./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-aa41828 [2018-11-23 04:40:46,760 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 04:40:46,761 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 04:40:46,769 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 04:40:46,769 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 04:40:46,770 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 04:40:46,771 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 04:40:46,772 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 04:40:46,773 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 04:40:46,773 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 04:40:46,774 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 04:40:46,774 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 04:40:46,775 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 04:40:46,775 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 04:40:46,776 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 04:40:46,777 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 04:40:46,778 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 04:40:46,779 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 04:40:46,780 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 04:40:46,782 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 04:40:46,783 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 04:40:46,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 04:40:46,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 04:40:46,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 04:40:46,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 04:40:46,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 04:40:46,787 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 04:40:46,788 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 04:40:46,788 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 04:40:46,789 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 04:40:46,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 04:40:46,789 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 04:40:46,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 04:40:46,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 04:40:46,790 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 04:40:46,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 04:40:46,791 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 04:40:46,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 04:40:46,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 04:40:46,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 04:40:46,804 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 04:40:46,804 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 04:40:46,804 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 04:40:46,804 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 04:40:46,804 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 04:40:46,805 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 04:40:46,805 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 04:40:46,805 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 04:40:46,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 04:40:46,805 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 04:40:46,805 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 04:40:46,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 04:40:46,805 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 04:40:46,806 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 04:40:46,806 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 04:40:46,806 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 04:40:46,806 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 04:40:46,806 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 04:40:46,806 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 04:40:46,806 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 04:40:46,806 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 04:40:46,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 04:40:46,807 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 04:40:46,807 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 04:40:46,807 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 04:40:46,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 04:40:46,807 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 04:40:46,807 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 04:40:46,807 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 04:40:46,808 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_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:46,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 04:40:46,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 04:40:46,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 04:40:46,839 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 04:40:46,839 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 04:40:46,839 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i [2018-11-23 04:40:46,874 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/data/6c3914747/9c3f4dc8686d4346a125f127e9612594/FLAG2ee36fc39 [2018-11-23 04:40:47,289 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 04:40:47,290 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/sv-benchmarks/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i [2018-11-23 04:40:47,295 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/data/6c3914747/9c3f4dc8686d4346a125f127e9612594/FLAG2ee36fc39 [2018-11-23 04:40:47,304 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/data/6c3914747/9c3f4dc8686d4346a125f127e9612594 [2018-11-23 04:40:47,306 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 04:40:47,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 04:40:47,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 04:40:47,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 04:40:47,310 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 04:40:47,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16069910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47, skipping insertion in model container [2018-11-23 04:40:47,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 04:40:47,332 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 04:40:47,442 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:40:47,449 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 04:40:47,466 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 04:40:47,478 INFO L195 MainTranslator]: Completed translation [2018-11-23 04:40:47,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47 WrapperNode [2018-11-23 04:40:47,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 04:40:47,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 04:40:47,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 04:40:47,479 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 04:40:47,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 04:40:47,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 04:40:47,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 04:40:47,508 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 04:40:47,515 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (1/1) ... [2018-11-23 04:40:47,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 04:40:47,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 04:40:47,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 04:40:47,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 04:40:47,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 04:40:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 04:40:47,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 04:40:47,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 04:40:47,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 04:40:47,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 04:40:47,809 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 04:40:47,809 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-11-23 04:40:47,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:40:47 BoogieIcfgContainer [2018-11-23 04:40:47,809 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 04:40:47,810 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 04:40:47,810 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 04:40:47,813 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 04:40:47,813 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:40:47,813 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 04:40:47" (1/3) ... [2018-11-23 04:40:47,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69c4158a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:40:47, skipping insertion in model container [2018-11-23 04:40:47,814 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:40:47,814 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 04:40:47" (2/3) ... [2018-11-23 04:40:47,814 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69c4158a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 04:40:47, skipping insertion in model container [2018-11-23 04:40:47,815 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 04:40:47,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 04:40:47" (3/3) ... [2018-11-23 04:40:47,816 INFO L375 chiAutomizerObserver]: Analyzing ICFG rangesum10_false-unreach-call_true-termination.i [2018-11-23 04:40:47,848 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 04:40:47,849 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 04:40:47,849 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 04:40:47,849 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 04:40:47,849 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 04:40:47,849 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 04:40:47,849 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 04:40:47,849 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 04:40:47,849 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 04:40:47,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-23 04:40:47,872 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-23 04:40:47,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:47,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:47,876 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:40:47,876 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 04:40:47,877 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 04:40:47,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states. [2018-11-23 04:40:47,878 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 13 [2018-11-23 04:40:47,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:47,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:47,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 04:40:47,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 04:40:47,884 INFO L794 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 26#L6-3true [2018-11-23 04:40:47,885 INFO L796 eck$LassoCheckResult]: Loop: 26#L6-3true assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 30#L6-2true init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 26#L6-3true [2018-11-23 04:40:47,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:47,890 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 04:40:47,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:47,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:47,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:47,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:47,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:47,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 04:40:47,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:47,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:47,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:47,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 04:40:47,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:47,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:47,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:47,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:47,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:48,135 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:48,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:48,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:48,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:48,136 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:40:48,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:48,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:48,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:48,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-23 04:40:48,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:48,137 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:48,153 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-23 04:40:48,157 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-23 04:40:48,161 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-23 04:40:48,162 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-23 04:40:48,169 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-23 04:40:48,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-23 04:40:48,179 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-23 04:40:48,181 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-23 04:40:48,183 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-23 04:40:48,185 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-23 04:40:48,188 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-23 04:40:48,269 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-23 04:40:48,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-23 04:40:48,276 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-23 04:40:48,282 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-23 04:40:48,283 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-23 04:40:48,284 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-23 04:40:48,285 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-23 04:40:48,431 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:48,435 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:40:48,436 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-23 04:40:48,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:48,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:48,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:48,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,443 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-23 04:40:48,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:48,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:48,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:48,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,446 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-23 04:40:48,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:48,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,447 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:48,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:48,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,448 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-23 04:40:48,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:48,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:48,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,455 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-23 04:40:48,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:48,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:48,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:48,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,457 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-23 04:40:48,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:48,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:48,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:48,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,459 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-23 04:40:48,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:48,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:48,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:48,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,461 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-23 04:40:48,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:48,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:48,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,468 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-23 04:40:48,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:48,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:48,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:48,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,470 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-23 04:40:48,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:48,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:48,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:48,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,472 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-23 04:40:48,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,473 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 04:40:48,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,475 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 04:40:48,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:48,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:48,492 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-23 04:40:48,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:48,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:48,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:48,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:48,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:48,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:48,534 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:40:48,550 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 04:40:48,550 INFO L444 ModelExtractionUtils]: 19 out of 22 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 04:40:48,552 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:40:48,554 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 04:40:48,554 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:40:48,555 INFO L520 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-23 04:40:48,563 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 04:40:48,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:48,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:48,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:48,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:48,613 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-23 04:40:48,622 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-23 04:40:48,623 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states. Second operand 3 states. [2018-11-23 04:40:48,661 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states.. Second operand 3 states. Result 78 states and 122 transitions. Complement of second has 7 states. [2018-11-23 04:40:48,662 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-23 04:40:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 04:40:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2018-11-23 04:40:48,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 04:40:48,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:40:48,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 04:40:48,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:40:48,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 82 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 04:40:48,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:40:48,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 122 transitions. [2018-11-23 04:40:48,670 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:48,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 22 states and 32 transitions. [2018-11-23 04:40:48,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-23 04:40:48,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:48,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2018-11-23 04:40:48,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:48,674 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-23 04:40:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2018-11-23 04:40:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 04:40:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 04:40:48,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2018-11-23 04:40:48,692 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-23 04:40:48,692 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2018-11-23 04:40:48,692 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 04:40:48,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 32 transitions. [2018-11-23 04:40:48,693 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:48,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:48,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:48,693 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 04:40:48,693 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:48,694 INFO L794 eck$LassoCheckResult]: Stem: 173#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 171#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 172#L6-3 assume !(init_nondet_~i~0 < 10); 175#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 158#L17-3 [2018-11-23 04:40:48,694 INFO L796 eck$LassoCheckResult]: Loop: 158#L17-3 assume !!(rangesum_~i~1 < 10); 166#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 157#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 158#L17-3 [2018-11-23 04:40:48,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:48,694 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-23 04:40:48,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:48,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:48,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:48,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:48,721 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-23 04:40:48,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:48,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:40:48,723 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:48,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:48,724 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 1 times [2018-11-23 04:40:48,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:48,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:48,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:48,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:48,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:48,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:48,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:48,772 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-23 04:40:48,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:48,781 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2018-11-23 04:40:48,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:48,782 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2018-11-23 04:40:48,782 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:48,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 32 transitions. [2018-11-23 04:40:48,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 04:40:48,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:48,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2018-11-23 04:40:48,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:48,783 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2018-11-23 04:40:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2018-11-23 04:40:48,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 04:40:48,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 04:40:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-11-23 04:40:48,785 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-23 04:40:48,785 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-23 04:40:48,785 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 04:40:48,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-11-23 04:40:48,786 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:48,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:48,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:48,786 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 04:40:48,786 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:48,787 INFO L794 eck$LassoCheckResult]: Stem: 224#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 222#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 223#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 226#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 227#L6-3 assume !(init_nondet_~i~0 < 10); 228#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 209#L17-3 [2018-11-23 04:40:48,787 INFO L796 eck$LassoCheckResult]: Loop: 209#L17-3 assume !!(rangesum_~i~1 < 10); 217#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 208#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 209#L17-3 [2018-11-23 04:40:48,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:48,787 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-23 04:40:48,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:48,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:48,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:48,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:48,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:48,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:48,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:48,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:40:48,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:48,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:48,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:48,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 04:40:48,867 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:48,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 2 times [2018-11-23 04:40:48,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:48,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:48,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:48,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:48,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:48,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:40:48,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:40:48,904 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-23 04:40:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:48,920 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-11-23 04:40:48,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:40:48,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2018-11-23 04:40:48,922 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:48,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2018-11-23 04:40:48,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 04:40:48,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:48,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2018-11-23 04:40:48,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:48,923 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-23 04:40:48,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2018-11-23 04:40:48,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 04:40:48,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 04:40:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2018-11-23 04:40:48,924 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 04:40:48,924 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 33 transitions. [2018-11-23 04:40:48,924 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 04:40:48,925 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 33 transitions. [2018-11-23 04:40:48,925 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:48,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:48,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:48,925 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-23 04:40:48,926 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:48,926 INFO L794 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 292#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 293#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 296#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 297#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 298#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 301#L6-3 assume !(init_nondet_~i~0 < 10); 300#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 279#L17-3 [2018-11-23 04:40:48,926 INFO L796 eck$LassoCheckResult]: Loop: 279#L17-3 assume !!(rangesum_~i~1 < 10); 287#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 278#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 279#L17-3 [2018-11-23 04:40:48,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:48,926 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-23 04:40:48,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:48,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:48,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:48,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:48,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:48,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:48,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:40:48,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 04:40:48,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 04:40:48,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:48,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:49,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:49,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 04:40:49,011 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:49,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 3 times [2018-11-23 04:40:49,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:49,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:40:49,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:40:49,055 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-23 04:40:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:49,071 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2018-11-23 04:40:49,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:40:49,073 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 36 transitions. [2018-11-23 04:40:49,074 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 36 transitions. [2018-11-23 04:40:49,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 04:40:49,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:49,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2018-11-23 04:40:49,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:49,075 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2018-11-23 04:40:49,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2018-11-23 04:40:49,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 04:40:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 04:40:49,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-11-23 04:40:49,077 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-23 04:40:49,077 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-23 04:40:49,077 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 04:40:49,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-11-23 04:40:49,078 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:49,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:49,078 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-23 04:40:49,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:49,079 INFO L794 eck$LassoCheckResult]: Stem: 375#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 373#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 374#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 377#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 381#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 384#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 378#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 379#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 383#L6-3 assume !(init_nondet_~i~0 < 10); 382#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 360#L17-3 [2018-11-23 04:40:49,079 INFO L796 eck$LassoCheckResult]: Loop: 360#L17-3 assume !!(rangesum_~i~1 < 10); 368#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 359#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 360#L17-3 [2018-11-23 04:40:49,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-23 04:40:49,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:49,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:49,112 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-23 04:40:49,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:49,113 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 04:40:49,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:40:49,129 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 04:40:49,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:49,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:49,135 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-23 04:40:49,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:49,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 04:40:49,151 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:49,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,151 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 4 times [2018-11-23 04:40:49,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:49,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:40:49,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:40:49,199 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 14 Second operand 7 states. [2018-11-23 04:40:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:49,233 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2018-11-23 04:40:49,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:40:49,233 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2018-11-23 04:40:49,234 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 38 transitions. [2018-11-23 04:40:49,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 04:40:49,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:49,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 38 transitions. [2018-11-23 04:40:49,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:49,235 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2018-11-23 04:40:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 38 transitions. [2018-11-23 04:40:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 04:40:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 04:40:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-23 04:40:49,236 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-23 04:40:49,236 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-23 04:40:49,236 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 04:40:49,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-11-23 04:40:49,236 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:49,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:49,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-23 04:40:49,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:49,237 INFO L794 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 465#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 466#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 469#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 470#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 471#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 473#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 478#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 477#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 476#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 475#L6-3 assume !(init_nondet_~i~0 < 10); 474#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 452#L17-3 [2018-11-23 04:40:49,237 INFO L796 eck$LassoCheckResult]: Loop: 452#L17-3 assume !!(rangesum_~i~1 < 10); 460#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 451#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 452#L17-3 [2018-11-23 04:40:49,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,237 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-23 04:40:49,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:49,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:49,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:49,269 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:49,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 04:40:49,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 04:40:49,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:49,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:49,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:49,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 04:40:49,308 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:49,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,309 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 5 times [2018-11-23 04:40:49,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:49,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 04:40:49,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 04:40:49,352 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-23 04:40:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:49,368 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2018-11-23 04:40:49,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:40:49,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2018-11-23 04:40:49,371 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 40 transitions. [2018-11-23 04:40:49,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 04:40:49,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:49,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2018-11-23 04:40:49,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:49,372 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2018-11-23 04:40:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2018-11-23 04:40:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 04:40:49,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 04:40:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2018-11-23 04:40:49,374 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-11-23 04:40:49,374 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-11-23 04:40:49,374 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 04:40:49,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2018-11-23 04:40:49,375 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:49,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:49,375 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-23 04:40:49,375 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:49,376 INFO L794 eck$LassoCheckResult]: Stem: 570#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 568#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 569#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 572#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 573#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 574#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 576#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 583#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 582#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 581#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 580#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 579#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 578#L6-3 assume !(init_nondet_~i~0 < 10); 577#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 555#L17-3 [2018-11-23 04:40:49,376 INFO L796 eck$LassoCheckResult]: Loop: 555#L17-3 assume !!(rangesum_~i~1 < 10); 563#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 554#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 555#L17-3 [2018-11-23 04:40:49,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-23 04:40:49,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:49,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:49,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:49,428 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:49,434 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 04:40:49,448 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 04:40:49,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:49,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:49,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:49,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 04:40:49,469 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:49,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 6 times [2018-11-23 04:40:49,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 04:40:49,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 04:40:49,510 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-11-23 04:40:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:49,531 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-11-23 04:40:49,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:40:49,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 42 transitions. [2018-11-23 04:40:49,532 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 42 transitions. [2018-11-23 04:40:49,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 04:40:49,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:49,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 42 transitions. [2018-11-23 04:40:49,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:49,533 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2018-11-23 04:40:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 42 transitions. [2018-11-23 04:40:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-23 04:40:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 04:40:49,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2018-11-23 04:40:49,534 INFO L728 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-23 04:40:49,534 INFO L608 BuchiCegarLoop]: Abstraction has 32 states and 41 transitions. [2018-11-23 04:40:49,535 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 04:40:49,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2018-11-23 04:40:49,535 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:49,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:49,536 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2018-11-23 04:40:49,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:49,536 INFO L794 eck$LassoCheckResult]: Stem: 684#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 682#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 683#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 686#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 687#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 688#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 690#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 699#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 698#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 697#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 696#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 695#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 694#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 693#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 692#L6-3 assume !(init_nondet_~i~0 < 10); 691#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 669#L17-3 [2018-11-23 04:40:49,536 INFO L796 eck$LassoCheckResult]: Loop: 669#L17-3 assume !!(rangesum_~i~1 < 10); 677#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 668#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 669#L17-3 [2018-11-23 04:40:49,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2018-11-23 04:40:49,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:49,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:49,570 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:49,583 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 04:40:49,600 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 04:40:49,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:49,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:49,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:49,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 04:40:49,624 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:49,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 7 times [2018-11-23 04:40:49,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 04:40:49,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 04:40:49,646 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. cyclomatic complexity: 14 Second operand 10 states. [2018-11-23 04:40:49,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:49,667 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2018-11-23 04:40:49,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 04:40:49,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-11-23 04:40:49,668 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 44 transitions. [2018-11-23 04:40:49,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 04:40:49,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:49,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-11-23 04:40:49,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:49,668 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-23 04:40:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-11-23 04:40:49,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 04:40:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 04:40:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-11-23 04:40:49,670 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-23 04:40:49,670 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-23 04:40:49,671 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 04:40:49,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 43 transitions. [2018-11-23 04:40:49,671 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:49,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:49,672 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2018-11-23 04:40:49,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:49,672 INFO L794 eck$LassoCheckResult]: Stem: 809#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 807#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 808#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 811#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 812#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 813#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 815#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 826#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 825#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 824#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 823#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 822#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 821#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 820#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 819#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 818#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 817#L6-3 assume !(init_nondet_~i~0 < 10); 816#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 794#L17-3 [2018-11-23 04:40:49,672 INFO L796 eck$LassoCheckResult]: Loop: 794#L17-3 assume !!(rangesum_~i~1 < 10); 802#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 793#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 794#L17-3 [2018-11-23 04:40:49,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,672 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2018-11-23 04:40:49,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:49,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:49,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:49,756 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:49,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:49,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:49,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:49,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 04:40:49,818 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:49,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,818 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 8 times [2018-11-23 04:40:49,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:49,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:49,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:40:49,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:40:49,849 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. cyclomatic complexity: 14 Second operand 11 states. [2018-11-23 04:40:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:49,868 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-23 04:40:49,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 04:40:49,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2018-11-23 04:40:49,878 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 46 transitions. [2018-11-23 04:40:49,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 04:40:49,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:49,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2018-11-23 04:40:49,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:49,879 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2018-11-23 04:40:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2018-11-23 04:40:49,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 04:40:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 04:40:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2018-11-23 04:40:49,880 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-23 04:40:49,880 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-23 04:40:49,880 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 04:40:49,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 45 transitions. [2018-11-23 04:40:49,881 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:49,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:49,881 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:49,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2018-11-23 04:40:49,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:49,882 INFO L794 eck$LassoCheckResult]: Stem: 945#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 943#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 944#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 947#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 948#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 949#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 951#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 964#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 963#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 962#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 961#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 960#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 959#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 958#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 957#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 956#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 955#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 954#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 953#L6-3 assume !(init_nondet_~i~0 < 10); 952#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 930#L17-3 [2018-11-23 04:40:49,882 INFO L796 eck$LassoCheckResult]: Loop: 930#L17-3 assume !!(rangesum_~i~1 < 10); 938#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 929#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 930#L17-3 [2018-11-23 04:40:49,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:49,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2018-11-23 04:40:49,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:49,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:49,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:49,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:49,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:49,946 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:49,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 04:40:49,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 04:40:49,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:49,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:49,993 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:50,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:50,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 04:40:50,019 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:50,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,019 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 9 times [2018-11-23 04:40:50,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:50,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 04:40:50,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:40:50,043 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. cyclomatic complexity: 14 Second operand 12 states. [2018-11-23 04:40:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:50,060 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2018-11-23 04:40:50,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:40:50,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 48 transitions. [2018-11-23 04:40:50,060 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:50,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 48 transitions. [2018-11-23 04:40:50,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 04:40:50,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:50,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2018-11-23 04:40:50,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:50,061 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-23 04:40:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2018-11-23 04:40:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-11-23 04:40:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 04:40:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2018-11-23 04:40:50,063 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-11-23 04:40:50,063 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-11-23 04:40:50,063 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 04:40:50,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 47 transitions. [2018-11-23 04:40:50,063 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:50,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:50,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:50,064 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2018-11-23 04:40:50,064 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:50,064 INFO L794 eck$LassoCheckResult]: Stem: 1092#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1090#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 1091#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1094#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1095#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1096#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1098#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1113#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1112#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1111#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1110#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1109#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1108#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1107#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1106#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1105#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1104#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1103#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1102#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1101#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1100#L6-3 assume !(init_nondet_~i~0 < 10); 1099#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1077#L17-3 [2018-11-23 04:40:50,064 INFO L796 eck$LassoCheckResult]: Loop: 1077#L17-3 assume !!(rangesum_~i~1 < 10); 1085#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1076#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1077#L17-3 [2018-11-23 04:40:50,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,064 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2018-11-23 04:40:50,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:50,130 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:50,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:50,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:50,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:40:50,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 04:40:50,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:50,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 04:40:50,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:50,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 04:40:50,204 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:50,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,204 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 10 times [2018-11-23 04:40:50,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:50,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 04:40:50,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 04:40:50,227 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. cyclomatic complexity: 14 Second operand 13 states. [2018-11-23 04:40:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:50,252 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-23 04:40:50,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 04:40:50,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 49 transitions. [2018-11-23 04:40:50,254 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:50,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 49 transitions. [2018-11-23 04:40:50,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 04:40:50,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 04:40:50,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2018-11-23 04:40:50,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:50,255 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-23 04:40:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2018-11-23 04:40:50,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 04:40:50,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 04:40:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-11-23 04:40:50,257 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-23 04:40:50,257 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-11-23 04:40:50,257 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 04:40:50,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2018-11-23 04:40:50,258 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:50,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:50,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:50,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2018-11-23 04:40:50,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:50,258 INFO L794 eck$LassoCheckResult]: Stem: 1249#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1247#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 1248#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1251#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1252#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1253#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1256#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1272#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1271#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1270#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1269#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1268#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1267#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1266#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1265#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1264#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1263#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1262#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1261#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1260#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1259#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1258#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1257#L6-3 assume !(init_nondet_~i~0 < 10); 1255#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1234#L17-3 [2018-11-23 04:40:50,259 INFO L796 eck$LassoCheckResult]: Loop: 1234#L17-3 assume !!(rangesum_~i~1 < 10); 1242#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1233#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1234#L17-3 [2018-11-23 04:40:50,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2018-11-23 04:40:50,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:50,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,281 INFO L82 PathProgramCache]: Analyzing trace with hash 53723, now seen corresponding path program 11 times [2018-11-23 04:40:50,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:50,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1328180093, now seen corresponding path program 1 times [2018-11-23 04:40:50,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:50,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:50,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:50,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 04:40:50,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 04:40:50,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 04:40:50,357 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-23 04:40:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:50,384 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 04:40:50,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 04:40:50,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 58 transitions. [2018-11-23 04:40:50,385 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:50,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 58 transitions. [2018-11-23 04:40:50,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 04:40:50,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 04:40:50,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 58 transitions. [2018-11-23 04:40:50,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:50,386 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-11-23 04:40:50,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 58 transitions. [2018-11-23 04:40:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-23 04:40:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 04:40:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2018-11-23 04:40:50,388 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-23 04:40:50,388 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 55 transitions. [2018-11-23 04:40:50,388 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 04:40:50,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 55 transitions. [2018-11-23 04:40:50,389 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:50,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:50,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:50,391 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:50,391 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:50,392 INFO L794 eck$LassoCheckResult]: Stem: 1348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1345#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);init_nondet_#in~x.base, init_nondet_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc init_nondet_#t~nondet1, init_nondet_#t~post0, init_nondet_~x.base, init_nondet_~x.offset, init_nondet_~i~0;init_nondet_~x.base, init_nondet_~x.offset := init_nondet_#in~x.base, init_nondet_#in~x.offset;havoc init_nondet_~i~0;init_nondet_~i~0 := 0; 1346#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1350#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1351#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1352#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1375#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1374#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1373#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1372#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1371#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1370#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1369#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1368#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1367#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1366#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1365#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1364#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1362#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1361#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1360#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1358#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1357#L6-3 assume !(init_nondet_~i~0 < 10); 1355#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1353#L17-3 assume !!(rangesum_~i~1 < 10); 1340#L18 assume !(rangesum_~i~1 > 5); 1330#L17-2 [2018-11-23 04:40:50,392 INFO L796 eck$LassoCheckResult]: Loop: 1330#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1331#L17-3 assume !!(rangesum_~i~1 < 10); 1363#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1330#L17-2 [2018-11-23 04:40:50,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,392 INFO L82 PathProgramCache]: Analyzing trace with hash -95702812, now seen corresponding path program 1 times [2018-11-23 04:40:50,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:50,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 12 times [2018-11-23 04:40:50,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:50,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash 775842814, now seen corresponding path program 1 times [2018-11-23 04:40:50,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:50,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:50,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:50,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:50,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:50,520 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:50,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:50,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-11-23 04:40:50,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 04:40:50,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 04:40:50,591 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. cyclomatic complexity: 14 Second operand 5 states. [2018-11-23 04:40:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:50,635 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-11-23 04:40:50,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:40:50,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2018-11-23 04:40:50,637 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:50,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 67 transitions. [2018-11-23 04:40:50,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-23 04:40:50,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-23 04:40:50,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 67 transitions. [2018-11-23 04:40:50,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:50,638 INFO L705 BuchiCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-11-23 04:40:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 67 transitions. [2018-11-23 04:40:50,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-11-23 04:40:50,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 04:40:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2018-11-23 04:40:50,640 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-23 04:40:50,641 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 64 transitions. [2018-11-23 04:40:50,641 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 04:40:50,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 64 transitions. [2018-11-23 04:40:50,644 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:50,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:50,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:50,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 04:40:50,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:50,645 INFO L794 eck$LassoCheckResult]: Stem: 1548#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1545#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 1546#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1550#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1551#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1552#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1555#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1579#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1578#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1577#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1576#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1575#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1574#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1573#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1572#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1570#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1569#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1565#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1564#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1563#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1562#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1559#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1558#L6-3 assume !(init_nondet_~i~0 < 10); 1556#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1557#L17-3 assume !!(rangesum_~i~1 < 10); 1571#L18 assume !(rangesum_~i~1 > 5); 1528#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1529#L17-3 assume !!(rangesum_~i~1 < 10); 1538#L18 assume !(rangesum_~i~1 > 5); 1539#L17-2 [2018-11-23 04:40:50,645 INFO L796 eck$LassoCheckResult]: Loop: 1539#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1567#L17-3 assume !!(rangesum_~i~1 < 10); 1568#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1539#L17-2 [2018-11-23 04:40:50,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,645 INFO L82 PathProgramCache]: Analyzing trace with hash 775842816, now seen corresponding path program 1 times [2018-11-23 04:40:50,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:50,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 13 times [2018-11-23 04:40:50,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:50,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1914342242, now seen corresponding path program 2 times [2018-11-23 04:40:50,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:50,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:50,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:50,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:50,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 04:40:50,765 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 04:40:50,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:50,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:50,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:50,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 04:40:50,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 04:40:50,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 04:40:50,830 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. cyclomatic complexity: 14 Second operand 6 states. [2018-11-23 04:40:50,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:50,876 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-23 04:40:50,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 04:40:50,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 76 transitions. [2018-11-23 04:40:50,877 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:50,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 76 transitions. [2018-11-23 04:40:50,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-23 04:40:50,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-23 04:40:50,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 76 transitions. [2018-11-23 04:40:50,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:50,879 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 76 transitions. [2018-11-23 04:40:50,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 76 transitions. [2018-11-23 04:40:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2018-11-23 04:40:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 04:40:50,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-23 04:40:50,881 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-23 04:40:50,881 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-23 04:40:50,881 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 04:40:50,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 73 transitions. [2018-11-23 04:40:50,882 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:50,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:50,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:50,883 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 2, 1, 1, 1, 1] [2018-11-23 04:40:50,883 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:50,883 INFO L794 eck$LassoCheckResult]: Stem: 1773#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1770#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 1771#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1775#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1776#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1777#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1804#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1803#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1802#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1801#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1800#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1799#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1798#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1797#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1796#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1795#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1794#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1792#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1789#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1788#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1787#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 1784#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 1783#L6-3 assume !(init_nondet_~i~0 < 10); 1781#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 1778#L17-3 assume !!(rangesum_~i~1 < 10); 1764#L18 assume !(rangesum_~i~1 > 5); 1754#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1755#L17-3 assume !!(rangesum_~i~1 < 10); 1808#L18 assume !(rangesum_~i~1 > 5); 1807#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1806#L17-3 assume !!(rangesum_~i~1 < 10); 1805#L18 assume !(rangesum_~i~1 > 5); 1793#L17-2 [2018-11-23 04:40:50,883 INFO L796 eck$LassoCheckResult]: Loop: 1793#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 1790#L17-3 assume !!(rangesum_~i~1 < 10); 1791#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 1793#L17-2 [2018-11-23 04:40:50,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1914342244, now seen corresponding path program 2 times [2018-11-23 04:40:50,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:50,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 14 times [2018-11-23 04:40:50,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:50,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:50,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:50,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065278, now seen corresponding path program 3 times [2018-11-23 04:40:50,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:50,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:50,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:50,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:50,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:50,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:50,945 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:50,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:40:50,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 04:40:50,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:50,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:51,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:51,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 04:40:51,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:40:51,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:40:51,041 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. cyclomatic complexity: 14 Second operand 7 states. [2018-11-23 04:40:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:51,092 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-11-23 04:40:51,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 04:40:51,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 85 transitions. [2018-11-23 04:40:51,094 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:51,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 76 states and 85 transitions. [2018-11-23 04:40:51,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2018-11-23 04:40:51,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-23 04:40:51,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 85 transitions. [2018-11-23 04:40:51,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:51,095 INFO L705 BuchiCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-11-23 04:40:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 85 transitions. [2018-11-23 04:40:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-11-23 04:40:51,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 04:40:51,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-11-23 04:40:51,100 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-11-23 04:40:51,100 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-11-23 04:40:51,100 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 04:40:51,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 82 transitions. [2018-11-23 04:40:51,101 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:51,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:51,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:51,101 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 3, 1, 1, 1, 1] [2018-11-23 04:40:51,101 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:51,102 INFO L794 eck$LassoCheckResult]: Stem: 2028#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2025#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 2026#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2030#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2031#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2032#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2058#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2057#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2056#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2055#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2054#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2053#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2052#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2051#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2050#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2049#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2048#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2046#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2043#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2042#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2040#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2037#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2036#L6-3 assume !(init_nondet_~i~0 < 10); 2034#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2035#L17-3 assume !!(rangesum_~i~1 < 10); 2070#L18 assume !(rangesum_~i~1 > 5); 2008#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2009#L17-3 assume !!(rangesum_~i~1 < 10); 2018#L18 assume !(rangesum_~i~1 > 5); 2019#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2068#L17-3 assume !!(rangesum_~i~1 < 10); 2066#L18 assume !(rangesum_~i~1 > 5); 2064#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2063#L17-3 assume !!(rangesum_~i~1 < 10); 2061#L18 assume !(rangesum_~i~1 > 5); 2047#L17-2 [2018-11-23 04:40:51,102 INFO L796 eck$LassoCheckResult]: Loop: 2047#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2044#L17-3 assume !!(rangesum_~i~1 < 10); 2045#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2047#L17-2 [2018-11-23 04:40:51,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:51,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1594065280, now seen corresponding path program 3 times [2018-11-23 04:40:51,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:51,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:51,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:51,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:51,120 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 15 times [2018-11-23 04:40:51,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:51,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:51,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:51,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:51,124 INFO L82 PathProgramCache]: Analyzing trace with hash -654604830, now seen corresponding path program 4 times [2018-11-23 04:40:51,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:51,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:51,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:51,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:51,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:51,168 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:51,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 04:40:51,201 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 04:40:51,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:51,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:51,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:51,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 04:40:51,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 04:40:51,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 04:40:51,263 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. cyclomatic complexity: 14 Second operand 8 states. [2018-11-23 04:40:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:51,311 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2018-11-23 04:40:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:40:51,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 94 transitions. [2018-11-23 04:40:51,312 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:51,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 94 transitions. [2018-11-23 04:40:51,312 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-23 04:40:51,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-23 04:40:51,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 94 transitions. [2018-11-23 04:40:51,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:51,313 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-23 04:40:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 94 transitions. [2018-11-23 04:40:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-11-23 04:40:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 04:40:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-11-23 04:40:51,314 INFO L728 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-11-23 04:40:51,314 INFO L608 BuchiCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-11-23 04:40:51,314 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 04:40:51,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 91 transitions. [2018-11-23 04:40:51,315 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:51,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:51,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:51,315 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 4, 1, 1, 1, 1] [2018-11-23 04:40:51,315 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:51,315 INFO L794 eck$LassoCheckResult]: Stem: 2310#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2307#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 2308#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2312#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2313#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2314#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2340#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2339#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2338#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2337#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2336#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2335#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2334#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2333#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2332#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2331#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2330#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2328#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2325#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2324#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2322#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2319#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2318#L6-3 assume !(init_nondet_~i~0 < 10); 2316#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2317#L17-3 assume !!(rangesum_~i~1 < 10); 2358#L18 assume !(rangesum_~i~1 > 5); 2290#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2291#L17-3 assume !!(rangesum_~i~1 < 10); 2300#L18 assume !(rangesum_~i~1 > 5); 2301#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2356#L17-3 assume !!(rangesum_~i~1 < 10); 2354#L18 assume !(rangesum_~i~1 > 5); 2352#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2350#L17-3 assume !!(rangesum_~i~1 < 10); 2348#L18 assume !(rangesum_~i~1 > 5); 2346#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2345#L17-3 assume !!(rangesum_~i~1 < 10); 2343#L18 assume !(rangesum_~i~1 > 5); 2329#L17-2 [2018-11-23 04:40:51,315 INFO L796 eck$LassoCheckResult]: Loop: 2329#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2326#L17-3 assume !!(rangesum_~i~1 < 10); 2327#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2329#L17-2 [2018-11-23 04:40:51,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:51,315 INFO L82 PathProgramCache]: Analyzing trace with hash -654604828, now seen corresponding path program 4 times [2018-11-23 04:40:51,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:51,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:51,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:51,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 16 times [2018-11-23 04:40:51,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:51,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:51,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:51,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:51,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090750, now seen corresponding path program 5 times [2018-11-23 04:40:51,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:51,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:51,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:51,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:51,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:51,425 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 04:40:51,456 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-23 04:40:51,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:51,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:51,464 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 04:40:51,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 04:40:51,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 04:40:51,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 04:40:51,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 04:40:51,498 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. cyclomatic complexity: 14 Second operand 9 states. [2018-11-23 04:40:51,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:51,543 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2018-11-23 04:40:51,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:40:51,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 103 transitions. [2018-11-23 04:40:51,543 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 14 [2018-11-23 04:40:51,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 103 transitions. [2018-11-23 04:40:51,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2018-11-23 04:40:51,544 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2018-11-23 04:40:51,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 103 transitions. [2018-11-23 04:40:51,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 04:40:51,544 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 103 transitions. [2018-11-23 04:40:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 103 transitions. [2018-11-23 04:40:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-11-23 04:40:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 04:40:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-11-23 04:40:51,545 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-11-23 04:40:51,546 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-11-23 04:40:51,546 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 04:40:51,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 100 transitions. [2018-11-23 04:40:51,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2018-11-23 04:40:51,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:51,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:51,546 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 5, 1, 1, 1, 1] [2018-11-23 04:40:51,546 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:51,547 INFO L794 eck$LassoCheckResult]: Stem: 2620#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2617#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 2618#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2622#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2623#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2624#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2650#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2649#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2648#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2647#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2646#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2645#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2644#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2643#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2642#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2641#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2639#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2636#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2635#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2633#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2630#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2629#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2628#L6-3 assume !(init_nondet_~i~0 < 10); 2626#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2627#L17-3 assume !!(rangesum_~i~1 < 10); 2674#L18 assume !(rangesum_~i~1 > 5); 2600#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2601#L17-3 assume !!(rangesum_~i~1 < 10); 2610#L18 assume !(rangesum_~i~1 > 5); 2611#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2672#L17-3 assume !!(rangesum_~i~1 < 10); 2670#L18 assume !(rangesum_~i~1 > 5); 2668#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2666#L17-3 assume !!(rangesum_~i~1 < 10); 2664#L18 assume !(rangesum_~i~1 > 5); 2662#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2660#L17-3 assume !!(rangesum_~i~1 < 10); 2658#L18 assume !(rangesum_~i~1 > 5); 2656#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2655#L17-3 assume !!(rangesum_~i~1 < 10); 2653#L18 assume !(rangesum_~i~1 > 5); 2640#L17-2 [2018-11-23 04:40:51,547 INFO L796 eck$LassoCheckResult]: Loop: 2640#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2637#L17-3 assume !!(rangesum_~i~1 < 10); 2638#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2640#L17-2 [2018-11-23 04:40:51,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash 2114090752, now seen corresponding path program 5 times [2018-11-23 04:40:51,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:51,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:51,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:51,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:51,566 INFO L82 PathProgramCache]: Analyzing trace with hash 60353, now seen corresponding path program 17 times [2018-11-23 04:40:51,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:51,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:51,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:51,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash -522805150, now seen corresponding path program 6 times [2018-11-23 04:40:51,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:51,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:51,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:51,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:55,024 WARN L180 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 242 DAG size of output: 177 [2018-11-23 04:40:55,132 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:55,132 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:55,132 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:55,132 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:55,132 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:40:55,133 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:55,133 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:55,133 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:55,133 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration18_Lasso [2018-11-23 04:40:55,133 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:55,133 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:55,136 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-23 04:40:55,138 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-23 04:40:55,139 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-23 04:40:55,145 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-23 04:40:55,146 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-23 04:40:55,148 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-23 04:40:55,148 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-23 04:40:55,149 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-23 04:40:55,150 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-23 04:40:55,151 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-23 04:40:55,153 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-23 04:40:55,154 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-23 04:40:55,155 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-23 04:40:55,155 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-23 04:40:55,156 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-23 04:40:55,157 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-23 04:40:55,158 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-23 04:40:55,159 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-23 04:40:55,234 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-23 04:40:55,235 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-23 04:40:55,236 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-23 04:40:55,236 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-23 04:40:55,238 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-23 04:40:55,239 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-23 04:40:55,394 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:55,394 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:40:55,395 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-23 04:40:55,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,397 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-23 04:40:55,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,399 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-23 04:40:55,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:55,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:55,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,401 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-23 04:40:55,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,403 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-23 04:40:55,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:55,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:55,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,406 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-23 04:40:55,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,407 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-23 04:40:55,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,409 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-23 04:40:55,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,410 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-23 04:40:55,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,412 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-23 04:40:55,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:55,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:55,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,414 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-23 04:40:55,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,416 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-23 04:40:55,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,417 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-23 04:40:55,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,419 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-23 04:40:55,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,420 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-23 04:40:55,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,422 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-23 04:40:55,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,424 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-23 04:40:55,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:55,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:55,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:55,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,425 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-23 04:40:55,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:55,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:55,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 04:40:55,430 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-23 04:40:55,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:55,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:55,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:55,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:55,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 04:40:55,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 04:40:55,441 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:40:55,453 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 04:40:55,453 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-23 04:40:55,453 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:40:55,454 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 04:40:55,454 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:40:55,455 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 17 Supporting invariants [] [2018-11-23 04:40:55,525 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 04:40:55,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:55,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:55,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:55,602 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-23 04:40:55,602 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-23 04:40:55,602 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 100 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-23 04:40:55,623 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 100 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 104 states and 116 transitions. Complement of second has 7 states. [2018-11-23 04:40:55,624 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-23 04:40:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 04:40:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-23 04:40:55,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 3 letters. [2018-11-23 04:40:55,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:40:55,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 44 letters. Loop has 3 letters. [2018-11-23 04:40:55,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:40:55,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 41 letters. Loop has 6 letters. [2018-11-23 04:40:55,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:40:55,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 116 transitions. [2018-11-23 04:40:55,627 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 04:40:55,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 93 states and 104 transitions. [2018-11-23 04:40:55,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-23 04:40:55,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2018-11-23 04:40:55,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 104 transitions. [2018-11-23 04:40:55,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:40:55,629 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-23 04:40:55,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 104 transitions. [2018-11-23 04:40:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-11-23 04:40:55,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-23 04:40:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2018-11-23 04:40:55,631 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-23 04:40:55,631 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 104 transitions. [2018-11-23 04:40:55,631 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 04:40:55,631 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 104 transitions. [2018-11-23 04:40:55,632 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 04:40:55,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:55,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:55,633 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:55,633 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:55,633 INFO L794 eck$LassoCheckResult]: Stem: 2986#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2983#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 2984#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2988#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2989#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 2990#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 2993#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3040#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3039#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3038#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3037#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3036#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3035#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3034#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3033#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3032#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3031#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3030#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3029#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3028#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3027#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3026#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3025#L6-3 assume !(init_nondet_~i~0 < 10); 2994#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2992#L17-3 assume !!(rangesum_~i~1 < 10); 2976#L18 assume !(rangesum_~i~1 > 5); 2964#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2965#L17-3 assume !!(rangesum_~i~1 < 10); 2977#L18 assume !(rangesum_~i~1 > 5); 2978#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3022#L17-3 assume !!(rangesum_~i~1 < 10); 3020#L18 assume !(rangesum_~i~1 > 5); 3018#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3016#L17-3 assume !!(rangesum_~i~1 < 10); 3014#L18 assume !(rangesum_~i~1 > 5); 3012#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3010#L17-3 assume !!(rangesum_~i~1 < 10); 3008#L18 assume !(rangesum_~i~1 > 5); 3006#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3004#L17-3 assume !!(rangesum_~i~1 < 10); 3002#L18 assume !(rangesum_~i~1 > 5); 2999#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2997#L17-3 assume !(rangesum_~i~1 < 10); 2987#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 2968#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 2969#L17-8 assume !!(rangesum_~i~1 < 10); 2972#L18-2 assume !(rangesum_~i~1 > 5); 2973#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2985#L17-8 assume !!(rangesum_~i~1 < 10); 3024#L18-2 assume !(rangesum_~i~1 > 5); 3023#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3021#L17-8 assume !!(rangesum_~i~1 < 10); 3019#L18-2 assume !(rangesum_~i~1 > 5); 3017#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3015#L17-8 assume !!(rangesum_~i~1 < 10); 3013#L18-2 assume !(rangesum_~i~1 > 5); 3011#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3009#L17-8 assume !!(rangesum_~i~1 < 10); 3007#L18-2 assume !(rangesum_~i~1 > 5); 3005#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3003#L17-8 assume !!(rangesum_~i~1 < 10); 3000#L18-2 assume !(rangesum_~i~1 > 5); 2998#L17-7 [2018-11-23 04:40:55,634 INFO L796 eck$LassoCheckResult]: Loop: 2998#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 2995#L17-8 assume !!(rangesum_~i~1 < 10); 2996#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 2998#L17-7 [2018-11-23 04:40:55,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash -365260545, now seen corresponding path program 1 times [2018-11-23 04:40:55,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:55,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:55,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:55,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 04:40:55,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:55,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 04:40:55,671 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:55,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:55,671 INFO L82 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2018-11-23 04:40:55,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:55,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:55,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:55,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:55,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 04:40:55,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 04:40:55,741 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-23 04:40:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:55,787 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2018-11-23 04:40:55,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 04:40:55,787 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 123 transitions. [2018-11-23 04:40:55,788 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-11-23 04:40:55,788 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 106 states and 119 transitions. [2018-11-23 04:40:55,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2018-11-23 04:40:55,788 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2018-11-23 04:40:55,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 106 states and 119 transitions. [2018-11-23 04:40:55,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:40:55,788 INFO L705 BuchiCegarLoop]: Abstraction has 106 states and 119 transitions. [2018-11-23 04:40:55,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 119 transitions. [2018-11-23 04:40:55,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2018-11-23 04:40:55,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-23 04:40:55,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2018-11-23 04:40:55,790 INFO L728 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-11-23 04:40:55,790 INFO L608 BuchiCegarLoop]: Abstraction has 95 states and 104 transitions. [2018-11-23 04:40:55,790 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 04:40:55,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 104 transitions. [2018-11-23 04:40:55,790 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-23 04:40:55,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:55,790 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:55,791 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:55,791 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:55,791 INFO L794 eck$LassoCheckResult]: Stem: 3193#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3190#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 3191#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3195#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3196#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3197#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3223#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3222#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3221#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3220#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3219#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3218#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3217#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3216#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3215#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3214#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3213#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3212#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3211#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3210#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3209#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 3207#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 3206#L6-3 assume !(init_nondet_~i~0 < 10); 3200#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3198#L17-3 assume !!(rangesum_~i~1 < 10); 3184#L18 assume !(rangesum_~i~1 > 5); 3172#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3173#L17-3 assume !!(rangesum_~i~1 < 10); 3185#L18 assume !(rangesum_~i~1 > 5); 3174#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3175#L17-3 assume !!(rangesum_~i~1 < 10); 3247#L18 assume !(rangesum_~i~1 > 5); 3245#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3243#L17-3 assume !!(rangesum_~i~1 < 10); 3241#L18 assume !(rangesum_~i~1 > 5); 3239#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3237#L17-3 assume !!(rangesum_~i~1 < 10); 3235#L18 assume !(rangesum_~i~1 > 5); 3233#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3231#L17-3 assume !!(rangesum_~i~1 < 10); 3229#L18 assume !(rangesum_~i~1 > 5); 3225#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3227#L17-3 assume !!(rangesum_~i~1 < 10); 3224#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 3205#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3203#L17-3 assume !(rangesum_~i~1 < 10); 3194#L17-4 assume !(0 != rangesum_~cnt~0);rangesum_#res := 0; 3176#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 3177#L17-8 assume !!(rangesum_~i~1 < 10); 3180#L18-2 assume !(rangesum_~i~1 > 5); 3181#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3192#L17-8 assume !!(rangesum_~i~1 < 10); 3250#L18-2 assume !(rangesum_~i~1 > 5); 3249#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3248#L17-8 assume !!(rangesum_~i~1 < 10); 3246#L18-2 assume !(rangesum_~i~1 > 5); 3244#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3242#L17-8 assume !!(rangesum_~i~1 < 10); 3240#L18-2 assume !(rangesum_~i~1 > 5); 3238#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3236#L17-8 assume !!(rangesum_~i~1 < 10); 3234#L18-2 assume !(rangesum_~i~1 > 5); 3232#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3230#L17-8 assume !!(rangesum_~i~1 < 10); 3228#L18-2 assume !(rangesum_~i~1 > 5); 3208#L17-7 [2018-11-23 04:40:55,791 INFO L796 eck$LassoCheckResult]: Loop: 3208#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 3226#L17-8 assume !!(rangesum_~i~1 < 10); 3202#L18-2 assume !(rangesum_~i~1 > 5); 3208#L17-7 [2018-11-23 04:40:55,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:55,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1039890653, now seen corresponding path program 1 times [2018-11-23 04:40:55,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:55,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:55,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:55,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 04:40:55,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 04:40:55,817 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:55,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:55,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-11-23 04:40:55,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:40:55,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-23 04:40:55,879 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:55,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash 85180, now seen corresponding path program 1 times [2018-11-23 04:40:55,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:55,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:55,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:55,895 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:55,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:55,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:55,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:55,896 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 04:40:55,896 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:55,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:55,896 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:55,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration20_Loop [2018-11-23 04:40:55,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:55,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:55,896 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-23 04:40:55,905 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-23 04:40:55,913 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:55,913 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:55,917 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 04:40:55,917 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:55,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 04:40:55,935 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 04:40:55,992 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 04:40:55,993 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:40:55,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:40:55,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:40:55,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:40:55,993 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:40:55,993 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:40:55,993 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:40:55,993 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:40:55,993 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration20_Loop [2018-11-23 04:40:55,993 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:40:55,994 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:40:55,994 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-23 04:40:55,997 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-23 04:40:56,004 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 04:40:56,005 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 04:40:56,005 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-23 04:40:56,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 04:40:56,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 04:40:56,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 04:40:56,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 04:40:56,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 04:40:56,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 04:40:56,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 04:40:56,007 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 04:40:56,007 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 04:40:56,007 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 04:40:56,007 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 04:40:56,008 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 04:40:56,008 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 04:40:56,008 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_rangesum_~i~1) = -2*ULTIMATE.start_rangesum_~i~1 + 9 Supporting invariants [] [2018-11-23 04:40:56,008 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 04:40:56,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:56,064 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-23 04:40:56,065 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-23 04:40:56,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 104 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-23 04:40:56,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 104 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 114 states and 126 transitions. Complement of second has 5 states. [2018-11-23 04:40:56,089 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-23 04:40:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 04:40:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-23 04:40:56,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 3 letters. [2018-11-23 04:40:56,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:40:56,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 68 letters. Loop has 3 letters. [2018-11-23 04:40:56,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:40:56,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 65 letters. Loop has 6 letters. [2018-11-23 04:40:56,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 04:40:56,091 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2018-11-23 04:40:56,092 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 04:40:56,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 99 states and 109 transitions. [2018-11-23 04:40:56,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-23 04:40:56,093 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-23 04:40:56,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 109 transitions. [2018-11-23 04:40:56,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:40:56,095 INFO L705 BuchiCegarLoop]: Abstraction has 99 states and 109 transitions. [2018-11-23 04:40:56,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 109 transitions. [2018-11-23 04:40:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-11-23 04:40:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 04:40:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2018-11-23 04:40:56,097 INFO L728 BuchiCegarLoop]: Abstraction has 98 states and 108 transitions. [2018-11-23 04:40:56,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:40:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:40:56,098 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 7 states. [2018-11-23 04:40:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:56,200 INFO L93 Difference]: Finished difference Result 137 states and 157 transitions. [2018-11-23 04:40:56,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 04:40:56,200 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 157 transitions. [2018-11-23 04:40:56,201 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2018-11-23 04:40:56,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 135 states and 154 transitions. [2018-11-23 04:40:56,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2018-11-23 04:40:56,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-23 04:40:56,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 154 transitions. [2018-11-23 04:40:56,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:40:56,203 INFO L705 BuchiCegarLoop]: Abstraction has 135 states and 154 transitions. [2018-11-23 04:40:56,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 154 transitions. [2018-11-23 04:40:56,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 104. [2018-11-23 04:40:56,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 04:40:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2018-11-23 04:40:56,205 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-11-23 04:40:56,205 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 113 transitions. [2018-11-23 04:40:56,205 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 04:40:56,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 113 transitions. [2018-11-23 04:40:56,205 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 04:40:56,205 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:56,205 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:56,206 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:56,206 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:56,207 INFO L794 eck$LassoCheckResult]: Stem: 4080#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4076#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 4077#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4082#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4083#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4084#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4111#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4110#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4109#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4108#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4107#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4106#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4105#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4104#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4103#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4102#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4101#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4100#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4099#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4098#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4097#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4096#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4095#L6-3 assume !(init_nondet_~i~0 < 10); 4088#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4089#L17-3 assume !!(rangesum_~i~1 < 10); 4065#L18 assume !(rangesum_~i~1 > 5); 4051#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4052#L17-3 assume !!(rangesum_~i~1 < 10); 4130#L18 assume !(rangesum_~i~1 > 5); 4053#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4054#L17-3 assume !!(rangesum_~i~1 < 10); 4066#L18 assume !(rangesum_~i~1 > 5); 4067#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4129#L17-3 assume !!(rangesum_~i~1 < 10); 4128#L18 assume !(rangesum_~i~1 > 5); 4127#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4126#L17-3 assume !!(rangesum_~i~1 < 10); 4125#L18 assume !(rangesum_~i~1 > 5); 4124#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4123#L17-3 assume !!(rangesum_~i~1 < 10); 4122#L18 assume !(rangesum_~i~1 > 5); 4114#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4121#L17-3 assume !!(rangesum_~i~1 < 10); 4120#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4113#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4117#L17-3 assume !!(rangesum_~i~1 < 10); 4112#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4093#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4085#L17-3 assume !(rangesum_~i~1 < 10); 4081#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 4055#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4056#L17-8 assume !!(rangesum_~i~1 < 10); 4059#L18-2 assume !(rangesum_~i~1 > 5); 4060#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4078#L17-8 assume !!(rangesum_~i~1 < 10); 4134#L18-2 assume !(rangesum_~i~1 > 5); 4133#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4131#L17-8 assume !!(rangesum_~i~1 < 10); 4132#L18-2 assume !(rangesum_~i~1 > 5); 4139#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4138#L17-8 assume !!(rangesum_~i~1 < 10); 4137#L18-2 assume !(rangesum_~i~1 > 5); 4136#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4135#L17-8 assume !!(rangesum_~i~1 < 10); 4061#L18-2 assume !(rangesum_~i~1 > 5); 4062#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4140#L17-8 assume !!(rangesum_~i~1 < 10); 4119#L18-2 assume !(rangesum_~i~1 > 5); 4118#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4072#L17-8 assume !!(rangesum_~i~1 < 10); 4073#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4115#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4116#L17-8 assume !!(rangesum_~i~1 < 10); 4092#L18-2 [2018-11-23 04:40:56,207 INFO L796 eck$LassoCheckResult]: Loop: 4092#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4094#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4091#L17-8 assume !!(rangesum_~i~1 < 10); 4092#L18-2 [2018-11-23 04:40:56,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,207 INFO L82 PathProgramCache]: Analyzing trace with hash 2012858871, now seen corresponding path program 1 times [2018-11-23 04:40:56,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,226 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 04:40:56,226 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 04:40:56,226 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 04:40:56,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 04:40:56,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-11-23 04:40:56,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:40:56,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 04:40:56,372 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:56,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,373 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 2 times [2018-11-23 04:40:56,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:56,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:56,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:56,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 04:40:56,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 04:40:56,423 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. cyclomatic complexity: 15 Second operand 11 states. [2018-11-23 04:40:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:56,509 INFO L93 Difference]: Finished difference Result 138 states and 156 transitions. [2018-11-23 04:40:56,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 04:40:56,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 156 transitions. [2018-11-23 04:40:56,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-23 04:40:56,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 136 states and 154 transitions. [2018-11-23 04:40:56,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2018-11-23 04:40:56,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2018-11-23 04:40:56,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 136 states and 154 transitions. [2018-11-23 04:40:56,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:40:56,512 INFO L705 BuchiCegarLoop]: Abstraction has 136 states and 154 transitions. [2018-11-23 04:40:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states and 154 transitions. [2018-11-23 04:40:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 110. [2018-11-23 04:40:56,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 04:40:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2018-11-23 04:40:56,514 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-11-23 04:40:56,514 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 120 transitions. [2018-11-23 04:40:56,514 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-23 04:40:56,514 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 120 transitions. [2018-11-23 04:40:56,514 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 04:40:56,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:56,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:56,515 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:56,515 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:56,516 INFO L794 eck$LassoCheckResult]: Stem: 4551#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4546#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 4547#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4553#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4554#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4555#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4583#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4582#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4581#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4580#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4579#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4578#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4577#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4576#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4575#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4574#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4573#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4572#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4571#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4570#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4569#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 4568#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 4567#L6-3 assume !(init_nondet_~i~0 < 10); 4560#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4561#L17-3 assume !!(rangesum_~i~1 < 10); 4537#L18 assume !(rangesum_~i~1 > 5); 4523#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4524#L17-3 assume !!(rangesum_~i~1 < 10); 4538#L18 assume !(rangesum_~i~1 > 5); 4525#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4526#L17-3 assume !!(rangesum_~i~1 < 10); 4557#L18 assume !(rangesum_~i~1 > 5); 4608#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4607#L17-3 assume !!(rangesum_~i~1 < 10); 4606#L18 assume !(rangesum_~i~1 > 5); 4605#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4604#L17-3 assume !!(rangesum_~i~1 < 10); 4603#L18 assume !(rangesum_~i~1 > 5); 4602#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4601#L17-3 assume !!(rangesum_~i~1 < 10); 4600#L18 assume !(rangesum_~i~1 > 5); 4586#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4599#L17-3 assume !!(rangesum_~i~1 < 10); 4598#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4597#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4596#L17-3 assume !!(rangesum_~i~1 < 10); 4595#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4585#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4587#L17-3 assume !!(rangesum_~i~1 < 10); 4584#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4565#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4556#L17-3 assume !(rangesum_~i~1 < 10); 4552#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 4527#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 4528#L17-8 assume !!(rangesum_~i~1 < 10); 4543#L18-2 assume !(rangesum_~i~1 > 5); 4548#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4549#L17-8 assume !!(rangesum_~i~1 < 10); 4612#L18-2 assume !(rangesum_~i~1 > 5); 4611#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4609#L17-8 assume !!(rangesum_~i~1 < 10); 4610#L18-2 assume !(rangesum_~i~1 > 5); 4617#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4616#L17-8 assume !!(rangesum_~i~1 < 10); 4615#L18-2 assume !(rangesum_~i~1 > 5); 4614#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4613#L17-8 assume !!(rangesum_~i~1 < 10); 4533#L18-2 assume !(rangesum_~i~1 > 5); 4534#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4618#L17-8 assume !!(rangesum_~i~1 < 10); 4594#L18-2 assume !(rangesum_~i~1 > 5); 4593#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4592#L17-8 assume !!(rangesum_~i~1 < 10); 4531#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4532#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4591#L17-8 assume !!(rangesum_~i~1 < 10); 4590#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4589#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4588#L17-8 assume !!(rangesum_~i~1 < 10); 4564#L18-2 [2018-11-23 04:40:56,516 INFO L796 eck$LassoCheckResult]: Loop: 4564#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 4566#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 4563#L17-8 assume !!(rangesum_~i~1 < 10); 4564#L18-2 [2018-11-23 04:40:56,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1646097460, now seen corresponding path program 2 times [2018-11-23 04:40:56,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:56,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,521 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 04:40:56,521 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 04:40:56,521 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 04:40:56,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 04:40:56,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 04:40:56,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:56,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2018-11-23 04:40:56,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 04:40:56,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 04:40:56,709 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 04:40:56,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 3 times [2018-11-23 04:40:56,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:56,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:56,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 04:40:56,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 04:40:56,743 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. cyclomatic complexity: 16 Second operand 12 states. [2018-11-23 04:40:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:56,848 INFO L93 Difference]: Finished difference Result 141 states and 158 transitions. [2018-11-23 04:40:56,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 04:40:56,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 158 transitions. [2018-11-23 04:40:56,850 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2018-11-23 04:40:56,850 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 156 transitions. [2018-11-23 04:40:56,850 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2018-11-23 04:40:56,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2018-11-23 04:40:56,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 156 transitions. [2018-11-23 04:40:56,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:40:56,851 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 156 transitions. [2018-11-23 04:40:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 156 transitions. [2018-11-23 04:40:56,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2018-11-23 04:40:56,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-23 04:40:56,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 127 transitions. [2018-11-23 04:40:56,853 INFO L728 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-11-23 04:40:56,853 INFO L608 BuchiCegarLoop]: Abstraction has 116 states and 127 transitions. [2018-11-23 04:40:56,853 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-23 04:40:56,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 127 transitions. [2018-11-23 04:40:56,854 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-23 04:40:56,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:56,854 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:56,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:56,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 04:40:56,855 INFO L794 eck$LassoCheckResult]: Stem: 5050#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5046#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 5047#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5052#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5053#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5054#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5098#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5097#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5096#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5095#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5093#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5091#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5089#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5087#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5085#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5083#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5081#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5079#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5077#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5075#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5073#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5071#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5070#L6-3 assume !(init_nondet_~i~0 < 10); 5059#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5060#L17-3 assume !!(rangesum_~i~1 < 10); 5037#L18 assume !(rangesum_~i~1 > 5); 5023#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5024#L17-3 assume !!(rangesum_~i~1 < 10); 5056#L18 assume !(rangesum_~i~1 > 5); 5025#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5026#L17-3 assume !!(rangesum_~i~1 < 10); 5038#L18 assume !(rangesum_~i~1 > 5); 5039#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5114#L17-3 assume !!(rangesum_~i~1 < 10); 5113#L18 assume !(rangesum_~i~1 > 5); 5112#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5111#L17-3 assume !!(rangesum_~i~1 < 10); 5110#L18 assume !(rangesum_~i~1 > 5); 5109#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5108#L17-3 assume !!(rangesum_~i~1 < 10); 5107#L18 assume !(rangesum_~i~1 > 5); 5067#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5106#L17-3 assume !!(rangesum_~i~1 < 10); 5105#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5104#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5103#L17-3 assume !!(rangesum_~i~1 < 10); 5102#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5101#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5100#L17-3 assume !!(rangesum_~i~1 < 10); 5099#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5066#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5068#L17-3 assume !!(rangesum_~i~1 < 10); 5065#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5064#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5055#L17-3 assume !(rangesum_~i~1 < 10); 5051#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 5027#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5028#L17-8 assume !!(rangesum_~i~1 < 10); 5031#L18-2 assume !(rangesum_~i~1 > 5); 5032#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5048#L17-8 assume !!(rangesum_~i~1 < 10); 5118#L18-2 assume !(rangesum_~i~1 > 5); 5117#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5115#L17-8 assume !!(rangesum_~i~1 < 10); 5116#L18-2 assume !(rangesum_~i~1 > 5); 5123#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5122#L17-8 assume !!(rangesum_~i~1 < 10); 5121#L18-2 assume !(rangesum_~i~1 > 5); 5120#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5119#L17-8 assume !!(rangesum_~i~1 < 10); 5033#L18-2 assume !(rangesum_~i~1 > 5); 5034#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5124#L17-8 assume !!(rangesum_~i~1 < 10); 5094#L18-2 assume !(rangesum_~i~1 > 5); 5092#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5090#L17-8 assume !!(rangesum_~i~1 < 10); 5088#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5086#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5084#L17-8 assume !!(rangesum_~i~1 < 10); 5082#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5080#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5078#L17-8 assume !!(rangesum_~i~1 < 10); 5076#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5074#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5072#L17-8 assume !!(rangesum_~i~1 < 10); 5063#L18-2 [2018-11-23 04:40:56,855 INFO L796 eck$LassoCheckResult]: Loop: 5063#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5069#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5062#L17-8 assume !!(rangesum_~i~1 < 10); 5063#L18-2 [2018-11-23 04:40:56,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:56,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1484601769, now seen corresponding path program 3 times [2018-11-23 04:40:56,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:56,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:56,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:56,862 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 04:40:56,862 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 04:40:56,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 04:40:56,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 04:40:56,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 04:40:56,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 04:40:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,038 INFO L82 PathProgramCache]: Analyzing trace with hash 81548, now seen corresponding path program 4 times [2018-11-23 04:40:57,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:57,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1801965686, now seen corresponding path program 4 times [2018-11-23 04:40:57,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,049 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 04:40:57,049 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 04:40:57,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 04:40:57,074 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 04:40:57,106 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 04:40:57,106 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 04:40:57,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 04:40:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2018-11-23 04:40:57,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 04:40:57,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 04:40:57,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 04:40:57,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 04:40:57,272 INFO L87 Difference]: Start difference. First operand 116 states and 127 transitions. cyclomatic complexity: 17 Second operand 7 states. [2018-11-23 04:40:57,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 04:40:57,329 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-11-23 04:40:57,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 04:40:57,329 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 143 transitions. [2018-11-23 04:40:57,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 04:40:57,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 115 states and 119 transitions. [2018-11-23 04:40:57,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-23 04:40:57,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-23 04:40:57,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 119 transitions. [2018-11-23 04:40:57,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 04:40:57,333 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-11-23 04:40:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 119 transitions. [2018-11-23 04:40:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2018-11-23 04:40:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 04:40:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2018-11-23 04:40:57,335 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-11-23 04:40:57,335 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 100 transitions. [2018-11-23 04:40:57,335 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-23 04:40:57,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 100 transitions. [2018-11-23 04:40:57,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 04:40:57,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 04:40:57,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 04:40:57,336 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 04:40:57,336 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 04:40:57,337 INFO L794 eck$LassoCheckResult]: Stem: 5576#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5572#L-1 havoc main_#res;havoc main_#t~ret4, main_#t~mem5, main_#t~mem6, main_#t~ret7, main_#t~mem8, main_#t~mem10, main_#t~post9, main_~i~2, main_#t~ret11, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc(40);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; 5573#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5578#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5579#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5580#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5639#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5638#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5637#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5636#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5635#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5634#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5633#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5632#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5631#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5630#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5629#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5627#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5625#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5623#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5621#L6-3 assume !!(init_nondet_~i~0 < 10);call write~int(init_nondet_#t~nondet1, init_nondet_~x.base, init_nondet_~x.offset + 4 * init_nondet_~i~0, 4);havoc init_nondet_#t~nondet1; 5618#L6-2 init_nondet_#t~post0 := init_nondet_~i~0;init_nondet_~i~0 := 1 + init_nondet_#t~post0;havoc init_nondet_#t~post0; 5617#L6-3 assume !(init_nondet_~i~0 < 10); 5584#L4 havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5581#L17-3 assume !!(rangesum_~i~1 < 10); 5564#L18 assume !(rangesum_~i~1 > 5); 5551#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5552#L17-3 assume !!(rangesum_~i~1 < 10); 5582#L18 assume !(rangesum_~i~1 > 5); 5553#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5554#L17-3 assume !!(rangesum_~i~1 < 10); 5565#L18 assume !(rangesum_~i~1 > 5); 5566#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5628#L17-3 assume !!(rangesum_~i~1 < 10); 5626#L18 assume !(rangesum_~i~1 > 5); 5624#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5622#L17-3 assume !!(rangesum_~i~1 < 10); 5620#L18 assume !(rangesum_~i~1 > 5); 5619#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5616#L17-3 assume !!(rangesum_~i~1 < 10); 5615#L18 assume !(rangesum_~i~1 > 5); 5610#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5613#L17-3 assume !!(rangesum_~i~1 < 10); 5609#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5607#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5605#L17-3 assume !!(rangesum_~i~1 < 10); 5603#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5601#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5599#L17-3 assume !!(rangesum_~i~1 < 10); 5597#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5595#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5593#L17-3 assume !!(rangesum_~i~1 < 10); 5591#L18 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5589#L17-2 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5587#L17-3 assume !(rangesum_~i~1 < 10); 5577#L17-4 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 5555#L26 main_#t~ret4 := rangesum_#res;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4;call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem5;havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem6;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);rangesum_#in~x.base, rangesum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc rangesum_#res;havoc rangesum_#t~mem3, rangesum_#t~post2, rangesum_~x.base, rangesum_~x.offset, rangesum_~i~1, rangesum_~ret~0, rangesum_~cnt~0;rangesum_~x.base, rangesum_~x.offset := rangesum_#in~x.base, rangesum_#in~x.offset;havoc rangesum_~i~1;havoc rangesum_~ret~0;rangesum_~ret~0 := 0;rangesum_~cnt~0 := 0;rangesum_~i~1 := 0; 5556#L17-8 assume !!(rangesum_~i~1 < 10); 5559#L18-2 assume !(rangesum_~i~1 > 5); 5560#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5574#L17-8 assume !!(rangesum_~i~1 < 10); 5646#L18-2 assume !(rangesum_~i~1 > 5); 5575#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5571#L17-8 assume !!(rangesum_~i~1 < 10); 5561#L18-2 assume !(rangesum_~i~1 > 5); 5562#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5645#L17-8 assume !!(rangesum_~i~1 < 10); 5644#L18-2 assume !(rangesum_~i~1 > 5); 5643#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5642#L17-8 assume !!(rangesum_~i~1 < 10); 5641#L18-2 assume !(rangesum_~i~1 > 5); 5640#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5612#L17-8 assume !!(rangesum_~i~1 < 10); 5614#L18-2 assume !(rangesum_~i~1 > 5); 5611#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5608#L17-8 assume !!(rangesum_~i~1 < 10); 5606#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5604#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5602#L17-8 assume !!(rangesum_~i~1 < 10); 5600#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5598#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5596#L17-8 assume !!(rangesum_~i~1 < 10); 5594#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5592#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5590#L17-8 assume !!(rangesum_~i~1 < 10); 5588#L18-2 assume rangesum_~i~1 > 5;call rangesum_#t~mem3 := read~int(rangesum_~x.base, rangesum_~x.offset + 4 * rangesum_~i~1, 4);rangesum_~ret~0 := rangesum_~ret~0 + rangesum_#t~mem3;havoc rangesum_#t~mem3;rangesum_~cnt~0 := 1 + rangesum_~cnt~0; 5586#L17-7 rangesum_#t~post2 := rangesum_~i~1;rangesum_~i~1 := 1 + rangesum_#t~post2;havoc rangesum_#t~post2; 5585#L17-8 assume !(rangesum_~i~1 < 10); 5567#L17-9 assume 0 != rangesum_~cnt~0;rangesum_#res := (if (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 <= 2147483647 then (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 else (if rangesum_~ret~0 < 0 && 0 != rangesum_~ret~0 % rangesum_~cnt~0 then (if rangesum_~cnt~0 < 0 then rangesum_~ret~0 / rangesum_~cnt~0 - 1 else 1 + rangesum_~ret~0 / rangesum_~cnt~0) else rangesum_~ret~0 / rangesum_~cnt~0) % 4294967296 - 4294967296); 5568#L26-1 main_#t~ret7 := rangesum_#res;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7;call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 5569#L43-3 [2018-11-23 04:40:57,337 INFO L796 eck$LassoCheckResult]: Loop: 5569#L43-3 assume !!(main_~i~2 < 9);call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~2), 4);call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~2, 4);havoc main_#t~mem10; 5570#L43-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 5569#L43-3 [2018-11-23 04:40:57,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash 817204024, now seen corresponding path program 1 times [2018-11-23 04:40:57,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 04:40:57,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,344 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 04:40:57,344 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 04:40:57,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:57,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,496 INFO L82 PathProgramCache]: Analyzing trace with hash 3331, now seen corresponding path program 1 times [2018-11-23 04:40:57,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 04:40:57,500 INFO L82 PathProgramCache]: Analyzing trace with hash -645945734, now seen corresponding path program 1 times [2018-11-23 04:40:57,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 04:40:57,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 04:40:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 04:40:57,507 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 04:40:57,507 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 04:40:57,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e8f47d33-8ba0-40bb-9e49-7355b9f75606/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-23 04:40:57,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 04:40:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:40:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 04:41:23,247 WARN L180 SmtUtils]: Spent 25.53 s on a formula simplification. DAG size of input: 515 DAG size of output: 377 [2018-11-23 04:41:41,823 WARN L180 SmtUtils]: Spent 16.70 s on a formula simplification. DAG size of input: 323 DAG size of output: 183 [2018-11-23 04:41:41,826 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 04:41:41,826 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 04:41:41,826 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 04:41:41,826 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 04:41:41,826 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 04:41:41,826 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 04:41:41,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 04:41:41,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 04:41:41,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: rangesum10_false-unreach-call_true-termination.i_Iteration24_Lasso [2018-11-23 04:41:41,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 04:41:41,826 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 04:41:41,828 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 04:41:41,964 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-23 04:41:41,977 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-23 04:41:41,981 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-23 04:41:41,982 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-23 04:41:41,984 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-23 04:41:42,425 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:286) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:958) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java: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-23 04:41:42,427 INFO L168 Benchmark]: Toolchain (without parser) took 55120.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 372.8 MB). Free memory was 959.2 MB in the beginning and 992.1 MB in the end (delta: -32.9 MB). Peak memory consumption was 445.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:42,427 INFO L168 Benchmark]: CDTParser took 0.13 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-23 04:41:42,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.86 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:42,428 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.48 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 04:41:42,428 INFO L168 Benchmark]: Boogie Preprocessor took 58.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:42,428 INFO L168 Benchmark]: RCFGBuilder took 242.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:42,429 INFO L168 Benchmark]: BuchiAutomizer took 54616.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.1 GB in the beginning and 992.1 MB in the end (delta: 117.2 MB). Peak memory consumption was 463.6 MB. Max. memory is 11.5 GB. [2018-11-23 04:41:42,431 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.13 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 170.86 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.6 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.48 ms. Allocated memory is still 1.0 GB. Free memory is still 945.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 242.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 54616.71 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.1 GB in the beginning and 992.1 MB in the end (delta: 117.2 MB). Peak memory consumption was 463.6 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...