./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum05.i -s /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/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_03f37d8b-c491-4979-af4d-ce8b1795c7a3/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-cad4683 [2019-11-15 20:00:56,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:00:56,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:00:56,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:00:56,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:00:56,056 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:00:56,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:00:56,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:00:56,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:00:56,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:00:56,070 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:00:56,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:00:56,072 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:00:56,075 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:00:56,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:00:56,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:00:56,079 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:00:56,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:00:56,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:00:56,083 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:00:56,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:00:56,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:00:56,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:00:56,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:00:56,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:00:56,094 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:00:56,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:00:56,095 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:00:56,096 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:00:56,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:00:56,097 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:00:56,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:00:56,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:00:56,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:00:56,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:00:56,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:00:56,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:00:56,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:00:56,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:00:56,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:00:56,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:00:56,104 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:00:56,136 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:00:56,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:00:56,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:00:56,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:00:56,149 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:00:56,150 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:00:56,150 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:00:56,150 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:00:56,150 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:00:56,150 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:00:56,151 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:00:56,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:00:56,151 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:00:56,151 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:00:56,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:00:56,152 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:00:56,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:00:56,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:00:56,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:00:56,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:00:56,153 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:00:56,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:00:56,153 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:00:56,153 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:00:56,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:00:56,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:00:56,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:00:56,154 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:00:56,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:00:56,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:00:56,155 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:00:56,155 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:00:56,156 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_03f37d8b-c491-4979-af4d-ce8b1795c7a3/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-15 20:00:56,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:00:56,203 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:00:56,207 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:00:56,209 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:00:56,210 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:00:56,210 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum05.i [2019-11-15 20:00:56,285 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/data/32e6d32e6/9a33c39249964b1aa1213ec6dcd564aa/FLAG0eebed9c1 [2019-11-15 20:00:56,704 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:00:56,706 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/sv-benchmarks/c/reducercommutativity/rangesum05.i [2019-11-15 20:00:56,712 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/data/32e6d32e6/9a33c39249964b1aa1213ec6dcd564aa/FLAG0eebed9c1 [2019-11-15 20:00:57,118 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/data/32e6d32e6/9a33c39249964b1aa1213ec6dcd564aa [2019-11-15 20:00:57,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:00:57,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:00:57,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:00:57,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:00:57,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:00:57,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ad6a5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57, skipping insertion in model container [2019-11-15 20:00:57,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,139 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:00:57,155 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:00:57,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:00:57,395 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:00:57,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:00:57,450 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:00:57,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57 WrapperNode [2019-11-15 20:00:57,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:00:57,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:00:57,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:00:57,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:00:57,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:00:57,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:00:57,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:00:57,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:00:57,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (1/1) ... [2019-11-15 20:00:57,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:00:57,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:00:57,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:00:57,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:00:57,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:00:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:00:57,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:00:57,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:00:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:00:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:00:57,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:00:57,975 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:00:57,975 INFO L284 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-15 20:00:57,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:00:57 BoogieIcfgContainer [2019-11-15 20:00:57,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:00:57,977 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:00:57,977 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:00:57,981 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:00:57,981 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:00:57,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:00:57" (1/3) ... [2019-11-15 20:00:57,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15e85926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:00:57, skipping insertion in model container [2019-11-15 20:00:57,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:00:57,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:00:57" (2/3) ... [2019-11-15 20:00:57,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@15e85926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:00:57, skipping insertion in model container [2019-11-15 20:00:57,984 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:00:57,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:00:57" (3/3) ... [2019-11-15 20:00:57,986 INFO L371 chiAutomizerObserver]: Analyzing ICFG rangesum05.i [2019-11-15 20:00:58,049 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:00:58,050 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:00:58,050 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:00:58,050 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:00:58,051 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:00:58,051 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:00:58,051 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:00:58,051 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:00:58,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-11-15 20:00:58,096 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-15 20:00:58,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:00:58,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:00:58,103 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:00:58,104 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:00:58,104 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:00:58,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2019-11-15 20:00:58,110 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-15 20:00:58,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:00:58,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:00:58,111 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:00:58,111 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:00:58,118 INFO L791 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:00:58,118 INFO L793 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-15 20:00:58,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:00:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 20:00:58,133 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:00:58,133 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297808748] [2019-11-15 20:00:58,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:58,134 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:58,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:00:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:00:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:00:58,247 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:00:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:00:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2019-11-15 20:00:58,248 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:00:58,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724658247] [2019-11-15 20:00:58,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:58,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:58,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:00:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:00:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:00:58,269 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:00:58,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:00:58,272 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2019-11-15 20:00:58,272 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:00:58,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839680873] [2019-11-15 20:00:58,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:58,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:58,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:00:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:00:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:00:58,320 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:00:58,505 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:00:58,506 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:00:58,506 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:00:58,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:00:58,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:00:58,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:00:58,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:00:58,507 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:00:58,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration1_Lasso [2019-11-15 20:00:58,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:00:58,508 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:00:58,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:00:58,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-15 20:00:59,047 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:00:59,050 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:00:59,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:00:59,053 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:00:59,054 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:00:59,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:00:59,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:00:59,056 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:00:59,059 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:00:59,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:00:59,062 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:00:59,062 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:00:59,063 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:00:59,063 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:00:59,063 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:00:59,063 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:00:59,063 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:00:59,064 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:00:59,064 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:00:59,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:00:59,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:00:59,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:00:59,065 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:00:59,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:00:59,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:00:59,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:00:59,066 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:00:59,066 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:00:59,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:00:59,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:00:59,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:00:59,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:00:59,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:00:59,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:00:59,070 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:00:59,071 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:00:59,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:00:59,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:00:59,076 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:00:59,076 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:00:59,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:00:59,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:00:59,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:00:59,077 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:00:59,077 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:00:59,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:00:59,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:00:59,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:00:59,079 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:00:59,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:00:59,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:00:59,084 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:00:59,084 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:00:59,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:00:59,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:00:59,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:00:59,112 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:00:59,112 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:00:59,112 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:00:59,117 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:00:59,118 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:00:59,186 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:00:59,266 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 20:00:59,266 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 20:00:59,268 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:00:59,270 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:00:59,277 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:00:59,278 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-15 20:00:59,292 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 20:00:59,301 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 20:00:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:00:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:00:59,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:00:59,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:00:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:00:59,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:00:59,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:00:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:00:59,424 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-15 20:00:59,425 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2019-11-15 20:00:59,546 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-15 20:00:59,547 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-15 20:00:59,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:00:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 79 transitions. [2019-11-15 20:00:59,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 2 letters. [2019-11-15 20:00:59,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:00:59,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 20:00:59,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:00:59,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 79 transitions. Stem has 2 letters. Loop has 4 letters. [2019-11-15 20:00:59,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:00:59,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 119 transitions. [2019-11-15 20:00:59,558 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:00:59,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 22 states and 32 transitions. [2019-11-15 20:00:59,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-15 20:00:59,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 20:00:59,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2019-11-15 20:00:59,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:00:59,565 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-11-15 20:00:59,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2019-11-15 20:00:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-15 20:00:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 20:00:59,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-11-15 20:00:59,589 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-11-15 20:00:59,589 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-11-15 20:00:59,589 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:00:59,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2019-11-15 20:00:59,590 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:00:59,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:00:59,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:00:59,591 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 20:00:59,591 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:00:59,591 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:00:59,591 INFO L793 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-15 20:00:59,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:00:59,592 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2019-11-15 20:00:59,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:00:59,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931131891] [2019-11-15 20:00:59,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:59,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:59,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:00:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:00:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:00:59,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931131891] [2019-11-15 20:00:59,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:00:59,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:00:59,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137829411] [2019-11-15 20:00:59,639 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:00:59,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:00:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2019-11-15 20:00:59,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:00:59,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983238353] [2019-11-15 20:00:59,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:59,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:59,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:00:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:00:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:00:59,650 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:00:59,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:00:59,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:00:59,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:00:59,698 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-11-15 20:00:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:00:59,711 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2019-11-15 20:00:59,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:00:59,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2019-11-15 20:00:59,713 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:00:59,714 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2019-11-15 20:00:59,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 20:00:59,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 20:00:59,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2019-11-15 20:00:59,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:00:59,715 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2019-11-15 20:00:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2019-11-15 20:00:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-11-15 20:00:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-15 20:00:59,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-11-15 20:00:59,718 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-15 20:00:59,718 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2019-11-15 20:00:59,718 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:00:59,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2019-11-15 20:00:59,719 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:00:59,719 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:00:59,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:00:59,720 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:00:59,720 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:00:59,720 INFO L791 eck$LassoCheckResult]: Stem: 227#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:00:59,720 INFO L793 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-15 20:00:59,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:00:59,721 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2019-11-15 20:00:59,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:00:59,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562923022] [2019-11-15 20:00:59,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:59,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:59,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:00:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:00:59,753 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-15 20:00:59,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562923022] [2019-11-15 20:00:59,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024070347] [2019-11-15 20:00:59,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:00:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:00:59,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:00:59,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:00:59,818 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-15 20:00:59,818 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:00:59,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 20:00:59,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98918479] [2019-11-15 20:00:59,819 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:00:59,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:00:59,820 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2019-11-15 20:00:59,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:00:59,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155888710] [2019-11-15 20:00:59,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:59,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:59,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:00:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:00:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:00:59,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:00:59,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:00:59,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:00:59,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:00:59,887 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-15 20:00:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:00:59,908 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2019-11-15 20:00:59,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:00:59,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-11-15 20:00:59,912 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:00:59,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2019-11-15 20:00:59,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 20:00:59,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 20:00:59,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2019-11-15 20:00:59,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:00:59,913 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-15 20:00:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2019-11-15 20:00:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-15 20:00:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-15 20:00:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2019-11-15 20:00:59,919 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 20:00:59,920 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2019-11-15 20:00:59,920 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:00:59,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2019-11-15 20:00:59,920 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:00:59,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:00:59,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:00:59,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-15 20:00:59,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:00:59,922 INFO L791 eck$LassoCheckResult]: Stem: 297#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:00:59,922 INFO L793 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-15 20:00:59,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:00:59,922 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2019-11-15 20:00:59,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:00:59,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447529480] [2019-11-15 20:00:59,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:59,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:00:59,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:00:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:00:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:00:59,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447529480] [2019-11-15 20:00:59,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369890247] [2019-11-15 20:00:59,979 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:01:00,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:01:00,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:01:00,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:01:00,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:00,054 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:01:00,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 20:01:00,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775966041] [2019-11-15 20:01:00,055 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:01:00,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,056 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2019-11-15 20:01:00,056 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,056 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111673822] [2019-11-15 20:01:00,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,056 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,070 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:00,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:00,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:01:00,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:01:00,126 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-11-15 20:01:00,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:00,156 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2019-11-15 20:01:00,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:01:00,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2019-11-15 20:01:00,161 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:00,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2019-11-15 20:01:00,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 20:01:00,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 20:01:00,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-15 20:01:00,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:01:00,162 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-15 20:01:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-15 20:01:00,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-11-15 20:01:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 20:01:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2019-11-15 20:01:00,165 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-15 20:01:00,165 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2019-11-15 20:01:00,165 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:01:00,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2019-11-15 20:01:00,166 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:00,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:00,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:00,167 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2019-11-15 20:01:00,167 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:01:00,167 INFO L791 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:00,167 INFO L793 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-15 20:01:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2019-11-15 20:01:00,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480629338] [2019-11-15 20:01:00,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:00,239 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-15 20:01:00,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480629338] [2019-11-15 20:01:00,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019064006] [2019-11-15 20:01:00,240 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:01:00,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-15 20:01:00,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:01:00,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 20:01:00,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:00,340 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-15 20:01:00,340 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:01:00,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-11-15 20:01:00,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669403214] [2019-11-15 20:01:00,341 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:01:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2019-11-15 20:01:00,341 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,341 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742554660] [2019-11-15 20:01:00,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,360 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:00,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:00,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:01:00,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:01:00,416 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-11-15 20:01:00,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:00,441 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-11-15 20:01:00,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 20:01:00,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2019-11-15 20:01:00,443 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:00,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2019-11-15 20:01:00,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 20:01:00,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 20:01:00,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2019-11-15 20:01:00,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:01:00,445 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-11-15 20:01:00,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2019-11-15 20:01:00,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-11-15 20:01:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-15 20:01:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-11-15 20:01:00,447 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-15 20:01:00,447 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-15 20:01:00,447 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:01:00,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-11-15 20:01:00,448 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:00,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:00,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:00,449 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2019-11-15 20:01:00,449 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:01:00,449 INFO L791 eck$LassoCheckResult]: Stem: 470#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:00,449 INFO L793 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-15 20:01:00,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,449 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2019-11-15 20:01:00,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875867920] [2019-11-15 20:01:00,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:00,507 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-15 20:01:00,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875867920] [2019-11-15 20:01:00,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28017902] [2019-11-15 20:01:00,508 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:01:00,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:01:00,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:01:00,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:01:00,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:00,586 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-15 20:01:00,586 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:01:00,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-15 20:01:00,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498861412] [2019-11-15 20:01:00,587 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:01:00,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,587 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2019-11-15 20:01:00,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998384631] [2019-11-15 20:01:00,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,594 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:00,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:00,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 20:01:00,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:01:00,635 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 8 states. [2019-11-15 20:01:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:00,668 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-11-15 20:01:00,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:01:00,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2019-11-15 20:01:00,669 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:00,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 39 transitions. [2019-11-15 20:01:00,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-15 20:01:00,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-15 20:01:00,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2019-11-15 20:01:00,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:01:00,671 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-15 20:01:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2019-11-15 20:01:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-15 20:01:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 20:01:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-11-15 20:01:00,674 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-15 20:01:00,675 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-11-15 20:01:00,675 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:01:00,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-11-15 20:01:00,676 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:00,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:00,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:00,678 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2019-11-15 20:01:00,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:01:00,679 INFO L791 eck$LassoCheckResult]: Stem: 572#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:00,679 INFO L793 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-15 20:01:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2019-11-15 20:01:00,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767215540] [2019-11-15 20:01:00,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:00,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,718 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2019-11-15 20:01:00,718 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888813866] [2019-11-15 20:01:00,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,725 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:00,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1638582855, now seen corresponding path program 1 times [2019-11-15 20:01:00,726 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211737527] [2019-11-15 20:01:00,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,727 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:00,780 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-15 20:01:00,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211737527] [2019-11-15 20:01:00,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:01:00,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:01:00,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667673791] [2019-11-15 20:01:00,823 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:00,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:01:00,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:01:00,823 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-15 20:01:00,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:00,870 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2019-11-15 20:01:00,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:01:00,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2019-11-15 20:01:00,872 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:00,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2019-11-15 20:01:00,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 20:01:00,873 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-15 20:01:00,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2019-11-15 20:01:00,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:01:00,873 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2019-11-15 20:01:00,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2019-11-15 20:01:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-15 20:01:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 20:01:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2019-11-15 20:01:00,876 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-15 20:01:00,876 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2019-11-15 20:01:00,876 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:01:00,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2019-11-15 20:01:00,877 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:00,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:00,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:00,878 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2019-11-15 20:01:00,878 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:01:00,878 INFO L791 eck$LassoCheckResult]: Stem: 651#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:00,878 INFO L793 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-15 20:01:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1715425498, now seen corresponding path program 1 times [2019-11-15 20:01:00,882 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333314269] [2019-11-15 20:01:00,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,926 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:00,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,928 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 7 times [2019-11-15 20:01:00,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794739123] [2019-11-15 20:01:00,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:00,943 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:00,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813624, now seen corresponding path program 1 times [2019-11-15 20:01:00,944 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:00,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140896478] [2019-11-15 20:01:00,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:00,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:00,969 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-15 20:01:00,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140896478] [2019-11-15 20:01:00,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26056454] [2019-11-15 20:01:00,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:01:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:01,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:01:01,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:01,039 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-15 20:01:01,040 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:01:01,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-11-15 20:01:01,040 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511300411] [2019-11-15 20:01:01,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:01,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:01:01,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:01:01,085 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand 5 states. [2019-11-15 20:01:01,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:01,142 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-11-15 20:01:01,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:01:01,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 57 transitions. [2019-11-15 20:01:01,144 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:01,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 48 states and 57 transitions. [2019-11-15 20:01:01,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-15 20:01:01,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-15 20:01:01,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2019-11-15 20:01:01,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:01:01,146 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 57 transitions. [2019-11-15 20:01:01,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2019-11-15 20:01:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-11-15 20:01:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 20:01:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-15 20:01:01,149 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-15 20:01:01,149 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-15 20:01:01,149 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 20:01:01,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-11-15 20:01:01,150 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:01,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:01,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:01,151 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 20:01:01,151 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:01:01,151 INFO L791 eck$LassoCheckResult]: Stem: 801#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:01,151 INFO L793 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-15 20:01:01,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:01,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1574813622, now seen corresponding path program 1 times [2019-11-15 20:01:01,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:01,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723941934] [2019-11-15 20:01:01,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,152 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:01,171 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:01,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 8 times [2019-11-15 20:01:01,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:01,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450628482] [2019-11-15 20:01:01,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,173 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:01,178 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:01,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808232, now seen corresponding path program 2 times [2019-11-15 20:01:01,179 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:01,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332026514] [2019-11-15 20:01:01,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,180 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:01,227 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-15 20:01:01,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332026514] [2019-11-15 20:01:01,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982523829] [2019-11-15 20:01:01,227 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:01:01,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:01:01,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:01:01,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:01:01,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:01,305 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-15 20:01:01,305 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:01:01,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-15 20:01:01,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086633511] [2019-11-15 20:01:01,341 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:01,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 20:01:01,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 20:01:01,341 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. cyclomatic complexity: 14 Second operand 6 states. [2019-11-15 20:01:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:01,426 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-11-15 20:01:01,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:01:01,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2019-11-15 20:01:01,428 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2019-11-15 20:01:01,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 57 states and 66 transitions. [2019-11-15 20:01:01,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-11-15 20:01:01,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-11-15 20:01:01,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2019-11-15 20:01:01,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:01:01,429 INFO L688 BuchiCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-11-15 20:01:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2019-11-15 20:01:01,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-11-15 20:01:01,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-15 20:01:01,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-11-15 20:01:01,433 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-15 20:01:01,433 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-11-15 20:01:01,433 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 20:01:01,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 63 transitions. [2019-11-15 20:01:01,434 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:01,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:01,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:01,437 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 1, 1, 1, 1] [2019-11-15 20:01:01,437 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:01:01,438 INFO L791 eck$LassoCheckResult]: Stem: 975#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:01,438 INFO L793 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-15 20:01:01,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:01,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1344808230, now seen corresponding path program 2 times [2019-11-15 20:01:01,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:01,439 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556873689] [2019-11-15 20:01:01,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,439 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:01,472 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:01,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 9 times [2019-11-15 20:01:01,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:01,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243714203] [2019-11-15 20:01:01,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:01,483 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:01,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:01,484 INFO L82 PathProgramCache]: Analyzing trace with hash 272987720, now seen corresponding path program 3 times [2019-11-15 20:01:01,485 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:01,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210130713] [2019-11-15 20:01:01,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,485 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:01,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:01,531 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:02,334 WARN L191 SmtUtils]: Spent 759.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 120 [2019-11-15 20:01:02,428 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:01:02,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:01:02,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:01:02,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:01:02,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:01:02,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:02,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:01:02,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:01:02,429 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration10_Lasso [2019-11-15 20:01:02,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:01:02,429 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:01:02,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,576 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-11-15 20:01:02,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:02,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:03,017 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:01:03,017 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:01:03,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:03,018 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:03,018 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:01:03,018 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:03,018 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:03,022 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:01:03,022 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:03,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:03,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:03,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:03,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:03,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:03,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:03,034 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:03,034 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:03,037 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:03,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:03,038 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:03,038 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:03,038 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:03,038 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:03,040 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:03,040 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:03,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:03,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:03,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:03,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:03,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:03,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:03,043 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:03,043 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:03,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:03,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:03,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:03,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:03,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:03,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:03,050 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:01:03,050 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:01:03,069 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:01:03,076 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:01:03,076 INFO L444 ModelExtractionUtils]: 31 out of 34 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:01:03,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:01:03,077 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:01:03,077 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:01:03,077 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-15 20:01:03,122 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2019-11-15 20:01:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:03,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:01:03,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:03,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:01:03,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:03,191 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-15 20:01:03,191 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states and 63 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-15 20:01:03,224 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-15 20:01:03,224 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-15 20:01:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:01:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-15 20:01:03,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-15 20:01:03,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:03,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-15 20:01:03,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:03,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-15 20:01:03,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:03,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 73 transitions. [2019-11-15 20:01:03,227 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 20:01:03,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 67 transitions. [2019-11-15 20:01:03,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-15 20:01:03,229 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-15 20:01:03,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-11-15 20:01:03,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:03,229 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-15 20:01:03,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-11-15 20:01:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-15 20:01:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-15 20:01:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2019-11-15 20:01:03,232 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-15 20:01:03,233 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-15 20:01:03,233 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 20:01:03,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 67 transitions. [2019-11-15 20:01:03,233 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 20:01:03,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:03,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:03,234 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:01:03,235 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:01:03,235 INFO L791 eck$LassoCheckResult]: Stem: 1214#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:03,235 INFO L793 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-15 20:01:03,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1909073688, now seen corresponding path program 1 times [2019-11-15 20:01:03,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:03,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829267436] [2019-11-15 20:01:03,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:03,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:03,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:03,273 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-15 20:01:03,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829267436] [2019-11-15 20:01:03,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:01:03,274 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:01:03,274 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083006455] [2019-11-15 20:01:03,275 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:01:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:03,275 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2019-11-15 20:01:03,275 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:03,275 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686062212] [2019-11-15 20:01:03,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:03,275 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:03,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:03,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:03,283 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:03,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:03,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:01:03,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:01:03,317 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-15 20:01:03,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:03,376 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-11-15 20:01:03,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:01:03,377 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 86 transitions. [2019-11-15 20:01:03,378 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2019-11-15 20:01:03,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 69 states and 82 transitions. [2019-11-15 20:01:03,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2019-11-15 20:01:03,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2019-11-15 20:01:03,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 82 transitions. [2019-11-15 20:01:03,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:03,379 INFO L688 BuchiCegarLoop]: Abstraction has 69 states and 82 transitions. [2019-11-15 20:01:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 82 transitions. [2019-11-15 20:01:03,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-11-15 20:01:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-15 20:01:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2019-11-15 20:01:03,383 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-11-15 20:01:03,383 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2019-11-15 20:01:03,383 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 20:01:03,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 67 transitions. [2019-11-15 20:01:03,384 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2019-11-15 20:01:03,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:03,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:03,385 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:01:03,385 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:01:03,385 INFO L791 eck$LassoCheckResult]: Stem: 1348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:03,385 INFO L793 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-15 20:01:03,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:03,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1744047494, now seen corresponding path program 1 times [2019-11-15 20:01:03,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:03,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655616482] [2019-11-15 20:01:03,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:03,388 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:03,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:03,433 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-15 20:01:03,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655616482] [2019-11-15 20:01:03,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843608506] [2019-11-15 20:01:03,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:01:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:03,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 20:01:03,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:03,516 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-15 20:01:03,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:01:03,517 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 20:01:03,517 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426296561] [2019-11-15 20:01:03,517 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:01:03,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:03,518 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2019-11-15 20:01:03,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:03,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819411084] [2019-11-15 20:01:03,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:03,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:03,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:03,522 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:03,535 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:01:03,535 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:01:03,535 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:01:03,535 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:01:03,535 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:01:03,535 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:03,535 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:01:03,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:01:03,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration12_Loop [2019-11-15 20:01:03,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:01:03,536 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:01:03,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:03,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:03,559 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:01:03,560 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/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) [2019-11-15 20:01:03,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:01:03,580 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:03,587 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:01:03,587 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_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:03,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:01:03,600 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:03,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:01:03,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:01:03,688 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:01:03,690 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:01:03,690 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:01:03,690 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:01:03,690 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:01:03,690 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:01:03,690 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:03,690 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:01:03,690 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:01:03,691 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration12_Loop [2019-11-15 20:01:03,691 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:01:03,691 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:01:03,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:03,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:03,718 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:01:03,718 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:01:03,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:03,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:03,719 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:03,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:03,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:03,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:03,719 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:03,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:03,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:01:03,720 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:01:03,720 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:01:03,720 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:01:03,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:01:03,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:01:03,721 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:01:03,721 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:01:03,721 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:01:03,722 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:01:03,723 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:01:03,723 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-15 20:01:03,724 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:01:03,724 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:01:03,724 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:01:03,724 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-15 20:01:03,724 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-15 20:01:03,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:03,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:01:03,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:03,831 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:01:03,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:01:03,864 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-15 20:01:03,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 67 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-15 20:01:03,906 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-15 20:01:03,907 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-15 20:01:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 20:01:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2019-11-15 20:01:03,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 3 letters. [2019-11-15 20:01:03,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:03,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 40 letters. Loop has 3 letters. [2019-11-15 20:01:03,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:03,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 37 letters. Loop has 6 letters. [2019-11-15 20:01:03,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:01:03,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 83 transitions. [2019-11-15 20:01:03,910 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 20:01:03,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 62 states and 72 transitions. [2019-11-15 20:01:03,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-15 20:01:03,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-15 20:01:03,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 72 transitions. [2019-11-15 20:01:03,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:03,911 INFO L688 BuchiCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-11-15 20:01:03,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 72 transitions. [2019-11-15 20:01:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-11-15 20:01:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 20:01:03,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2019-11-15 20:01:03,914 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2019-11-15 20:01:03,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:03,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:01:03,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:01:03,915 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 4 states. [2019-11-15 20:01:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:03,949 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2019-11-15 20:01:03,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:01:03,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 85 transitions. [2019-11-15 20:01:03,950 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-15 20:01:03,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 85 transitions. [2019-11-15 20:01:03,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2019-11-15 20:01:03,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-15 20:01:03,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 85 transitions. [2019-11-15 20:01:03,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:03,951 INFO L688 BuchiCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-11-15 20:01:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 85 transitions. [2019-11-15 20:01:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 61. [2019-11-15 20:01:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-15 20:01:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2019-11-15 20:01:03,958 INFO L711 BuchiCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-11-15 20:01:03,958 INFO L591 BuchiCegarLoop]: Abstraction has 61 states and 69 transitions. [2019-11-15 20:01:03,958 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 20:01:03,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 69 transitions. [2019-11-15 20:01:03,959 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 20:01:03,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:03,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:03,960 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:01:03,960 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:01:03,961 INFO L791 eck$LassoCheckResult]: Stem: 1869#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:03,961 INFO L793 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-15 20:01:03,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:03,961 INFO L82 PathProgramCache]: Analyzing trace with hash 734232641, now seen corresponding path program 1 times [2019-11-15 20:01:03,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:03,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145893819] [2019-11-15 20:01:03,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:03,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:03,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:03,969 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:01:03,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937675199] [2019-11-15 20:01:03,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/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-15 20:01:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:01:04,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:01:04,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:04,157 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-15 20:01:04,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145893819] [2019-11-15 20:01:04,158 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:01:04,158 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937675199] [2019-11-15 20:01:04,158 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 20:01:04,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-11-15 20:01:04,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985092090] [2019-11-15 20:01:04,159 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 20:01:04,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:04,159 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2019-11-15 20:01:04,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:04,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886261362] [2019-11-15 20:01:04,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:04,165 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:04,217 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:04,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:01:04,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:01:04,218 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. cyclomatic complexity: 14 Second operand 7 states. [2019-11-15 20:01:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:04,331 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2019-11-15 20:01:04,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 20:01:04,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 91 transitions. [2019-11-15 20:01:04,332 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-15 20:01:04,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 78 states and 89 transitions. [2019-11-15 20:01:04,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2019-11-15 20:01:04,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-15 20:01:04,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 89 transitions. [2019-11-15 20:01:04,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:04,333 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. [2019-11-15 20:01:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 89 transitions. [2019-11-15 20:01:04,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-11-15 20:01:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 20:01:04,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2019-11-15 20:01:04,337 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-11-15 20:01:04,337 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2019-11-15 20:01:04,337 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 20:01:04,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 76 transitions. [2019-11-15 20:01:04,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2019-11-15 20:01:04,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:04,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:04,339 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-15 20:01:04,339 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-15 20:01:04,340 INFO L791 eck$LassoCheckResult]: Stem: 2134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:04,340 INFO L793 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-15 20:01:04,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:04,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1040814406, now seen corresponding path program 1 times [2019-11-15 20:01:04,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:04,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853333113] [2019-11-15 20:01:04,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:04,353 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:01:04,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2084616707] [2019-11-15 20:01:04,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/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-15 20:01:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:04,497 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:04,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2019-11-15 20:01:04,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:04,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889780831] [2019-11-15 20:01:04,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:04,504 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:04,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:04,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1533007565, now seen corresponding path program 2 times [2019-11-15 20:01:04,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:04,505 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173029865] [2019-11-15 20:01:04,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,505 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:04,513 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:01:04,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723145166] [2019-11-15 20:01:04,513 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/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-15 20:01:04,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:01:04,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:01:04,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 20:01:04,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:01:04,659 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-15 20:01:04,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173029865] [2019-11-15 20:01:04,659 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 20:01:04,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723145166] [2019-11-15 20:01:04,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:01:04,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:01:04,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601849297] [2019-11-15 20:01:04,699 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:01:04,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 20:01:04,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 20:01:04,699 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-15 20:01:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:01:04,760 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2019-11-15 20:01:04,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:01:04,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 82 transitions. [2019-11-15 20:01:04,761 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:01:04,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 70 transitions. [2019-11-15 20:01:04,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2019-11-15 20:01:04,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-15 20:01:04,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 70 transitions. [2019-11-15 20:01:04,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:01:04,763 INFO L688 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2019-11-15 20:01:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 70 transitions. [2019-11-15 20:01:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2019-11-15 20:01:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-15 20:01:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2019-11-15 20:01:04,765 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-15 20:01:04,765 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2019-11-15 20:01:04,765 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 20:01:04,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2019-11-15 20:01:04,766 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-15 20:01:04,766 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:01:04,766 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:01:04,767 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-15 20:01:04,767 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 20:01:04,768 INFO L791 eck$LassoCheckResult]: Stem: 2425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 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-15 20:01:04,768 INFO L793 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-15 20:01:04,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:04,768 INFO L82 PathProgramCache]: Analyzing trace with hash -46487371, now seen corresponding path program 1 times [2019-11-15 20:01:04,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:04,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588487036] [2019-11-15 20:01:04,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:04,785 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:01:04,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1877326663] [2019-11-15 20:01:04,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/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-15 20:01:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:04,935 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:04,936 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2019-11-15 20:01:04,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:04,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039962102] [2019-11-15 20:01:04,938 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:04,948 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:01:04,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1724688201, now seen corresponding path program 1 times [2019-11-15 20:01:04,949 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:01:04,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559709226] [2019-11-15 20:01:04,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,949 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:01:04,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:01:04,956 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 20:01:04,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142496603] [2019-11-15 20:01:04,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_03f37d8b-c491-4979-af4d-ce8b1795c7a3/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:01:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:05,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:01:05,099 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:01:07,682 WARN L191 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 356 DAG size of output: 252 [2019-11-15 20:01:26,315 WARN L191 SmtUtils]: Spent 14.20 s on a formula simplification. DAG size of input: 451 DAG size of output: 151 [2019-11-15 20:01:26,318 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:01:26,318 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:01:26,318 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:01:26,318 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:01:26,318 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:01:26,318 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:01:26,318 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:01:26,318 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:01:26,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum05.i_Iteration15_Lasso [2019-11-15 20:01:26,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:01:26,318 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:01:26,320 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-11-15 20:01:26,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:26,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:26,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:26,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:26,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:26,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:26,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:26,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:01:26,808 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:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:536) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:951) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:248) 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-15 20:01:26,811 INFO L168 Benchmark]: Toolchain (without parser) took 29688.79 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 514.9 MB). Free memory was 942.4 MB in the beginning and 974.3 MB in the end (delta: -31.8 MB). Peak memory consumption was 606.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:01:26,812 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:01:26,812 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:01:26,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.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-15 20:01:26,813 INFO L168 Benchmark]: Boogie Preprocessor took 29.52 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:01:26,813 INFO L168 Benchmark]: RCFGBuilder took 440.88 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:01:26,814 INFO L168 Benchmark]: BuchiAutomizer took 28833.01 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 373.8 MB). Free memory was 1.1 GB in the beginning and 974.3 MB in the end (delta: 132.5 MB). Peak memory consumption was 629.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:01:26,816 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -193.4 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.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 29.52 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 440.88 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 28833.01 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 373.8 MB). Free memory was 1.1 GB in the beginning and 974.3 MB in the end (delta: 132.5 MB). Peak memory consumption was 629.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...