./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/avg10_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/avg10_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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 9f07a48114771d824f096049259b31d59f0e2427 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 23:49:46,635 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:49:46,636 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:49:46,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:49:46,642 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:49:46,642 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:49:46,643 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:49:46,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:49:46,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:49:46,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:49:46,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:49:46,645 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:49:46,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:49:46,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:49:46,646 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:49:46,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:49:46,647 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:49:46,648 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:49:46,649 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:49:46,650 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:49:46,650 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:49:46,651 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:49:46,652 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:49:46,652 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:49:46,652 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:49:46,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:49:46,653 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:49:46,653 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:49:46,654 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:49:46,654 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:49:46,654 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:49:46,655 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:49:46,655 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:49:46,655 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:49:46,655 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:49:46,656 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:49:46,656 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 23:49:46,663 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:49:46,663 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:49:46,664 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 23:49:46,664 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 23:49:46,664 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 23:49:46,664 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 23:49:46,665 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 23:49:46,665 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 23:49:46,665 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 23:49:46,665 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 23:49:46,665 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 23:49:46,665 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:49:46,665 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:49:46,665 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 23:49:46,665 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:49:46,665 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:49:46,665 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:49:46,666 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 23:49:46,666 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 23:49:46,666 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 23:49:46,666 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:49:46,666 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:49:46,666 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 23:49:46,666 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 23:49:46,666 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 23:49:46,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:49:46,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:49:46,666 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 23:49:46,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:49:46,667 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 23:49:46,667 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 23:49:46,667 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 23:49:46,667 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_cc363980-7abb-4be1-927f-ab956e8c2da6/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 -> 9f07a48114771d824f096049259b31d59f0e2427 [2018-12-02 23:49:46,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:49:46,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:49:46,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:49:46,694 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:49:46,695 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:49:46,695 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/avg10_true-unreach-call_true-termination.i [2018-12-02 23:49:46,731 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/data/4600be1e5/61f13916390c41deb7a802ec04ced263/FLAG2035349b3 [2018-12-02 23:49:47,132 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:49:47,133 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/sv-benchmarks/c/reducercommutativity/avg10_true-unreach-call_true-termination.i [2018-12-02 23:49:47,137 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/data/4600be1e5/61f13916390c41deb7a802ec04ced263/FLAG2035349b3 [2018-12-02 23:49:47,145 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/data/4600be1e5/61f13916390c41deb7a802ec04ced263 [2018-12-02 23:49:47,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:49:47,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:49:47,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:49:47,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:49:47,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:49:47,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14c56171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47, skipping insertion in model container [2018-12-02 23:49:47,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:49:47,168 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:49:47,267 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:49:47,273 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:49:47,285 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:49:47,294 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:49:47,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47 WrapperNode [2018-12-02 23:49:47,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:49:47,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:49:47,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:49:47,295 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:49:47,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:49:47,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:49:47,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:49:47,350 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:49:47,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,357 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (1/1) ... [2018-12-02 23:49:47,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:49:47,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:49:47,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:49:47,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:49:47,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:47,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 23:49:47,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 23:49:47,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:49:47,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:49:47,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 23:49:47,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 23:49:47,536 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:49:47,536 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-12-02 23:49:47,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:49:47 BoogieIcfgContainer [2018-12-02 23:49:47,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:49:47,537 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 23:49:47,537 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 23:49:47,540 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 23:49:47,541 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 23:49:47,541 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 11:49:47" (1/3) ... [2018-12-02 23:49:47,541 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a9f0c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 11:49:47, skipping insertion in model container [2018-12-02 23:49:47,541 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 23:49:47,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:49:47" (2/3) ... [2018-12-02 23:49:47,542 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a9f0c86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 11:49:47, skipping insertion in model container [2018-12-02 23:49:47,542 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 23:49:47,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:49:47" (3/3) ... [2018-12-02 23:49:47,544 INFO L375 chiAutomizerObserver]: Analyzing ICFG avg10_true-unreach-call_true-termination.i [2018-12-02 23:49:47,578 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 23:49:47,578 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 23:49:47,578 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 23:49:47,578 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 23:49:47,578 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:49:47,578 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:49:47,579 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 23:49:47,579 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:49:47,579 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 23:49:47,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-02 23:49:47,601 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-02 23:49:47,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:47,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:47,605 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 23:49:47,605 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:47,605 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 23:49:47,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-12-02 23:49:47,606 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-12-02 23:49:47,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:47,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:47,606 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 23:49:47,607 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:47,611 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 26#L23-3true [2018-12-02 23:49:47,611 INFO L796 eck$LassoCheckResult]: Loop: 26#L23-3true assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 9#L23-2true main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 26#L23-3true [2018-12-02 23:49:47,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 23:49:47,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:47,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:47,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:47,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:47,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:47,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:47,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:47,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-02 23:49:47,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:47,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:47,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:47,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:47,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:47,693 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-02 23:49:47,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:47,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:47,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:47,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:47,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:47,792 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 23:49:47,793 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 23:49:47,793 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 23:49:47,793 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 23:49:47,793 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 23:49:47,793 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 23:49:47,794 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 23:49:47,794 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 23:49:47,794 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg10_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-12-02 23:49:47,794 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 23:49:47,794 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 23:49:47,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:47,965 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 23:49:47,968 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 23:49:47,969 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-12-02 23:49:47,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:47,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:47,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:47,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:47,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:47,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:47,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:47,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:47,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 23:49:47,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:47,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:47,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:47,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:47,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:47,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:47,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:47,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:47,978 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-12-02 23:49:47,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:47,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:47,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:47,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:47,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:47,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:47,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:47,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:47,980 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-12-02 23:49:47,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:47,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:47,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:47,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:47,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:47,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:47,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:47,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:47,982 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-12-02 23:49:47,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:47,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:47,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:47,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:47,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:47,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:47,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:47,988 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-12-02 23:49:47,988 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:47,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:47,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:47,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:47,989 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:47,989 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:47,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:47,990 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:47,990 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-12-02 23:49:47,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:47,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:47,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:47,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:47,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:47,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:47,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:47,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:47,992 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-12-02 23:49:47,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:47,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:47,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:47,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:47,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:47,994 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:47,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:47,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:47,995 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-12-02 23:49:47,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:47,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:47,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:47,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:47,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:47,996 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:47,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:47,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:47,998 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-12-02 23:49:47,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:47,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:47,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:47,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,000 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:48,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:48,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,003 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-12-02 23:49:48,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:48,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,004 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:48,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:48,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,006 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-12-02 23:49:48,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,006 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:48,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:48,007 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:48,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,008 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-12-02 23:49:48,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:48,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,009 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:48,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:48,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,010 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-12-02 23:49:48,010 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:48,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:48,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:48,012 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,012 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-12-02 23:49:48,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,013 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:48,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,013 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:48,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:48,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,014 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-12-02 23:49:48,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:48,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,016 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:48,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:48,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,017 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-12-02 23:49:48,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:48,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,018 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:48,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:48,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,019 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-12-02 23:49:48,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,020 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 23:49:48,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,021 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 23:49:48,021 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:48,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,025 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-12-02 23:49:48,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:48,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:48,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:48,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,028 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-12-02 23:49:48,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,029 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:48,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:48,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,031 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-12-02 23:49:48,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:48,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:48,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:48,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,034 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-12-02 23:49:48,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:48,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:48,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:48,042 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-12-02 23:49:48,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:48,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:48,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:48,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:48,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:48,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:48,060 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 23:49:48,074 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 23:49:48,074 INFO L444 ModelExtractionUtils]: 9 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 23:49:48,075 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 23:49:48,076 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 23:49:48,076 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 23:49:48,077 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 19 Supporting invariants [] [2018-12-02 23:49:48,080 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-02 23:49:48,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:48,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,133 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-12-02 23:49:48,134 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-12-02 23:49:48,163 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 69 states and 95 transitions. Complement of second has 7 states. [2018-12-02 23:49:48,164 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-12-02 23:49:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 23:49:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-12-02 23:49:48,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-02 23:49:48,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 23:49:48,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-02 23:49:48,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 23:49:48,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-02 23:49:48,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 23:49:48,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 95 transitions. [2018-12-02 23:49:48,170 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 19 states and 24 transitions. [2018-12-02 23:49:48,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-12-02 23:49:48,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:48,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-12-02 23:49:48,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:48,174 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 23:49:48,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-12-02 23:49:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 23:49:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 23:49:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-02 23:49:48,189 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 23:49:48,189 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-02 23:49:48,189 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 23:49:48,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-12-02 23:49:48,190 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:48,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:48,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-02 23:49:48,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:48,191 INFO L794 eck$LassoCheckResult]: Stem: 153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 150#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 147#L23-3 assume !(main_~i~1 < 10); 146#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 139#L9-3 [2018-12-02 23:49:48,191 INFO L796 eck$LassoCheckResult]: Loop: 139#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 140#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 139#L9-3 [2018-12-02 23:49:48,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,191 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-12-02 23:49:48,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:48,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:49:48,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:49:48,214 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:48,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-12-02 23:49:48,215 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:48,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:49:48,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:49:48,243 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 23:49:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:48,253 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-02 23:49:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:49:48,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-12-02 23:49:48,254 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2018-12-02 23:49:48,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 23:49:48,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:48,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-12-02 23:49:48,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:48,256 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-12-02 23:49:48,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-12-02 23:49:48,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-02 23:49:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 23:49:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-12-02 23:49:48,257 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-02 23:49:48,257 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-12-02 23:49:48,257 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 23:49:48,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-12-02 23:49:48,258 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:48,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:48,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 23:49:48,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:48,258 INFO L794 eck$LassoCheckResult]: Stem: 196#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 195#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 192#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 193#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 194#L23-3 assume !(main_~i~1 < 10); 191#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 184#L9-3 [2018-12-02 23:49:48,258 INFO L796 eck$LassoCheckResult]: Loop: 184#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 185#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 184#L9-3 [2018-12-02 23:49:48,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,259 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-12-02 23:49:48,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:48,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:48,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:48,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:48,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 23:49:48,314 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:48,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-12-02 23:49:48,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:48,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:49:48,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:49:48,335 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-02 23:49:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:48,345 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-12-02 23:49:48,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:49:48,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-12-02 23:49:48,346 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2018-12-02 23:49:48,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 23:49:48,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:48,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-12-02 23:49:48,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:48,347 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-12-02 23:49:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-12-02 23:49:48,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-12-02 23:49:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 23:49:48,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-02 23:49:48,348 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 23:49:48,348 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-02 23:49:48,348 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 23:49:48,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-12-02 23:49:48,349 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:48,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:48,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-12-02 23:49:48,349 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:48,349 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 256#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 257#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 258#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 259#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 266#L23-3 assume !(main_~i~1 < 10); 255#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 248#L9-3 [2018-12-02 23:49:48,349 INFO L796 eck$LassoCheckResult]: Loop: 248#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 249#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 248#L9-3 [2018-12-02 23:49:48,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,350 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-12-02 23:49:48,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:48,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:48,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:48,374 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 23:49:48,382 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 23:49:48,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:48,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:48,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 23:49:48,416 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:48,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2018-12-02 23:49:48,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:48,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:49:48,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:49:48,444 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-02 23:49:48,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:48,458 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-12-02 23:49:48,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:49:48,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-12-02 23:49:48,459 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,459 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2018-12-02 23:49:48,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 23:49:48,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:48,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-12-02 23:49:48,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:48,460 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-12-02 23:49:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-12-02 23:49:48,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-12-02 23:49:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 23:49:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-02 23:49:48,461 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 23:49:48,461 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-02 23:49:48,461 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 23:49:48,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-12-02 23:49:48,461 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:48,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:48,462 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-12-02 23:49:48,462 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:48,462 INFO L794 eck$LassoCheckResult]: Stem: 336#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 335#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 331#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 332#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 333#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 334#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 343#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 342#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 341#L23-3 assume !(main_~i~1 < 10); 330#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 323#L9-3 [2018-12-02 23:49:48,462 INFO L796 eck$LassoCheckResult]: Loop: 323#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 324#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 323#L9-3 [2018-12-02 23:49:48,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-12-02 23:49:48,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:48,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:48,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:48,491 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 23:49:48,501 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 23:49:48,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:48,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:48,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:48,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-02 23:49:48,528 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:48,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2018-12-02 23:49:48,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:49:48,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:49:48,551 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-02 23:49:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:48,563 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-12-02 23:49:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:49:48,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-12-02 23:49:48,564 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2018-12-02 23:49:48,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 23:49:48,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:48,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-12-02 23:49:48,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:48,565 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-02 23:49:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-12-02 23:49:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-02 23:49:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 23:49:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-12-02 23:49:48,566 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-02 23:49:48,566 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-12-02 23:49:48,566 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 23:49:48,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-12-02 23:49:48,567 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:48,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:48,567 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-12-02 23:49:48,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:48,568 INFO L794 eck$LassoCheckResult]: Stem: 425#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 421#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 417#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 418#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 419#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 420#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 422#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 431#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 430#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 429#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 428#L23-3 assume !(main_~i~1 < 10); 416#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 409#L9-3 [2018-12-02 23:49:48,568 INFO L796 eck$LassoCheckResult]: Loop: 409#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 410#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 409#L9-3 [2018-12-02 23:49:48,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,568 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-12-02 23:49:48,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:48,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:48,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:48,600 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 23:49:48,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 23:49:48,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:48,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:48,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 23:49:48,631 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:48,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2018-12-02 23:49:48,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:49:48,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:49:48,655 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-12-02 23:49:48,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:48,669 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-12-02 23:49:48,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:49:48,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-12-02 23:49:48,670 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2018-12-02 23:49:48,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 23:49:48,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:48,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2018-12-02 23:49:48,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:48,671 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-02 23:49:48,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2018-12-02 23:49:48,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-12-02 23:49:48,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-02 23:49:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-12-02 23:49:48,672 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 23:49:48,672 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-12-02 23:49:48,672 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 23:49:48,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-12-02 23:49:48,673 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:48,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:48,673 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-12-02 23:49:48,673 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:48,673 INFO L794 eck$LassoCheckResult]: Stem: 520#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 518#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 514#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 515#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 516#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 517#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 519#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 530#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 529#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 528#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 527#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 526#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 525#L23-3 assume !(main_~i~1 < 10); 513#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 506#L9-3 [2018-12-02 23:49:48,673 INFO L796 eck$LassoCheckResult]: Loop: 506#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 507#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 506#L9-3 [2018-12-02 23:49:48,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-12-02 23:49:48,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:48,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,713 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:48,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:48,719 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 23:49:48,731 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-02 23:49:48,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:48,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:48,739 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:48,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-02 23:49:48,753 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:48,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2018-12-02 23:49:48,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:48,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 23:49:48,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:49:48,773 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-12-02 23:49:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:48,789 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-12-02 23:49:48,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:49:48,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2018-12-02 23:49:48,790 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2018-12-02 23:49:48,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 23:49:48,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:48,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2018-12-02 23:49:48,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:48,791 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-02 23:49:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2018-12-02 23:49:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-12-02 23:49:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 23:49:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 23:49:48,793 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 23:49:48,793 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 23:49:48,793 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 23:49:48,793 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-12-02 23:49:48,794 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:48,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:48,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2018-12-02 23:49:48,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:48,795 INFO L794 eck$LassoCheckResult]: Stem: 628#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 626#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 622#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 623#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 624#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 625#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 627#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 640#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 639#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 638#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 637#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 636#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 635#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 634#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 633#L23-3 assume !(main_~i~1 < 10); 621#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 614#L9-3 [2018-12-02 23:49:48,795 INFO L796 eck$LassoCheckResult]: Loop: 614#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 615#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 614#L9-3 [2018-12-02 23:49:48,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2018-12-02 23:49:48,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:48,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:48,860 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:48,866 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 23:49:48,879 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-02 23:49:48,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:48,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:48,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-02 23:49:48,902 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:48,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 7 times [2018-12-02 23:49:48,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:48,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:49:48,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:49:48,921 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-02 23:49:48,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:48,938 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 23:49:48,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:49:48,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2018-12-02 23:49:48,938 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2018-12-02 23:49:48,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 23:49:48,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:48,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2018-12-02 23:49:48,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:48,939 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-02 23:49:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2018-12-02 23:49:48,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-02 23:49:48,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-02 23:49:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-02 23:49:48,940 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-02 23:49:48,940 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-02 23:49:48,940 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 23:49:48,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-12-02 23:49:48,940 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:48,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:48,940 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:48,940 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2018-12-02 23:49:48,940 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:48,941 INFO L794 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 745#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 741#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 742#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 743#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 744#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 746#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 761#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 760#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 759#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 758#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 757#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 756#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 755#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 754#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 753#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 752#L23-3 assume !(main_~i~1 < 10); 740#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 733#L9-3 [2018-12-02 23:49:48,941 INFO L796 eck$LassoCheckResult]: Loop: 733#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 734#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 733#L9-3 [2018-12-02 23:49:48,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:48,941 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2018-12-02 23:49:48,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:48,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:48,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:48,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:48,998 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:49,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:49,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:49,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:49,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-12-02 23:49:49,044 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:49,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:49,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 8 times [2018-12-02 23:49:49,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:49,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:49,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:49,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 23:49:49,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-02 23:49:49,064 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 9 Second operand 11 states. [2018-12-02 23:49:49,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:49,085 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-12-02 23:49:49,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 23:49:49,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2018-12-02 23:49:49,086 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:49,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 38 transitions. [2018-12-02 23:49:49,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 23:49:49,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:49,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2018-12-02 23:49:49,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:49,087 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-12-02 23:49:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2018-12-02 23:49:49,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-02 23:49:49,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 23:49:49,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-12-02 23:49:49,088 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 23:49:49,088 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-12-02 23:49:49,088 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 23:49:49,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2018-12-02 23:49:49,089 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:49,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:49,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:49,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2018-12-02 23:49:49,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:49,090 INFO L794 eck$LassoCheckResult]: Stem: 879#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 875#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 871#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 872#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 873#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 874#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 876#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 893#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 892#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 891#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 890#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 889#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 888#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 887#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 886#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 885#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 884#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 883#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 882#L23-3 assume !(main_~i~1 < 10); 870#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 863#L9-3 [2018-12-02 23:49:49,090 INFO L796 eck$LassoCheckResult]: Loop: 863#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 864#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 863#L9-3 [2018-12-02 23:49:49,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2018-12-02 23:49:49,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:49,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:49,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:49,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:49,137 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:49,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:49,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:49,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 23:49:49,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 23:49:49,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:49,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:49,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:49,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-02 23:49:49,191 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:49,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:49,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 9 times [2018-12-02 23:49:49,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:49,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:49,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:49,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 23:49:49,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:49:49,213 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-12-02 23:49:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:49,233 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-12-02 23:49:49,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:49:49,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2018-12-02 23:49:49,234 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:49,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2018-12-02 23:49:49,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 23:49:49,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:49,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2018-12-02 23:49:49,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:49,234 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-12-02 23:49:49,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2018-12-02 23:49:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-02 23:49:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 23:49:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-12-02 23:49:49,236 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-02 23:49:49,236 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-12-02 23:49:49,236 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 23:49:49,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2018-12-02 23:49:49,236 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:49,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:49,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:49,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2018-12-02 23:49:49,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:49,237 INFO L794 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1016#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1012#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1013#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1014#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1015#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1017#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1036#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1035#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1034#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1033#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1032#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1031#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1030#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1029#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1028#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1027#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1026#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1025#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1024#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1023#L23-3 assume !(main_~i~1 < 10); 1011#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1004#L9-3 [2018-12-02 23:49:49,237 INFO L796 eck$LassoCheckResult]: Loop: 1004#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1005#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1004#L9-3 [2018-12-02 23:49:49,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:49,237 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2018-12-02 23:49:49,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:49,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:49,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:49,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:49,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:49,294 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:49,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 23:49:49,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-02 23:49:49,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:49,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:49,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:49,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-02 23:49:49,378 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:49,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:49,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 10 times [2018-12-02 23:49:49,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:49,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:49,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 23:49:49,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:49:49,405 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-12-02 23:49:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:49,427 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-12-02 23:49:49,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:49:49,428 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-12-02 23:49:49,428 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:49,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 23:49:49,429 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 23:49:49,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 23:49:49,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2018-12-02 23:49:49,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:49,429 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 23:49:49,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2018-12-02 23:49:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-02 23:49:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 23:49:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-12-02 23:49:49,431 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 23:49:49,431 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-12-02 23:49:49,431 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 23:49:49,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-12-02 23:49:49,432 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-12-02 23:49:49,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:49,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:49,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2018-12-02 23:49:49,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:49,433 INFO L794 eck$LassoCheckResult]: Stem: 1169#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1167#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1163#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1164#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1165#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1166#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1168#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1189#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1188#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1187#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1186#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1185#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1184#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1183#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1182#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1181#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1180#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1179#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1178#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1177#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1176#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1175#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1174#L23-3 assume !(main_~i~1 < 10); 1162#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1155#L9-3 [2018-12-02 23:49:49,433 INFO L796 eck$LassoCheckResult]: Loop: 1155#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1156#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1155#L9-3 [2018-12-02 23:49:49,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:49,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2018-12-02 23:49:49,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:49,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:49,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:49,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 11 times [2018-12-02 23:49:49,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:49,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:49,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:49,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:49,451 INFO L82 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2018-12-02 23:49:49,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:49,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:49,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:52,533 WARN L180 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 198 DAG size of output: 154 [2018-12-02 23:49:52,620 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 23:49:52,620 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 23:49:52,620 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 23:49:52,620 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 23:49:52,620 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 23:49:52,620 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 23:49:52,620 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 23:49:52,620 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 23:49:52,620 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg10_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-12-02 23:49:52,620 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 23:49:52,620 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 23:49:52,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:49:52,797 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 23:49:52,797 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 23:49:52,797 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-12-02 23:49:52,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:52,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:52,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:52,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,798 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-12-02 23:49:52,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:52,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:52,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:52,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,800 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-12-02 23:49:52,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:52,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:52,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:52,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,801 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-12-02 23:49:52,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:52,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:52,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:52,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,802 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-12-02 23:49:52,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:52,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:52,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,803 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-12-02 23:49:52,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:52,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,804 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:52,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:52,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,804 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-12-02 23:49:52,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:49:52,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:49:52,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:49:52,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,805 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-12-02 23:49:52,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:52,807 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:52,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,808 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-12-02 23:49:52,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,808 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,809 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:52,809 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:52,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,810 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-12-02 23:49:52,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:52,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:52,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,812 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-12-02 23:49:52,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:52,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:52,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,815 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-12-02 23:49:52,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,815 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 23:49:52,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,816 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 23:49:52,816 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:52,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:49:52,818 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-12-02 23:49:52,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:49:52,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:49:52,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:49:52,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:49:52,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:49:52,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:49:52,825 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 23:49:52,832 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 23:49:52,832 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 23:49:52,833 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 23:49:52,833 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 23:49:52,833 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 23:49:52,833 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~i~0) = -2*ULTIMATE.start_avg_~i~0 + 19 Supporting invariants [] [2018-12-02 23:49:52,838 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-02 23:49:52,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:52,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:52,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:49:52,869 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-12-02 23:49:52,869 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-12-02 23:49:52,880 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 41 states and 48 transitions. Complement of second has 7 states. [2018-12-02 23:49:52,880 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-12-02 23:49:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 23:49:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-12-02 23:49:52,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2018-12-02 23:49:52,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 23:49:52,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2018-12-02 23:49:52,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 23:49:52,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2018-12-02 23:49:52,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 23:49:52,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2018-12-02 23:49:52,882 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:52,883 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2018-12-02 23:49:52,883 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 23:49:52,883 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-02 23:49:52,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-12-02 23:49:52,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:52,883 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 23:49:52,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-12-02 23:49:52,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-02 23:49:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 23:49:52,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-02 23:49:52,885 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 23:49:52,885 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-02 23:49:52,885 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 23:49:52,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-12-02 23:49:52,886 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:52,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:52,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:52,886 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:52,886 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:52,886 INFO L794 eck$LassoCheckResult]: Stem: 1362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1360#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1356#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1357#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1358#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1359#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1361#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1382#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1381#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1380#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1379#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1378#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1377#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1376#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1375#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1374#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1373#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1372#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1371#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1370#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1369#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1368#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1367#L23-3 assume !(main_~i~1 < 10); 1355#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1347#L9-3 assume !(avg_~i~0 < 10); 1345#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 1346#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1365#L9-8 [2018-12-02 23:49:52,886 INFO L796 eck$LassoCheckResult]: Loop: 1365#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1366#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1365#L9-8 [2018-12-02 23:49:52,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:52,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2018-12-02 23:49:52,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:52,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:52,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:52,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 23:49:52,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:49:52,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:49:52,913 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:52,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2018-12-02 23:49:52,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:52,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:52,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:52,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:52,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:49:52,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:49:52,953 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-02 23:49:52,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:52,965 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-12-02 23:49:52,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:49:52,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2018-12-02 23:49:52,966 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:52,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2018-12-02 23:49:52,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-02 23:49:52,967 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-02 23:49:52,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2018-12-02 23:49:52,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:52,967 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-02 23:49:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2018-12-02 23:49:52,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-12-02 23:49:52,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-02 23:49:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-12-02 23:49:52,969 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-02 23:49:52,969 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-12-02 23:49:52,969 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 23:49:52,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2018-12-02 23:49:52,969 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:52,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:52,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:52,970 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:52,970 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:52,970 INFO L794 eck$LassoCheckResult]: Stem: 1450#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1447#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1443#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1444#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1445#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1446#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1470#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1469#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1468#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1467#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1466#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1465#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1464#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1463#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1462#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1461#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1460#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1459#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1458#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1457#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1456#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1455#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1454#L23-3 assume !(main_~i~1 < 10); 1442#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1434#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1435#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1436#L9-3 assume !(avg_~i~0 < 10); 1432#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 1433#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1451#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1452#L9-7 [2018-12-02 23:49:52,970 INFO L796 eck$LassoCheckResult]: Loop: 1452#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1453#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1452#L9-7 [2018-12-02 23:49:52,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2018-12-02 23:49:52,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:52,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:52,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:52,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:52,996 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 23:49:52,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:52,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:53,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:53,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:53,029 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-02 23:49:53,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:53,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 23:49:53,054 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:53,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2018-12-02 23:49:53,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:53,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 23:49:53,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 23:49:53,077 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-12-02 23:49:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:53,101 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-02 23:49:53,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 23:49:53,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2018-12-02 23:49:53,102 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2018-12-02 23:49:53,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-02 23:49:53,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-02 23:49:53,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2018-12-02 23:49:53,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:53,103 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-12-02 23:49:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2018-12-02 23:49:53,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-12-02 23:49:53,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-02 23:49:53,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-02 23:49:53,105 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-02 23:49:53,105 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-02 23:49:53,105 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 23:49:53,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2018-12-02 23:49:53,105 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:53,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:53,106 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:53,106 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:53,106 INFO L794 eck$LassoCheckResult]: Stem: 1633#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1632#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1628#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1629#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1630#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1631#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1657#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1656#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1655#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1654#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1653#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1652#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1651#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1650#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1649#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1648#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1647#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1646#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1645#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1644#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1643#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1642#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1641#L23-3 assume !(main_~i~1 < 10); 1627#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1617#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1618#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1619#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1620#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1624#L9-3 assume !(avg_~i~0 < 10); 1615#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 1616#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1636#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1637#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1638#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1640#L9-7 [2018-12-02 23:49:53,106 INFO L796 eck$LassoCheckResult]: Loop: 1640#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1639#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1640#L9-7 [2018-12-02 23:49:53,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,107 INFO L82 PathProgramCache]: Analyzing trace with hash 528482161, now seen corresponding path program 1 times [2018-12-02 23:49:53,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-02 23:49:53,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:53,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:53,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:53,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-12-02 23:49:53,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:53,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 23:49:53,193 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:53,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2018-12-02 23:49:53,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:53,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 23:49:53,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 23:49:53,215 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-12-02 23:49:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:53,241 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-12-02 23:49:53,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 23:49:53,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 59 transitions. [2018-12-02 23:49:53,242 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 59 transitions. [2018-12-02 23:49:53,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-02 23:49:53,243 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-12-02 23:49:53,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2018-12-02 23:49:53,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:53,244 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-02 23:49:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2018-12-02 23:49:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-02 23:49:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 23:49:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-12-02 23:49:53,246 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-12-02 23:49:53,246 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-12-02 23:49:53,246 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-02 23:49:53,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 51 transitions. [2018-12-02 23:49:53,246 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:53,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:53,247 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:53,247 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:53,247 INFO L794 eck$LassoCheckResult]: Stem: 1840#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1837#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1833#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1834#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1835#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1836#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1864#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1863#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1862#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1861#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1860#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1859#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1858#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1857#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1856#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1855#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1854#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1853#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1850#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1849#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1848#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1847#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1846#L23-3 assume !(main_~i~1 < 10); 1832#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1823#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1824#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1825#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1826#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1867#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1845#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1844#L9-3 assume !(avg_~i~0 < 10); 1821#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 1822#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 1841#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1842#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1843#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1866#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1865#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1852#L9-7 [2018-12-02 23:49:53,247 INFO L796 eck$LassoCheckResult]: Loop: 1852#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 1851#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 1852#L9-7 [2018-12-02 23:49:53,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1101320015, now seen corresponding path program 2 times [2018-12-02 23:49:53,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:53,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 23:49:53,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:53,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:53,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 23:49:53,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 23:49:53,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:53,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 23:49:53,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:53,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-12-02 23:49:53,340 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:53,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,340 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2018-12-02 23:49:53,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:53,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 23:49:53,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-02 23:49:53,360 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-12-02 23:49:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:53,385 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-02 23:49:53,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 23:49:53,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2018-12-02 23:49:53,386 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,386 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 65 transitions. [2018-12-02 23:49:53,386 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-02 23:49:53,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-12-02 23:49:53,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 65 transitions. [2018-12-02 23:49:53,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:53,386 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-12-02 23:49:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 65 transitions. [2018-12-02 23:49:53,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-12-02 23:49:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 23:49:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-12-02 23:49:53,388 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-12-02 23:49:53,388 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-12-02 23:49:53,388 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-02 23:49:53,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2018-12-02 23:49:53,388 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:53,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:53,389 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:53,389 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:53,389 INFO L794 eck$LassoCheckResult]: Stem: 2067#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2066#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2062#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2063#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2064#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2065#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2093#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2092#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2091#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2090#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2089#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2088#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2087#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2086#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2085#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2084#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2083#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2082#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2081#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2080#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2079#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2078#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2077#L23-3 assume !(main_~i~1 < 10); 2061#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 2052#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2053#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2054#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2055#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2096#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2095#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2094#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2074#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2073#L9-3 assume !(avg_~i~0 < 10); 2050#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 2051#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 2070#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2071#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2072#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2100#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2099#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2098#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2097#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2076#L9-7 [2018-12-02 23:49:53,389 INFO L796 eck$LassoCheckResult]: Loop: 2076#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2075#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2076#L9-7 [2018-12-02 23:49:53,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,389 INFO L82 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 3 times [2018-12-02 23:49:53,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:53,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 23:49:53,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:53,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:53,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 23:49:53,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 23:49:53,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:53,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:53,449 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-12-02 23:49:53,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:53,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-12-02 23:49:53,465 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:53,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,465 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2018-12-02 23:49:53,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:53,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 23:49:53,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 23:49:53,483 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-12-02 23:49:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:53,514 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-02 23:49:53,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 23:49:53,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 71 transitions. [2018-12-02 23:49:53,515 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 71 transitions. [2018-12-02 23:49:53,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-02 23:49:53,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-02 23:49:53,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2018-12-02 23:49:53,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:53,515 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-02 23:49:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2018-12-02 23:49:53,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-12-02 23:49:53,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 23:49:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-02 23:49:53,516 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-02 23:49:53,516 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-02 23:49:53,516 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-02 23:49:53,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 59 transitions. [2018-12-02 23:49:53,517 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:53,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:53,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:53,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:53,517 INFO L794 eck$LassoCheckResult]: Stem: 2320#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2319#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2315#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2316#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2317#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2318#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2346#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2345#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2344#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2343#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2342#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2341#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2340#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2339#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2338#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2337#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2336#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2335#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2334#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2333#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2332#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2331#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2330#L23-3 assume !(main_~i~1 < 10); 2314#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 2304#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2305#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2306#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2307#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2311#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2350#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2349#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2348#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2347#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2327#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2326#L9-3 assume !(avg_~i~0 < 10); 2302#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 2303#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 2323#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2324#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2325#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2356#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2355#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2354#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2353#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2352#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2351#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2329#L9-7 [2018-12-02 23:49:53,517 INFO L796 eck$LassoCheckResult]: Loop: 2329#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2328#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2329#L9-7 [2018-12-02 23:49:53,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1883803697, now seen corresponding path program 4 times [2018-12-02 23:49:53,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:53,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-12-02 23:49:53,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:53,548 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:53,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 23:49:53,573 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 23:49:53,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:53,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-12-02 23:49:53,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:53,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-12-02 23:49:53,597 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:53,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2018-12-02 23:49:53,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:53,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 23:49:53,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-02 23:49:53,620 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-12-02 23:49:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:53,670 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-02 23:49:53,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 23:49:53,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 77 transitions. [2018-12-02 23:49:53,671 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 77 transitions. [2018-12-02 23:49:53,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-12-02 23:49:53,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-12-02 23:49:53,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 77 transitions. [2018-12-02 23:49:53,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:53,672 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-12-02 23:49:53,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 77 transitions. [2018-12-02 23:49:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2018-12-02 23:49:53,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-02 23:49:53,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-12-02 23:49:53,674 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-12-02 23:49:53,675 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-12-02 23:49:53,675 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-02 23:49:53,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 63 transitions. [2018-12-02 23:49:53,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:53,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:53,676 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:53,676 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:53,676 INFO L794 eck$LassoCheckResult]: Stem: 2595#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2594#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2590#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2591#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2592#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2593#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2621#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2620#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2619#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2618#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2617#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2616#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2615#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2614#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2613#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2612#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2611#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2610#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2609#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2608#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2607#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2606#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2605#L23-3 assume !(main_~i~1 < 10); 2589#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 2579#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2580#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2581#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2582#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2586#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2627#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2626#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2625#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2624#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2623#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2622#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2602#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2601#L9-3 assume !(avg_~i~0 < 10); 2577#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 2578#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 2598#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2599#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2600#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2635#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2634#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2633#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2632#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2631#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2630#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2629#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2628#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2604#L9-7 [2018-12-02 23:49:53,676 INFO L796 eck$LassoCheckResult]: Loop: 2604#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2603#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2604#L9-7 [2018-12-02 23:49:53,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,677 INFO L82 PathProgramCache]: Analyzing trace with hash -414957967, now seen corresponding path program 5 times [2018-12-02 23:49:53,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:53,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-12-02 23:49:53,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:53,731 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/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-12-02 23:49:53,740 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 23:49:53,794 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-12-02 23:49:53,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:53,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-12-02 23:49:53,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:53,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-02 23:49:53,848 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:53,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 7 times [2018-12-02 23:49:53,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:53,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:53,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 23:49:53,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 23:49:53,869 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-12-02 23:49:53,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:53,914 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-12-02 23:49:53,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 23:49:53,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 83 transitions. [2018-12-02 23:49:53,914 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 83 transitions. [2018-12-02 23:49:53,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-12-02 23:49:53,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-12-02 23:49:53,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 83 transitions. [2018-12-02 23:49:53,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:53,915 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-12-02 23:49:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 83 transitions. [2018-12-02 23:49:53,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-12-02 23:49:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-02 23:49:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-12-02 23:49:53,917 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-02 23:49:53,917 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-02 23:49:53,917 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-02 23:49:53,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 67 transitions. [2018-12-02 23:49:53,918 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:53,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:53,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:53,918 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:53,918 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:53,918 INFO L794 eck$LassoCheckResult]: Stem: 2895#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2892#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2888#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2889#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2890#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2891#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2919#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2918#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2917#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2916#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2915#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2914#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2913#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2912#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2911#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2910#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2909#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2908#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2905#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2904#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2903#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2902#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2901#L23-3 assume !(main_~i~1 < 10); 2887#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 2877#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2878#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2879#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2880#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2884#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2927#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2926#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2925#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2924#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2923#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2922#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2921#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2920#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2900#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2899#L9-3 assume !(avg_~i~0 < 10); 2875#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 2876#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 2896#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2897#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2898#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2937#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2936#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2935#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2934#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2933#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2932#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2931#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2930#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2929#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2928#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2907#L9-7 [2018-12-02 23:49:53,919 INFO L796 eck$LassoCheckResult]: Loop: 2907#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 2906#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 2907#L9-7 [2018-12-02 23:49:53,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:53,919 INFO L82 PathProgramCache]: Analyzing trace with hash 919530417, now seen corresponding path program 6 times [2018-12-02 23:49:53,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:53,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:53,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:53,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:53,963 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-02 23:49:53,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:53,963 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 23:49:53,973 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 23:49:54,090 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-12-02 23:49:54,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:54,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:54,112 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 19 proven. 49 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-12-02 23:49:54,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:54,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2018-12-02 23:49:54,128 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:54,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:54,128 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 8 times [2018-12-02 23:49:54,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:54,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:54,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:54,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:54,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:54,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 23:49:54,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:49:54,143 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-12-02 23:49:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:54,244 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-02 23:49:54,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:49:54,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 89 transitions. [2018-12-02 23:49:54,245 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:54,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 89 transitions. [2018-12-02 23:49:54,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-12-02 23:49:54,246 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-12-02 23:49:54,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 89 transitions. [2018-12-02 23:49:54,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:54,246 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-12-02 23:49:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 89 transitions. [2018-12-02 23:49:54,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-12-02 23:49:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-02 23:49:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-12-02 23:49:54,248 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-02 23:49:54,248 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-12-02 23:49:54,248 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-02 23:49:54,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 71 transitions. [2018-12-02 23:49:54,249 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:54,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:54,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:54,249 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:54,249 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:54,250 INFO L794 eck$LassoCheckResult]: Stem: 3231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3230#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3226#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3227#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3228#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3229#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3258#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3257#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3256#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3255#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3254#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3253#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3252#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3251#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3250#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3249#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3248#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3247#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3246#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3245#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3244#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3243#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3242#L23-3 assume !(main_~i~1 < 10); 3225#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 3216#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3217#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3218#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3219#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3280#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3279#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3277#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3275#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3273#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3271#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3269#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3267#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3265#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3263#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3261#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3239#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3238#L9-3 assume !(avg_~i~0 < 10); 3214#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 3215#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 3236#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3237#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3234#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3235#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3278#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3276#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3274#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3272#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3270#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3268#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3266#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3264#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3262#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3260#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3259#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3241#L9-7 [2018-12-02 23:49:54,250 INFO L796 eck$LassoCheckResult]: Loop: 3241#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3240#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3241#L9-7 [2018-12-02 23:49:54,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:54,250 INFO L82 PathProgramCache]: Analyzing trace with hash 231036913, now seen corresponding path program 7 times [2018-12-02 23:49:54,250 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:54,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:54,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-02 23:49:54,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:54,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 23:49:54,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:54,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:54,367 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-12-02 23:49:54,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:54,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-12-02 23:49:54,390 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:54,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:54,391 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 9 times [2018-12-02 23:49:54,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:54,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:54,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:54,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 23:49:54,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 23:49:54,411 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-12-02 23:49:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:54,473 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-12-02 23:49:54,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 23:49:54,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2018-12-02 23:49:54,474 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:54,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 95 transitions. [2018-12-02 23:49:54,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-12-02 23:49:54,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-12-02 23:49:54,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 95 transitions. [2018-12-02 23:49:54,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:54,475 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-12-02 23:49:54,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 95 transitions. [2018-12-02 23:49:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2018-12-02 23:49:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 23:49:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-12-02 23:49:54,477 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-02 23:49:54,477 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-12-02 23:49:54,477 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-02 23:49:54,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 75 transitions. [2018-12-02 23:49:54,477 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:54,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:54,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:54,478 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:54,478 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:54,478 INFO L794 eck$LassoCheckResult]: Stem: 3575#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3574#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3570#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3571#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3572#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3573#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3602#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3601#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3600#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3599#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3598#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3597#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3596#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3595#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3594#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3593#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3592#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3591#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3590#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3589#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3588#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3587#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3586#L23-3 assume !(main_~i~1 < 10); 3569#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 3560#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3561#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3562#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3563#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3628#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3627#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3626#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3625#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3624#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3623#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3622#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3621#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3620#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3619#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3618#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3617#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3616#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3583#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3582#L9-3 assume !(avg_~i~0 < 10); 3558#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 3559#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 3580#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3581#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3578#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3579#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3615#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3614#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3613#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3612#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3611#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3610#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3609#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3608#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3607#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3606#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3605#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3604#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3603#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3585#L9-7 [2018-12-02 23:49:54,478 INFO L796 eck$LassoCheckResult]: Loop: 3585#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3584#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3585#L9-7 [2018-12-02 23:49:54,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1835777231, now seen corresponding path program 8 times [2018-12-02 23:49:54,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:54,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:54,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:54,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:54,539 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-02 23:49:54,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 23:49:54,540 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc363980-7abb-4be1-927f-ab956e8c2da6/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 23:49:54,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 23:49:54,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 23:49:54,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 23:49:54,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:49:54,581 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-12-02 23:49:54,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 23:49:54,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-12-02 23:49:54,604 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 23:49:54,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 10 times [2018-12-02 23:49:54,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:54,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:54,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:54,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 23:49:54,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 23:49:54,631 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-12-02 23:49:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:54,688 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-12-02 23:49:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 23:49:54,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2018-12-02 23:49:54,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:54,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2018-12-02 23:49:54,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-12-02 23:49:54,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-12-02 23:49:54,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2018-12-02 23:49:54,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:54,690 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-12-02 23:49:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2018-12-02 23:49:54,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2018-12-02 23:49:54,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 23:49:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-12-02 23:49:54,691 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-12-02 23:49:54,691 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-12-02 23:49:54,691 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-02 23:49:54,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2018-12-02 23:49:54,691 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-12-02 23:49:54,691 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:54,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:54,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:54,691 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:54,692 INFO L794 eck$LassoCheckResult]: Stem: 3941#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3938#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3934#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3935#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3936#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3937#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3978#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3976#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3974#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3972#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3970#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3968#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3966#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3964#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3962#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3960#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3958#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3956#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3954#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3952#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3950#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3949#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3948#L23-3 assume !(main_~i~1 < 10); 3933#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 3924#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3925#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3926#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3927#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3979#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3977#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3975#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3973#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3971#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3969#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3967#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3965#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3963#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3961#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3959#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3957#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3955#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3953#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3951#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3947#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3946#L9-3 assume !(avg_~i~0 < 10); 3922#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 3923#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 3944#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3945#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3942#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3943#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3996#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3995#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3994#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3993#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3992#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3991#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3990#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3989#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3988#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3987#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3986#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3985#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3984#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3983#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3982#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3981#L9-7 [2018-12-02 23:49:54,692 INFO L796 eck$LassoCheckResult]: Loop: 3981#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 3980#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 3981#L9-7 [2018-12-02 23:49:54,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:54,692 INFO L82 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 9 times [2018-12-02 23:49:54,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:54,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:54,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:54,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:54,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 11 times [2018-12-02 23:49:54,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:54,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:54,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:54,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:54,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:54,839 INFO L82 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 10 times [2018-12-02 23:49:54,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:54,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:54,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:54,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:49:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-12-02 23:49:54,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:49:54,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 23:49:54,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 23:49:54,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-12-02 23:49:54,962 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand 15 states. [2018-12-02 23:49:55,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:49:55,121 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-12-02 23:49:55,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 23:49:55,121 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2018-12-02 23:49:55,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 23:49:55,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2018-12-02 23:49:55,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-12-02 23:49:55,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-12-02 23:49:55,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2018-12-02 23:49:55,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:49:55,122 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-02 23:49:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2018-12-02 23:49:55,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-02 23:49:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 23:49:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-02 23:49:55,123 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-02 23:49:55,124 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-02 23:49:55,124 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-12-02 23:49:55,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2018-12-02 23:49:55,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 23:49:55,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 23:49:55,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 23:49:55,124 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:49:55,124 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 23:49:55,125 INFO L794 eck$LassoCheckResult]: Stem: 4148#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4145#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~post2, main_~i~1, 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);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4141#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4142#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4143#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4144#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4187#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4186#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4184#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4182#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4180#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4178#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4176#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4174#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4172#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4170#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4168#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4166#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4164#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4162#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4160#L23-3 assume !!(main_~i~1 < 10);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 4157#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4156#L23-3 assume !(main_~i~1 < 10); 4140#L23-4 avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 4135#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4136#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4137#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4185#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4183#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4181#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4179#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4177#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4175#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4173#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4171#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4169#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4167#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4165#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4163#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4161#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4159#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4158#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4155#L9-3 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4154#L9-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4153#L9-3 assume !(avg_~i~0 < 10); 4133#L9-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 4134#L12 main_#t~ret4 := avg_#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);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 4151#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4152#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4149#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4150#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4204#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4203#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4202#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4201#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4200#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4199#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4198#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4197#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4196#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4195#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4194#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4193#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4192#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4191#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4190#L9-8 assume !!(avg_~i~0 < 10);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 4189#L9-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 4188#L9-8 assume !(avg_~i~0 < 10); 4146#L9-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % 10 then 1 + avg_~ret~0 / 10 else avg_~ret~0 / 10) % 4294967296 - 4294967296); 4147#L12-1 main_#t~ret7 := avg_#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; 4138#L32-3 [2018-12-02 23:49:55,125 INFO L796 eck$LassoCheckResult]: Loop: 4138#L32-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; 4139#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 4138#L32-3 [2018-12-02 23:49:55,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:55,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2018-12-02 23:49:55,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:55,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:55,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:49:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:55,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:55,296 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2018-12-02 23:49:55,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:55,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:55,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:55,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:55,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:55,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:49:55,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2018-12-02 23:49:55,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:49:55,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:49:55,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:55,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:49:55,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:49:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:49:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 23:50:15,809 WARN L180 SmtUtils]: Spent 20.35 s on a formula simplification. DAG size of input: 540 DAG size of output: 406 [2018-12-02 23:58:09,350 WARN L180 SmtUtils]: Spent 7.87 m on a formula simplification. DAG size of input: 334 DAG size of output: 190 [2018-12-02 23:58:09,353 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 23:58:09,353 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 23:58:09,353 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 23:58:09,353 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 23:58:09,353 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 23:58:09,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 23:58:09,354 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 23:58:09,354 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 23:58:09,354 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg10_true-unreach-call_true-termination.i_Iteration24_Lasso [2018-12-02 23:58:09,354 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 23:58:09,354 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 23:58:09,355 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 23:58:09,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:09,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:09,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:09,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:09,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:09,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:09,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:09,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:11,274 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 110 [2018-12-02 23:58:17,605 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 5990 conjuctions. This might take some time... [2018-12-02 23:58:17,655 INFO L193 XnfTransformerHelper]: Simplified to disjunction of 6 conjuctions. [2018-12-02 23:58:18,533 WARN L180 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 121 [2018-12-02 23:58:18,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:18,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:18,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:18,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:18,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:18,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:18,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:18,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:18,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 23:58:18,620 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 23:58:20,178 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 253 DAG size of output: 150 [2018-12-02 23:58:20,188 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-12-02 23:58:23,443 WARN L180 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 291 DAG size of output: 134 [2018-12-02 23:58:23,456 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 23:58:23,456 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 23:58:23,456 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-12-02 23:58:23,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:58:23,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:58:23,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,457 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:58:23,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:58:23,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:58:23,458 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-12-02 23:58:23,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,458 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:58:23,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:58:23,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,458 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:58:23,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:58:23,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:58:23,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-12-02 23:58:23,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:58:23,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:58:23,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:58:23,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:58:23,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:58:23,460 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-12-02 23:58:23,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:58:23,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:58:23,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:58:23,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:58:23,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:58:23,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-12-02 23:58:23,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:58:23,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:58:23,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:58:23,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:58:23,462 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-12-02 23:58:23,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:58:23,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:58:23,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:58:23,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:58:23,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:58:23,463 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-12-02 23:58:23,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 23:58:23,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:58:23,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,464 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 23:58:23,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 23:58:23,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:58:23,465 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-12-02 23:58:23,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:58:23,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:58:23,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:58:23,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:58:23,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-12-02 23:58:23,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,469 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 23:58:23,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,470 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 23:58:23,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:58:23,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:58:23,473 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-12-02 23:58:23,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:58:23,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:58:23,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:58:23,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 23:58:23,475 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-12-02 23:58:23,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 23:58:23,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 23:58:23,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 23:58:23,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 23:58:23,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 23:58:23,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 23:58:23,487 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 23:58:23,497 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-02 23:58:23,497 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-02 23:58:23,498 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 23:58:23,498 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 23:58:23,498 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 23:58:23,498 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_avg_~x.base)_2, ULTIMATE.start_main_~i~2) = 17*v_rep(select #length ULTIMATE.start_avg_~x.base)_2 - 16*ULTIMATE.start_main_~i~2 Supporting invariants [] [2018-12-02 23:58:23,904 INFO L297 tatePredicateManager]: 102 out of 103 supporting invariants were superfluous and have been removed [2018-12-02 23:58:23,906 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 23:58:23,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:58:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:58:23,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:58:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:58:23,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 23:58:23,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:58:23,991 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 23:58:23,992 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-02 23:58:24,012 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 74 states and 76 transitions. Complement of second has 5 states. [2018-12-02 23:58:24,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 23:58:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 23:58:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-02 23:58:24,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 70 letters. Loop has 2 letters. [2018-12-02 23:58:24,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 23:58:24,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 72 letters. Loop has 2 letters. [2018-12-02 23:58:24,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 23:58:24,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 70 letters. Loop has 4 letters. [2018-12-02 23:58:24,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 23:58:24,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 76 transitions. [2018-12-02 23:58:24,013 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 23:58:24,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2018-12-02 23:58:24,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 23:58:24,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 23:58:24,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 23:58:24,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 23:58:24,014 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 23:58:24,014 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 23:58:24,014 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 23:58:24,014 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-12-02 23:58:24,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 23:58:24,014 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 23:58:24,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 23:58:24,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 11:58:24 BoogieIcfgContainer [2018-12-02 23:58:24,018 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 23:58:24,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:58:24,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:58:24,018 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:58:24,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:49:47" (3/4) ... [2018-12-02 23:58:24,021 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 23:58:24,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:58:24,021 INFO L168 Benchmark]: Toolchain (without parser) took 516873.45 ms. Allocated memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: 2.0 GB). Free memory was 956.0 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 533.5 MB. Max. memory is 11.5 GB. [2018-12-02 23:58:24,022 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:58:24,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.85 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 23:58:24,022 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-12-02 23:58:24,022 INFO L168 Benchmark]: Boogie Preprocessor took 16.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:58:24,023 INFO L168 Benchmark]: RCFGBuilder took 170.26 ms. Allocated memory is still 1.1 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-12-02 23:58:24,023 INFO L168 Benchmark]: BuchiAutomizer took 516480.79 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 553.2 MB. Max. memory is 11.5 GB. [2018-12-02 23:58:24,023 INFO L168 Benchmark]: Witness Printer took 2.82 ms. Allocated memory is still 3.1 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:58:24,025 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.85 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.22 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 170.26 ms. Allocated memory is still 1.1 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 516480.79 ms. Allocated memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 553.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.82 ms. Allocated memory is still 3.1 GB. Free memory is still 2.5 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 19 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function 17 * unknown-#length-unknown[x] + -16 * i and consists of 4 locations. 21 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 516.4s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 515.2s. Construction of modules took 0.5s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 24. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 136 StatesRemovedByMinimization, 19 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 75 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 411 SDtfs, 469 SDslu, 1506 SDs, 0 SdLazy, 870 SolverSat, 237 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital3845 mio100 ax100 hnf99 lsp482 ukn38 mio100 lsp236 div80 bol100 ite100 ukn100 eq165 hnf91 smp72 dnf2334 smp67 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...