./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/reducercommutativity/sum10_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/reducercommutativity/sum10_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/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 78e5d6b90ccf383f71b677cd9b9ca234bb8ccddb ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:20:46,699 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:20:46,700 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:20:46,707 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:20:46,707 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:20:46,708 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:20:46,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:20:46,709 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:20:46,710 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:20:46,711 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:20:46,712 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:20:46,712 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:20:46,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:20:46,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:20:46,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:20:46,714 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:20:46,715 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:20:46,716 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:20:46,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:20:46,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:20:46,719 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:20:46,720 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:20:46,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:20:46,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:20:46,721 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:20:46,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:20:46,723 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:20:46,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:20:46,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:20:46,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:20:46,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:20:46,725 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:20:46,725 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:20:46,725 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:20:46,726 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:20:46,727 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:20:46,727 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 23:20:46,736 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:20:46,736 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:20:46,737 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:20:46,737 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:20:46,737 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:20:46,737 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 23:20:46,738 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 23:20:46,738 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 23:20:46,738 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 23:20:46,738 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 23:20:46,738 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 23:20:46,738 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:20:46,738 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:20:46,738 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:20:46,739 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:20:46,739 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:20:46,739 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:20:46,739 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 23:20:46,739 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 23:20:46,739 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 23:20:46,739 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:20:46,739 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:20:46,740 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 23:20:46,740 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:20:46,740 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 23:20:46,740 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:20:46,740 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:20:46,740 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 23:20:46,740 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:20:46,741 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:20:46,741 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 23:20:46,741 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 23:20:46,741 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_813461f3-2cd8-47b0-904b-83eaf76428b1/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 -> 78e5d6b90ccf383f71b677cd9b9ca234bb8ccddb [2018-11-22 23:20:46,763 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:20:46,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:20:46,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:20:46,774 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:20:46,774 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:20:46,775 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-11-22 23:20:46,810 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/data/bcff2bcea/808766d92f0f42f3aecd27c298fe7af8/FLAGc4fc99b8b [2018-11-22 23:20:47,207 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:20:47,207 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/sv-benchmarks/c/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-11-22 23:20:47,212 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/data/bcff2bcea/808766d92f0f42f3aecd27c298fe7af8/FLAGc4fc99b8b [2018-11-22 23:20:47,221 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/data/bcff2bcea/808766d92f0f42f3aecd27c298fe7af8 [2018-11-22 23:20:47,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:20:47,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:20:47,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:20:47,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:20:47,227 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:20:47,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef06843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47, skipping insertion in model container [2018-11-22 23:20:47,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:20:47,250 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:20:47,363 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:20:47,369 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:20:47,383 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:20:47,394 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:20:47,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47 WrapperNode [2018-11-22 23:20:47,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:20:47,394 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:20:47,395 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:20:47,395 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:20:47,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,405 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:20:47,420 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:20:47,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:20:47,420 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:20:47,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,428 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (1/1) ... [2018-11-22 23:20:47,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:20:47,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:20:47,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:20:47,476 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:20:47,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:20:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:20:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:20:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:20:47,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:20:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:20:47,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:20:47,657 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:20:47,658 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-11-22 23:20:47,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:20:47 BoogieIcfgContainer [2018-11-22 23:20:47,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:20:47,658 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 23:20:47,659 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 23:20:47,661 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 23:20:47,661 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:20:47,661 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 11:20:47" (1/3) ... [2018-11-22 23:20:47,662 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a1a5cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:20:47, skipping insertion in model container [2018-11-22 23:20:47,662 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:20:47,662 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:47" (2/3) ... [2018-11-22 23:20:47,663 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a1a5cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:20:47, skipping insertion in model container [2018-11-22 23:20:47,663 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:20:47,663 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:20:47" (3/3) ... [2018-11-22 23:20:47,664 INFO L375 chiAutomizerObserver]: Analyzing ICFG sum10_true-unreach-call_true-termination.i [2018-11-22 23:20:47,696 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:20:47,697 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 23:20:47,697 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 23:20:47,697 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 23:20:47,697 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:20:47,697 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:20:47,697 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 23:20:47,697 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:20:47,698 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 23:20:47,706 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-22 23:20:47,723 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-22 23:20:47,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:47,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:47,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:20:47,727 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:47,727 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 23:20:47,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-22 23:20:47,729 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 10 [2018-11-22 23:20:47,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:47,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:47,729 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-22 23:20:47,729 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:47,734 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-11-22 23:20:47,734 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-11-22 23:20:47,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:47,738 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-22 23:20:47,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:47,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:47,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:47,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:47,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:47,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:47,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-22 23:20:47,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:47,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:47,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:47,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:47,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:47,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:47,818 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-22 23:20:47,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:47,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:47,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:47,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:47,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:47,976 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:20:47,977 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:20:47,977 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:20:47,977 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:20:47,977 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:20:47,977 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:20:47,977 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:20:47,977 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:20:47,978 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-11-22 23:20:47,978 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:20:47,978 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:20:48,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:48,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:20:48,248 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:20:48,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:48,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:48,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:48,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:48,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:48,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:48,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:48,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:48,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:48,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:48,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:48,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:48,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:48,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:48,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:48,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:48,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:48,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:48,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:48,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:48,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:48,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:20:48,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:20:48,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:48,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:48,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:48,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:48,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:48,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:48,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:48,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:48,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:48,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:48,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:48,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:48,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:48,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:48,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:48,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:48,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:48,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:20:48,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:20:48,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:48,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,294 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:20:48,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,296 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:20:48,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:20:48,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:48,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:48,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:48,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:48,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:48,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:48,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:20:48,307 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:20:48,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:20:48,348 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 23:20:48,348 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-22 23:20:48,351 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:20:48,352 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:20:48,352 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:20:48,353 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1, ULTIMATE.start_main_~i~1) = 19*v_rep(select #length ULTIMATE.start_main_~#x~0.base)_1 - 8*ULTIMATE.start_main_~i~1 Supporting invariants [] [2018-11-22 23:20:48,362 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-22 23:20:48,368 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-22 23:20:48,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:48,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:48,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:48,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:48,440 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 23:20:48,441 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 3 states. [2018-11-22 23:20:48,509 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 3 states. Result 66 states and 92 transitions. Complement of second has 8 states. [2018-11-22 23:20:48,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 23:20:48,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 23:20:48,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2018-11-22 23:20:48,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-22 23:20:48,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:20:48,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-22 23:20:48,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:20:48,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 61 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-22 23:20:48,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:20:48,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 92 transitions. [2018-11-22 23:20:48,516 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:48,520 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 19 states and 24 transitions. [2018-11-22 23:20:48,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-22 23:20:48,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:48,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2018-11-22 23:20:48,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:48,522 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-22 23:20:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2018-11-22 23:20:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-22 23:20:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-22 23:20:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-22 23:20:48,541 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-22 23:20:48,541 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-22 23:20:48,541 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 23:20:48,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-22 23:20:48,541 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:48,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:48,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:48,542 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-22 23:20:48,542 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:48,542 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 148#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; 145#L23-3 assume !(main_~i~1 < 10); 144#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 137#L9-3 [2018-11-22 23:20:48,542 INFO L796 eck$LassoCheckResult]: Loop: 137#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 138#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 137#L9-3 [2018-11-22 23:20:48,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:48,542 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2018-11-22 23:20:48,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:48,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:48,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:20:48,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:20:48,568 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:48,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:48,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 1 times [2018-11-22 23:20:48,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:48,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:48,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:48,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:48,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:20:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:20:48,613 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-22 23:20:48,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:48,625 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-22 23:20:48,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:20:48,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-22 23:20:48,627 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:48,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 24 transitions. [2018-11-22 23:20:48,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 23:20:48,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:48,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2018-11-22 23:20:48,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:48,628 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2018-11-22 23:20:48,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2018-11-22 23:20:48,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-22 23:20:48,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-22 23:20:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-22 23:20:48,629 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-22 23:20:48,629 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-22 23:20:48,629 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 23:20:48,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-22 23:20:48,630 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:48,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:48,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:48,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-22 23:20:48,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:48,630 INFO L794 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 193#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; 190#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; 191#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 192#L23-3 assume !(main_~i~1 < 10); 189#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 182#L9-3 [2018-11-22 23:20:48,631 INFO L796 eck$LassoCheckResult]: Loop: 182#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 183#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 182#L9-3 [2018-11-22 23:20:48,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2018-11-22 23:20:48,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:48,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:48,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:48,650 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:48,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:48,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:48,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:48,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-22 23:20:48,682 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:48,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:48,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 2 times [2018-11-22 23:20:48,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:48,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:48,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:48,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:48,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:20:48,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:20:48,711 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-22 23:20:48,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:48,726 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2018-11-22 23:20:48,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 23:20:48,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2018-11-22 23:20:48,727 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:48,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 26 transitions. [2018-11-22 23:20:48,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 23:20:48,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:48,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2018-11-22 23:20:48,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:48,728 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2018-11-22 23:20:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2018-11-22 23:20:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-22 23:20:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 23:20:48,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-11-22 23:20:48,730 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-22 23:20:48,730 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-11-22 23:20:48,730 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 23:20:48,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-11-22 23:20:48,730 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:48,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:48,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:48,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2018-11-22 23:20:48,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:48,731 INFO L794 eck$LassoCheckResult]: Stem: 261#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 258#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; 254#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; 255#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 264#L23-3 assume !(main_~i~1 < 10); 253#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 246#L9-3 [2018-11-22 23:20:48,731 INFO L796 eck$LassoCheckResult]: Loop: 246#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 247#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 246#L9-3 [2018-11-22 23:20:48,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:48,731 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2018-11-22 23:20:48,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:48,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:48,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:48,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:48,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:48,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 23:20:48,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 23:20:48,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:48,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:48,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:48,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-22 23:20:48,813 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:48,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 3 times [2018-11-22 23:20:48,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:48,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:48,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:48,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:20:48,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:20:48,861 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-22 23:20:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:48,880 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-22 23:20:48,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:20:48,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2018-11-22 23:20:48,881 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:48,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2018-11-22 23:20:48,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 23:20:48,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:48,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-22 23:20:48,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:48,882 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-22 23:20:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-22 23:20:48,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-22 23:20:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 23:20:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-11-22 23:20:48,887 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-22 23:20:48,887 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-11-22 23:20:48,887 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 23:20:48,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2018-11-22 23:20:48,887 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:48,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:48,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:48,888 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1] [2018-11-22 23:20:48,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:48,888 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 333#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; 329#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; 330#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 341#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; 340#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 339#L23-3 assume !(main_~i~1 < 10); 328#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 321#L9-3 [2018-11-22 23:20:48,888 INFO L796 eck$LassoCheckResult]: Loop: 321#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 322#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 321#L9-3 [2018-11-22 23:20:48,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:48,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1489134225, now seen corresponding path program 3 times [2018-11-22 23:20:48,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:48,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:48,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:48,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:48,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:48,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:48,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:20:48,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-22 23:20:48,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:48,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:48,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:48,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-22 23:20:48,959 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:48,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:48,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 4 times [2018-11-22 23:20:48,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:48,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:48,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:48,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 23:20:48,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:20:48,981 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-22 23:20:48,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:49,000 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-22 23:20:49,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:20:49,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 30 transitions. [2018-11-22 23:20:49,001 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,002 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 30 transitions. [2018-11-22 23:20:49,002 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 23:20:49,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:49,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2018-11-22 23:20:49,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:49,002 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-22 23:20:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2018-11-22 23:20:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-22 23:20:49,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-22 23:20:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-22 23:20:49,004 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-22 23:20:49,004 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-22 23:20:49,004 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 23:20:49,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2018-11-22 23:20:49,005 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:49,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:49,005 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2018-11-22 23:20:49,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:49,006 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 419#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; 415#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; 416#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 420#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 427#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 426#L23-3 assume !(main_~i~1 < 10); 414#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 407#L9-3 [2018-11-22 23:20:49,006 INFO L796 eck$LassoCheckResult]: Loop: 407#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 408#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 407#L9-3 [2018-11-22 23:20:49,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,006 INFO L82 PathProgramCache]: Analyzing trace with hash 833936659, now seen corresponding path program 4 times [2018-11-22 23:20:49,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:49,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:49,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:49,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:20:49,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:20:49,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:49,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:49,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:49,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-22 23:20:49,105 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:49,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 5 times [2018-11-22 23:20:49,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:49,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 23:20:49,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:20:49,137 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-22 23:20:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:49,156 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-22 23:20:49,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 23:20:49,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2018-11-22 23:20:49,158 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,158 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2018-11-22 23:20:49,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 23:20:49,158 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:49,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2018-11-22 23:20:49,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:49,159 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-22 23:20:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2018-11-22 23:20:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-22 23:20:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 23:20:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-22 23:20:49,161 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-22 23:20:49,161 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-22 23:20:49,161 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 23:20:49,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-22 23:20:49,162 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:49,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:49,162 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2018-11-22 23:20:49,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:49,163 INFO L794 eck$LassoCheckResult]: Stem: 518#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 516#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; 512#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; 513#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 517#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 524#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 523#L23-3 assume !(main_~i~1 < 10); 511#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 504#L9-3 [2018-11-22 23:20:49,163 INFO L796 eck$LassoCheckResult]: Loop: 504#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 505#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 504#L9-3 [2018-11-22 23:20:49,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1745699051, now seen corresponding path program 5 times [2018-11-22 23:20:49,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:49,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:49,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:49,217 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 23:20:49,229 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-22 23:20:49,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:49,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:49,238 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:49,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-22 23:20:49,254 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:49,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 6 times [2018-11-22 23:20:49,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:49,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 23:20:49,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 23:20:49,285 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-11-22 23:20:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:49,300 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-22 23:20:49,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:20:49,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 34 transitions. [2018-11-22 23:20:49,301 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 34 transitions. [2018-11-22 23:20:49,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 23:20:49,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:49,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 34 transitions. [2018-11-22 23:20:49,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:49,302 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-22 23:20:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 34 transitions. [2018-11-22 23:20:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-22 23:20:49,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-22 23:20:49,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-11-22 23:20:49,304 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-22 23:20:49,304 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-22 23:20:49,304 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 23:20:49,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2018-11-22 23:20:49,304 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:49,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:49,305 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1, 1] [2018-11-22 23:20:49,305 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:49,305 INFO L794 eck$LassoCheckResult]: Stem: 626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 624#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; 620#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; 621#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 625#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 632#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 631#L23-3 assume !(main_~i~1 < 10); 619#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 612#L9-3 [2018-11-22 23:20:49,305 INFO L796 eck$LassoCheckResult]: Loop: 612#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 613#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 612#L9-3 [2018-11-22 23:20:49,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1715480727, now seen corresponding path program 6 times [2018-11-22 23:20:49,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:49,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:49,352 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:49,358 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 23:20:49,373 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-22 23:20:49,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:49,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:49,380 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:49,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-22 23:20:49,395 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:49,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 7 times [2018-11-22 23:20:49,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:49,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 23:20:49,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-22 23:20:49,417 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-22 23:20:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:49,434 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-11-22 23:20:49,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 23:20:49,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2018-11-22 23:20:49,435 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2018-11-22 23:20:49,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 23:20:49,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:49,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2018-11-22 23:20:49,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:49,436 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-22 23:20:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2018-11-22 23:20:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-22 23:20:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-22 23:20:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-22 23:20:49,438 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-22 23:20:49,438 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-22 23:20:49,438 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-22 23:20:49,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 35 transitions. [2018-11-22 23:20:49,439 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:49,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:49,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1, 1] [2018-11-22 23:20:49,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:49,439 INFO L794 eck$LassoCheckResult]: Stem: 747#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 743#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; 739#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; 740#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 744#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 751#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 750#L23-3 assume !(main_~i~1 < 10); 738#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 731#L9-3 [2018-11-22 23:20:49,440 INFO L796 eck$LassoCheckResult]: Loop: 731#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 732#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 731#L9-3 [2018-11-22 23:20:49,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,440 INFO L82 PathProgramCache]: Analyzing trace with hash -690407015, now seen corresponding path program 7 times [2018-11-22 23:20:49,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:49,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:49,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:49,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:49,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:49,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-22 23:20:49,579 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:49,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 8 times [2018-11-22 23:20:49,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:49,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 23:20:49,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-22 23:20:49,610 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. cyclomatic complexity: 9 Second operand 11 states. [2018-11-22 23:20:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:49,632 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-22 23:20:49,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 23:20:49,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 38 transitions. [2018-11-22 23:20:49,637 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 38 transitions. [2018-11-22 23:20:49,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 23:20:49,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:49,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 38 transitions. [2018-11-22 23:20:49,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:49,638 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-22 23:20:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 38 transitions. [2018-11-22 23:20:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-22 23:20:49,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 23:20:49,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-22 23:20:49,643 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-22 23:20:49,643 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-22 23:20:49,643 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-22 23:20:49,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 37 transitions. [2018-11-22 23:20:49,644 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:49,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:49,644 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1, 1] [2018-11-22 23:20:49,644 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:49,645 INFO L794 eck$LassoCheckResult]: Stem: 877#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 873#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; 869#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; 870#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 874#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 881#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 880#L23-3 assume !(main_~i~1 < 10); 868#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 861#L9-3 [2018-11-22 23:20:49,645 INFO L796 eck$LassoCheckResult]: Loop: 861#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 862#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 861#L9-3 [2018-11-22 23:20:49,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash -2056121829, now seen corresponding path program 8 times [2018-11-22 23:20:49,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:49,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:49,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:49,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 23:20:49,774 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 23:20:49,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:49,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:49,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-22 23:20:49,796 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:49,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 9 times [2018-11-22 23:20:49,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:49,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 23:20:49,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-22 23:20:49,819 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-11-22 23:20:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:49,837 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-22 23:20:49,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 23:20:49,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2018-11-22 23:20:49,845 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2018-11-22 23:20:49,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 23:20:49,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:49,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2018-11-22 23:20:49,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:49,845 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-22 23:20:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2018-11-22 23:20:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-22 23:20:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-22 23:20:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-22 23:20:49,847 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-22 23:20:49,847 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-22 23:20:49,847 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-22 23:20:49,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2018-11-22 23:20:49,847 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:49,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:49,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:49,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1, 1] [2018-11-22 23:20:49,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:49,848 INFO L794 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1014#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; 1010#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; 1011#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 1015#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1022#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1021#L23-3 assume !(main_~i~1 < 10); 1009#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1002#L9-3 [2018-11-22 23:20:49,848 INFO L796 eck$LassoCheckResult]: Loop: 1002#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1003#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1002#L9-3 [2018-11-22 23:20:49,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,848 INFO L82 PathProgramCache]: Analyzing trace with hash -248065507, now seen corresponding path program 9 times [2018-11-22 23:20:49,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:49,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:49,905 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:49,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:20:49,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-22 23:20:49,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:49,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:49,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:49,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-22 23:20:49,966 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:49,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 10 times [2018-11-22 23:20:49,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:49,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:49,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:49,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 23:20:49,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:20:49,994 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-22 23:20:50,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:50,016 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-22 23:20:50,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 23:20:50,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 41 transitions. [2018-11-22 23:20:50,017 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:50,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 41 transitions. [2018-11-22 23:20:50,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-22 23:20:50,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-22 23:20:50,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 41 transitions. [2018-11-22 23:20:50,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:50,018 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-22 23:20:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 41 transitions. [2018-11-22 23:20:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-22 23:20:50,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-22 23:20:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-22 23:20:50,019 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-22 23:20:50,019 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-22 23:20:50,019 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-22 23:20:50,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 41 transitions. [2018-11-22 23:20:50,020 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2018-11-22 23:20:50,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:50,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:50,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1] [2018-11-22 23:20:50,020 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:50,021 INFO L794 eck$LassoCheckResult]: Stem: 1167#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1165#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; 1161#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; 1162#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 1166#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1173#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1172#L23-3 assume !(main_~i~1 < 10); 1160#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1153#L9-3 [2018-11-22 23:20:50,021 INFO L796 eck$LassoCheckResult]: Loop: 1153#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1154#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1153#L9-3 [2018-11-22 23:20:50,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:50,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2127272351, now seen corresponding path program 10 times [2018-11-22 23:20:50,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:50,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:50,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:50,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:50,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:50,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1731, now seen corresponding path program 11 times [2018-11-22 23:20:50,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:50,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:50,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:50,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:50,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:50,039 INFO L82 PathProgramCache]: Analyzing trace with hash -95702815, now seen corresponding path program 1 times [2018-11-22 23:20:50,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:50,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:50,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:52,073 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 198 DAG size of output: 154 [2018-11-22 23:20:52,166 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:20:52,166 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:20:52,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:20:52,167 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:20:52,167 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:20:52,167 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:20:52,167 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:20:52,167 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:20:52,167 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-11-22 23:20:52,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:20:52,167 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:20:52,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:20:52,356 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:20:52,356 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:20:52,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:52,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:52,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:52,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:52,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,359 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:52,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:52,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:52,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:52,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:52,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:20:52,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:20:52,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:52,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:52,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:52,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:52,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:52,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:52,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:52,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:52,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:52,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:52,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:52,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:52,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:52,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:52,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:52,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:20:52,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:20:52,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:20:52,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:20:52,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:20:52,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:20:52,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:20:52,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:20:52,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:20:52,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:20:52,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:20:52,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:20:52,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:20:52,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:20:52,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:20:52,397 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:20:52,407 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-22 23:20:52,407 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-22 23:20:52,407 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:20:52,408 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:20:52,408 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:20:52,408 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 19 Supporting invariants [] [2018-11-22 23:20:52,433 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-22 23:20:52,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:20:52,487 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 23:20:52,487 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 41 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-22 23:20:52,509 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-11-22 23:20:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-22 23:20:52,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 23:20:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-22 23:20:52,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 2 letters. [2018-11-22 23:20:52,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:20:52,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 26 letters. Loop has 2 letters. [2018-11-22 23:20:52,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:20:52,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 24 letters. Loop has 4 letters. [2018-11-22 23:20:52,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:20:52,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 48 transitions. [2018-11-22 23:20:52,514 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:52,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 38 states and 43 transitions. [2018-11-22 23:20:52,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-22 23:20:52,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-22 23:20:52,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2018-11-22 23:20:52,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:52,515 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-22 23:20:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2018-11-22 23:20:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-22 23:20:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-22 23:20:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-22 23:20:52,517 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-22 23:20:52,517 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-22 23:20:52,517 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-22 23:20:52,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 43 transitions. [2018-11-22 23:20:52,518 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:52,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:52,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:52,518 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:52,518 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:52,519 INFO L794 eck$LassoCheckResult]: Stem: 1360#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1358#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; 1354#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; 1355#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 1359#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1366#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1365#L23-3 assume !(main_~i~1 < 10); 1353#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1345#L9-3 assume !(sum_~i~0 < 10); 1343#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1344#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1363#L9-8 [2018-11-22 23:20:52,519 INFO L796 eck$LassoCheckResult]: Loop: 1363#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1364#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1363#L9-8 [2018-11-22 23:20:52,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1328178265, now seen corresponding path program 1 times [2018-11-22 23:20:52,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,554 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-22 23:20:52,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:20:52,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:20:52,555 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:52,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:52,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2243, now seen corresponding path program 1 times [2018-11-22 23:20:52,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:52,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:52,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:52,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:52,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:20:52,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:20:52,582 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-22 23:20:52,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:52,606 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-11-22 23:20:52,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:20:52,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 47 transitions. [2018-11-22 23:20:52,608 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:52,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 43 states and 47 transitions. [2018-11-22 23:20:52,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-22 23:20:52,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-22 23:20:52,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2018-11-22 23:20:52,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:52,609 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-22 23:20:52,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2018-11-22 23:20:52,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-11-22 23:20:52,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 23:20:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-22 23:20:52,611 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-22 23:20:52,611 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-22 23:20:52,611 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-22 23:20:52,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2018-11-22 23:20:52,611 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:52,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:52,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:52,612 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:52,612 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:52,612 INFO L794 eck$LassoCheckResult]: Stem: 1448#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1445#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; 1441#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; 1442#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1453#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1452#L23-3 assume !(main_~i~1 < 10); 1440#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1432#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1433#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1434#L9-3 assume !(sum_~i~0 < 10); 1430#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1431#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1449#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1450#L9-7 [2018-11-22 23:20:52,612 INFO L796 eck$LassoCheckResult]: Loop: 1450#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1451#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1450#L9-7 [2018-11-22 23:20:52,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:52,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1721709263, now seen corresponding path program 1 times [2018-11-22 23:20:52,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:52,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:52,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:52,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,668 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-22 23:20:52,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:52,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:52,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-22 23:20:52,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:52,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-22 23:20:52,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:52,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 2 times [2018-11-22 23:20:52,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:52,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:52,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:52,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:52,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:20:52,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-22 23:20:52,799 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-22 23:20:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:52,835 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-11-22 23:20:52,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 23:20:52,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions. [2018-11-22 23:20:52,837 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:52,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions. [2018-11-22 23:20:52,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-22 23:20:52,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-22 23:20:52,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions. [2018-11-22 23:20:52,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:52,838 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-22 23:20:52,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions. [2018-11-22 23:20:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-22 23:20:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-22 23:20:52,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-22 23:20:52,840 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-22 23:20:52,840 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-22 23:20:52,843 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-22 23:20:52,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2018-11-22 23:20:52,844 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:52,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:52,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:52,845 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:52,845 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:52,845 INFO L794 eck$LassoCheckResult]: Stem: 1631#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1630#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; 1626#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; 1627#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1640#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1639#L23-3 assume !(main_~i~1 < 10); 1625#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1615#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1616#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1617#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1618#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1622#L9-3 assume !(sum_~i~0 < 10); 1613#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1614#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1634#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1635#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1636#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1638#L9-7 [2018-11-22 23:20:52,845 INFO L796 eck$LassoCheckResult]: Loop: 1638#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1637#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1638#L9-7 [2018-11-22 23:20:52,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:52,845 INFO L82 PathProgramCache]: Analyzing trace with hash 528482161, now seen corresponding path program 1 times [2018-11-22 23:20:52,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:52,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:52,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:52,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-22 23:20:52,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:52,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:52,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2018-11-22 23:20:52,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:52,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-22 23:20:52,957 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:52,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 3 times [2018-11-22 23:20:52,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:52,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:52,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:52,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:52,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:20:52,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:20:52,984 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-11-22 23:20:53,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:53,012 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2018-11-22 23:20:53,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:20:53,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 59 transitions. [2018-11-22 23:20:53,014 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:53,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 55 states and 59 transitions. [2018-11-22 23:20:53,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-22 23:20:53,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-22 23:20:53,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2018-11-22 23:20:53,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:53,015 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-22 23:20:53,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2018-11-22 23:20:53,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-11-22 23:20:53,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-22 23:20:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-11-22 23:20:53,017 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-22 23:20:53,017 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-11-22 23:20:53,017 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-22 23:20:53,018 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 51 transitions. [2018-11-22 23:20:53,018 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:53,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:53,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:53,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:53,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:53,019 INFO L794 eck$LassoCheckResult]: Stem: 1838#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1835#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; 1831#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; 1832#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 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; 1852#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; 1851#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 1845#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 1844#L23-3 assume !(main_~i~1 < 10); 1830#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1821#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1822#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1823#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1824#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1865#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1843#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1842#L9-3 assume !(sum_~i~0 < 10); 1819#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 1820#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 1839#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1840#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1841#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1864#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1863#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1850#L9-7 [2018-11-22 23:20:53,019 INFO L796 eck$LassoCheckResult]: Loop: 1850#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 1849#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1850#L9-7 [2018-11-22 23:20:53,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1101320015, now seen corresponding path program 2 times [2018-11-22 23:20:53,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:53,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:53,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:53,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:53,066 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-22 23:20:53,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:53,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 23:20:53,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 23:20:53,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:53,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-22 23:20:53,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:53,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-22 23:20:53,137 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:53,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 4 times [2018-11-22 23:20:53,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:53,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:53,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:53,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:53,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 23:20:53,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:20:53,198 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-22 23:20:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:53,244 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-22 23:20:53,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:20:53,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2018-11-22 23:20:53,245 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:53,245 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 65 transitions. [2018-11-22 23:20:53,245 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-22 23:20:53,245 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-22 23:20:53,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 65 transitions. [2018-11-22 23:20:53,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:53,246 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-11-22 23:20:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 65 transitions. [2018-11-22 23:20:53,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 51. [2018-11-22 23:20:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-22 23:20:53,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-22 23:20:53,248 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-22 23:20:53,248 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-22 23:20:53,248 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-22 23:20:53,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2018-11-22 23:20:53,251 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:53,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:53,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:53,251 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:53,251 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:53,251 INFO L794 eck$LassoCheckResult]: Stem: 2066#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2065#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; 2061#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; 2062#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2063#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; 2064#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2092#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; 2091#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2090#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; 2089#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2088#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; 2087#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2086#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; 2085#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2084#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; 2083#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2082#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; 2081#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2080#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; 2079#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2078#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; 2077#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2076#L23-3 assume !(main_~i~1 < 10); 2060#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2050#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2051#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2052#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2053#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2057#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2094#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2093#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2073#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2072#L9-3 assume !(sum_~i~0 < 10); 2048#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2049#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2069#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2070#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2071#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2098#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2097#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2096#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2095#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2075#L9-7 [2018-11-22 23:20:53,251 INFO L796 eck$LassoCheckResult]: Loop: 2075#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2074#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2075#L9-7 [2018-11-22 23:20:53,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,252 INFO L82 PathProgramCache]: Analyzing trace with hash 512696561, now seen corresponding path program 3 times [2018-11-22 23:20:53,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:53,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:53,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:53,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-22 23:20:53,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:53,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:20:53,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-22 23:20:53,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:53,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:53,347 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-22 23:20:53,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:53,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-22 23:20:53,362 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:53,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,362 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 5 times [2018-11-22 23:20:53,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:53,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:53,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:53,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:53,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 23:20:53,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-22 23:20:53,384 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-11-22 23:20:53,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:53,444 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-11-22 23:20:53,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 23:20:53,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 71 transitions. [2018-11-22 23:20:53,444 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:53,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 71 transitions. [2018-11-22 23:20:53,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-22 23:20:53,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-22 23:20:53,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 71 transitions. [2018-11-22 23:20:53,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:53,446 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-22 23:20:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 71 transitions. [2018-11-22 23:20:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2018-11-22 23:20:53,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-22 23:20:53,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-11-22 23:20:53,447 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-22 23:20:53,448 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-11-22 23:20:53,448 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-22 23:20:53,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 59 transitions. [2018-11-22 23:20:53,448 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:53,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:53,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:53,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:53,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:53,449 INFO L794 eck$LassoCheckResult]: Stem: 2318#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2317#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; 2313#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; 2314#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2329#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2328#L23-3 assume !(main_~i~1 < 10); 2312#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2302#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2303#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2304#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2305#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2309#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2348#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2347#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2346#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2345#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2325#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2324#L9-3 assume !(sum_~i~0 < 10); 2300#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2301#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2321#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2322#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2323#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2354#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2353#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2352#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2351#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2350#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2349#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2327#L9-7 [2018-11-22 23:20:53,449 INFO L796 eck$LassoCheckResult]: Loop: 2327#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2326#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2327#L9-7 [2018-11-22 23:20:53,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1883803697, now seen corresponding path program 4 times [2018-11-22 23:20:53,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:53,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:53,506 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-22 23:20:53,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:53,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:20:53,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:20:53,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:53,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-22 23:20:53,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:53,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-22 23:20:53,588 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:53,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 6 times [2018-11-22 23:20:53,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:53,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:53,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:53,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:53,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 23:20:53,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 23:20:53,628 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-11-22 23:20:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:53,676 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-22 23:20:53,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:20:53,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 77 transitions. [2018-11-22 23:20:53,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:53,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 73 states and 77 transitions. [2018-11-22 23:20:53,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-11-22 23:20:53,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-22 23:20:53,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 77 transitions. [2018-11-22 23:20:53,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:53,678 INFO L705 BuchiCegarLoop]: Abstraction has 73 states and 77 transitions. [2018-11-22 23:20:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 77 transitions. [2018-11-22 23:20:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 59. [2018-11-22 23:20:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-22 23:20:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2018-11-22 23:20:53,680 INFO L728 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-22 23:20:53,680 INFO L608 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2018-11-22 23:20:53,680 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-22 23:20:53,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 63 transitions. [2018-11-22 23:20:53,681 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:53,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:53,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:53,681 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:53,681 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:53,681 INFO L794 eck$LassoCheckResult]: Stem: 2592#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2591#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; 2587#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; 2588#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2589#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; 2590#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2618#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; 2617#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2616#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; 2615#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2614#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; 2613#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2612#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; 2611#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2610#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; 2609#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2608#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; 2607#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2606#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; 2605#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2604#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; 2603#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2602#L23-3 assume !(main_~i~1 < 10); 2586#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2577#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2578#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2579#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2580#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2625#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2624#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2623#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2622#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2621#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2620#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2619#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2599#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2598#L9-3 assume !(sum_~i~0 < 10); 2575#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2576#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2595#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2596#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2597#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2633#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2632#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2631#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2630#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2629#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2628#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2627#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2626#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2601#L9-7 [2018-11-22 23:20:53,682 INFO L796 eck$LassoCheckResult]: Loop: 2601#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2600#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2601#L9-7 [2018-11-22 23:20:53,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash -414957967, now seen corresponding path program 5 times [2018-11-22 23:20:53,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:53,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:53,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-22 23:20:53,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:53,747 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-22 23:20:53,789 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-11-22 23:20:53,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:53,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-22 23:20:53,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:53,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-22 23:20:53,820 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:53,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 7 times [2018-11-22 23:20:53,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:53,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:53,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:53,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:53,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:53,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 23:20:53,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-22 23:20:53,847 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-11-22 23:20:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:53,910 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-11-22 23:20:53,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 23:20:53,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 83 transitions. [2018-11-22 23:20:53,911 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:53,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 83 transitions. [2018-11-22 23:20:53,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-22 23:20:53,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-22 23:20:53,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 83 transitions. [2018-11-22 23:20:53,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:53,912 INFO L705 BuchiCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-11-22 23:20:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 83 transitions. [2018-11-22 23:20:53,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2018-11-22 23:20:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-22 23:20:53,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-11-22 23:20:53,914 INFO L728 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-22 23:20:53,914 INFO L608 BuchiCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-11-22 23:20:53,914 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-22 23:20:53,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 67 transitions. [2018-11-22 23:20:53,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:53,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:53,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:53,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:53,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:53,916 INFO L794 eck$LassoCheckResult]: Stem: 2893#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2890#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; 2886#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; 2887#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 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; 2907#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; 2906#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 2900#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 2899#L23-3 assume !(main_~i~1 < 10); 2885#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2875#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2876#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2877#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2878#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2882#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2925#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2924#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2923#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2922#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2921#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2920#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2919#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2918#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2898#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2897#L9-3 assume !(sum_~i~0 < 10); 2873#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2874#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 2894#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2895#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2896#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2935#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2934#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2933#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2932#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2931#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2930#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2929#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2928#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2927#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2926#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2905#L9-7 [2018-11-22 23:20:53,916 INFO L796 eck$LassoCheckResult]: Loop: 2905#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 2904#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2905#L9-7 [2018-11-22 23:20:53,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,916 INFO L82 PathProgramCache]: Analyzing trace with hash 919530417, now seen corresponding path program 6 times [2018-11-22 23:20:53,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:53,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:53,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-11-22 23:20:53,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:54,004 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-22 23:20:54,126 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-22 23:20:54,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:54,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:54,173 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 19 proven. 49 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-22 23:20:54,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:54,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2018-11-22 23:20:54,191 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:54,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:54,191 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 8 times [2018-11-22 23:20:54,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:54,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:54,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:54,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:54,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 23:20:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:20:54,216 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-22 23:20:54,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:54,334 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-11-22 23:20:54,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 23:20:54,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 89 transitions. [2018-11-22 23:20:54,335 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:54,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 85 states and 89 transitions. [2018-11-22 23:20:54,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-22 23:20:54,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-22 23:20:54,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 89 transitions. [2018-11-22 23:20:54,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:54,336 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-11-22 23:20:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 89 transitions. [2018-11-22 23:20:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-11-22 23:20:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-22 23:20:54,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-22 23:20:54,337 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-22 23:20:54,337 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-22 23:20:54,337 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-22 23:20:54,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 71 transitions. [2018-11-22 23:20:54,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:54,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:54,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:54,339 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:54,339 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:54,339 INFO L794 eck$LassoCheckResult]: Stem: 3229#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3228#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; 3224#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; 3225#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3241#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3240#L23-3 assume !(main_~i~1 < 10); 3223#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3214#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3215#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3216#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3217#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3278#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3277#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3275#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3273#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3271#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3269#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3267#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3265#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3263#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3261#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3259#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3237#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3236#L9-3 assume !(sum_~i~0 < 10); 3212#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3213#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3234#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3235#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3232#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3233#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3276#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3274#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3272#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3270#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3268#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3266#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3264#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3262#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3260#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3258#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3257#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3239#L9-7 [2018-11-22 23:20:54,339 INFO L796 eck$LassoCheckResult]: Loop: 3239#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3238#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3239#L9-7 [2018-11-22 23:20:54,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash 231036913, now seen corresponding path program 7 times [2018-11-22 23:20:54,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:54,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:54,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:54,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-22 23:20:54,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:54,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:20:54,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:54,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2018-11-22 23:20:54,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:54,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-22 23:20:54,483 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:54,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 9 times [2018-11-22 23:20:54,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:54,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:54,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:54,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:54,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 23:20:54,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-22 23:20:54,502 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-11-22 23:20:54,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:54,572 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-11-22 23:20:54,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 23:20:54,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2018-11-22 23:20:54,574 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:54,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 95 transitions. [2018-11-22 23:20:54,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-22 23:20:54,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-22 23:20:54,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 95 transitions. [2018-11-22 23:20:54,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:54,575 INFO L705 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-11-22 23:20:54,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 95 transitions. [2018-11-22 23:20:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2018-11-22 23:20:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-22 23:20:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-11-22 23:20:54,577 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-22 23:20:54,577 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-11-22 23:20:54,577 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-22 23:20:54,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 75 transitions. [2018-11-22 23:20:54,577 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:54,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:54,577 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:54,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:54,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:54,578 INFO L794 eck$LassoCheckResult]: Stem: 3573#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3572#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; 3568#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; 3569#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3585#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3584#L23-3 assume !(main_~i~1 < 10); 3567#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3558#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3559#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3560#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3561#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3626#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3625#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3624#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3623#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3622#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3621#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3620#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3619#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3618#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3617#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3616#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3615#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3614#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3581#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3580#L9-3 assume !(sum_~i~0 < 10); 3556#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3557#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3578#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3579#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3576#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3577#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3613#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3612#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3611#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3610#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3609#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3608#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3607#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3606#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3605#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3604#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3603#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3602#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3601#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3583#L9-7 [2018-11-22 23:20:54,578 INFO L796 eck$LassoCheckResult]: Loop: 3583#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3582#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3583#L9-7 [2018-11-22 23:20:54,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:54,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1835777231, now seen corresponding path program 8 times [2018-11-22 23:20:54,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:54,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:54,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-22 23:20:54,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:54,688 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_813461f3-2cd8-47b0-904b-83eaf76428b1/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-11-22 23:20:54,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 23:20:54,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 23:20:54,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:54,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:54,736 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-22 23:20:54,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:20:54,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-22 23:20:54,762 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:20:54,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:54,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 10 times [2018-11-22 23:20:54,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:54,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:54,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:54,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:54,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 23:20:54,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:20:54,782 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-11-22 23:20:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:54,836 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-11-22 23:20:54,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 23:20:54,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 98 transitions. [2018-11-22 23:20:54,837 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:54,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 94 states and 98 transitions. [2018-11-22 23:20:54,837 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2018-11-22 23:20:54,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-22 23:20:54,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 98 transitions. [2018-11-22 23:20:54,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:54,837 INFO L705 BuchiCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-11-22 23:20:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 98 transitions. [2018-11-22 23:20:54,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2018-11-22 23:20:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-22 23:20:54,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-11-22 23:20:54,839 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-22 23:20:54,839 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-11-22 23:20:54,839 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-22 23:20:54,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 79 transitions. [2018-11-22 23:20:54,840 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2018-11-22 23:20:54,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:54,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:54,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:54,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:54,841 INFO L794 eck$LassoCheckResult]: Stem: 3939#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3936#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; 3932#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; 3933#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 3976#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; 3974#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3972#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; 3970#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3968#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; 3966#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3964#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; 3962#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3960#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; 3958#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3956#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; 3954#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3952#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; 3950#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);call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet3; 3947#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 3946#L23-3 assume !(main_~i~1 < 10); 3931#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3922#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3923#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3924#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3925#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3977#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3975#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3973#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3971#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3969#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3967#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3965#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3963#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3961#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3959#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3957#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3955#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3953#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3951#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3949#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3945#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3944#L9-3 assume !(sum_~i~0 < 10); 3920#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3921#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 3942#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3943#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3940#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3941#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3994#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3993#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3992#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3991#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3990#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3989#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3988#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3987#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3986#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3985#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3984#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3983#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3982#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3981#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3980#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3979#L9-7 [2018-11-22 23:20:54,841 INFO L796 eck$LassoCheckResult]: Loop: 3979#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 3978#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3979#L9-7 [2018-11-22 23:20:54,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:54,841 INFO L82 PathProgramCache]: Analyzing trace with hash -549950095, now seen corresponding path program 9 times [2018-11-22 23:20:54,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:54,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:54,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:54,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:55,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:55,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2303, now seen corresponding path program 11 times [2018-11-22 23:20:55,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:55,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:55,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:55,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:55,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:55,121 INFO L82 PathProgramCache]: Analyzing trace with hash -221062545, now seen corresponding path program 10 times [2018-11-22 23:20:55,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:55,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-22 23:20:55,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:20:55,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-22 23:20:55,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 23:20:55,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-11-22 23:20:55,287 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. cyclomatic complexity: 9 Second operand 15 states. [2018-11-22 23:20:55,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:55,441 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-11-22 23:20:55,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-22 23:20:55,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 95 transitions. [2018-11-22 23:20:55,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 23:20:55,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 72 states and 73 transitions. [2018-11-22 23:20:55,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-22 23:20:55,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-22 23:20:55,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 73 transitions. [2018-11-22 23:20:55,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:20:55,444 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-22 23:20:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 73 transitions. [2018-11-22 23:20:55,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-22 23:20:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-22 23:20:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-22 23:20:55,445 INFO L728 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-22 23:20:55,445 INFO L608 BuchiCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-22 23:20:55,445 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-22 23:20:55,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 73 transitions. [2018-11-22 23:20:55,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-22 23:20:55,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:20:55,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:20:55,446 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:55,446 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:20:55,447 INFO L794 eck$LassoCheckResult]: Stem: 4146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4143#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; 4139#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; 4140#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 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; 4185#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; 4184#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4182#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; 4180#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4178#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; 4176#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4174#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; 4172#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4170#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; 4168#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4166#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; 4164#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4162#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; 4160#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4158#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; 4155#L23-2 main_#t~post2 := main_~i~1;main_~i~1 := 1 + main_#t~post2;havoc main_#t~post2; 4154#L23-3 assume !(main_~i~1 < 10); 4138#L23-4 sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4133#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4134#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4135#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4183#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4181#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4179#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4177#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4175#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4173#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4171#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4169#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4167#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4165#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4163#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4161#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4159#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4157#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4156#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4153#L9-3 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4152#L9-2 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4151#L9-3 assume !(sum_~i~0 < 10); 4131#L9-4 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4132#L12 main_#t~ret4 := sum_#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);sum_#in~x.base, sum_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc sum_#res;havoc sum_#t~mem1, sum_#t~post0, sum_~x.base, sum_~x.offset, sum_~i~0, sum_~ret~0;sum_~x.base, sum_~x.offset := sum_#in~x.base, sum_#in~x.offset;havoc sum_~i~0;havoc sum_~ret~0;sum_~ret~0 := 0;sum_~i~0 := 0; 4149#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4150#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4147#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4148#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4202#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4201#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4200#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4199#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4198#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4197#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4196#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4195#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4194#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4193#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4192#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4191#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4190#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4189#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4188#L9-8 assume !!(sum_~i~0 < 10);call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + 4 * sum_~i~0, 4);sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4187#L9-7 sum_#t~post0 := sum_~i~0;sum_~i~0 := 1 + sum_#t~post0;havoc sum_#t~post0; 4186#L9-8 assume !(sum_~i~0 < 10); 4144#L9-9 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4145#L12-1 main_#t~ret7 := sum_#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; 4136#L32-3 [2018-11-22 23:20:55,447 INFO L796 eck$LassoCheckResult]: Loop: 4136#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; 4137#L32-2 main_#t~post9 := main_~i~2;main_~i~2 := 1 + main_#t~post9;havoc main_#t~post9; 4136#L32-3 [2018-11-22 23:20:55,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:55,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1987708689, now seen corresponding path program 1 times [2018-11-22 23:20:55,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:55,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:55,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:55,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:55,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:55,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2755, now seen corresponding path program 1 times [2018-11-22 23:20:55,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:55,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:55,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:55,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:55,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:55,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1072398385, now seen corresponding path program 1 times [2018-11-22 23:20:55,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:20:55,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:20:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:55,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:20:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:21:14,448 WARN L180 SmtUtils]: Spent 18.63 s on a formula simplification. DAG size of input: 524 DAG size of output: 390 [2018-11-22 23:21:17,758 WARN L180 SmtUtils]: Spent 3.25 s on a formula simplification. DAG size of input: 181 DAG size of output: 177 [2018-11-22 23:21:17,760 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:21:17,761 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:21:17,761 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:21:17,761 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:21:17,761 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:21:17,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:21:17,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:21:17,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:21:17,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10_true-unreach-call_true-termination.i_Iteration24_Lasso [2018-11-22 23:21:17,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:21:17,761 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:21:17,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:17,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:17,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:17,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:17,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:17,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:17,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:17,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:17,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:19,051 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-22 23:21:19,359 WARN L180 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 98 [2018-11-22 23:21:19,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:19,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:19,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:19,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:19,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:21:19,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-11-22 23:21:19,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-11-22 23:21:19,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-11-22 23:21:19,570 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 82 [2018-11-22 23:21:19,860 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2018-11-22 23:21:19,902 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:21:19,902 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:21:19,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,903 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,907 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,907 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,908 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:21:19,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:21:19,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,910 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,911 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,912 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,912 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:21:19,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:21:19,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,918 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:21:19,918 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:21:19,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,921 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,923 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:21:19,927 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:21:19,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,929 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,930 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,932 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,938 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:21:19,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,946 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:21:19,946 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:21:19,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:21:19,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:21:19,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:21:19,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:21:19,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:21:19,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:21:19,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:21:19,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:21:19,961 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:21:19,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:21:19,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:21:19,970 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:21:19,982 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-22 23:21:19,982 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 23:21:19,982 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:21:19,983 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:21:19,983 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:21:19,983 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 17 Supporting invariants [] [2018-11-22 23:21:20,584 INFO L297 tatePredicateManager]: 103 out of 103 supporting invariants were superfluous and have been removed [2018-11-22 23:21:20,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:21:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:21:20,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:21:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:21:20,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:21:20,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:21:20,650 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-22 23:21:20,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-22 23:21:20,658 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 73 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 74 states and 76 transitions. Complement of second has 4 states. [2018-11-22 23:21:20,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-22 23:21:20,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-22 23:21:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2018-11-22 23:21:20,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 70 letters. Loop has 2 letters. [2018-11-22 23:21:20,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:21:20,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 72 letters. Loop has 2 letters. [2018-11-22 23:21:20,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:21:20,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 70 letters. Loop has 4 letters. [2018-11-22 23:21:20,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:21:20,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 76 transitions. [2018-11-22 23:21:20,662 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 23:21:20,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 0 states and 0 transitions. [2018-11-22 23:21:20,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-22 23:21:20,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-22 23:21:20,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-22 23:21:20,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:21:20,662 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:21:20,662 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:21:20,662 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 23:21:20,662 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-22 23:21:20,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-22 23:21:20,662 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-22 23:21:20,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-22 23:21:20,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 11:21:20 BoogieIcfgContainer [2018-11-22 23:21:20,668 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 23:21:20,668 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:21:20,668 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:21:20,669 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:21:20,669 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:20:47" (3/4) ... [2018-11-22 23:21:20,672 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-22 23:21:20,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:21:20,673 INFO L168 Benchmark]: Toolchain (without parser) took 33449.84 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.3 MB). Free memory was 954.8 MB in the beginning and 1.4 GB in the end (delta: -417.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:21:20,674 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:21:20,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.80 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:20,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.43 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:20,675 INFO L168 Benchmark]: Boogie Preprocessor took 55.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -196.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:20,675 INFO L168 Benchmark]: RCFGBuilder took 182.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:20,675 INFO L168 Benchmark]: BuchiAutomizer took 33009.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 274.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -252.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:20,676 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:21:20,678 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 169.80 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 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 25.43 ms. Allocated memory is still 1.0 GB. Free memory was 944.1 MB in the beginning and 941.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -196.5 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 182.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 33009.70 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 274.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -252.3 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.4 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 19 * unknown-#length-unknown[x] + -8 * i 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 -2 * i + 17 and consists of 3 locations. 21 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 32.9s and 25 iterations. TraceHistogramMax:10. Analysis of lassos took 31.5s. Construction of modules took 0.6s. Büchi inclusion checks took 0.5s. 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: 404 SDtfs, 473 SDslu, 1356 SDs, 0 SdLazy, 868 SolverSat, 252 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital931 mio100 ax100 hnf99 lsp134 ukn39 mio100 lsp65 div100 bol100 ite100 ukn100 eq166 hnf84 smp88 dnf276 smp75 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms 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...