./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/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 279fae57395782089eff32ec1396d1726d808c7f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/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-678e011 [2019-11-20 01:50:25,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 01:50:25,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 01:50:25,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 01:50:25,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 01:50:25,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 01:50:25,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 01:50:25,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 01:50:25,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 01:50:25,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 01:50:25,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 01:50:25,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 01:50:25,093 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 01:50:25,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 01:50:25,097 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 01:50:25,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 01:50:25,099 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 01:50:25,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 01:50:25,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 01:50:25,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 01:50:25,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 01:50:25,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 01:50:25,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 01:50:25,119 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 01:50:25,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 01:50:25,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 01:50:25,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 01:50:25,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 01:50:25,124 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 01:50:25,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 01:50:25,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 01:50:25,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 01:50:25,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 01:50:25,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 01:50:25,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 01:50:25,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 01:50:25,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 01:50:25,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 01:50:25,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 01:50:25,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 01:50:25,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 01:50:25,134 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-20 01:50:25,163 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 01:50:25,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 01:50:25,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 01:50:25,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 01:50:25,171 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 01:50:25,171 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 01:50:25,171 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 01:50:25,171 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 01:50:25,171 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 01:50:25,172 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 01:50:25,172 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 01:50:25,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 01:50:25,172 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 01:50:25,172 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 01:50:25,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 01:50:25,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 01:50:25,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 01:50:25,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 01:50:25,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 01:50:25,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 01:50:25,174 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 01:50:25,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 01:50:25,174 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 01:50:25,174 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 01:50:25,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 01:50:25,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 01:50:25,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 01:50:25,175 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 01:50:25,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 01:50:25,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 01:50:25,176 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 01:50:25,177 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 01:50:25,177 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_3514cea9-94c0-48b7-b6bb-bf89afaed446/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 -> 279fae57395782089eff32ec1396d1726d808c7f [2019-11-20 01:50:25,327 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 01:50:25,339 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 01:50:25,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 01:50:25,346 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 01:50:25,346 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 01:50:25,347 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum.i [2019-11-20 01:50:25,414 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/data/6f70f56ac/74cc9dc8f74a4b1497efa0d7ede7f41a/FLAG2de530c01 [2019-11-20 01:50:25,793 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 01:50:25,794 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/sv-benchmarks/c/reducercommutativity/rangesum.i [2019-11-20 01:50:25,801 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/data/6f70f56ac/74cc9dc8f74a4b1497efa0d7ede7f41a/FLAG2de530c01 [2019-11-20 01:50:26,238 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/data/6f70f56ac/74cc9dc8f74a4b1497efa0d7ede7f41a [2019-11-20 01:50:26,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 01:50:26,241 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 01:50:26,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 01:50:26,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 01:50:26,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 01:50:26,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396f560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26, skipping insertion in model container [2019-11-20 01:50:26,249 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,256 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 01:50:26,275 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 01:50:26,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:50:26,649 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 01:50:26,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 01:50:26,718 INFO L192 MainTranslator]: Completed translation [2019-11-20 01:50:26,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26 WrapperNode [2019-11-20 01:50:26,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 01:50:26,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 01:50:26,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 01:50:26,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 01:50:26,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,796 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 01:50:26,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 01:50:26,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 01:50:26,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 01:50:26,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (1/1) ... [2019-11-20 01:50:26,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 01:50:26,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 01:50:26,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 01:50:26,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 01:50:26,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/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-20 01:50:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 01:50:26,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 01:50:26,969 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 01:50:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 01:50:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 01:50:26,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 01:50:27,383 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 01:50:27,383 INFO L285 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-20 01:50:27,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:50:27 BoogieIcfgContainer [2019-11-20 01:50:27,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 01:50:27,385 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 01:50:27,385 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 01:50:27,389 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 01:50:27,391 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 01:50:27,391 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 01:50:26" (1/3) ... [2019-11-20 01:50:27,392 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bbe1bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 01:50:27, skipping insertion in model container [2019-11-20 01:50:27,392 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 01:50:27,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:50:26" (2/3) ... [2019-11-20 01:50:27,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bbe1bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 01:50:27, skipping insertion in model container [2019-11-20 01:50:27,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 01:50:27,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:50:27" (3/3) ... [2019-11-20 01:50:27,395 INFO L371 chiAutomizerObserver]: Analyzing ICFG rangesum.i [2019-11-20 01:50:27,445 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 01:50:27,445 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 01:50:27,445 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 01:50:27,446 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 01:50:27,446 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 01:50:27,446 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 01:50:27,446 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 01:50:27,446 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 01:50:27,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-11-20 01:50:27,480 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-20 01:50:27,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:27,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:27,487 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 01:50:27,487 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 01:50:27,488 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 01:50:27,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2019-11-20 01:50:27,491 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-20 01:50:27,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:27,491 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:27,492 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 01:50:27,492 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 01:50:27,498 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 9#L-1true havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 30#L33true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 17#L7-3true [2019-11-20 01:50:27,498 INFO L796 eck$LassoCheckResult]: Loop: 17#L7-3true assume !!(init_nondet_~i~0 < ~N~0);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; 6#L7-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 17#L7-3true [2019-11-20 01:50:27,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:27,505 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-11-20 01:50:27,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:27,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363168209] [2019-11-20 01:50:27,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:27,635 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2019-11-20 01:50:27,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:27,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289045094] [2019-11-20 01:50:27,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:27,653 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2019-11-20 01:50:27,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:27,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809207315] [2019-11-20 01:50:27,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:27,693 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:27,981 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-20 01:50:28,052 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 01:50:28,054 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 01:50:28,054 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 01:50:28,055 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 01:50:28,055 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 01:50:28,055 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:28,055 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 01:50:28,056 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 01:50:28,056 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration1_Lasso [2019-11-20 01:50:28,056 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 01:50:28,056 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 01:50:28,092 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-20 01:50:28,100 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-20 01:50:28,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:50:28,106 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-20 01:50:28,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:50:28,118 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-20 01:50:28,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:50:28,129 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-20 01:50:28,285 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-11-20 01:50:28,322 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-20 01:50:28,326 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-20 01:50:28,329 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-20 01:50:28,332 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-20 01:50:28,336 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-20 01:50:28,339 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-20 01:50:28,343 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-20 01:50:28,346 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-20 01:50:28,351 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-20 01:50:28,355 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-20 01:50:28,359 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-20 01:50:28,698 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 01:50:28,703 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:28,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-20 01:50:28,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:28,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:28,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:28,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:28,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:28,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:28,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:50:28,730 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:28,753 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-20 01:50:28,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:28,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:28,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:28,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:28,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:28,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:28,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:50:28,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:28,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 01:50:28,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:28,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:28,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:28,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:28,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:28,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:28,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:50:28,784 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:28,800 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-20 01:50:28,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:28,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:28,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:28,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:28,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:28,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:28,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:28,808 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:28,827 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-20 01:50:28,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:28,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:28,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:28,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:28,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:28,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:28,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:28,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:28,847 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-20 01:50:28,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:28,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:28,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:28,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:28,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:28,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:28,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:28,856 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:28,871 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-20 01:50:28,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:28,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:28,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:28,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:28,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:50:28,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:28,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:28,903 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-20 01:50:28,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:28,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:28,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:28,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:28,918 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:50:28,918 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:50:28,927 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/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-20 01:50:28,948 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-20 01:50:28,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:28,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:28,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:28,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:28,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:28,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:28,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:50:28,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/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-20 01:50:28,966 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-20 01:50:28,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:28,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:28,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:28,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:28,995 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:50:28,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:50:29,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 01:50:29,225 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-20 01:50:29,226 INFO L444 ModelExtractionUtils]: 11 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:29,235 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:29,239 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 01:50:29,239 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 01:50:29,240 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0, ~N~0) = -1*ULTIMATE.start_init_nondet_~i~0 + 1*~N~0 Supporting invariants [] [2019-11-20 01:50:29,260 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-20 01:50:29,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:29,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:50:29,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:29,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:50:29,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:29,365 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-20 01:50:29,383 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-20 01:50:29,385 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states. Second operand 3 states. [2019-11-20 01:50:29,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states.. Second operand 3 states. Result 86 states and 130 transitions. Complement of second has 7 states. [2019-11-20 01:50:29,530 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-20 01:50:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-20 01:50:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2019-11-20 01:50:29,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-20 01:50:29,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:29,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-20 01:50:29,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:29,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-20 01:50:29,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:29,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 130 transitions. [2019-11-20 01:50:29,558 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 01:50:29,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 23 states and 33 transitions. [2019-11-20 01:50:29,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-11-20 01:50:29,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-20 01:50:29,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 33 transitions. [2019-11-20 01:50:29,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 01:50:29,566 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-11-20 01:50:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 33 transitions. [2019-11-20 01:50:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-20 01:50:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-20 01:50:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2019-11-20 01:50:29,601 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-11-20 01:50:29,601 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 33 transitions. [2019-11-20 01:50:29,601 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 01:50:29,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 33 transitions. [2019-11-20 01:50:29,603 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 01:50:29,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:29,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:29,604 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 01:50:29,604 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 01:50:29,605 INFO L794 eck$LassoCheckResult]: Stem: 190#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 187#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 188#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 192#L7-3 assume !(init_nondet_~i~0 < ~N~0); 178#L5 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; 170#L18-3 [2019-11-20 01:50:29,605 INFO L796 eck$LassoCheckResult]: Loop: 170#L18-3 assume !!(rangesum_~i~1 < ~N~0); 172#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 181#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 170#L18-3 [2019-11-20 01:50:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:29,606 INFO L82 PathProgramCache]: Analyzing trace with hash 28693898, now seen corresponding path program 1 times [2019-11-20 01:50:29,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:29,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052430609] [2019-11-20 01:50:29,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:29,706 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-20 01:50:29,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052430609] [2019-11-20 01:50:29,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 01:50:29,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 01:50:29,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133223830] [2019-11-20 01:50:29,711 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 01:50:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:29,712 INFO L82 PathProgramCache]: Analyzing trace with hash 56764, now seen corresponding path program 1 times [2019-11-20 01:50:29,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:29,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498409759] [2019-11-20 01:50:29,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:29,747 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:29,773 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 01:50:29,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 01:50:29,773 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 01:50:29,774 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 01:50:29,774 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 01:50:29,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:29,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 01:50:29,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 01:50:29,774 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2019-11-20 01:50:29,775 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 01:50:29,775 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 01:50:29,776 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-20 01:50:29,789 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-20 01:50:29,927 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 01:50:29,928 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:29,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 01:50:29,948 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:29,962 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 01:50:29,963 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_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:29,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 01:50:29,971 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:29,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 01:50:29,997 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:30,178 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 01:50:30,181 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 01:50:30,181 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 01:50:30,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 01:50:30,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 01:50:30,182 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 01:50:30,182 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:30,182 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 01:50:30,182 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 01:50:30,182 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration2_Loop [2019-11-20 01:50:30,182 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 01:50:30,182 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 01:50:30,184 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-20 01:50:30,194 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-20 01:50:30,324 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 01:50:30,324 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:30,342 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-20 01:50:30,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:30,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:30,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:30,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:30,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:30,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:30,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:30,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:30,366 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-20 01:50:30,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:30,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:30,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:30,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:30,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:30,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:30,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:30,376 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 01:50:30,381 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-20 01:50:30,381 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:30,394 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 01:50:30,394 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 01:50:30,394 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 01:50:30,395 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, ~N~0) = -4*ULTIMATE.start_rangesum_~i~1 + 3*~N~0 Supporting invariants [] [2019-11-20 01:50:30,397 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:30,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:30,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:50:30,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:30,445 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:50:30,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:30,492 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-20 01:50:30,492 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-20 01:50:30,493 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-20 01:50:30,549 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 33 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 34 states and 53 transitions. Complement of second has 9 states. [2019-11-20 01:50:30,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-20 01:50:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 01:50:30,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2019-11-20 01:50:30,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-20 01:50:30,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:30,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-20 01:50:30,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:30,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-20 01:50:30,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:30,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 53 transitions. [2019-11-20 01:50:30,555 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 01:50:30,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 31 states and 46 transitions. [2019-11-20 01:50:30,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-20 01:50:30,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-20 01:50:30,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2019-11-20 01:50:30,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:50:30,564 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-11-20 01:50:30,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2019-11-20 01:50:30,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-11-20 01:50:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-20 01:50:30,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-11-20 01:50:30,573 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-11-20 01:50:30,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:30,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 01:50:30,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 01:50:30,579 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 3 states. [2019-11-20 01:50:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:30,634 INFO L93 Difference]: Finished difference Result 30 states and 43 transitions. [2019-11-20 01:50:30,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 01:50:30,635 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 43 transitions. [2019-11-20 01:50:30,636 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 01:50:30,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 43 transitions. [2019-11-20 01:50:30,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-20 01:50:30,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-20 01:50:30,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 43 transitions. [2019-11-20 01:50:30,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:50:30,637 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 43 transitions. [2019-11-20 01:50:30,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 43 transitions. [2019-11-20 01:50:30,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-20 01:50:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-20 01:50:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2019-11-20 01:50:30,640 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-11-20 01:50:30,641 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-11-20 01:50:30,641 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 01:50:30,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2019-11-20 01:50:30,646 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 01:50:30,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:30,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:30,652 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:30,652 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 01:50:30,653 INFO L794 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 359#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 360#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 364#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 347#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 348#L7-3 assume !(init_nondet_~i~0 < ~N~0); 349#L5 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; 350#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2019-11-20 01:50:30,653 INFO L796 eck$LassoCheckResult]: Loop: 339#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 351#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 337#L18-3 assume !!(rangesum_~i~1 < ~N~0); 339#L19 [2019-11-20 01:50:30,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:30,654 INFO L82 PathProgramCache]: Analyzing trace with hash 123162479, now seen corresponding path program 1 times [2019-11-20 01:50:30,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:30,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713591211] [2019-11-20 01:50:30,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:30,717 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-20 01:50:30,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713591211] [2019-11-20 01:50:30,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884688744] [2019-11-20 01:50:30,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:50:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:30,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 01:50:30,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:30,803 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-20 01:50:30,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:50:30,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-20 01:50:30,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576257515] [2019-11-20 01:50:30,805 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 01:50:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:30,805 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 1 times [2019-11-20 01:50:30,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:30,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804297646] [2019-11-20 01:50:30,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:30,835 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:30,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:30,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 01:50:30,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-20 01:50:30,895 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. cyclomatic complexity: 19 Second operand 6 states. [2019-11-20 01:50:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:30,973 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2019-11-20 01:50:30,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 01:50:30,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 45 transitions. [2019-11-20 01:50:30,975 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 01:50:30,976 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 45 transitions. [2019-11-20 01:50:30,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-20 01:50:30,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-20 01:50:30,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 45 transitions. [2019-11-20 01:50:30,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:50:30,977 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 45 transitions. [2019-11-20 01:50:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 45 transitions. [2019-11-20 01:50:30,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-11-20 01:50:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 01:50:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-11-20 01:50:30,980 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-20 01:50:30,980 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-20 01:50:30,980 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 01:50:30,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-11-20 01:50:30,981 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 01:50:30,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:30,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:30,984 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:30,984 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 01:50:30,984 INFO L794 eck$LassoCheckResult]: Stem: 453#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 450#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 451#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 455#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 456#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 457#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 437#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 438#L7-3 assume !(init_nondet_~i~0 < ~N~0); 439#L5 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; 440#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2019-11-20 01:50:30,985 INFO L796 eck$LassoCheckResult]: Loop: 430#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 442#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 428#L18-3 assume !!(rangesum_~i~1 < ~N~0); 430#L19 [2019-11-20 01:50:30,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:30,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228851, now seen corresponding path program 2 times [2019-11-20 01:50:30,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:30,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963768211] [2019-11-20 01:50:30,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:31,019 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:31,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:31,019 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 2 times [2019-11-20 01:50:31,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:31,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994472073] [2019-11-20 01:50:31,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:31,035 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:31,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:31,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1698716202, now seen corresponding path program 1 times [2019-11-20 01:50:31,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:31,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53113566] [2019-11-20 01:50:31,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:31,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53113566] [2019-11-20 01:50:31,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727474705] [2019-11-20 01:50:31,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:50:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:31,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 01:50:31,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:50:31,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 01:50:31,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2019-11-20 01:50:31,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007361755] [2019-11-20 01:50:31,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:31,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 01:50:31,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 01:50:31,266 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 19 Second operand 4 states. [2019-11-20 01:50:31,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:31,350 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-20 01:50:31,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 01:50:31,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 51 transitions. [2019-11-20 01:50:31,351 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 01:50:31,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 39 states and 50 transitions. [2019-11-20 01:50:31,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-20 01:50:31,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-20 01:50:31,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 50 transitions. [2019-11-20 01:50:31,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:50:31,353 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-20 01:50:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 50 transitions. [2019-11-20 01:50:31,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-20 01:50:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-20 01:50:31,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2019-11-20 01:50:31,357 INFO L711 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-11-20 01:50:31,357 INFO L591 BuchiCegarLoop]: Abstraction has 36 states and 47 transitions. [2019-11-20 01:50:31,357 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 01:50:31,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2019-11-20 01:50:31,358 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-20 01:50:31,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:31,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:31,359 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:31,359 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 01:50:31,359 INFO L794 eck$LassoCheckResult]: Stem: 577#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 573#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 574#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 580#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 558#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 559#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 583#L7-3 assume !(init_nondet_~i~0 < ~N~0); 560#L5 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; 550#L18-3 assume !!(rangesum_~i~1 < ~N~0); 551#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 571#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 584#L18-3 assume !!(rangesum_~i~1 < ~N~0); 570#L19 [2019-11-20 01:50:31,359 INFO L796 eck$LassoCheckResult]: Loop: 570#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 563#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 564#L18-3 assume !!(rangesum_~i~1 < ~N~0); 570#L19 [2019-11-20 01:50:31,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:31,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1698718124, now seen corresponding path program 1 times [2019-11-20 01:50:31,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:31,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835436382] [2019-11-20 01:50:31,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:31,409 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:31,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:31,410 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 3 times [2019-11-20 01:50:31,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:31,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74548170] [2019-11-20 01:50:31,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:31,423 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:31,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1087986773, now seen corresponding path program 1 times [2019-11-20 01:50:31,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:31,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663762906] [2019-11-20 01:50:31,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:31,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:50:31,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663762906] [2019-11-20 01:50:31,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658629733] [2019-11-20 01:50:31,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:50:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:31,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:50:31,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:31,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:50:31,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2019-11-20 01:50:31,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978387707] [2019-11-20 01:50:31,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:31,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 01:50:31,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-20 01:50:31,694 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. cyclomatic complexity: 17 Second operand 12 states. [2019-11-20 01:50:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:32,096 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2019-11-20 01:50:32,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 01:50:32,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 115 transitions. [2019-11-20 01:50:32,099 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 17 [2019-11-20 01:50:32,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 77 states and 99 transitions. [2019-11-20 01:50:32,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-20 01:50:32,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2019-11-20 01:50:32,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 99 transitions. [2019-11-20 01:50:32,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:50:32,102 INFO L688 BuchiCegarLoop]: Abstraction has 77 states and 99 transitions. [2019-11-20 01:50:32,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 99 transitions. [2019-11-20 01:50:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2019-11-20 01:50:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-20 01:50:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 78 transitions. [2019-11-20 01:50:32,108 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-11-20 01:50:32,108 INFO L591 BuchiCegarLoop]: Abstraction has 60 states and 78 transitions. [2019-11-20 01:50:32,108 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 01:50:32,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 78 transitions. [2019-11-20 01:50:32,109 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2019-11-20 01:50:32,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:32,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:32,111 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:32,111 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 01:50:32,111 INFO L794 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 775#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 776#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 782#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 759#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 760#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 783#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 801#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 800#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 798#L7-3 assume !(init_nondet_~i~0 < ~N~0); 799#L5 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; 806#L18-3 assume !!(rangesum_~i~1 < ~N~0); 773#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 766#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 767#L18-3 assume !!(rangesum_~i~1 < ~N~0); 796#L19 [2019-11-20 01:50:32,111 INFO L796 eck$LassoCheckResult]: Loop: 796#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 797#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 795#L18-3 assume !!(rangesum_~i~1 < ~N~0); 796#L19 [2019-11-20 01:50:32,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:32,112 INFO L82 PathProgramCache]: Analyzing trace with hash -154124210, now seen corresponding path program 2 times [2019-11-20 01:50:32,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:32,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598964146] [2019-11-20 01:50:32,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:32,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:32,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:32,187 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 4 times [2019-11-20 01:50:32,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:32,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938631609] [2019-11-20 01:50:32,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:32,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:32,211 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:32,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:32,212 INFO L82 PathProgramCache]: Analyzing trace with hash -194270775, now seen corresponding path program 2 times [2019-11-20 01:50:32,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:32,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78648667] [2019-11-20 01:50:32,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:32,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:32,319 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:32,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78648667] [2019-11-20 01:50:32,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619774677] [2019-11-20 01:50:32,320 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:50:32,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 01:50:32,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:50:32,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:50:32,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 01:50:32,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:50:32,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2019-11-20 01:50:32,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990102068] [2019-11-20 01:50:32,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 01:50:32,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:50:32,542 INFO L87 Difference]: Start difference. First operand 60 states and 78 transitions. cyclomatic complexity: 25 Second operand 16 states. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-11-20 01:50:33,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:33,247 INFO L93 Difference]: Finished difference Result 122 states and 148 transitions. [2019-11-20 01:50:33,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 01:50:33,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 148 transitions. [2019-11-20 01:50:33,249 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-11-20 01:50:33,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 116 states and 142 transitions. [2019-11-20 01:50:33,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2019-11-20 01:50:33,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2019-11-20 01:50:33,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 142 transitions. [2019-11-20 01:50:33,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:50:33,252 INFO L688 BuchiCegarLoop]: Abstraction has 116 states and 142 transitions. [2019-11-20 01:50:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 142 transitions. [2019-11-20 01:50:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2019-11-20 01:50:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-20 01:50:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 128 transitions. [2019-11-20 01:50:33,259 INFO L711 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-11-20 01:50:33,259 INFO L591 BuchiCegarLoop]: Abstraction has 102 states and 128 transitions. [2019-11-20 01:50:33,259 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 01:50:33,259 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 128 transitions. [2019-11-20 01:50:33,260 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-11-20 01:50:33,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:33,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:33,261 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1] [2019-11-20 01:50:33,261 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 01:50:33,261 INFO L794 eck$LassoCheckResult]: Stem: 1068#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1064#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1065#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 1073#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1076#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1077#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1048#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1049#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1116#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1115#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1087#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1085#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1086#L5 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; 1117#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1060#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1061#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1043#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1044#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1109#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1098#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1101#L19 [2019-11-20 01:50:33,262 INFO L796 eck$LassoCheckResult]: Loop: 1101#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 1102#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1103#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1101#L19 [2019-11-20 01:50:33,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash -326653975, now seen corresponding path program 3 times [2019-11-20 01:50:33,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:33,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557284904] [2019-11-20 01:50:33,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:33,297 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:33,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:33,297 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 5 times [2019-11-20 01:50:33,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:33,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569117213] [2019-11-20 01:50:33,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:33,305 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:33,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1047353422, now seen corresponding path program 3 times [2019-11-20 01:50:33,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:33,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436856037] [2019-11-20 01:50:33,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:33,385 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-20 01:50:33,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436856037] [2019-11-20 01:50:33,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551378928] [2019-11-20 01:50:33,386 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:50:33,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-20 01:50:33,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 01:50:33,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 01:50:33,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-20 01:50:33,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:50:33,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2019-11-20 01:50:33,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321806512] [2019-11-20 01:50:33,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:33,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 01:50:33,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-11-20 01:50:33,570 INFO L87 Difference]: Start difference. First operand 102 states and 128 transitions. cyclomatic complexity: 37 Second operand 16 states. [2019-11-20 01:50:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:34,583 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2019-11-20 01:50:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-20 01:50:34,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 345 transitions. [2019-11-20 01:50:34,586 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 49 [2019-11-20 01:50:34,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 263 states and 329 transitions. [2019-11-20 01:50:34,590 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2019-11-20 01:50:34,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2019-11-20 01:50:34,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 329 transitions. [2019-11-20 01:50:34,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:50:34,591 INFO L688 BuchiCegarLoop]: Abstraction has 263 states and 329 transitions. [2019-11-20 01:50:34,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 329 transitions. [2019-11-20 01:50:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 112. [2019-11-20 01:50:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-20 01:50:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2019-11-20 01:50:34,601 INFO L711 BuchiCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-11-20 01:50:34,601 INFO L591 BuchiCegarLoop]: Abstraction has 112 states and 139 transitions. [2019-11-20 01:50:34,601 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 01:50:34,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 139 transitions. [2019-11-20 01:50:34,602 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 21 [2019-11-20 01:50:34,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:34,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:34,603 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:34,603 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 01:50:34,603 INFO L794 eck$LassoCheckResult]: Stem: 1604#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 1600#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 1601#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 1608#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1610#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1611#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1612#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1622#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 1587#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1588#L7-3 assume !(init_nondet_~i~0 < ~N~0); 1589#L5 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; 1590#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1644#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1642#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1582#L18-3 assume !!(rangesum_~i~1 < ~N~0); 1583#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1592#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1593#L18-3 assume !(rangesum_~i~1 < ~N~0); 1581#L18-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 1594#L27 main_#t~ret5 := rangesum_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;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; 1595#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1688#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1687#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1603#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1596#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1597#L18-7 [2019-11-20 01:50:34,603 INFO L796 eck$LassoCheckResult]: Loop: 1597#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1605#L18-8 assume !!(rangesum_~i~1 < ~N~0); 1689#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 1597#L18-7 [2019-11-20 01:50:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:34,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1740406288, now seen corresponding path program 1 times [2019-11-20 01:50:34,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:34,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865264214] [2019-11-20 01:50:34,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:34,741 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 01:50:34,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865264214] [2019-11-20 01:50:34,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104924418] [2019-11-20 01:50:34,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 01:50:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:34,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 01:50:34,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 01:50:34,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 01:50:34,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-20 01:50:34,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644537424] [2019-11-20 01:50:34,860 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-20 01:50:34,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:34,860 INFO L82 PathProgramCache]: Analyzing trace with hash 88159, now seen corresponding path program 1 times [2019-11-20 01:50:34,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:34,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493268230] [2019-11-20 01:50:34,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:34,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:34,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:34,885 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 01:50:34,885 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 01:50:34,885 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 01:50:34,885 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 01:50:34,885 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 01:50:34,886 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:34,886 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 01:50:34,886 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 01:50:34,886 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration8_Loop [2019-11-20 01:50:34,886 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 01:50:34,886 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 01:50:34,887 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-20 01:50:34,890 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-20 01:50:34,976 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 01:50:34,976 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:34,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 01:50:34,980 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 01:50:34,986 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 01:50:34,986 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_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:34,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 01:50:34,992 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:35,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 01:50:35,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 01:50:35,597 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 01:50:35,599 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 01:50:35,600 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 01:50:35,600 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 01:50:35,600 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 01:50:35,600 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 01:50:35,600 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:35,600 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 01:50:35,600 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 01:50:35,600 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration8_Loop [2019-11-20 01:50:35,600 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 01:50:35,601 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 01:50:35,601 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-20 01:50:35,603 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-20 01:50:35,679 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 01:50:35,680 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:35,684 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-20 01:50:35,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:35,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:35,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:35,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:35,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:35,687 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:35,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:50:35,688 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:35,693 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-20 01:50:35,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:35,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:35,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:35,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:35,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:35,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:35,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:50:35,698 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 01:50:35,702 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-20 01:50:35,702 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:35,705 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 01:50:35,705 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 01:50:35,706 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 01:50:35,706 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_rangesum_~i~1) = 1*~N~0 - 2*ULTIMATE.start_rangesum_~i~1 Supporting invariants [] Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:35,707 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 01:50:35,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:35,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 01:50:35,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:35,751 WARN L253 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 01:50:35,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:35,781 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-20 01:50:35,782 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-20 01:50:35,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 139 transitions. cyclomatic complexity: 38 Second operand 4 states. [2019-11-20 01:50:35,843 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 139 transitions. cyclomatic complexity: 38. Second operand 4 states. Result 144 states and 182 transitions. Complement of second has 7 states. [2019-11-20 01:50:35,844 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-20 01:50:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 01:50:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2019-11-20 01:50:35,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-20 01:50:35,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:35,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-20 01:50:35,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:35,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-20 01:50:35,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:35,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 182 transitions. [2019-11-20 01:50:35,847 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-11-20 01:50:35,849 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 121 states and 150 transitions. [2019-11-20 01:50:35,849 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2019-11-20 01:50:35,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2019-11-20 01:50:35,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 150 transitions. [2019-11-20 01:50:35,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:50:35,852 INFO L688 BuchiCegarLoop]: Abstraction has 121 states and 150 transitions. [2019-11-20 01:50:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 150 transitions. [2019-11-20 01:50:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2019-11-20 01:50:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-20 01:50:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2019-11-20 01:50:35,859 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-11-20 01:50:35,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 01:50:35,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 01:50:35,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-11-20 01:50:35,860 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand 15 states. [2019-11-20 01:50:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 01:50:36,271 INFO L93 Difference]: Finished difference Result 148 states and 175 transitions. [2019-11-20 01:50:36,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 01:50:36,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 175 transitions. [2019-11-20 01:50:36,273 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 20 [2019-11-20 01:50:36,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 148 states and 175 transitions. [2019-11-20 01:50:36,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2019-11-20 01:50:36,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2019-11-20 01:50:36,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 148 states and 175 transitions. [2019-11-20 01:50:36,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:50:36,276 INFO L688 BuchiCegarLoop]: Abstraction has 148 states and 175 transitions. [2019-11-20 01:50:36,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states and 175 transitions. [2019-11-20 01:50:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 117. [2019-11-20 01:50:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-20 01:50:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2019-11-20 01:50:36,291 INFO L711 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-11-20 01:50:36,291 INFO L591 BuchiCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-11-20 01:50:36,291 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-20 01:50:36,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 140 transitions. [2019-11-20 01:50:36,292 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 18 [2019-11-20 01:50:36,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:36,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:36,294 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 1, 1, 1, 1, 1] [2019-11-20 01:50:36,294 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 01:50:36,294 INFO L794 eck$LassoCheckResult]: Stem: 2340#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 2335#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2336#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 2345#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2347#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2382#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2381#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2379#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2380#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2412#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2317#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2318#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2350#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2348#L7-3 assume !(init_nondet_~i~0 < ~N~0); 2349#L5 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; 2310#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2311#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2410#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2408#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2407#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2405#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2403#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2402#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2401#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2399#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2385#L19 [2019-11-20 01:50:36,294 INFO L796 eck$LassoCheckResult]: Loop: 2385#L19 assume rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 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; 2321#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2322#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2385#L19 [2019-11-20 01:50:36,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:36,294 INFO L82 PathProgramCache]: Analyzing trace with hash -185017358, now seen corresponding path program 4 times [2019-11-20 01:50:36,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:36,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590176437] [2019-11-20 01:50:36,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:36,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:36,355 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:36,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:36,356 INFO L82 PathProgramCache]: Analyzing trace with hash 59702, now seen corresponding path program 6 times [2019-11-20 01:50:36,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:36,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203192201] [2019-11-20 01:50:36,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:36,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:36,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1409041499, now seen corresponding path program 4 times [2019-11-20 01:50:36,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:36,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994585065] [2019-11-20 01:50:36,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:36,435 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:37,299 WARN L191 SmtUtils]: Spent 813.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 130 [2019-11-20 01:50:37,400 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 01:50:37,400 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 01:50:37,400 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 01:50:37,401 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 01:50:37,401 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 01:50:37,401 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:37,401 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 01:50:37,401 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 01:50:37,401 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration9_Lasso [2019-11-20 01:50:37,401 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 01:50:37,401 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 01:50:37,405 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-20 01:50:37,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Exception during sending of exit command (exit): Broken pipe [2019-11-20 01:50:37,560 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-20 01:50:37,612 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-20 01:50:37,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:50:37,615 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-20 01:50:37,617 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-20 01:50:37,619 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-20 01:50:37,620 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-20 01:50:37,622 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-20 01:50:37,623 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-20 01:50:37,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-20 01:50:37,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-20 01:50:37,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-20 01:50:37,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:50:37,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:50:37,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-20 01:50:37,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-20 01:50:37,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:50:37,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-20 01:50:37,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-20 01:50:37,666 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-20 01:50:37,668 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-20 01:50:37,670 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-20 01:50:37,676 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-20 01:50:38,017 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 01:50:38,018 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:38,022 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-20 01:50:38,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:38,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 01:50:38,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:38,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:38,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:38,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 01:50:38,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 01:50:38,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:38,030 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-20 01:50:38,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:38,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:38,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:38,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:38,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:50:38,034 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:50:38,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:38,044 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-20 01:50:38,046 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:38,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:38,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:38,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:38,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:50:38,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:50:38,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:38,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-20 01:50:38,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:38,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:38,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:38,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:38,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:50:38,078 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:50:38,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:38,085 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-20 01:50:38,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:38,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:38,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:38,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 01:50:38,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:50:38,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:50:38,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 01:50:38,105 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-20 01:50:38,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 01:50:38,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 01:50:38,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 01:50:38,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:38,130 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-20 01:50:38,131 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-20 01:50:38,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 01:50:38,226 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-20 01:50:38,226 INFO L444 ModelExtractionUtils]: 5 out of 37 variables were initially zero. Simplification set additionally 28 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3514cea9-94c0-48b7-b6bb-bf89afaed446/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:38,229 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 01:50:38,237 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-20 01:50:38,238 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 01:50:38,238 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1, v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_2, ULTIMATE.start_rangesum_~x.offset) = -4*ULTIMATE.start_rangesum_~i~1 + 1*v_rep(select #length ULTIMATE.start_init_nondet_~x.base)_2 - 1*ULTIMATE.start_rangesum_~x.offset Supporting invariants [] [2019-11-20 01:50:38,281 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-11-20 01:50:38,287 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-20 01:50:38,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:38,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 01:50:38,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 01:50:38,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 01:50:38,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 01:50:38,391 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-20 01:50:38,391 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2019-11-20 01:50:38,391 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 117 states and 140 transitions. cyclomatic complexity: 35 Second operand 6 states. [2019-11-20 01:50:38,462 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 117 states and 140 transitions. cyclomatic complexity: 35. Second operand 6 states. Result 149 states and 180 transitions. Complement of second has 9 states. [2019-11-20 01:50:38,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-20 01:50:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-20 01:50:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-11-20 01:50:38,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-20 01:50:38,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:38,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 28 letters. Loop has 3 letters. [2019-11-20 01:50:38,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:38,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 25 letters. Loop has 6 letters. [2019-11-20 01:50:38,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 01:50:38,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 180 transitions. [2019-11-20 01:50:38,469 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2019-11-20 01:50:38,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 118 states and 141 transitions. [2019-11-20 01:50:38,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2019-11-20 01:50:38,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-11-20 01:50:38,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 141 transitions. [2019-11-20 01:50:38,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 01:50:38,471 INFO L688 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-20 01:50:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 141 transitions. [2019-11-20 01:50:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-11-20 01:50:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-20 01:50:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2019-11-20 01:50:38,476 INFO L711 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-20 01:50:38,476 INFO L591 BuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2019-11-20 01:50:38,476 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-20 01:50:38,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 141 transitions. [2019-11-20 01:50:38,477 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 15 [2019-11-20 01:50:38,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 01:50:38,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 01:50:38,479 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 01:50:38,479 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-20 01:50:38,479 INFO L794 eck$LassoCheckResult]: Stem: 2747#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; 2740#L-1 havoc main_#res;havoc main_#t~nondet4, main_#t~ret5, main_#t~mem6, main_#t~mem7, main_#t~ret8, main_#t~mem9, main_#t~mem11, main_#t~post10, main_~i~2, main_#t~ret12, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet4;havoc main_#t~nondet4; 2741#L33 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);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; 2751#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2754#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2755#L7-3 assume !!(init_nondet_~i~0 < ~N~0);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; 2724#L7-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2725#L7-3 assume !(init_nondet_~i~0 < ~N~0); 2758#L5 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; 2770#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2779#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2769#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2765#L18-3 assume !!(rangesum_~i~1 < ~N~0); 2760#L19 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2761#L18-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2781#L18-3 assume !(rangesum_~i~1 < ~N~0); 2780#L18-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2778#L27 main_#t~ret5 := rangesum_#res;main_~ret~1 := main_#t~ret5;havoc main_#t~ret5;call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem6;havoc main_#t~mem6;call main_#t~mem7 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem7, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem7;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; 2777#L18-8 assume !!(rangesum_~i~1 < ~N~0); 2776#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2775#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2771#L18-8 assume !!(rangesum_~i~1 < ~N~0); 2768#L19-2 assume !(rangesum_~i~1 > (if ~N~0 < 0 && 0 != ~N~0 % 2 then 1 + ~N~0 / 2 else ~N~0 / 2)); 2764#L18-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2763#L18-8 assume !(rangesum_~i~1 < ~N~0); 2739#L18-9 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2720#L27-1 main_#t~ret8 := rangesum_#res;main_~ret2~0 := main_#t~ret8;havoc main_#t~ret8;call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem9;havoc main_#t~mem9;main_~i~2 := 0; 2721#L46-3 [2019-11-20 01:50:38,479 INFO L796 eck$LassoCheckResult]: Loop: 2721#L46-3 assume !!(main_~i~2 < ~N~0 - 1);call main_#t~mem11 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem11, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem11; 2750#L46-2 main_#t~post10 := main_~i~2;main_~i~2 := 1 + main_#t~post10;havoc main_#t~post10; 2721#L46-3 [2019-11-20 01:50:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1751120697, now seen corresponding path program 1 times [2019-11-20 01:50:38,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:38,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930665131] [2019-11-20 01:50:38,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:38,508 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:38,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:38,508 INFO L82 PathProgramCache]: Analyzing trace with hash 3427, now seen corresponding path program 1 times [2019-11-20 01:50:38,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:38,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686627852] [2019-11-20 01:50:38,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:38,514 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:38,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 01:50:38,515 INFO L82 PathProgramCache]: Analyzing trace with hash 800192681, now seen corresponding path program 1 times [2019-11-20 01:50:38,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 01:50:38,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308785488] [2019-11-20 01:50:38,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 01:50:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 01:50:38,544 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 01:50:39,141 WARN L191 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 150 [2019-11-20 01:50:39,417 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-20 01:50:39,622 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-20 01:50:39,826 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-11-20 01:50:39,917 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 01:50:39,917 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 01:50:39,917 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 01:50:39,917 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 01:50:39,917 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 01:50:39,917 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 01:50:39,918 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 01:50:39,918 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 01:50:39,918 INFO L133 ssoRankerPreferences]: Filename of dumped script: rangesum.i_Iteration10_Lasso [2019-11-20 01:50:39,918 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 01:50:39,918 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 01:50:39,920 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-20 01:50:39,924 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-20 01:50:39,925 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-20 01:50:39,927 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-20 01:50:39,928 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-20 01:50:39,932 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-20 01:50:39,934 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-20 01:50:39,935 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-20 01:50:39,940 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-20 01:50:39,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 01:50:39,943 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-20 01:50:39,977 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 01:50:39,980 INFO L168 Benchmark]: Toolchain (without parser) took 13738.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -172.3 MB). Peak memory consumption was 308.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:50:39,980 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 01:50:39,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 01:50:39,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.79 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-20 01:50:39,982 INFO L168 Benchmark]: Boogie Preprocessor took 73.64 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 01:50:39,982 INFO L168 Benchmark]: RCFGBuilder took 505.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:50:39,983 INFO L168 Benchmark]: BuchiAutomizer took 12593.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.7 MB). Peak memory consumption was 322.4 MB. Max. memory is 11.5 GB. [2019-11-20 01:50:39,985 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 479.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -179.7 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.79 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 73.64 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 505.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12593.89 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.7 MB). Peak memory consumption was 322.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...