./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash af68da58954d6230e3860792840330ae6de845ab ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/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.23-1dbac8b [2018-11-10 08:04:24,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:04:24,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:04:24,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:04:24,733 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:04:24,733 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:04:24,734 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:04:24,735 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:04:24,736 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:04:24,737 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:04:24,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:04:24,738 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:04:24,738 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:04:24,739 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:04:24,740 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:04:24,740 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:04:24,741 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:04:24,742 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:04:24,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:04:24,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:04:24,745 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:04:24,746 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:04:24,747 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:04:24,747 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:04:24,748 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:04:24,748 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:04:24,749 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:04:24,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:04:24,750 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:04:24,751 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:04:24,751 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:04:24,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:04:24,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:04:24,752 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:04:24,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:04:24,753 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:04:24,753 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 08:04:24,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:04:24,764 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:04:24,764 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:04:24,765 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:04:24,765 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:04:24,765 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 08:04:24,765 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 08:04:24,765 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 08:04:24,765 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 08:04:24,765 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 08:04:24,765 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 08:04:24,766 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:04:24,766 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:04:24,766 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:04:24,766 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:04:24,766 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:04:24,766 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:04:24,766 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 08:04:24,766 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 08:04:24,767 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 08:04:24,767 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:04:24,767 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:04:24,767 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 08:04:24,767 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 08:04:24,767 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:04:24,767 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:04:24,767 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 08:04:24,768 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:04:24,768 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:04:24,768 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 08:04:24,768 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 08:04:24,769 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> af68da58954d6230e3860792840330ae6de845ab [2018-11-10 08:04:24,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:04:24,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:04:24,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:04:24,806 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:04:24,807 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:04:24,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i [2018-11-10 08:04:24,853 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/data/689226091/db7010491eb1476e8e2813b538c992a3/FLAGe97268c22 [2018-11-10 08:04:25,187 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:04:25,187 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/sv-benchmarks/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i [2018-11-10 08:04:25,192 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/data/689226091/db7010491eb1476e8e2813b538c992a3/FLAGe97268c22 [2018-11-10 08:04:25,204 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/data/689226091/db7010491eb1476e8e2813b538c992a3 [2018-11-10 08:04:25,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:04:25,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:04:25,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:04:25,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:04:25,211 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:04:25,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46cbfc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25, skipping insertion in model container [2018-11-10 08:04:25,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:04:25,238 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:04:25,354 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:04:25,360 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:04:25,374 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:04:25,384 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:04:25,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25 WrapperNode [2018-11-10 08:04:25,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:04:25,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:04:25,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:04:25,385 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:04:25,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:04:25,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:04:25,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:04:25,412 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:04:25,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (1/1) ... [2018-11-10 08:04:25,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:04:25,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:04:25,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:04:25,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:04:25,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:04:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 08:04:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:04:25,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:04:25,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 08:04:25,868 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:04:25,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:04:25 BoogieIcfgContainer [2018-11-10 08:04:25,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:04:25,869 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 08:04:25,869 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 08:04:25,872 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 08:04:25,873 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:04:25,873 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 08:04:25" (1/3) ... [2018-11-10 08:04:25,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40620603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:04:25, skipping insertion in model container [2018-11-10 08:04:25,874 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:04:25,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:04:25" (2/3) ... [2018-11-10 08:04:25,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@40620603 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:04:25, skipping insertion in model container [2018-11-10 08:04:25,875 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:04:25,875 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:04:25" (3/3) ... [2018-11-10 08:04:25,876 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum10_false-unreach-call_true-termination.i [2018-11-10 08:04:25,914 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:04:25,914 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 08:04:25,915 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 08:04:25,915 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 08:04:25,915 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:04:25,915 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:04:25,915 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 08:04:25,915 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:04:25,915 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 08:04:25,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-11-10 08:04:25,941 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 29 [2018-11-10 08:04:25,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:25,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:25,945 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:04:25,945 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 08:04:25,945 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 08:04:25,945 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states. [2018-11-10 08:04:25,948 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 29 [2018-11-10 08:04:25,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:25,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:25,949 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:04:25,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 08:04:25,953 INFO L793 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 52#L6-4true [2018-11-10 08:04:25,953 INFO L795 eck$LassoCheckResult]: Loop: 52#L6-4true assume true; 44#L6-1true assume !!(init_nondet_~i~0 < 10); 7#L7true SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5#L7-1true havoc init_nondet_#t~nondet1; 54#L6-3true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 52#L6-4true [2018-11-10 08:04:25,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:25,957 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 08:04:25,958 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:25,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:25,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:25,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:25,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:26,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-11-10 08:04:26,037 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:26,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:26,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:26,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:26,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:26,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:26,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-11-10 08:04:26,050 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:26,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:26,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:26,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:26,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:26,221 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:04:26,222 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:04:26,222 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:04:26,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:04:26,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:04:26,223 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:04:26,223 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:04:26,223 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:04:26,223 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-10 08:04:26,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:04:26,223 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:04:26,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:26,645 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:04:26,648 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:04:26,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,660 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,661 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,664 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:26,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:26,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,669 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:26,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:26,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,689 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,697 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:26,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:26,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:26,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:26,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:26,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:26,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:26,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:26,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,740 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:04:26,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,742 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:04:26,742 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:26,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:26,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:26,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:26,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:26,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:26,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:26,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:26,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:26,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:26,766 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:26,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:26,807 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:04:26,834 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 08:04:26,834 INFO L444 ModelExtractionUtils]: 20 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 08:04:26,835 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:04:26,837 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:04:26,837 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:04:26,837 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_~i~0) = -2*ULTIMATE.start_init_nondet_~i~0 + 19 Supporting invariants [] [2018-11-10 08:04:26,858 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-10 08:04:26,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:26,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:26,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:26,905 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 [2018-11-10 08:04:26,906 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 54 states. Second operand 4 states. [2018-11-10 08:04:26,960 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 54 states.. Second operand 4 states. Result 153 states and 195 transitions. Complement of second has 7 states. [2018-11-10 08:04:26,960 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 [2018-11-10 08:04:26,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:04:26,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-10 08:04:26,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 131 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-10 08:04:26,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:26,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 131 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-10 08:04:26,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:26,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 131 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-10 08:04:26,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:26,965 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 195 transitions. [2018-11-10 08:04:26,970 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:26,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 49 states and 59 transitions. [2018-11-10 08:04:26,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2018-11-10 08:04:26,974 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-10 08:04:26,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 59 transitions. [2018-11-10 08:04:26,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:26,974 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-10 08:04:26,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 59 transitions. [2018-11-10 08:04:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-10 08:04:26,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-10 08:04:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2018-11-10 08:04:26,993 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-10 08:04:26,993 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 59 transitions. [2018-11-10 08:04:26,993 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 08:04:26,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 59 transitions. [2018-11-10 08:04:26,995 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:26,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:26,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:26,995 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 08:04:26,995 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 08:04:26,995 INFO L793 eck$LassoCheckResult]: Stem: 312#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 287#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 288#L6-4 assume true; 301#L6-1 assume !(init_nondet_~i~0 < 10); 302#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 315#L17-4 [2018-11-10 08:04:26,996 INFO L795 eck$LassoCheckResult]: Loop: 315#L17-4 assume true; 304#L17-1 assume !!(rangesum_~i~1 < 10); 281#L18 assume !(rangesum_~i~1 > 5); 282#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 315#L17-4 [2018-11-10 08:04:26,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash 28694797, now seen corresponding path program 1 times [2018-11-10 08:04:26,996 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:26,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:26,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:26,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:27,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:27,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:27,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:04:27,034 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:27,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:27,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1636744, now seen corresponding path program 1 times [2018-11-10 08:04:27,034 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:27,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:27,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:27,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:27,061 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:04:27,061 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:04:27,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:04:27,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:04:27,061 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:04:27,061 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:04:27,061 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:04:27,061 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:04:27,061 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration2_Loop [2018-11-10 08:04:27,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:04:27,062 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:04:27,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:27,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:27,086 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:04:27,086 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/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 [2018-11-10 08:04:27,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:04:27,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:04:27,094 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:04:27,094 INFO L446 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/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/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 [2018-11-10 08:04:27,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:04:27,110 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/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 [2018-11-10 08:04:27,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:04:27,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:04:27,171 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:04:27,173 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:04:27,173 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:04:27,173 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:04:27,174 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:04:27,174 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:04:27,174 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:04:27,174 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:04:27,174 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:04:27,174 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration2_Loop [2018-11-10 08:04:27,174 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:04:27,174 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:04:27,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:27,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:27,300 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:04:27,300 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:04:27,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:27,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:27,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:27,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:27,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:27,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:27,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:27,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:27,303 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:27,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:27,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:27,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:27,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:27,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:27,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:27,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:27,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:27,308 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:04:27,310 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:04:27,310 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:04:27,311 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:04:27,311 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:04:27,311 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:04:27,311 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 11 Supporting invariants [] [2018-11-10 08:04:27,312 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:04:27,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:27,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:27,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:27,356 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 [2018-11-10 08:04:27,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 59 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-10 08:04:27,397 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 59 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 69 states and 83 transitions. Complement of second has 7 states. [2018-11-10 08:04:27,397 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 [2018-11-10 08:04:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:04:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 08:04:27,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-10 08:04:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:27,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-10 08:04:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:27,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-10 08:04:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:27,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 83 transitions. [2018-11-10 08:04:27,401 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:27,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 59 states and 72 transitions. [2018-11-10 08:04:27,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:27,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-10 08:04:27,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 72 transitions. [2018-11-10 08:04:27,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:27,403 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 72 transitions. [2018-11-10 08:04:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 72 transitions. [2018-11-10 08:04:27,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-11-10 08:04:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 08:04:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2018-11-10 08:04:27,408 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 70 transitions. [2018-11-10 08:04:27,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:04:27,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:04:27,410 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 3 states. [2018-11-10 08:04:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:27,421 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-10 08:04:27,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:04:27,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 74 transitions. [2018-11-10 08:04:27,422 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:27,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 62 states and 73 transitions. [2018-11-10 08:04:27,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:27,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 08:04:27,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2018-11-10 08:04:27,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:27,424 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-10 08:04:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2018-11-10 08:04:27,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 58. [2018-11-10 08:04:27,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-10 08:04:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2018-11-10 08:04:27,426 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-10 08:04:27,426 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 69 transitions. [2018-11-10 08:04:27,426 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 08:04:27,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 69 transitions. [2018-11-10 08:04:27,426 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:27,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:27,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:27,427 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:27,427 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:27,427 INFO L793 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 578#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 579#L6-4 assume true; 594#L6-1 assume !!(init_nondet_~i~0 < 10); 569#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 564#L7-1 havoc init_nondet_#t~nondet1; 565#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 609#L6-4 assume true; 592#L6-1 assume !(init_nondet_~i~0 < 10); 593#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 612#L17-4 assume true; 596#L17-1 [2018-11-10 08:04:27,427 INFO L795 eck$LassoCheckResult]: Loop: 596#L17-1 assume !!(rangesum_~i~1 < 10); 570#L18 assume rangesum_~i~1 > 5; 571#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 600#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 601#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 610#L17-4 assume true; 596#L17-1 [2018-11-10 08:04:27,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:27,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1918637389, now seen corresponding path program 1 times [2018-11-10 08:04:27,427 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:27,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:27,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:27,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:27,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:27,447 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:27,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:27,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:27,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:27,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 08:04:27,516 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:27,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:27,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 1 times [2018-11-10 08:04:27,516 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:27,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:27,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:27,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:27,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:04:27,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:04:27,560 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-10 08:04:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:27,593 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2018-11-10 08:04:27,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:04:27,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 79 transitions. [2018-11-10 08:04:27,596 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:27,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 67 states and 78 transitions. [2018-11-10 08:04:27,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:27,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 08:04:27,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 78 transitions. [2018-11-10 08:04:27,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:27,597 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-11-10 08:04:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 78 transitions. [2018-11-10 08:04:27,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-10 08:04:27,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-10 08:04:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2018-11-10 08:04:27,599 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-10 08:04:27,599 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 74 transitions. [2018-11-10 08:04:27,600 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 08:04:27,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 74 transitions. [2018-11-10 08:04:27,600 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:27,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:27,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:27,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-10 08:04:27,601 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:27,601 INFO L793 eck$LassoCheckResult]: Stem: 771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 742#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 743#L6-4 assume true; 773#L6-1 assume !!(init_nondet_~i~0 < 10); 782#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 781#L7-1 havoc init_nondet_#t~nondet1; 777#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 774#L6-4 assume true; 758#L6-1 assume !!(init_nondet_~i~0 < 10); 730#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 725#L7-1 havoc init_nondet_#t~nondet1; 726#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 780#L6-4 assume true; 756#L6-1 assume !(init_nondet_~i~0 < 10); 757#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 778#L17-4 assume true; 759#L17-1 [2018-11-10 08:04:27,601 INFO L795 eck$LassoCheckResult]: Loop: 759#L17-1 assume !!(rangesum_~i~1 < 10); 734#L18 assume rangesum_~i~1 > 5; 735#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 764#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 765#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 775#L17-4 assume true; 759#L17-1 [2018-11-10 08:04:27,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1300936330, now seen corresponding path program 2 times [2018-11-10 08:04:27,601 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:27,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:27,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:27,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:27,639 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:27,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 08:04:27,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 08:04:27,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:27,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:27,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:27,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 08:04:27,714 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:27,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:27,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 2 times [2018-11-10 08:04:27,715 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:27,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:27,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:27,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:04:27,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:04:27,749 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-11-10 08:04:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:27,770 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-10 08:04:27,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:04:27,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 84 transitions. [2018-11-10 08:04:27,772 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:27,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 72 states and 83 transitions. [2018-11-10 08:04:27,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:27,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 08:04:27,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 83 transitions. [2018-11-10 08:04:27,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:27,773 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-11-10 08:04:27,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 83 transitions. [2018-11-10 08:04:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-11-10 08:04:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-10 08:04:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2018-11-10 08:04:27,776 INFO L728 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-10 08:04:27,777 INFO L608 BuchiCegarLoop]: Abstraction has 68 states and 79 transitions. [2018-11-10 08:04:27,777 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 08:04:27,777 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 79 transitions. [2018-11-10 08:04:27,777 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:27,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:27,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:27,778 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-11-10 08:04:27,778 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:27,779 INFO L793 eck$LassoCheckResult]: Stem: 961#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 932#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 933#L6-4 assume true; 963#L6-1 assume !!(init_nondet_~i~0 < 10); 977#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 976#L7-1 havoc init_nondet_#t~nondet1; 975#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 964#L6-4 assume true; 948#L6-1 assume !!(init_nondet_~i~0 < 10); 920#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 915#L7-1 havoc init_nondet_#t~nondet1; 916#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 967#L6-4 assume true; 971#L6-1 assume !!(init_nondet_~i~0 < 10); 974#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 973#L7-1 havoc init_nondet_#t~nondet1; 972#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 970#L6-4 assume true; 946#L6-1 assume !(init_nondet_~i~0 < 10); 947#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 968#L17-4 assume true; 949#L17-1 [2018-11-10 08:04:27,779 INFO L795 eck$LassoCheckResult]: Loop: 949#L17-1 assume !!(rangesum_~i~1 < 10); 924#L18 assume rangesum_~i~1 > 5; 925#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 954#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 955#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 965#L17-4 assume true; 949#L17-1 [2018-11-10 08:04:27,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:27,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1668305773, now seen corresponding path program 3 times [2018-11-10 08:04:27,779 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:27,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:27,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:27,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:27,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:27,812 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:27,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:04:27,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 08:04:27,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:27,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:27,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:27,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 08:04:27,874 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:27,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:27,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 3 times [2018-11-10 08:04:27,875 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:27,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:27,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:27,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:27,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:04:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:04:27,913 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-11-10 08:04:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:27,938 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-11-10 08:04:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:04:27,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 89 transitions. [2018-11-10 08:04:27,941 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:27,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 77 states and 88 transitions. [2018-11-10 08:04:27,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:27,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 08:04:27,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 88 transitions. [2018-11-10 08:04:27,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:27,942 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 88 transitions. [2018-11-10 08:04:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 88 transitions. [2018-11-10 08:04:27,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-11-10 08:04:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-10 08:04:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2018-11-10 08:04:27,947 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 84 transitions. [2018-11-10 08:04:27,947 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 84 transitions. [2018-11-10 08:04:27,947 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 08:04:27,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 84 transitions. [2018-11-10 08:04:27,948 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:27,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:27,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:27,949 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-11-10 08:04:27,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:27,949 INFO L793 eck$LassoCheckResult]: Stem: 1177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 1149#L6-4 assume true; 1164#L6-1 assume !!(init_nondet_~i~0 < 10); 1136#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1131#L7-1 havoc init_nondet_#t~nondet1; 1132#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1179#L6-4 assume true; 1180#L6-1 assume !!(init_nondet_~i~0 < 10); 1198#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1197#L7-1 havoc init_nondet_#t~nondet1; 1196#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1195#L6-4 assume true; 1194#L6-1 assume !!(init_nondet_~i~0 < 10); 1193#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1192#L7-1 havoc init_nondet_#t~nondet1; 1191#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1190#L6-4 assume true; 1186#L6-1 assume !!(init_nondet_~i~0 < 10); 1189#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1188#L7-1 havoc init_nondet_#t~nondet1; 1187#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1185#L6-4 assume true; 1162#L6-1 assume !(init_nondet_~i~0 < 10); 1163#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 1183#L17-4 assume true; 1165#L17-1 [2018-11-10 08:04:27,950 INFO L795 eck$LassoCheckResult]: Loop: 1165#L17-1 assume !!(rangesum_~i~1 < 10); 1140#L18 assume rangesum_~i~1 > 5; 1141#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 1170#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 1171#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1181#L17-4 assume true; 1165#L17-1 [2018-11-10 08:04:27,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:27,950 INFO L82 PathProgramCache]: Analyzing trace with hash -335000470, now seen corresponding path program 4 times [2018-11-10 08:04:27,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:27,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:28,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:28,015 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:28,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:04:28,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:04:28,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:28,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:28,063 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:28,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:28,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 08:04:28,080 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:28,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 4 times [2018-11-10 08:04:28,080 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:28,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:28,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:28,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:28,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 08:04:28,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:04:28,117 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. cyclomatic complexity: 17 Second operand 8 states. [2018-11-10 08:04:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:28,142 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2018-11-10 08:04:28,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:04:28,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 94 transitions. [2018-11-10 08:04:28,144 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:28,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 82 states and 93 transitions. [2018-11-10 08:04:28,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:28,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 08:04:28,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 93 transitions. [2018-11-10 08:04:28,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:28,146 INFO L705 BuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-11-10 08:04:28,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 93 transitions. [2018-11-10 08:04:28,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2018-11-10 08:04:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-10 08:04:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2018-11-10 08:04:28,149 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-11-10 08:04:28,149 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 89 transitions. [2018-11-10 08:04:28,149 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 08:04:28,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 89 transitions. [2018-11-10 08:04:28,150 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:28,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:28,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:28,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2018-11-10 08:04:28,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:28,151 INFO L793 eck$LassoCheckResult]: Stem: 1419#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1390#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 1391#L6-4 assume true; 1406#L6-1 assume !!(init_nondet_~i~0 < 10); 1378#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1373#L7-1 havoc init_nondet_#t~nondet1; 1374#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1421#L6-4 assume true; 1422#L6-1 assume !!(init_nondet_~i~0 < 10); 1445#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1444#L7-1 havoc init_nondet_#t~nondet1; 1443#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1442#L6-4 assume true; 1441#L6-1 assume !!(init_nondet_~i~0 < 10); 1440#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1439#L7-1 havoc init_nondet_#t~nondet1; 1438#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1437#L6-4 assume true; 1436#L6-1 assume !!(init_nondet_~i~0 < 10); 1435#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1434#L7-1 havoc init_nondet_#t~nondet1; 1433#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1432#L6-4 assume true; 1428#L6-1 assume !!(init_nondet_~i~0 < 10); 1431#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1430#L7-1 havoc init_nondet_#t~nondet1; 1429#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1427#L6-4 assume true; 1404#L6-1 assume !(init_nondet_~i~0 < 10); 1405#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 1425#L17-4 assume true; 1407#L17-1 [2018-11-10 08:04:28,151 INFO L795 eck$LassoCheckResult]: Loop: 1407#L17-1 assume !!(rangesum_~i~1 < 10); 1382#L18 assume rangesum_~i~1 > 5; 1383#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 1412#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 1413#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1423#L17-4 assume true; 1407#L17-1 [2018-11-10 08:04:28,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,151 INFO L82 PathProgramCache]: Analyzing trace with hash 191195533, now seen corresponding path program 5 times [2018-11-10 08:04:28,151 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:28,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:28,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:28,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:28,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:28,216 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:28,224 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 08:04:28,244 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 08:04:28,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:28,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:28,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:28,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 08:04:28,270 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:28,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 5 times [2018-11-10 08:04:28,270 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:28,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:28,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:28,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:28,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:04:28,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:04:28,321 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. cyclomatic complexity: 17 Second operand 9 states. [2018-11-10 08:04:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:28,345 INFO L93 Difference]: Finished difference Result 88 states and 99 transitions. [2018-11-10 08:04:28,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:04:28,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 99 transitions. [2018-11-10 08:04:28,348 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:28,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 87 states and 98 transitions. [2018-11-10 08:04:28,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:28,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 08:04:28,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 98 transitions. [2018-11-10 08:04:28,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:28,350 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 98 transitions. [2018-11-10 08:04:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 98 transitions. [2018-11-10 08:04:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-10 08:04:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-10 08:04:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2018-11-10 08:04:28,352 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-11-10 08:04:28,352 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 94 transitions. [2018-11-10 08:04:28,352 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 08:04:28,352 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 94 transitions. [2018-11-10 08:04:28,353 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:28,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:28,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:28,353 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2018-11-10 08:04:28,353 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:28,353 INFO L793 eck$LassoCheckResult]: Stem: 1687#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1658#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 1659#L6-4 assume true; 1674#L6-1 assume !!(init_nondet_~i~0 < 10); 1646#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1641#L7-1 havoc init_nondet_#t~nondet1; 1642#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1689#L6-4 assume true; 1690#L6-1 assume !!(init_nondet_~i~0 < 10); 1718#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1717#L7-1 havoc init_nondet_#t~nondet1; 1716#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1715#L6-4 assume true; 1714#L6-1 assume !!(init_nondet_~i~0 < 10); 1713#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1712#L7-1 havoc init_nondet_#t~nondet1; 1711#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1710#L6-4 assume true; 1709#L6-1 assume !!(init_nondet_~i~0 < 10); 1708#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1707#L7-1 havoc init_nondet_#t~nondet1; 1706#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1705#L6-4 assume true; 1704#L6-1 assume !!(init_nondet_~i~0 < 10); 1703#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1702#L7-1 havoc init_nondet_#t~nondet1; 1701#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1700#L6-4 assume true; 1696#L6-1 assume !!(init_nondet_~i~0 < 10); 1699#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1698#L7-1 havoc init_nondet_#t~nondet1; 1697#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1695#L6-4 assume true; 1672#L6-1 assume !(init_nondet_~i~0 < 10); 1673#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 1693#L17-4 assume true; 1675#L17-1 [2018-11-10 08:04:28,353 INFO L795 eck$LassoCheckResult]: Loop: 1675#L17-1 assume !!(rangesum_~i~1 < 10); 1650#L18 assume rangesum_~i~1 > 5; 1651#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 1680#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 1681#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1691#L17-4 assume true; 1675#L17-1 [2018-11-10 08:04:28,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1234433462, now seen corresponding path program 6 times [2018-11-10 08:04:28,354 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:28,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:28,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:28,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:28,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:28,405 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:28,423 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 08:04:28,465 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 08:04:28,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:28,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:28,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:28,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-10 08:04:28,506 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:28,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 6 times [2018-11-10 08:04:28,506 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:28,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:28,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:28,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:28,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 08:04:28,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-10 08:04:28,540 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. cyclomatic complexity: 17 Second operand 10 states. [2018-11-10 08:04:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:28,564 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2018-11-10 08:04:28,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 08:04:28,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 104 transitions. [2018-11-10 08:04:28,566 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:28,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 103 transitions. [2018-11-10 08:04:28,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:28,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 08:04:28,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 103 transitions. [2018-11-10 08:04:28,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:28,567 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-11-10 08:04:28,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 103 transitions. [2018-11-10 08:04:28,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 88. [2018-11-10 08:04:28,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 08:04:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-11-10 08:04:28,569 INFO L728 BuchiCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-11-10 08:04:28,569 INFO L608 BuchiCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-11-10 08:04:28,569 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 08:04:28,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 99 transitions. [2018-11-10 08:04:28,570 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:28,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:28,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:28,571 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2018-11-10 08:04:28,571 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:28,571 INFO L793 eck$LassoCheckResult]: Stem: 1981#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1952#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 1953#L6-4 assume true; 1983#L6-1 assume !!(init_nondet_~i~0 < 10); 2017#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2016#L7-1 havoc init_nondet_#t~nondet1; 2015#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1984#L6-4 assume true; 1968#L6-1 assume !!(init_nondet_~i~0 < 10); 1940#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1935#L7-1 havoc init_nondet_#t~nondet1; 1936#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1987#L6-4 assume true; 2014#L6-1 assume !!(init_nondet_~i~0 < 10); 2013#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2012#L7-1 havoc init_nondet_#t~nondet1; 2011#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2010#L6-4 assume true; 2009#L6-1 assume !!(init_nondet_~i~0 < 10); 2008#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2007#L7-1 havoc init_nondet_#t~nondet1; 2006#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2005#L6-4 assume true; 2004#L6-1 assume !!(init_nondet_~i~0 < 10); 2003#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2002#L7-1 havoc init_nondet_#t~nondet1; 2001#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2000#L6-4 assume true; 1999#L6-1 assume !!(init_nondet_~i~0 < 10); 1998#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1997#L7-1 havoc init_nondet_#t~nondet1; 1996#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1995#L6-4 assume true; 1991#L6-1 assume !!(init_nondet_~i~0 < 10); 1994#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 1993#L7-1 havoc init_nondet_#t~nondet1; 1992#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 1990#L6-4 assume true; 1966#L6-1 assume !(init_nondet_~i~0 < 10); 1967#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 1988#L17-4 assume true; 1969#L17-1 [2018-11-10 08:04:28,571 INFO L795 eck$LassoCheckResult]: Loop: 1969#L17-1 assume !!(rangesum_~i~1 < 10); 1944#L18 assume rangesum_~i~1 > 5; 1945#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 1974#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 1975#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 1985#L17-4 assume true; 1969#L17-1 [2018-11-10 08:04:28,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1225611181, now seen corresponding path program 7 times [2018-11-10 08:04:28,571 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:28,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:28,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:28,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:28,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:28,640 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:28,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:28,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:28,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:28,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-10 08:04:28,706 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:28,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 7 times [2018-11-10 08:04:28,706 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:28,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:28,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:28,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 08:04:28,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:04:28,742 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. cyclomatic complexity: 17 Second operand 11 states. [2018-11-10 08:04:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:28,768 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2018-11-10 08:04:28,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 08:04:28,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 109 transitions. [2018-11-10 08:04:28,770 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:28,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 97 states and 108 transitions. [2018-11-10 08:04:28,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:28,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 08:04:28,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 108 transitions. [2018-11-10 08:04:28,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:28,771 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-11-10 08:04:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 108 transitions. [2018-11-10 08:04:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-11-10 08:04:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-10 08:04:28,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-11-10 08:04:28,773 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-10 08:04:28,774 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-10 08:04:28,774 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 08:04:28,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 104 transitions. [2018-11-10 08:04:28,774 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:28,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:28,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:28,775 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-11-10 08:04:28,775 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:28,775 INFO L793 eck$LassoCheckResult]: Stem: 2301#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 2273#L6-4 assume true; 2288#L6-1 assume !!(init_nondet_~i~0 < 10); 2260#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2255#L7-1 havoc init_nondet_#t~nondet1; 2256#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2303#L6-4 assume true; 2304#L6-1 assume !!(init_nondet_~i~0 < 10); 2342#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2341#L7-1 havoc init_nondet_#t~nondet1; 2340#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2339#L6-4 assume true; 2338#L6-1 assume !!(init_nondet_~i~0 < 10); 2337#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2336#L7-1 havoc init_nondet_#t~nondet1; 2335#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2334#L6-4 assume true; 2333#L6-1 assume !!(init_nondet_~i~0 < 10); 2332#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2331#L7-1 havoc init_nondet_#t~nondet1; 2330#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2329#L6-4 assume true; 2328#L6-1 assume !!(init_nondet_~i~0 < 10); 2327#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2326#L7-1 havoc init_nondet_#t~nondet1; 2325#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2324#L6-4 assume true; 2323#L6-1 assume !!(init_nondet_~i~0 < 10); 2322#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2321#L7-1 havoc init_nondet_#t~nondet1; 2320#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2319#L6-4 assume true; 2318#L6-1 assume !!(init_nondet_~i~0 < 10); 2317#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2316#L7-1 havoc init_nondet_#t~nondet1; 2315#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2314#L6-4 assume true; 2310#L6-1 assume !!(init_nondet_~i~0 < 10); 2313#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2312#L7-1 havoc init_nondet_#t~nondet1; 2311#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2309#L6-4 assume true; 2286#L6-1 assume !(init_nondet_~i~0 < 10); 2287#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 2307#L17-4 assume true; 2289#L17-1 [2018-11-10 08:04:28,776 INFO L795 eck$LassoCheckResult]: Loop: 2289#L17-1 assume !!(rangesum_~i~1 < 10); 2264#L18 assume rangesum_~i~1 > 5; 2265#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 2294#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 2295#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2305#L17-4 assume true; 2289#L17-1 [2018-11-10 08:04:28,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1092874282, now seen corresponding path program 8 times [2018-11-10 08:04:28,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:28,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:28,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:28,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:28,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:28,848 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:28,861 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 08:04:28,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 08:04:28,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:28,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:28,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:28,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-10 08:04:28,919 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:28,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:28,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 8 times [2018-11-10 08:04:28,920 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:28,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:28,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:28,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:28,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 08:04:28,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:04:28,964 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. cyclomatic complexity: 17 Second operand 12 states. [2018-11-10 08:04:29,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:29,004 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2018-11-10 08:04:29,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 08:04:29,004 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 114 transitions. [2018-11-10 08:04:29,005 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:29,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 102 states and 113 transitions. [2018-11-10 08:04:29,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:29,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 08:04:29,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 113 transitions. [2018-11-10 08:04:29,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:29,006 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 113 transitions. [2018-11-10 08:04:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 113 transitions. [2018-11-10 08:04:29,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2018-11-10 08:04:29,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-10 08:04:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-11-10 08:04:29,008 INFO L728 BuchiCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-11-10 08:04:29,008 INFO L608 BuchiCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-11-10 08:04:29,009 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 08:04:29,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 109 transitions. [2018-11-10 08:04:29,009 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:29,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:29,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:29,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2018-11-10 08:04:29,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:29,010 INFO L793 eck$LassoCheckResult]: Stem: 2647#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2618#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 2619#L6-4 assume true; 2649#L6-1 assume !!(init_nondet_~i~0 < 10); 2693#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2692#L7-1 havoc init_nondet_#t~nondet1; 2691#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2650#L6-4 assume true; 2634#L6-1 assume !!(init_nondet_~i~0 < 10); 2609#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2604#L7-1 havoc init_nondet_#t~nondet1; 2605#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2653#L6-4 assume true; 2690#L6-1 assume !!(init_nondet_~i~0 < 10); 2689#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2688#L7-1 havoc init_nondet_#t~nondet1; 2687#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2686#L6-4 assume true; 2685#L6-1 assume !!(init_nondet_~i~0 < 10); 2684#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2683#L7-1 havoc init_nondet_#t~nondet1; 2682#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2681#L6-4 assume true; 2680#L6-1 assume !!(init_nondet_~i~0 < 10); 2679#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2678#L7-1 havoc init_nondet_#t~nondet1; 2677#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2676#L6-4 assume true; 2675#L6-1 assume !!(init_nondet_~i~0 < 10); 2674#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2673#L7-1 havoc init_nondet_#t~nondet1; 2672#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2671#L6-4 assume true; 2670#L6-1 assume !!(init_nondet_~i~0 < 10); 2669#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2668#L7-1 havoc init_nondet_#t~nondet1; 2667#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2666#L6-4 assume true; 2665#L6-1 assume !!(init_nondet_~i~0 < 10); 2664#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2663#L7-1 havoc init_nondet_#t~nondet1; 2662#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2661#L6-4 assume true; 2657#L6-1 assume !!(init_nondet_~i~0 < 10); 2660#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2659#L7-1 havoc init_nondet_#t~nondet1; 2658#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 2656#L6-4 assume true; 2632#L6-1 assume !(init_nondet_~i~0 < 10); 2633#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 2654#L17-4 assume true; 2636#L17-1 [2018-11-10 08:04:29,010 INFO L795 eck$LassoCheckResult]: Loop: 2636#L17-1 assume !!(rangesum_~i~1 < 10); 2610#L18 assume rangesum_~i~1 > 5; 2611#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 2640#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 2641#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 2651#L17-4 assume true; 2636#L17-1 [2018-11-10 08:04:29,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,011 INFO L82 PathProgramCache]: Analyzing trace with hash 481959373, now seen corresponding path program 9 times [2018-11-10 08:04:29,011 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:29,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:29,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:29,129 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:29,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:04:29,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-10 08:04:29,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:29,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:29,220 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:29,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:29,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-10 08:04:29,238 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:29,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 9 times [2018-11-10 08:04:29,238 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:29,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 08:04:29,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-10 08:04:29,268 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. cyclomatic complexity: 17 Second operand 13 states. [2018-11-10 08:04:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:29,305 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2018-11-10 08:04:29,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 08:04:29,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 116 transitions. [2018-11-10 08:04:29,307 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:29,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 104 states and 115 transitions. [2018-11-10 08:04:29,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2018-11-10 08:04:29,308 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2018-11-10 08:04:29,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 115 transitions. [2018-11-10 08:04:29,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:29,308 INFO L705 BuchiCegarLoop]: Abstraction has 104 states and 115 transitions. [2018-11-10 08:04:29,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 115 transitions. [2018-11-10 08:04:29,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-11-10 08:04:29,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-10 08:04:29,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2018-11-10 08:04:29,310 INFO L728 BuchiCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-11-10 08:04:29,310 INFO L608 BuchiCegarLoop]: Abstraction has 103 states and 114 transitions. [2018-11-10 08:04:29,310 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 08:04:29,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 114 transitions. [2018-11-10 08:04:29,311 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:29,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:29,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:29,312 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2018-11-10 08:04:29,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:29,312 INFO L793 eck$LassoCheckResult]: Stem: 3016#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2987#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 2988#L6-4 assume true; 3018#L6-1 assume !!(init_nondet_~i~0 < 10); 3067#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3066#L7-1 havoc init_nondet_#t~nondet1; 3065#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3019#L6-4 assume true; 3003#L6-1 assume !!(init_nondet_~i~0 < 10); 2975#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 2970#L7-1 havoc init_nondet_#t~nondet1; 2971#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3022#L6-4 assume true; 3064#L6-1 assume !!(init_nondet_~i~0 < 10); 3063#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3062#L7-1 havoc init_nondet_#t~nondet1; 3061#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3060#L6-4 assume true; 3059#L6-1 assume !!(init_nondet_~i~0 < 10); 3058#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3057#L7-1 havoc init_nondet_#t~nondet1; 3056#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3055#L6-4 assume true; 3054#L6-1 assume !!(init_nondet_~i~0 < 10); 3053#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3052#L7-1 havoc init_nondet_#t~nondet1; 3051#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3050#L6-4 assume true; 3049#L6-1 assume !!(init_nondet_~i~0 < 10); 3048#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3047#L7-1 havoc init_nondet_#t~nondet1; 3046#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3045#L6-4 assume true; 3044#L6-1 assume !!(init_nondet_~i~0 < 10); 3043#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3042#L7-1 havoc init_nondet_#t~nondet1; 3041#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3040#L6-4 assume true; 3039#L6-1 assume !!(init_nondet_~i~0 < 10); 3038#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3037#L7-1 havoc init_nondet_#t~nondet1; 3036#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3035#L6-4 assume true; 3034#L6-1 assume !!(init_nondet_~i~0 < 10); 3033#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3032#L7-1 havoc init_nondet_#t~nondet1; 3031#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3030#L6-4 assume true; 3026#L6-1 assume !!(init_nondet_~i~0 < 10); 3029#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3028#L7-1 havoc init_nondet_#t~nondet1; 3027#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3025#L6-4 assume true; 3001#L6-1 assume !(init_nondet_~i~0 < 10); 3002#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 3023#L17-4 assume true; 3004#L17-1 [2018-11-10 08:04:29,312 INFO L795 eck$LassoCheckResult]: Loop: 3004#L17-1 assume !!(rangesum_~i~1 < 10); 2979#L18 assume rangesum_~i~1 > 5; 2980#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 3009#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 3010#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3020#L17-4 assume true; 3004#L17-1 [2018-11-10 08:04:29,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,312 INFO L82 PathProgramCache]: Analyzing trace with hash -283247094, now seen corresponding path program 10 times [2018-11-10 08:04:29,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:29,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 10 times [2018-11-10 08:04:29,334 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:29,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,339 INFO L82 PathProgramCache]: Analyzing trace with hash 380724448, now seen corresponding path program 1 times [2018-11-10 08:04:29,339 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:29,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:29,364 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:29,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:29,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:04:29,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:04:29,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:04:29,407 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-10 08:04:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:29,433 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2018-11-10 08:04:29,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:04:29,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 126 transitions. [2018-11-10 08:04:29,435 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:29,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 114 states and 124 transitions. [2018-11-10 08:04:29,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-10 08:04:29,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-10 08:04:29,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 124 transitions. [2018-11-10 08:04:29,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:29,436 INFO L705 BuchiCegarLoop]: Abstraction has 114 states and 124 transitions. [2018-11-10 08:04:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 124 transitions. [2018-11-10 08:04:29,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-11-10 08:04:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-10 08:04:29,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-11-10 08:04:29,438 INFO L728 BuchiCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-11-10 08:04:29,438 INFO L608 BuchiCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-11-10 08:04:29,438 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 08:04:29,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 121 transitions. [2018-11-10 08:04:29,439 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:29,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:29,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:29,440 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:29,440 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:29,440 INFO L793 eck$LassoCheckResult]: Stem: 3246#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3213#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 3214#L6-4 assume true; 3230#L6-1 assume !!(init_nondet_~i~0 < 10); 3201#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3196#L7-1 havoc init_nondet_#t~nondet1; 3197#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3248#L6-4 assume true; 3249#L6-1 assume !!(init_nondet_~i~0 < 10); 3302#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3301#L7-1 havoc init_nondet_#t~nondet1; 3300#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3299#L6-4 assume true; 3298#L6-1 assume !!(init_nondet_~i~0 < 10); 3297#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3296#L7-1 havoc init_nondet_#t~nondet1; 3295#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3294#L6-4 assume true; 3293#L6-1 assume !!(init_nondet_~i~0 < 10); 3292#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3291#L7-1 havoc init_nondet_#t~nondet1; 3290#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3289#L6-4 assume true; 3288#L6-1 assume !!(init_nondet_~i~0 < 10); 3287#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3286#L7-1 havoc init_nondet_#t~nondet1; 3285#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3284#L6-4 assume true; 3283#L6-1 assume !!(init_nondet_~i~0 < 10); 3282#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3281#L7-1 havoc init_nondet_#t~nondet1; 3280#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3279#L6-4 assume true; 3278#L6-1 assume !!(init_nondet_~i~0 < 10); 3277#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3276#L7-1 havoc init_nondet_#t~nondet1; 3275#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3274#L6-4 assume true; 3273#L6-1 assume !!(init_nondet_~i~0 < 10); 3272#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3271#L7-1 havoc init_nondet_#t~nondet1; 3270#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3269#L6-4 assume true; 3268#L6-1 assume !!(init_nondet_~i~0 < 10); 3267#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3266#L7-1 havoc init_nondet_#t~nondet1; 3265#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3264#L6-4 assume true; 3259#L6-1 assume !!(init_nondet_~i~0 < 10); 3263#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3262#L7-1 havoc init_nondet_#t~nondet1; 3261#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3258#L6-4 assume true; 3228#L6-1 assume !(init_nondet_~i~0 < 10); 3229#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 3253#L17-4 assume true; 3257#L17-1 assume !!(rangesum_~i~1 < 10); 3207#L18 assume !(rangesum_~i~1 > 5); 3208#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3260#L17-4 assume true; 3231#L17-1 [2018-11-10 08:04:29,440 INFO L795 eck$LassoCheckResult]: Loop: 3231#L17-1 assume !!(rangesum_~i~1 < 10); 3205#L18 assume rangesum_~i~1 > 5; 3206#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 3238#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 3239#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3250#L17-4 assume true; 3231#L17-1 [2018-11-10 08:04:29,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,440 INFO L82 PathProgramCache]: Analyzing trace with hash 344533859, now seen corresponding path program 1 times [2018-11-10 08:04:29,441 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:29,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 11 times [2018-11-10 08:04:29,462 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:29,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,467 INFO L82 PathProgramCache]: Analyzing trace with hash 475097977, now seen corresponding path program 1 times [2018-11-10 08:04:29,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,468 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:29,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:29,517 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:29,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:29,518 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:29,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:29,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:29,560 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:29,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:29,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 08:04:29,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:04:29,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:04:29,603 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-10 08:04:29,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:29,632 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2018-11-10 08:04:29,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:04:29,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 138 transitions. [2018-11-10 08:04:29,633 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:29,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 126 states and 136 transitions. [2018-11-10 08:04:29,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-10 08:04:29,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-10 08:04:29,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 136 transitions. [2018-11-10 08:04:29,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:29,635 INFO L705 BuchiCegarLoop]: Abstraction has 126 states and 136 transitions. [2018-11-10 08:04:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 136 transitions. [2018-11-10 08:04:29,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2018-11-10 08:04:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 08:04:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-11-10 08:04:29,637 INFO L728 BuchiCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-11-10 08:04:29,637 INFO L608 BuchiCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-11-10 08:04:29,637 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 08:04:29,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 133 transitions. [2018-11-10 08:04:29,638 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:29,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:29,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:29,642 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 3, 2, 2, 2, 1, 1, 1, 1] [2018-11-10 08:04:29,642 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:29,643 INFO L793 eck$LassoCheckResult]: Stem: 3693#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3658#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 3659#L6-4 assume true; 3695#L6-1 assume !!(init_nondet_~i~0 < 10); 3758#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3643#L7-1 havoc init_nondet_#t~nondet1; 3644#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3696#L6-4 assume true; 3678#L6-1 assume !!(init_nondet_~i~0 < 10); 3648#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3649#L7-1 havoc init_nondet_#t~nondet1; 3699#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3700#L6-4 assume true; 3757#L6-1 assume !!(init_nondet_~i~0 < 10); 3756#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3755#L7-1 havoc init_nondet_#t~nondet1; 3754#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3753#L6-4 assume true; 3752#L6-1 assume !!(init_nondet_~i~0 < 10); 3751#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3750#L7-1 havoc init_nondet_#t~nondet1; 3749#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3748#L6-4 assume true; 3747#L6-1 assume !!(init_nondet_~i~0 < 10); 3746#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3745#L7-1 havoc init_nondet_#t~nondet1; 3744#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3743#L6-4 assume true; 3742#L6-1 assume !!(init_nondet_~i~0 < 10); 3741#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3740#L7-1 havoc init_nondet_#t~nondet1; 3739#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3738#L6-4 assume true; 3737#L6-1 assume !!(init_nondet_~i~0 < 10); 3736#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3735#L7-1 havoc init_nondet_#t~nondet1; 3734#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3733#L6-4 assume true; 3732#L6-1 assume !!(init_nondet_~i~0 < 10); 3731#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3730#L7-1 havoc init_nondet_#t~nondet1; 3729#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3727#L6-4 assume true; 3726#L6-1 assume !!(init_nondet_~i~0 < 10); 3725#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3721#L7-1 havoc init_nondet_#t~nondet1; 3718#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3717#L6-4 assume true; 3712#L6-1 assume !!(init_nondet_~i~0 < 10); 3716#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 3715#L7-1 havoc init_nondet_#t~nondet1; 3714#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 3711#L6-4 assume true; 3676#L6-1 assume !(init_nondet_~i~0 < 10); 3677#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 3703#L17-4 assume true; 3724#L17-1 assume !!(rangesum_~i~1 < 10); 3722#L18 assume !(rangesum_~i~1 > 5); 3719#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3698#L17-4 assume true; 3682#L17-1 assume !!(rangesum_~i~1 < 10); 3652#L18 assume !(rangesum_~i~1 > 5); 3653#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3728#L17-4 assume true; 3680#L17-1 [2018-11-10 08:04:29,643 INFO L795 eck$LassoCheckResult]: Loop: 3680#L17-1 assume !!(rangesum_~i~1 < 10); 3650#L18 assume rangesum_~i~1 > 5; 3651#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 3685#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 3686#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 3697#L17-4 assume true; 3680#L17-1 [2018-11-10 08:04:29,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,643 INFO L82 PathProgramCache]: Analyzing trace with hash 192676924, now seen corresponding path program 2 times [2018-11-10 08:04:29,643 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:29,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 12 times [2018-11-10 08:04:29,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:29,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1360364142, now seen corresponding path program 2 times [2018-11-10 08:04:29,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:29,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:29,738 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:29,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:29,738 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:29,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 08:04:29,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 08:04:29,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:29,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:29,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:29,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 08:04:29,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:04:29,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:04:29,853 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. cyclomatic complexity: 16 Second operand 6 states. [2018-11-10 08:04:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:29,903 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2018-11-10 08:04:29,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:04:29,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 150 transitions. [2018-11-10 08:04:29,905 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:29,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 138 states and 148 transitions. [2018-11-10 08:04:29,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-10 08:04:29,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 08:04:29,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 148 transitions. [2018-11-10 08:04:29,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:29,907 INFO L705 BuchiCegarLoop]: Abstraction has 138 states and 148 transitions. [2018-11-10 08:04:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 148 transitions. [2018-11-10 08:04:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2018-11-10 08:04:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-11-10 08:04:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2018-11-10 08:04:29,909 INFO L728 BuchiCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-11-10 08:04:29,909 INFO L608 BuchiCegarLoop]: Abstraction has 135 states and 145 transitions. [2018-11-10 08:04:29,910 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 08:04:29,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 145 transitions. [2018-11-10 08:04:29,910 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:29,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:29,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:29,911 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 4, 3, 3, 3, 1, 1, 1, 1] [2018-11-10 08:04:29,911 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:29,912 INFO L793 eck$LassoCheckResult]: Stem: 4176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 4140#L6-4 assume true; 4159#L6-1 assume !!(init_nondet_~i~0 < 10); 4160#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4121#L7-1 havoc init_nondet_#t~nondet1; 4122#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4178#L6-4 assume true; 4179#L6-1 assume !!(init_nondet_~i~0 < 10); 4126#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4127#L7-1 havoc init_nondet_#t~nondet1; 4251#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4250#L6-4 assume true; 4249#L6-1 assume !!(init_nondet_~i~0 < 10); 4248#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4247#L7-1 havoc init_nondet_#t~nondet1; 4246#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4245#L6-4 assume true; 4244#L6-1 assume !!(init_nondet_~i~0 < 10); 4243#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4242#L7-1 havoc init_nondet_#t~nondet1; 4241#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4240#L6-4 assume true; 4239#L6-1 assume !!(init_nondet_~i~0 < 10); 4238#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4237#L7-1 havoc init_nondet_#t~nondet1; 4236#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4234#L6-4 assume true; 4232#L6-1 assume !!(init_nondet_~i~0 < 10); 4230#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4228#L7-1 havoc init_nondet_#t~nondet1; 4226#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4225#L6-4 assume true; 4223#L6-1 assume !!(init_nondet_~i~0 < 10); 4222#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4221#L7-1 havoc init_nondet_#t~nondet1; 4219#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4217#L6-4 assume true; 4216#L6-1 assume !!(init_nondet_~i~0 < 10); 4213#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4212#L7-1 havoc init_nondet_#t~nondet1; 4210#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4206#L6-4 assume true; 4205#L6-1 assume !!(init_nondet_~i~0 < 10); 4204#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4202#L7-1 havoc init_nondet_#t~nondet1; 4201#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4200#L6-4 assume true; 4195#L6-1 assume !!(init_nondet_~i~0 < 10); 4199#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4198#L7-1 havoc init_nondet_#t~nondet1; 4197#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4194#L6-4 assume true; 4157#L6-1 assume !(init_nondet_~i~0 < 10); 4158#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 4180#L17-4 assume true; 4163#L17-1 assume !!(rangesum_~i~1 < 10); 4133#L18 assume !(rangesum_~i~1 > 5); 4134#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4181#L17-4 assume true; 4182#L17-1 assume !!(rangesum_~i~1 < 10); 4235#L18 assume !(rangesum_~i~1 > 5); 4233#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4231#L17-4 assume true; 4229#L17-1 assume !!(rangesum_~i~1 < 10); 4227#L18 assume !(rangesum_~i~1 > 5); 4185#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4196#L17-4 assume true; 4161#L17-1 [2018-11-10 08:04:29,912 INFO L795 eck$LassoCheckResult]: Loop: 4161#L17-1 assume !!(rangesum_~i~1 < 10); 4131#L18 assume rangesum_~i~1 > 5; 4132#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 4167#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 4168#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4183#L17-4 assume true; 4161#L17-1 [2018-11-10 08:04:29,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,912 INFO L82 PathProgramCache]: Analyzing trace with hash 691325077, now seen corresponding path program 3 times [2018-11-10 08:04:29,912 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:29,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 13 times [2018-11-10 08:04:29,937 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:29,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:29,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:29,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1275779883, now seen corresponding path program 3 times [2018-11-10 08:04:29,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:29,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:29,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:29,990 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:29,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:29,991 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:29,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:04:30,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-10 08:04:30,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:30,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:30,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:30,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-10 08:04:30,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:04:30,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:04:30,128 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-10 08:04:30,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:30,176 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2018-11-10 08:04:30,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:04:30,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 162 transitions. [2018-11-10 08:04:30,178 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:30,178 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 150 states and 160 transitions. [2018-11-10 08:04:30,178 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2018-11-10 08:04:30,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2018-11-10 08:04:30,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 160 transitions. [2018-11-10 08:04:30,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:30,179 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 160 transitions. [2018-11-10 08:04:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 160 transitions. [2018-11-10 08:04:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-11-10 08:04:30,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-10 08:04:30,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-11-10 08:04:30,182 INFO L728 BuchiCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-11-10 08:04:30,182 INFO L608 BuchiCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-11-10 08:04:30,182 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 08:04:30,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 147 states and 157 transitions. [2018-11-10 08:04:30,183 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:30,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:30,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:30,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 5, 4, 4, 4, 1, 1, 1, 1] [2018-11-10 08:04:30,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:30,184 INFO L793 eck$LassoCheckResult]: Stem: 4691#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4656#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 4657#L6-4 assume true; 4674#L6-1 assume !!(init_nondet_~i~0 < 10); 4644#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4639#L7-1 havoc init_nondet_#t~nondet1; 4640#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4693#L6-4 assume true; 4694#L6-1 assume !!(init_nondet_~i~0 < 10); 4781#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4780#L7-1 havoc init_nondet_#t~nondet1; 4779#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4778#L6-4 assume true; 4777#L6-1 assume !!(init_nondet_~i~0 < 10); 4776#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4775#L7-1 havoc init_nondet_#t~nondet1; 4773#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4771#L6-4 assume true; 4769#L6-1 assume !!(init_nondet_~i~0 < 10); 4767#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4765#L7-1 havoc init_nondet_#t~nondet1; 4763#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4761#L6-4 assume true; 4759#L6-1 assume !!(init_nondet_~i~0 < 10); 4757#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4755#L7-1 havoc init_nondet_#t~nondet1; 4754#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4753#L6-4 assume true; 4752#L6-1 assume !!(init_nondet_~i~0 < 10); 4750#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4748#L7-1 havoc init_nondet_#t~nondet1; 4746#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4744#L6-4 assume true; 4742#L6-1 assume !!(init_nondet_~i~0 < 10); 4740#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4738#L7-1 havoc init_nondet_#t~nondet1; 4736#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4733#L6-4 assume true; 4732#L6-1 assume !!(init_nondet_~i~0 < 10); 4730#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4728#L7-1 havoc init_nondet_#t~nondet1; 4726#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4724#L6-4 assume true; 4722#L6-1 assume !!(init_nondet_~i~0 < 10); 4720#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4718#L7-1 havoc init_nondet_#t~nondet1; 4717#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4716#L6-4 assume true; 4711#L6-1 assume !!(init_nondet_~i~0 < 10); 4715#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 4714#L7-1 havoc init_nondet_#t~nondet1; 4713#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 4710#L6-4 assume true; 4672#L6-1 assume !(init_nondet_~i~0 < 10); 4673#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 4695#L17-4 assume true; 4696#L17-1 assume !!(rangesum_~i~1 < 10); 4650#L18 assume !(rangesum_~i~1 > 5); 4651#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4697#L17-4 assume true; 4677#L17-1 assume !!(rangesum_~i~1 < 10); 4678#L18 assume !(rangesum_~i~1 > 5); 4751#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4749#L17-4 assume true; 4747#L17-1 assume !!(rangesum_~i~1 < 10); 4745#L18 assume !(rangesum_~i~1 > 5); 4743#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4741#L17-4 assume true; 4739#L17-1 assume !!(rangesum_~i~1 < 10); 4737#L18 assume !(rangesum_~i~1 > 5); 4701#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4712#L17-4 assume true; 4675#L17-1 [2018-11-10 08:04:30,184 INFO L795 eck$LassoCheckResult]: Loop: 4675#L17-1 assume !!(rangesum_~i~1 < 10); 4648#L18 assume rangesum_~i~1 > 5; 4649#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 4683#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 4684#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 4699#L17-4 assume true; 4675#L17-1 [2018-11-10 08:04:30,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:30,184 INFO L82 PathProgramCache]: Analyzing trace with hash 2043787374, now seen corresponding path program 4 times [2018-11-10 08:04:30,184 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:30,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:30,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:30,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 14 times [2018-11-10 08:04:30,204 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:30,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2145336252, now seen corresponding path program 4 times [2018-11-10 08:04:30,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:30,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:30,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:30,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:30,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:30,253 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:30,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:04:30,287 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:04:30,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:30,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:30,299 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:30,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:30,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-10 08:04:30,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 08:04:30,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-10 08:04:30,342 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. cyclomatic complexity: 16 Second operand 8 states. [2018-11-10 08:04:30,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:30,401 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2018-11-10 08:04:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:04:30,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 174 transitions. [2018-11-10 08:04:30,403 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:30,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 162 states and 172 transitions. [2018-11-10 08:04:30,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2018-11-10 08:04:30,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2018-11-10 08:04:30,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 172 transitions. [2018-11-10 08:04:30,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:30,405 INFO L705 BuchiCegarLoop]: Abstraction has 162 states and 172 transitions. [2018-11-10 08:04:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 172 transitions. [2018-11-10 08:04:30,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2018-11-10 08:04:30,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-10 08:04:30,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2018-11-10 08:04:30,408 INFO L728 BuchiCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-11-10 08:04:30,408 INFO L608 BuchiCegarLoop]: Abstraction has 159 states and 169 transitions. [2018-11-10 08:04:30,408 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 08:04:30,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 169 transitions. [2018-11-10 08:04:30,409 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:30,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:30,409 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:30,409 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 6, 5, 5, 5, 1, 1, 1, 1] [2018-11-10 08:04:30,409 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:30,410 INFO L793 eck$LassoCheckResult]: Stem: 5245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 5212#L6-4 assume true; 5229#L6-1 assume !!(init_nondet_~i~0 < 10); 5201#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5196#L7-1 havoc init_nondet_#t~nondet1; 5197#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5247#L6-4 assume true; 5248#L6-1 assume !!(init_nondet_~i~0 < 10); 5308#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5307#L7-1 havoc init_nondet_#t~nondet1; 5306#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5305#L6-4 assume true; 5304#L6-1 assume !!(init_nondet_~i~0 < 10); 5303#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5302#L7-1 havoc init_nondet_#t~nondet1; 5301#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5300#L6-4 assume true; 5299#L6-1 assume !!(init_nondet_~i~0 < 10); 5298#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5297#L7-1 havoc init_nondet_#t~nondet1; 5296#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5295#L6-4 assume true; 5294#L6-1 assume !!(init_nondet_~i~0 < 10); 5293#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5292#L7-1 havoc init_nondet_#t~nondet1; 5291#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5290#L6-4 assume true; 5289#L6-1 assume !!(init_nondet_~i~0 < 10); 5288#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5287#L7-1 havoc init_nondet_#t~nondet1; 5286#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5285#L6-4 assume true; 5284#L6-1 assume !!(init_nondet_~i~0 < 10); 5283#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5282#L7-1 havoc init_nondet_#t~nondet1; 5281#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5280#L6-4 assume true; 5279#L6-1 assume !!(init_nondet_~i~0 < 10); 5278#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5277#L7-1 havoc init_nondet_#t~nondet1; 5276#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5275#L6-4 assume true; 5274#L6-1 assume !!(init_nondet_~i~0 < 10); 5273#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5272#L7-1 havoc init_nondet_#t~nondet1; 5271#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5270#L6-4 assume true; 5265#L6-1 assume !!(init_nondet_~i~0 < 10); 5269#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5267#L7-1 havoc init_nondet_#t~nondet1; 5266#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5264#L6-4 assume true; 5227#L6-1 assume !(init_nondet_~i~0 < 10); 5228#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 5249#L17-4 assume true; 5234#L17-1 assume !!(rangesum_~i~1 < 10); 5205#L18 assume !(rangesum_~i~1 > 5); 5206#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5250#L17-4 assume true; 5251#L17-1 assume !!(rangesum_~i~1 < 10); 5347#L18 assume !(rangesum_~i~1 > 5); 5345#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5343#L17-4 assume true; 5341#L17-1 assume !!(rangesum_~i~1 < 10); 5339#L18 assume !(rangesum_~i~1 > 5); 5337#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5335#L17-4 assume true; 5333#L17-1 assume !!(rangesum_~i~1 < 10); 5331#L18 assume !(rangesum_~i~1 > 5); 5329#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5327#L17-4 assume true; 5324#L17-1 assume !!(rangesum_~i~1 < 10); 5321#L18 assume !(rangesum_~i~1 > 5); 5255#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5268#L17-4 assume true; 5232#L17-1 [2018-11-10 08:04:30,410 INFO L795 eck$LassoCheckResult]: Loop: 5232#L17-1 assume !!(rangesum_~i~1 < 10); 5203#L18 assume rangesum_~i~1 > 5; 5204#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 5237#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 5238#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5253#L17-4 assume true; 5232#L17-1 [2018-11-10 08:04:30,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1347490759, now seen corresponding path program 5 times [2018-11-10 08:04:30,410 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:30,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:30,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:30,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 15 times [2018-11-10 08:04:30,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:30,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:30,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:30,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1987737821, now seen corresponding path program 5 times [2018-11-10 08:04:30,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:30,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:30,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:30,494 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:30,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:30,495 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:30,503 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 08:04:30,536 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-10 08:04:30,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:30,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 11 proven. 55 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-11-10 08:04:30,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:04:30,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-10 08:04:30,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 08:04:30,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-10 08:04:30,586 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. cyclomatic complexity: 16 Second operand 9 states. [2018-11-10 08:04:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:30,649 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2018-11-10 08:04:30,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:04:30,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 185 transitions. [2018-11-10 08:04:30,650 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 26 [2018-11-10 08:04:30,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 173 states and 183 transitions. [2018-11-10 08:04:30,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2018-11-10 08:04:30,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2018-11-10 08:04:30,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 173 states and 183 transitions. [2018-11-10 08:04:30,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:30,651 INFO L705 BuchiCegarLoop]: Abstraction has 173 states and 183 transitions. [2018-11-10 08:04:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 183 transitions. [2018-11-10 08:04:30,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-11-10 08:04:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-11-10 08:04:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 181 transitions. [2018-11-10 08:04:30,653 INFO L728 BuchiCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-11-10 08:04:30,653 INFO L608 BuchiCegarLoop]: Abstraction has 171 states and 181 transitions. [2018-11-10 08:04:30,653 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 08:04:30,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 171 states and 181 transitions. [2018-11-10 08:04:30,654 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 24 [2018-11-10 08:04:30,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:30,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:30,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 7, 6, 6, 6, 1, 1, 1, 1] [2018-11-10 08:04:30,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:30,655 INFO L793 eck$LassoCheckResult]: Stem: 5836#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5803#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 5804#L6-4 assume true; 5820#L6-1 assume !!(init_nondet_~i~0 < 10); 5790#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5791#L7-1 havoc init_nondet_#t~nondet1; 5843#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5838#L6-4 assume true; 5839#L6-1 assume !!(init_nondet_~i~0 < 10); 5920#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5785#L7-1 havoc init_nondet_#t~nondet1; 5786#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5914#L6-4 assume true; 5913#L6-1 assume !!(init_nondet_~i~0 < 10); 5912#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5911#L7-1 havoc init_nondet_#t~nondet1; 5910#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5909#L6-4 assume true; 5908#L6-1 assume !!(init_nondet_~i~0 < 10); 5907#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5906#L7-1 havoc init_nondet_#t~nondet1; 5905#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5904#L6-4 assume true; 5903#L6-1 assume !!(init_nondet_~i~0 < 10); 5902#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5901#L7-1 havoc init_nondet_#t~nondet1; 5900#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5899#L6-4 assume true; 5898#L6-1 assume !!(init_nondet_~i~0 < 10); 5897#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5896#L7-1 havoc init_nondet_#t~nondet1; 5895#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5894#L6-4 assume true; 5892#L6-1 assume !!(init_nondet_~i~0 < 10); 5890#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5888#L7-1 havoc init_nondet_#t~nondet1; 5886#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5884#L6-4 assume true; 5882#L6-1 assume !!(init_nondet_~i~0 < 10); 5880#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5878#L7-1 havoc init_nondet_#t~nondet1; 5876#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5874#L6-4 assume true; 5872#L6-1 assume !!(init_nondet_~i~0 < 10); 5870#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5868#L7-1 havoc init_nondet_#t~nondet1; 5866#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5864#L6-4 assume true; 5857#L6-1 assume !!(init_nondet_~i~0 < 10); 5861#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 5860#L7-1 havoc init_nondet_#t~nondet1; 5859#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 5856#L6-4 assume true; 5818#L6-1 assume !(init_nondet_~i~0 < 10); 5819#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 5840#L17-4 assume true; 5823#L17-1 assume !!(rangesum_~i~1 < 10); 5797#L18 assume !(rangesum_~i~1 > 5); 5798#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5841#L17-4 assume true; 5842#L17-1 assume !!(rangesum_~i~1 < 10); 5893#L18 assume !(rangesum_~i~1 > 5); 5891#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5889#L17-4 assume true; 5887#L17-1 assume !!(rangesum_~i~1 < 10); 5885#L18 assume !(rangesum_~i~1 > 5); 5883#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5881#L17-4 assume true; 5879#L17-1 assume !!(rangesum_~i~1 < 10); 5877#L18 assume !(rangesum_~i~1 > 5); 5875#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5873#L17-4 assume true; 5871#L17-1 assume !!(rangesum_~i~1 < 10); 5869#L18 assume !(rangesum_~i~1 > 5); 5867#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5865#L17-4 assume true; 5863#L17-1 assume !!(rangesum_~i~1 < 10); 5862#L18 assume !(rangesum_~i~1 > 5); 5847#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5858#L17-4 assume true; 5821#L17-1 [2018-11-10 08:04:30,655 INFO L795 eck$LassoCheckResult]: Loop: 5821#L17-1 assume !!(rangesum_~i~1 < 10); 5795#L18 assume rangesum_~i~1 > 5; 5796#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 5828#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 5829#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 5844#L17-4 assume true; 5821#L17-1 [2018-11-10 08:04:30,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash -695133536, now seen corresponding path program 6 times [2018-11-10 08:04:30,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:30,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:30,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:30,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:30,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1718735255, now seen corresponding path program 16 times [2018-11-10 08:04:30,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:30,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:30,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:30,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:30,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1991886602, now seen corresponding path program 6 times [2018-11-10 08:04:30,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:30,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:30,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:33,535 WARN L179 SmtUtils]: Spent 2.80 s on a formula simplification. DAG size of input: 255 DAG size of output: 194 [2018-11-10 08:04:33,844 WARN L179 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-10 08:04:33,846 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:04:33,846 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:04:33,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:04:33,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:04:33,846 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:04:33,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:04:33,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:04:33,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:04:33,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration18_Lasso [2018-11-10 08:04:33,846 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:04:33,846 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:04:33,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:33,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,304 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:04:34,304 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:04:34,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,308 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,310 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,313 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:34,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:34,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,319 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,321 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,322 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:34,322 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:34,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:34,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:34,328 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,331 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,332 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,334 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,337 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:34,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:34,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,342 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:34,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:34,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,345 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 08:04:34,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,346 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 08:04:34,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:34,351 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:34,353 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:34,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:34,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:34,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:04:34,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:04:34,371 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:04:34,388 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 08:04:34,388 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-10 08:04:34,388 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:04:34,389 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 08:04:34,389 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:04:34,389 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 19 Supporting invariants [] [2018-11-10 08:04:34,475 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-11-10 08:04:34,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:34,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:34,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:34,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:34,592 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 [2018-11-10 08:04:34,592 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 171 states and 181 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-10 08:04:34,615 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 171 states and 181 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 209 states and 225 transitions. Complement of second has 7 states. [2018-11-10 08:04:34,618 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 [2018-11-10 08:04:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:04:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2018-11-10 08:04:34,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 80 letters. Loop has 6 letters. [2018-11-10 08:04:34,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:34,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 86 letters. Loop has 6 letters. [2018-11-10 08:04:34,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:34,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 28 transitions. Stem has 80 letters. Loop has 12 letters. [2018-11-10 08:04:34,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:34,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 225 transitions. [2018-11-10 08:04:34,623 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 08:04:34,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 174 states and 185 transitions. [2018-11-10 08:04:34,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2018-11-10 08:04:34,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-11-10 08:04:34,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 185 transitions. [2018-11-10 08:04:34,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:34,625 INFO L705 BuchiCegarLoop]: Abstraction has 174 states and 185 transitions. [2018-11-10 08:04:34,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 185 transitions. [2018-11-10 08:04:34,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-11-10 08:04:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-10 08:04:34,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 184 transitions. [2018-11-10 08:04:34,632 INFO L728 BuchiCegarLoop]: Abstraction has 173 states and 184 transitions. [2018-11-10 08:04:34,632 INFO L608 BuchiCegarLoop]: Abstraction has 173 states and 184 transitions. [2018-11-10 08:04:34,632 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 08:04:34,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 173 states and 184 transitions. [2018-11-10 08:04:34,633 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 08:04:34,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:34,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:34,635 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:34,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 08:04:34,636 INFO L793 eck$LassoCheckResult]: Stem: 6514#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6483#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 6484#L6-4 assume true; 6500#L6-1 assume !!(init_nondet_~i~0 < 10); 6475#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 6470#L7-1 havoc init_nondet_#t~nondet1; 6471#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 6517#L6-4 assume true; 6518#L6-1 assume !!(init_nondet_~i~0 < 10); 6596#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 6595#L7-1 havoc init_nondet_#t~nondet1; 6594#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 6593#L6-4 assume true; 6592#L6-1 assume !!(init_nondet_~i~0 < 10); 6591#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 6590#L7-1 havoc init_nondet_#t~nondet1; 6589#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 6588#L6-4 assume true; 6587#L6-1 assume !!(init_nondet_~i~0 < 10); 6586#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 6585#L7-1 havoc init_nondet_#t~nondet1; 6584#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 6583#L6-4 assume true; 6582#L6-1 assume !!(init_nondet_~i~0 < 10); 6581#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 6580#L7-1 havoc init_nondet_#t~nondet1; 6579#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 6578#L6-4 assume true; 6577#L6-1 assume !!(init_nondet_~i~0 < 10); 6575#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 6573#L7-1 havoc init_nondet_#t~nondet1; 6570#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 6569#L6-4 assume true; 6568#L6-1 assume !!(init_nondet_~i~0 < 10); 6567#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 6566#L7-1 havoc init_nondet_#t~nondet1; 6565#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 6564#L6-4 assume true; 6562#L6-1 assume !!(init_nondet_~i~0 < 10); 6560#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 6558#L7-1 havoc init_nondet_#t~nondet1; 6556#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 6554#L6-4 assume true; 6552#L6-1 assume !!(init_nondet_~i~0 < 10); 6550#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 6548#L7-1 havoc init_nondet_#t~nondet1; 6546#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 6544#L6-4 assume true; 6535#L6-1 assume !!(init_nondet_~i~0 < 10); 6541#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 6539#L7-1 havoc init_nondet_#t~nondet1; 6537#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 6534#L6-4 assume true; 6498#L6-1 assume !(init_nondet_~i~0 < 10); 6499#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 6519#L17-4 assume true; 6505#L17-1 assume !!(rangesum_~i~1 < 10); 6477#L18 assume !(rangesum_~i~1 > 5); 6478#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6520#L17-4 assume true; 6521#L17-1 assume !!(rangesum_~i~1 < 10); 6636#L18 assume !(rangesum_~i~1 > 5); 6635#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6634#L17-4 assume true; 6633#L17-1 assume !!(rangesum_~i~1 < 10); 6632#L18 assume !(rangesum_~i~1 > 5); 6631#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6630#L17-4 assume true; 6629#L17-1 assume !!(rangesum_~i~1 < 10); 6628#L18 assume !(rangesum_~i~1 > 5); 6627#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6626#L17-4 assume true; 6625#L17-1 assume !!(rangesum_~i~1 < 10); 6624#L18 assume !(rangesum_~i~1 > 5); 6623#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6622#L17-4 assume true; 6621#L17-1 assume !!(rangesum_~i~1 < 10); 6576#L18 assume !(rangesum_~i~1 > 5); 6574#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6571#L17-4 assume true; 6523#L17-1 assume !(rangesum_~i~1 < 10); 6516#L17-5 assume !(rangesum_~cnt~0 != 0);rangesum_#res := 0; 6497#L26 main_#t~ret4 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 6480#L40 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40 6476#L40-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 6472#L40-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-2 6464#L40-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40-3 6465#L40-4 havoc main_#t~mem6; 6493#L40-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-5 6492#L40-6 assume { :begin_inline_rangesum } true;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; 6473#L17-10 assume true; 6474#L17-7 assume !!(rangesum_~i~1 < 10); 6466#L18-2 assume !(rangesum_~i~1 > 5); 6467#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6479#L17-10 assume true; 6613#L17-7 assume !!(rangesum_~i~1 < 10); 6612#L18-2 assume !(rangesum_~i~1 > 5); 6611#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6610#L17-10 assume true; 6609#L17-7 assume !!(rangesum_~i~1 < 10); 6608#L18-2 assume !(rangesum_~i~1 > 5); 6607#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6606#L17-10 assume true; 6605#L17-7 assume !!(rangesum_~i~1 < 10); 6604#L18-2 assume !(rangesum_~i~1 > 5); 6603#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6602#L17-10 assume true; 6601#L17-7 assume !!(rangesum_~i~1 < 10); 6600#L18-2 assume !(rangesum_~i~1 > 5); 6599#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6598#L17-10 assume true; 6597#L17-7 assume !!(rangesum_~i~1 < 10); 6531#L18-2 assume !(rangesum_~i~1 > 5); 6502#L17-9 [2018-11-10 08:04:34,636 INFO L795 eck$LassoCheckResult]: Loop: 6502#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 6529#L17-10 assume true; 6526#L17-7 assume !!(rangesum_~i~1 < 10); 6527#L18-2 assume !(rangesum_~i~1 > 5); 6502#L17-9 [2018-11-10 08:04:34,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:34,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1280016505, now seen corresponding path program 1 times [2018-11-10 08:04:34,636 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:34,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:34,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:34,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:34,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:34,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2018-11-10 08:04:34,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:34,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:04:34,714 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:34,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash 3126234, now seen corresponding path program 1 times [2018-11-10 08:04:34,714 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:34,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:34,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:34,756 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:04:34,756 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:04:34,756 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:04:34,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:04:34,756 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:04:34,757 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:04:34,757 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:04:34,757 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:04:34,757 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration19_Loop [2018-11-10 08:04:34,757 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:04:34,757 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:04:34,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,787 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:04:34,787 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:04:34,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:04:34,796 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:04:34,800 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:04:34,800 INFO L446 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/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:04:34,832 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:04:34,832 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:04:34,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:04:34,871 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:04:34,951 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:04:34,953 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:04:34,953 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:04:34,953 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:04:34,953 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:04:34,953 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:04:34,953 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:04:34,953 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:04:34,953 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:04:34,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration19_Loop [2018-11-10 08:04:34,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:04:34,953 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:04:34,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:04:34,972 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:04:34,973 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:04:34,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,973 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,974 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:04:34,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:04:34,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:04:34,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:04:34,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:04:34,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:04:34,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:04:34,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:04:34,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:04:34,976 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:04:34,977 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:04:34,977 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:04:34,977 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:04:34,977 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:04:34,977 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:04:34,978 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 9 Supporting invariants [] [2018-11-10 08:04:34,978 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:04:35,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:35,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:35,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:35,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:04:35,037 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 [2018-11-10 08:04:35,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 173 states and 184 transitions. cyclomatic complexity: 17 Second operand 3 states. [2018-11-10 08:04:35,060 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 173 states and 184 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 208 states and 222 transitions. Complement of second has 5 states. [2018-11-10 08:04:35,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-10 08:04:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-10 08:04:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2018-11-10 08:04:35,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 52 transitions. Stem has 113 letters. Loop has 4 letters. [2018-11-10 08:04:35,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:35,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 52 transitions. Stem has 117 letters. Loop has 4 letters. [2018-11-10 08:04:35,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:35,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 52 transitions. Stem has 113 letters. Loop has 8 letters. [2018-11-10 08:04:35,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:04:35,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208 states and 222 transitions. [2018-11-10 08:04:35,065 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 08:04:35,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208 states to 181 states and 193 transitions. [2018-11-10 08:04:35,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-11-10 08:04:35,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2018-11-10 08:04:35,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 193 transitions. [2018-11-10 08:04:35,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:35,066 INFO L705 BuchiCegarLoop]: Abstraction has 181 states and 193 transitions. [2018-11-10 08:04:35,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 193 transitions. [2018-11-10 08:04:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-11-10 08:04:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-10 08:04:35,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 192 transitions. [2018-11-10 08:04:35,071 INFO L728 BuchiCegarLoop]: Abstraction has 180 states and 192 transitions. [2018-11-10 08:04:35,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:04:35,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:04:35,072 INFO L87 Difference]: Start difference. First operand 180 states and 192 transitions. Second operand 4 states. [2018-11-10 08:04:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:35,114 INFO L93 Difference]: Finished difference Result 209 states and 223 transitions. [2018-11-10 08:04:35,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:04:35,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 223 transitions. [2018-11-10 08:04:35,116 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 25 [2018-11-10 08:04:35,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 208 states and 222 transitions. [2018-11-10 08:04:35,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2018-11-10 08:04:35,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2018-11-10 08:04:35,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 222 transitions. [2018-11-10 08:04:35,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:35,117 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 222 transitions. [2018-11-10 08:04:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 222 transitions. [2018-11-10 08:04:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 182. [2018-11-10 08:04:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-10 08:04:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2018-11-10 08:04:35,120 INFO L728 BuchiCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-11-10 08:04:35,120 INFO L608 BuchiCegarLoop]: Abstraction has 182 states and 193 transitions. [2018-11-10 08:04:35,120 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 08:04:35,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 193 transitions. [2018-11-10 08:04:35,121 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 08:04:35,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:35,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:35,122 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 8, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:35,122 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:35,122 INFO L793 eck$LassoCheckResult]: Stem: 7666#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 7632#L6-4 assume true; 7649#L6-1 assume !!(init_nondet_~i~0 < 10); 7617#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 7612#L7-1 havoc init_nondet_#t~nondet1; 7613#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 7669#L6-4 assume true; 7670#L6-1 assume !!(init_nondet_~i~0 < 10); 7747#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 7746#L7-1 havoc init_nondet_#t~nondet1; 7745#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 7744#L6-4 assume true; 7743#L6-1 assume !!(init_nondet_~i~0 < 10); 7742#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 7741#L7-1 havoc init_nondet_#t~nondet1; 7740#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 7739#L6-4 assume true; 7738#L6-1 assume !!(init_nondet_~i~0 < 10); 7737#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 7736#L7-1 havoc init_nondet_#t~nondet1; 7735#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 7734#L6-4 assume true; 7733#L6-1 assume !!(init_nondet_~i~0 < 10); 7732#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 7731#L7-1 havoc init_nondet_#t~nondet1; 7730#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 7729#L6-4 assume true; 7728#L6-1 assume !!(init_nondet_~i~0 < 10); 7727#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 7726#L7-1 havoc init_nondet_#t~nondet1; 7725#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 7724#L6-4 assume true; 7722#L6-1 assume !!(init_nondet_~i~0 < 10); 7720#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 7718#L7-1 havoc init_nondet_#t~nondet1; 7716#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 7714#L6-4 assume true; 7712#L6-1 assume !!(init_nondet_~i~0 < 10); 7710#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 7708#L7-1 havoc init_nondet_#t~nondet1; 7706#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 7704#L6-4 assume true; 7702#L6-1 assume !!(init_nondet_~i~0 < 10); 7700#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 7698#L7-1 havoc init_nondet_#t~nondet1; 7696#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 7694#L6-4 assume true; 7687#L6-1 assume !!(init_nondet_~i~0 < 10); 7691#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 7690#L7-1 havoc init_nondet_#t~nondet1; 7689#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 7686#L6-4 assume true; 7647#L6-1 assume !(init_nondet_~i~0 < 10); 7648#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 7671#L17-4 assume true; 7672#L17-1 assume !!(rangesum_~i~1 < 10); 7623#L18 assume !(rangesum_~i~1 > 5); 7624#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7674#L17-4 assume true; 7766#L17-1 assume !!(rangesum_~i~1 < 10); 7765#L18 assume !(rangesum_~i~1 > 5); 7764#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7763#L17-4 assume true; 7762#L17-1 assume !!(rangesum_~i~1 < 10); 7761#L18 assume !(rangesum_~i~1 > 5); 7760#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7759#L17-4 assume true; 7758#L17-1 assume !!(rangesum_~i~1 < 10); 7757#L18 assume !(rangesum_~i~1 > 5); 7756#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7755#L17-4 assume true; 7754#L17-1 assume !!(rangesum_~i~1 < 10); 7753#L18 assume !(rangesum_~i~1 > 5); 7752#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7751#L17-4 assume true; 7750#L17-1 assume !!(rangesum_~i~1 < 10); 7684#L18 assume !(rangesum_~i~1 > 5); 7683#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7680#L17-4 assume true; 7650#L17-1 assume !!(rangesum_~i~1 < 10); 7651#L18 assume rangesum_~i~1 > 5; 7662#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 7663#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 7682#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7678#L17-4 assume true; 7676#L17-1 assume !(rangesum_~i~1 < 10); 7668#L17-5 assume !(rangesum_~cnt~0 != 0);rangesum_#res := 0; 7646#L26 main_#t~ret4 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 7625#L40 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40 7618#L40-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 7614#L40-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-2 7606#L40-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40-3 7607#L40-4 havoc main_#t~mem6; 7642#L40-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-5 7638#L40-6 assume { :begin_inline_rangesum } true;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; 7639#L17-10 assume true; 7688#L17-7 assume !!(rangesum_~i~1 < 10); 7685#L18-2 assume !(rangesum_~i~1 > 5); 7626#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7621#L17-10 assume true; 7622#L17-7 assume !!(rangesum_~i~1 < 10); 7610#L18-2 assume !(rangesum_~i~1 > 5); 7611#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7723#L17-10 assume true; 7721#L17-7 assume !!(rangesum_~i~1 < 10); 7719#L18-2 assume !(rangesum_~i~1 > 5); 7717#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7715#L17-10 assume true; 7713#L17-7 assume !!(rangesum_~i~1 < 10); 7711#L18-2 assume !(rangesum_~i~1 > 5); 7709#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7707#L17-10 assume true; 7705#L17-7 assume !!(rangesum_~i~1 < 10); 7703#L18-2 assume !(rangesum_~i~1 > 5); 7701#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7699#L17-10 assume true; 7697#L17-7 assume !!(rangesum_~i~1 < 10); 7695#L18-2 assume !(rangesum_~i~1 > 5); 7693#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7619#L17-10 assume true; 7620#L17-7 assume !!(rangesum_~i~1 < 10); 7608#L18-2 [2018-11-10 08:04:35,122 INFO L795 eck$LassoCheckResult]: Loop: 7608#L18-2 assume rangesum_~i~1 > 5; 7609#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 7654#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 7655#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 7681#L17-10 assume true; 7677#L17-7 assume !!(rangesum_~i~1 < 10); 7608#L18-2 [2018-11-10 08:04:35,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash -81477636, now seen corresponding path program 1 times [2018-11-10 08:04:35,123 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:35,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:35,162 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 40 proven. 3 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2018-11-10 08:04:35,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:04:35,163 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:04:35,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:35,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2018-11-10 08:04:35,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:04:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-10 08:04:35,229 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:35,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:35,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1453966901, now seen corresponding path program 1 times [2018-11-10 08:04:35,230 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:35,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:35,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:04:35,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:04:35,260 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. cyclomatic complexity: 18 Second operand 7 states. [2018-11-10 08:04:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:35,383 INFO L93 Difference]: Finished difference Result 266 states and 286 transitions. [2018-11-10 08:04:35,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 08:04:35,383 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 286 transitions. [2018-11-10 08:04:35,384 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 35 [2018-11-10 08:04:35,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 265 states and 285 transitions. [2018-11-10 08:04:35,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2018-11-10 08:04:35,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-10 08:04:35,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 265 states and 285 transitions. [2018-11-10 08:04:35,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:35,385 INFO L705 BuchiCegarLoop]: Abstraction has 265 states and 285 transitions. [2018-11-10 08:04:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states and 285 transitions. [2018-11-10 08:04:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 193. [2018-11-10 08:04:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-10 08:04:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 202 transitions. [2018-11-10 08:04:35,386 INFO L728 BuchiCegarLoop]: Abstraction has 193 states and 202 transitions. [2018-11-10 08:04:35,386 INFO L608 BuchiCegarLoop]: Abstraction has 193 states and 202 transitions. [2018-11-10 08:04:35,387 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 08:04:35,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 202 transitions. [2018-11-10 08:04:35,387 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 08:04:35,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:35,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:35,388 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:35,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:35,389 INFO L793 eck$LassoCheckResult]: Stem: 8503#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8467#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 8468#L6-4 assume true; 8506#L6-1 assume !!(init_nondet_~i~0 < 10); 8564#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 8448#L7-1 havoc init_nondet_#t~nondet1; 8449#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 8507#L6-4 assume true; 8484#L6-1 assume !!(init_nondet_~i~0 < 10); 8453#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 8454#L7-1 havoc init_nondet_#t~nondet1; 8561#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 8560#L6-4 assume true; 8559#L6-1 assume !!(init_nondet_~i~0 < 10); 8558#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 8557#L7-1 havoc init_nondet_#t~nondet1; 8556#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 8555#L6-4 assume true; 8554#L6-1 assume !!(init_nondet_~i~0 < 10); 8553#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 8552#L7-1 havoc init_nondet_#t~nondet1; 8551#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 8550#L6-4 assume true; 8549#L6-1 assume !!(init_nondet_~i~0 < 10); 8548#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 8547#L7-1 havoc init_nondet_#t~nondet1; 8546#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 8545#L6-4 assume true; 8544#L6-1 assume !!(init_nondet_~i~0 < 10); 8543#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 8542#L7-1 havoc init_nondet_#t~nondet1; 8541#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 8540#L6-4 assume true; 8539#L6-1 assume !!(init_nondet_~i~0 < 10); 8538#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 8537#L7-1 havoc init_nondet_#t~nondet1; 8536#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 8535#L6-4 assume true; 8534#L6-1 assume !!(init_nondet_~i~0 < 10); 8533#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 8532#L7-1 havoc init_nondet_#t~nondet1; 8531#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 8530#L6-4 assume true; 8529#L6-1 assume !!(init_nondet_~i~0 < 10); 8528#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 8527#L7-1 havoc init_nondet_#t~nondet1; 8526#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 8525#L6-4 assume true; 8521#L6-1 assume !!(init_nondet_~i~0 < 10); 8524#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 8523#L7-1 havoc init_nondet_#t~nondet1; 8522#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 8520#L6-4 assume true; 8482#L6-1 assume !(init_nondet_~i~0 < 10); 8483#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 8508#L17-4 assume true; 8509#L17-1 assume !!(rangesum_~i~1 < 10); 8460#L18 assume !(rangesum_~i~1 > 5); 8461#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8615#L17-4 assume true; 8614#L17-1 assume !!(rangesum_~i~1 < 10); 8613#L18 assume !(rangesum_~i~1 > 5); 8612#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8611#L17-4 assume true; 8610#L17-1 assume !!(rangesum_~i~1 < 10); 8609#L18 assume !(rangesum_~i~1 > 5); 8608#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8607#L17-4 assume true; 8606#L17-1 assume !!(rangesum_~i~1 < 10); 8605#L18 assume !(rangesum_~i~1 > 5); 8604#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8603#L17-4 assume true; 8602#L17-1 assume !!(rangesum_~i~1 < 10); 8601#L18 assume !(rangesum_~i~1 > 5); 8600#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8599#L17-4 assume true; 8598#L17-1 assume !!(rangesum_~i~1 < 10); 8570#L18 assume !(rangesum_~i~1 > 5); 8565#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8562#L17-4 assume true; 8485#L17-1 assume !!(rangesum_~i~1 < 10); 8486#L18 assume rangesum_~i~1 > 5; 8596#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 8595#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 8594#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8593#L17-4 assume true; 8516#L17-1 assume !!(rangesum_~i~1 < 10); 8576#L18 assume rangesum_~i~1 > 5; 8566#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 8563#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 8518#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8515#L17-4 assume true; 8512#L17-1 assume !(rangesum_~i~1 < 10); 8505#L17-5 assume rangesum_~cnt~0 != 0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 8481#L26 main_#t~ret4 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 8462#L40 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40 8455#L40-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 8450#L40-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-2 8442#L40-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40-3 8443#L40-4 havoc main_#t~mem6; 8477#L40-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-5 8474#L40-6 assume { :begin_inline_rangesum } true;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; 8456#L17-10 assume true; 8457#L17-7 assume !!(rangesum_~i~1 < 10); 8444#L18-2 assume !(rangesum_~i~1 > 5); 8445#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8458#L17-10 assume true; 8459#L17-7 assume !!(rangesum_~i~1 < 10); 8446#L18-2 assume !(rangesum_~i~1 > 5); 8447#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8591#L17-10 assume true; 8579#L17-7 assume !!(rangesum_~i~1 < 10); 8580#L18-2 assume !(rangesum_~i~1 > 5); 8590#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8589#L17-10 assume true; 8588#L17-7 assume !!(rangesum_~i~1 < 10); 8587#L18-2 assume !(rangesum_~i~1 > 5); 8586#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8585#L17-10 assume true; 8584#L17-7 assume !!(rangesum_~i~1 < 10); 8583#L18-2 assume !(rangesum_~i~1 > 5); 8582#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8581#L17-10 assume true; 8499#L17-7 assume !!(rangesum_~i~1 < 10); 8500#L18-2 assume !(rangesum_~i~1 > 5); 8575#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8574#L17-10 assume true; 8572#L17-7 assume !!(rangesum_~i~1 < 10); 8569#L18-2 assume rangesum_~i~1 > 5; 8493#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 8489#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 8490#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8573#L17-10 assume true; 8571#L17-7 assume !!(rangesum_~i~1 < 10); 8514#L18-2 [2018-11-10 08:04:35,389 INFO L795 eck$LassoCheckResult]: Loop: 8514#L18-2 assume rangesum_~i~1 > 5; 8568#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 8567#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 8519#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 8517#L17-10 assume true; 8513#L17-7 assume !!(rangesum_~i~1 < 10); 8514#L18-2 [2018-11-10 08:04:35,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:35,389 INFO L82 PathProgramCache]: Analyzing trace with hash -786016806, now seen corresponding path program 1 times [2018-11-10 08:04:35,389 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:35,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:35,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:35,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,398 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 08:04:35,398 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 08:04:35,398 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/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 [2018-11-10 08:04:35,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:04:35,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2018-11-10 08:04:35,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:04:35,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-10 08:04:35,546 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:35,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:35,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1453966901, now seen corresponding path program 2 times [2018-11-10 08:04:35,546 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:35,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:35,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:35,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:35,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 08:04:35,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-10 08:04:35,578 INFO L87 Difference]: Start difference. First operand 193 states and 202 transitions. cyclomatic complexity: 16 Second operand 11 states. [2018-11-10 08:04:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:35,660 INFO L93 Difference]: Finished difference Result 269 states and 287 transitions. [2018-11-10 08:04:35,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 08:04:35,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 269 states and 287 transitions. [2018-11-10 08:04:35,661 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-10 08:04:35,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 269 states to 268 states and 286 transitions. [2018-11-10 08:04:35,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 105 [2018-11-10 08:04:35,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 105 [2018-11-10 08:04:35,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 286 transitions. [2018-11-10 08:04:35,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:35,663 INFO L705 BuchiCegarLoop]: Abstraction has 268 states and 286 transitions. [2018-11-10 08:04:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 286 transitions. [2018-11-10 08:04:35,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 205. [2018-11-10 08:04:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-10 08:04:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 214 transitions. [2018-11-10 08:04:35,666 INFO L728 BuchiCegarLoop]: Abstraction has 205 states and 214 transitions. [2018-11-10 08:04:35,666 INFO L608 BuchiCegarLoop]: Abstraction has 205 states and 214 transitions. [2018-11-10 08:04:35,666 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-10 08:04:35,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 214 transitions. [2018-11-10 08:04:35,666 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 08:04:35,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:35,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:35,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 8, 6, 6, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:35,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:35,667 INFO L793 eck$LassoCheckResult]: Stem: 9380#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9342#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 9343#L6-4 assume true; 9360#L6-1 assume !!(init_nondet_~i~0 < 10); 9332#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 9325#L7-1 havoc init_nondet_#t~nondet1; 9326#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 9383#L6-4 assume true; 9384#L6-1 assume !!(init_nondet_~i~0 < 10); 9444#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 9443#L7-1 havoc init_nondet_#t~nondet1; 9442#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 9441#L6-4 assume true; 9440#L6-1 assume !!(init_nondet_~i~0 < 10); 9439#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 9438#L7-1 havoc init_nondet_#t~nondet1; 9437#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 9436#L6-4 assume true; 9435#L6-1 assume !!(init_nondet_~i~0 < 10); 9434#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 9433#L7-1 havoc init_nondet_#t~nondet1; 9432#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 9431#L6-4 assume true; 9430#L6-1 assume !!(init_nondet_~i~0 < 10); 9429#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 9428#L7-1 havoc init_nondet_#t~nondet1; 9427#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 9426#L6-4 assume true; 9425#L6-1 assume !!(init_nondet_~i~0 < 10); 9424#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 9423#L7-1 havoc init_nondet_#t~nondet1; 9422#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 9421#L6-4 assume true; 9420#L6-1 assume !!(init_nondet_~i~0 < 10); 9419#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 9418#L7-1 havoc init_nondet_#t~nondet1; 9417#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 9416#L6-4 assume true; 9415#L6-1 assume !!(init_nondet_~i~0 < 10); 9414#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 9413#L7-1 havoc init_nondet_#t~nondet1; 9412#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 9411#L6-4 assume true; 9410#L6-1 assume !!(init_nondet_~i~0 < 10); 9409#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 9408#L7-1 havoc init_nondet_#t~nondet1; 9406#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 9404#L6-4 assume true; 9399#L6-1 assume !!(init_nondet_~i~0 < 10); 9402#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 9401#L7-1 havoc init_nondet_#t~nondet1; 9400#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 9398#L6-4 assume true; 9358#L6-1 assume !(init_nondet_~i~0 < 10); 9359#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 9385#L17-4 assume true; 9366#L17-1 assume !!(rangesum_~i~1 < 10); 9334#L18 assume !(rangesum_~i~1 > 5); 9335#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9501#L17-4 assume true; 9500#L17-1 assume !!(rangesum_~i~1 < 10); 9499#L18 assume !(rangesum_~i~1 > 5); 9498#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9497#L17-4 assume true; 9496#L17-1 assume !!(rangesum_~i~1 < 10); 9495#L18 assume !(rangesum_~i~1 > 5); 9494#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9493#L17-4 assume true; 9492#L17-1 assume !!(rangesum_~i~1 < 10); 9491#L18 assume !(rangesum_~i~1 > 5); 9490#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9489#L17-4 assume true; 9488#L17-1 assume !!(rangesum_~i~1 < 10); 9487#L18 assume !(rangesum_~i~1 > 5); 9486#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9485#L17-4 assume true; 9483#L17-1 assume !!(rangesum_~i~1 < 10); 9407#L18 assume !(rangesum_~i~1 > 5); 9405#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9403#L17-4 assume true; 9364#L17-1 assume !!(rangesum_~i~1 < 10); 9365#L18 assume rangesum_~i~1 > 5; 9467#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 9466#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 9465#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9464#L17-4 assume true; 9463#L17-1 assume !!(rangesum_~i~1 < 10); 9462#L18 assume rangesum_~i~1 > 5; 9461#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 9460#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 9456#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9455#L17-4 assume true; 9396#L17-1 assume !!(rangesum_~i~1 < 10); 9451#L18 assume rangesum_~i~1 > 5; 9448#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 9446#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 9397#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9395#L17-4 assume true; 9394#L17-1 assume !(rangesum_~i~1 < 10); 9382#L17-5 assume rangesum_~cnt~0 != 0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 9357#L26 main_#t~ret4 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 9339#L40 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40 9333#L40-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 9327#L40-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-2 9317#L40-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40-3 9318#L40-4 havoc main_#t~mem6; 9352#L40-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-5 9350#L40-6 assume { :begin_inline_rangesum } true;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; 9351#L17-10 assume true; 9450#L17-7 assume !!(rangesum_~i~1 < 10); 9449#L18-2 assume !(rangesum_~i~1 > 5); 9336#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9337#L17-10 assume true; 9481#L17-7 assume !!(rangesum_~i~1 < 10); 9321#L18-2 assume !(rangesum_~i~1 > 5); 9322#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9484#L17-10 assume true; 9482#L17-7 assume !!(rangesum_~i~1 < 10); 9479#L18-2 assume !(rangesum_~i~1 > 5); 9478#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9477#L17-10 assume true; 9476#L17-7 assume !!(rangesum_~i~1 < 10); 9475#L18-2 assume !(rangesum_~i~1 > 5); 9474#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9473#L17-10 assume true; 9472#L17-7 assume !!(rangesum_~i~1 < 10); 9471#L18-2 assume !(rangesum_~i~1 > 5); 9470#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9469#L17-10 assume true; 9468#L17-7 assume !!(rangesum_~i~1 < 10); 9459#L18-2 assume !(rangesum_~i~1 > 5); 9458#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9328#L17-10 assume true; 9329#L17-7 assume !!(rangesum_~i~1 < 10); 9319#L18-2 assume rangesum_~i~1 > 5; 9320#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 9361#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 9362#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9457#L17-10 assume true; 9375#L17-7 assume !!(rangesum_~i~1 < 10); 9376#L18-2 assume rangesum_~i~1 > 5; 9368#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 9369#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 9454#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9453#L17-10 assume true; 9452#L17-7 assume !!(rangesum_~i~1 < 10); 9391#L18-2 [2018-11-10 08:04:35,667 INFO L795 eck$LassoCheckResult]: Loop: 9391#L18-2 assume rangesum_~i~1 > 5; 9447#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 9445#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 9393#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 9392#L17-10 assume true; 9390#L17-7 assume !!(rangesum_~i~1 < 10); 9391#L18-2 [2018-11-10 08:04:35,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:35,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1750667834, now seen corresponding path program 2 times [2018-11-10 08:04:35,668 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:35,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:35,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:35,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,678 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 08:04:35,678 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 08:04:35,678 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/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 [2018-11-10 08:04:35,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 08:04:35,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 08:04:35,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:35,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2018-11-10 08:04:35,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-10 08:04:35,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-10 08:04:35,831 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:04:35,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:35,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1453966901, now seen corresponding path program 3 times [2018-11-10 08:04:35,832 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:35,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:35,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:35,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:35,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 08:04:35,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-10 08:04:35,871 INFO L87 Difference]: Start difference. First operand 205 states and 214 transitions. cyclomatic complexity: 16 Second operand 12 states. [2018-11-10 08:04:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:35,961 INFO L93 Difference]: Finished difference Result 279 states and 297 transitions. [2018-11-10 08:04:35,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 08:04:35,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 279 states and 297 transitions. [2018-11-10 08:04:35,962 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 39 [2018-11-10 08:04:35,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 279 states to 278 states and 296 transitions. [2018-11-10 08:04:35,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-11-10 08:04:35,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-11-10 08:04:35,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 278 states and 296 transitions. [2018-11-10 08:04:35,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:35,964 INFO L705 BuchiCegarLoop]: Abstraction has 278 states and 296 transitions. [2018-11-10 08:04:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states and 296 transitions. [2018-11-10 08:04:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 217. [2018-11-10 08:04:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-10 08:04:35,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 226 transitions. [2018-11-10 08:04:35,967 INFO L728 BuchiCegarLoop]: Abstraction has 217 states and 226 transitions. [2018-11-10 08:04:35,967 INFO L608 BuchiCegarLoop]: Abstraction has 217 states and 226 transitions. [2018-11-10 08:04:35,967 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-10 08:04:35,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 226 transitions. [2018-11-10 08:04:35,968 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-10 08:04:35,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:35,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:35,969 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 6, 6, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:35,969 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:35,970 INFO L793 eck$LassoCheckResult]: Stem: 10313#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 10276#L6-4 assume true; 10316#L6-1 assume !!(init_nondet_~i~0 < 10); 10400#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 10398#L7-1 havoc init_nondet_#t~nondet1; 10322#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 10317#L6-4 assume true; 10293#L6-1 assume !!(init_nondet_~i~0 < 10); 10262#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 10257#L7-1 havoc init_nondet_#t~nondet1; 10258#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 10396#L6-4 assume true; 10395#L6-1 assume !!(init_nondet_~i~0 < 10); 10394#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 10393#L7-1 havoc init_nondet_#t~nondet1; 10392#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 10391#L6-4 assume true; 10390#L6-1 assume !!(init_nondet_~i~0 < 10); 10389#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 10388#L7-1 havoc init_nondet_#t~nondet1; 10387#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 10386#L6-4 assume true; 10385#L6-1 assume !!(init_nondet_~i~0 < 10); 10384#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 10383#L7-1 havoc init_nondet_#t~nondet1; 10382#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 10381#L6-4 assume true; 10380#L6-1 assume !!(init_nondet_~i~0 < 10); 10379#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 10378#L7-1 havoc init_nondet_#t~nondet1; 10377#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 10376#L6-4 assume true; 10375#L6-1 assume !!(init_nondet_~i~0 < 10); 10374#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 10373#L7-1 havoc init_nondet_#t~nondet1; 10372#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 10371#L6-4 assume true; 10370#L6-1 assume !!(init_nondet_~i~0 < 10); 10369#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 10368#L7-1 havoc init_nondet_#t~nondet1; 10367#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 10365#L6-4 assume true; 10364#L6-1 assume !!(init_nondet_~i~0 < 10); 10363#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 10361#L7-1 havoc init_nondet_#t~nondet1; 10358#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 10356#L6-4 assume true; 10347#L6-1 assume !!(init_nondet_~i~0 < 10); 10353#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 10351#L7-1 havoc init_nondet_#t~nondet1; 10349#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 10346#L6-4 assume true; 10291#L6-1 assume !(init_nondet_~i~0 < 10); 10292#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 10318#L17-4 assume true; 10319#L17-1 assume !!(rangesum_~i~1 < 10); 10268#L18 assume !(rangesum_~i~1 > 5); 10269#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10447#L17-4 assume true; 10296#L17-1 assume !!(rangesum_~i~1 < 10); 10297#L18 assume !(rangesum_~i~1 > 5); 10435#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10434#L17-4 assume true; 10433#L17-1 assume !!(rangesum_~i~1 < 10); 10432#L18 assume !(rangesum_~i~1 > 5); 10431#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10430#L17-4 assume true; 10429#L17-1 assume !!(rangesum_~i~1 < 10); 10428#L18 assume !(rangesum_~i~1 > 5); 10427#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10426#L17-4 assume true; 10425#L17-1 assume !!(rangesum_~i~1 < 10); 10424#L18 assume !(rangesum_~i~1 > 5); 10423#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10422#L17-4 assume true; 10421#L17-1 assume !!(rangesum_~i~1 < 10); 10334#L18 assume !(rangesum_~i~1 > 5); 10331#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10327#L17-4 assume true; 10294#L17-1 assume !!(rangesum_~i~1 < 10); 10295#L18 assume rangesum_~i~1 > 5; 10414#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 10413#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 10412#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10411#L17-4 assume true; 10410#L17-1 assume !!(rangesum_~i~1 < 10); 10409#L18 assume rangesum_~i~1 > 5; 10408#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 10407#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 10406#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10405#L17-4 assume true; 10404#L17-1 assume !!(rangesum_~i~1 < 10); 10403#L18 assume rangesum_~i~1 > 5; 10402#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 10401#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 10399#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10397#L17-4 assume true; 10329#L17-1 assume !!(rangesum_~i~1 < 10); 10339#L18 assume rangesum_~i~1 > 5; 10337#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 10335#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 10332#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10328#L17-4 assume true; 10324#L17-1 assume !(rangesum_~i~1 < 10); 10315#L17-5 assume rangesum_~cnt~0 != 0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 10290#L26 main_#t~ret4 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 10270#L40 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40 10263#L40-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 10259#L40-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-2 10251#L40-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40-3 10252#L40-4 havoc main_#t~mem6; 10286#L40-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-5 10284#L40-6 assume { :begin_inline_rangesum } true;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; 10285#L17-10 assume true; 10360#L17-7 assume !!(rangesum_~i~1 < 10); 10253#L18-2 assume !(rangesum_~i~1 > 5); 10254#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10271#L17-10 assume true; 10415#L17-7 assume !!(rangesum_~i~1 < 10); 10416#L18-2 assume !(rangesum_~i~1 > 5); 10420#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10417#L17-10 assume true; 10418#L17-7 assume !!(rangesum_~i~1 < 10); 10436#L18-2 assume !(rangesum_~i~1 > 5); 10437#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10443#L17-10 assume true; 10442#L17-7 assume !!(rangesum_~i~1 < 10); 10441#L18-2 assume !(rangesum_~i~1 > 5); 10440#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10439#L17-10 assume true; 10438#L17-7 assume !!(rangesum_~i~1 < 10); 10255#L18-2 assume !(rangesum_~i~1 > 5); 10256#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10446#L17-10 assume true; 10309#L17-7 assume !!(rangesum_~i~1 < 10); 10310#L18-2 assume !(rangesum_~i~1 > 5); 10366#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10264#L17-10 assume true; 10265#L17-7 assume !!(rangesum_~i~1 < 10); 10308#L18-2 assume rangesum_~i~1 > 5; 10302#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 10298#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 10299#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10362#L17-10 assume true; 10359#L17-7 assume !!(rangesum_~i~1 < 10); 10357#L18-2 assume rangesum_~i~1 > 5; 10355#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 10354#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 10352#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10350#L17-10 assume true; 10348#L17-7 assume !!(rangesum_~i~1 < 10); 10345#L18-2 assume rangesum_~i~1 > 5; 10344#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 10343#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 10342#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10341#L17-10 assume true; 10340#L17-7 assume !!(rangesum_~i~1 < 10); 10326#L18-2 [2018-11-10 08:04:35,970 INFO L795 eck$LassoCheckResult]: Loop: 10326#L18-2 assume rangesum_~i~1 > 5; 10338#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 10336#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 10333#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 10330#L17-10 assume true; 10325#L17-7 assume !!(rangesum_~i~1 < 10); 10326#L18-2 [2018-11-10 08:04:35,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:35,970 INFO L82 PathProgramCache]: Analyzing trace with hash -349981286, now seen corresponding path program 3 times [2018-11-10 08:04:35,970 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:35,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:35,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:35,978 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 08:04:35,978 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 08:04:35,978 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 08:04:36,022 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 08:04:36,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-10 08:04:36,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-10 08:04:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:36,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:36,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1453966901, now seen corresponding path program 4 times [2018-11-10 08:04:36,232 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:36,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:36,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:36,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:36,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:36,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:36,236 INFO L82 PathProgramCache]: Analyzing trace with hash -742942556, now seen corresponding path program 4 times [2018-11-10 08:04:36,236 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:36,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:36,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:36,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:36,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:36,243 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 08:04:36,243 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 08:04:36,243 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 08:04:36,250 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 08:04:36,278 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 08:04:36,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:04:36,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:04:36,301 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2018-11-10 08:04:36,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:04:36,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 08:04:36,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:04:36,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:04:36,344 INFO L87 Difference]: Start difference. First operand 217 states and 226 transitions. cyclomatic complexity: 16 Second operand 7 states. [2018-11-10 08:04:36,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:04:36,393 INFO L93 Difference]: Finished difference Result 278 states and 282 transitions. [2018-11-10 08:04:36,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 08:04:36,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 278 states and 282 transitions. [2018-11-10 08:04:36,394 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 08:04:36,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 278 states to 208 states and 212 transitions. [2018-11-10 08:04:36,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2018-11-10 08:04:36,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-11-10 08:04:36,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 212 transitions. [2018-11-10 08:04:36,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:04:36,396 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 212 transitions. [2018-11-10 08:04:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 212 transitions. [2018-11-10 08:04:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2018-11-10 08:04:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-10 08:04:36,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 184 transitions. [2018-11-10 08:04:36,398 INFO L728 BuchiCegarLoop]: Abstraction has 180 states and 184 transitions. [2018-11-10 08:04:36,398 INFO L608 BuchiCegarLoop]: Abstraction has 180 states and 184 transitions. [2018-11-10 08:04:36,399 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-10 08:04:36,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 180 states and 184 transitions. [2018-11-10 08:04:36,399 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-10 08:04:36,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:04:36,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:04:36,400 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:04:36,400 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-10 08:04:36,401 INFO L793 eck$LassoCheckResult]: Stem: 11302#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;assume { :begin_inline_init_nondet } true;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; 11273#L6-4 assume true; 11286#L6-1 assume !!(init_nondet_~i~0 < 10); 11258#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 11253#L7-1 havoc init_nondet_#t~nondet1; 11254#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 11305#L6-4 assume true; 11306#L6-1 assume !!(init_nondet_~i~0 < 10); 11402#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 11401#L7-1 havoc init_nondet_#t~nondet1; 11400#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 11399#L6-4 assume true; 11398#L6-1 assume !!(init_nondet_~i~0 < 10); 11397#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 11396#L7-1 havoc init_nondet_#t~nondet1; 11395#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 11394#L6-4 assume true; 11393#L6-1 assume !!(init_nondet_~i~0 < 10); 11392#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 11391#L7-1 havoc init_nondet_#t~nondet1; 11390#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 11389#L6-4 assume true; 11388#L6-1 assume !!(init_nondet_~i~0 < 10); 11387#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 11386#L7-1 havoc init_nondet_#t~nondet1; 11385#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 11384#L6-4 assume true; 11383#L6-1 assume !!(init_nondet_~i~0 < 10); 11382#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 11381#L7-1 havoc init_nondet_#t~nondet1; 11380#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 11379#L6-4 assume true; 11378#L6-1 assume !!(init_nondet_~i~0 < 10); 11377#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 11376#L7-1 havoc init_nondet_#t~nondet1; 11375#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 11374#L6-4 assume true; 11373#L6-1 assume !!(init_nondet_~i~0 < 10); 11372#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 11371#L7-1 havoc init_nondet_#t~nondet1; 11370#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 11369#L6-4 assume true; 11368#L6-1 assume !!(init_nondet_~i~0 < 10); 11367#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 11366#L7-1 havoc init_nondet_#t~nondet1; 11364#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 11361#L6-4 assume true; 11345#L6-1 assume !!(init_nondet_~i~0 < 10); 11356#L7 SUMMARY for call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + init_nondet_~i~0 * 4, 4); srcloc: L7 11353#L7-1 havoc init_nondet_#t~nondet1; 11347#L6-3 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := init_nondet_#t~post0 + 1;havoc init_nondet_#t~post0; 11344#L6-4 assume true; 11284#L6-1 assume !(init_nondet_~i~0 < 10); 11285#L4 assume { :end_inline_init_nondet } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;assume { :begin_inline_rangesum } true;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; 11307#L17-4 assume true; 11308#L17-1 assume !!(rangesum_~i~1 < 10); 11266#L18 assume !(rangesum_~i~1 > 5); 11267#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11309#L17-4 assume true; 11289#L17-1 assume !!(rangesum_~i~1 < 10); 11290#L18 assume !(rangesum_~i~1 > 5); 11311#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11312#L17-4 assume true; 11426#L17-1 assume !!(rangesum_~i~1 < 10); 11425#L18 assume !(rangesum_~i~1 > 5); 11423#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11421#L17-4 assume true; 11419#L17-1 assume !!(rangesum_~i~1 < 10); 11417#L18 assume !(rangesum_~i~1 > 5); 11415#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11413#L17-4 assume true; 11411#L17-1 assume !!(rangesum_~i~1 < 10); 11409#L18 assume !(rangesum_~i~1 > 5); 11407#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11405#L17-4 assume true; 11351#L17-1 assume !!(rangesum_~i~1 < 10); 11357#L18 assume !(rangesum_~i~1 > 5); 11354#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11350#L17-4 assume true; 11287#L17-1 assume !!(rangesum_~i~1 < 10); 11288#L18 assume rangesum_~i~1 > 5; 11343#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 11296#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 11297#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11310#L17-4 assume true; 11349#L17-1 assume !!(rangesum_~i~1 < 10); 11264#L18 assume rangesum_~i~1 > 5; 11265#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 11299#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 11340#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11338#L17-4 assume true; 11336#L17-1 assume !!(rangesum_~i~1 < 10); 11334#L18 assume rangesum_~i~1 > 5; 11332#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 11330#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 11328#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11326#L17-4 assume true; 11324#L17-1 assume !!(rangesum_~i~1 < 10); 11322#L18 assume rangesum_~i~1 > 5; 11320#L19 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19 11318#L19-1 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 11316#L17-3 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11314#L17-4 assume true; 11313#L17-1 assume !(rangesum_~i~1 < 10); 11304#L17-5 assume rangesum_~cnt~0 != 0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 11283#L26 main_#t~ret4 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 11268#L40 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40 11259#L40-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 11255#L40-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-2 11247#L40-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L40-3 11248#L40-4 havoc main_#t~mem6; 11281#L40-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L40-5 11279#L40-6 assume { :begin_inline_rangesum } true;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; 11260#L17-10 assume true; 11261#L17-7 assume !!(rangesum_~i~1 < 10); 11249#L18-2 assume !(rangesum_~i~1 > 5); 11250#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11262#L17-10 assume true; 11263#L17-7 assume !!(rangesum_~i~1 < 10); 11251#L18-2 assume !(rangesum_~i~1 > 5); 11252#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11269#L17-10 assume true; 11424#L17-7 assume !!(rangesum_~i~1 < 10); 11422#L18-2 assume !(rangesum_~i~1 > 5); 11420#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11418#L17-10 assume true; 11416#L17-7 assume !!(rangesum_~i~1 < 10); 11414#L18-2 assume !(rangesum_~i~1 > 5); 11412#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11410#L17-10 assume true; 11408#L17-7 assume !!(rangesum_~i~1 < 10); 11406#L18-2 assume !(rangesum_~i~1 > 5); 11404#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11360#L17-10 assume true; 11403#L17-7 assume !!(rangesum_~i~1 < 10); 11363#L18-2 assume !(rangesum_~i~1 > 5); 11359#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11358#L17-10 assume true; 11355#L17-7 assume !!(rangesum_~i~1 < 10); 11352#L18-2 assume rangesum_~i~1 > 5; 11346#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 11291#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 11292#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11365#L17-10 assume true; 11362#L17-7 assume !!(rangesum_~i~1 < 10); 11348#L18-2 assume rangesum_~i~1 > 5; 11294#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 11295#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 11342#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11341#L17-10 assume true; 11339#L17-7 assume !!(rangesum_~i~1 < 10); 11337#L18-2 assume rangesum_~i~1 > 5; 11335#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 11333#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 11331#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11329#L17-10 assume true; 11327#L17-7 assume !!(rangesum_~i~1 < 10); 11325#L18-2 assume rangesum_~i~1 > 5; 11323#L19-2 SUMMARY for call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + rangesum_~i~1 * 4, 4); srcloc: L19-2 11321#L19-3 rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := rangesum_~cnt~0 + 1; 11319#L17-9 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := rangesum_#t~post2 + 1;havoc rangesum_#t~post2; 11317#L17-10 assume true; 11315#L17-7 assume !(rangesum_~i~1 < 10); 11256#L17-11 assume rangesum_~cnt~0 != 0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && rangesum_~ret~0 % rangesum_~cnt~0 != 0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else rangesum_~ret~0 / rangesum_~cnt~0 + 1) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 11257#L26-1 main_#t~ret7 := rangesum_#res;assume { :end_inline_rangesum } true;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7; 11300#L42 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L42 11270#L42-1 main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 11271#L43-4 [2018-11-10 08:04:36,401 INFO L795 eck$LassoCheckResult]: Loop: 11271#L43-4 assume true; 11274#L43-1 assume !!(main_~i~2 < 9); 11276#L44 SUMMARY for call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~2 + 1) * 4, 4); srcloc: L44 11303#L44-1 SUMMARY for call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + main_~i~2 * 4, 4); srcloc: L44-1 11301#L44-2 havoc main_#t~mem10; 11298#L43-3 main_#t~post9 := main_~i~2;main_~i~2 := main_#t~post9 + 1;havoc main_#t~post9; 11271#L43-4 [2018-11-10 08:04:36,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:36,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2026165561, now seen corresponding path program 1 times [2018-11-10 08:04:36,401 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:36,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:36,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:36,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:04:36,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:36,408 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 08:04:36,408 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 08:04:36,409 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 08:04:36,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:36,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:36,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash -799316151, now seen corresponding path program 1 times [2018-11-10 08:04:36,563 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:36,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:36,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:36,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:04:36,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1864426895, now seen corresponding path program 1 times [2018-11-10 08:04:36,568 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:04:36,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:04:36,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:36,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:36,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:04:36,577 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-10 08:04:36,577 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-10 08:04:36,577 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86ed67e4-d166-4b09-95a6-2158003028a8/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-10 08:04:36,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:04:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:04:53,726 WARN L179 SmtUtils]: Spent 16.89 s on a formula simplification. DAG size of input: 551 DAG size of output: 417 [2018-11-10 08:05:45,351 WARN L179 SmtUtils]: Spent 49.09 s on a formula simplification. DAG size of input: 330 DAG size of output: 201 [2018-11-10 08:05:45,353 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:05:45,353 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:05:45,353 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:05:45,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:05:45,354 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:05:45,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:05:45,354 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:05:45,354 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:05:45,354 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration24_Lasso [2018-11-10 08:05:45,354 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:05:45,354 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:05:45,357 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 08:05:45,376 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 5916 disjunctions. This might take some time... [2018-11-10 08:05:45,550 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 144 disjunctions. [2018-11-10 08:05:45,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:45,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:45,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:45,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:45,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:45,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:45,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:45,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:05:46,371 FATAL L292 ToolchainWalker]: 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.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.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:284) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:611) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:538) 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:864) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) 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) [2018-11-10 08:05:46,373 INFO L168 Benchmark]: Toolchain (without parser) took 81166.79 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 551.0 MB). Free memory was 960.3 MB in the beginning and 1.5 GB in the end (delta: -546.0 MB). Peak memory consumption was 753.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:05:46,374 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:05:46,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.03 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-11-10 08:05:46,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.52 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:05:46,375 INFO L168 Benchmark]: Boogie Preprocessor took 18.97 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 08:05:46,375 INFO L168 Benchmark]: RCFGBuilder took 437.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-10 08:05:46,376 INFO L168 Benchmark]: BuchiAutomizer took 80503.92 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 420.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -405.2 MB). Peak memory consumption was 763.4 MB. Max. memory is 11.5 GB. [2018-11-10 08:05:46,378 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.03 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 948.5 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.52 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.97 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 437.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 80503.92 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 420.5 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -405.2 MB). Peak memory consumption was 763.4 MB. Max. memory is 11.5 GB. * 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.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...