./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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_f21281ad-b58b-4254-bbdd-0fdb7cc62325/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-1dbac8b [2018-10-27 06:12:56,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:12:56,976 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:12:56,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:12:56,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:12:56,985 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:12:56,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:12:56,987 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:12:56,988 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:12:56,989 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:12:56,989 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:12:56,989 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:12:56,990 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:12:56,991 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:12:56,992 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:12:56,993 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:12:56,994 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:12:56,995 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:12:56,997 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:12:56,998 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:12:56,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:12:57,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:12:57,002 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:12:57,002 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:12:57,003 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:12:57,003 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:12:57,005 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:12:57,006 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:12:57,006 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:12:57,007 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:12:57,007 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:12:57,008 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:12:57,009 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:12:57,009 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:12:57,010 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:12:57,011 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:12:57,011 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:12:57,025 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:12:57,025 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:12:57,026 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:12:57,026 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:12:57,026 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:12:57,027 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:12:57,027 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:12:57,027 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:12:57,027 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:12:57,027 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:12:57,027 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:12:57,028 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:12:57,028 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:12:57,028 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:12:57,029 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:12:57,030 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:12:57,030 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:12:57,030 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:12:57,030 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:12:57,030 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:12:57,031 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:12:57,031 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:12:57,031 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:12:57,031 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:12:57,031 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:12:57,031 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:12:57,032 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:12:57,032 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:12:57,032 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:12:57,032 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:12:57,033 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:12:57,033 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_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:12:57,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:12:57,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:12:57,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:12:57,087 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:12:57,087 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:12:57,088 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/bin-2019/uautomizer/../../sv-benchmarks/c/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-10-27 06:12:57,142 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/bin-2019/uautomizer/data/d25ef98c4/396c15c3ccd74130945fbf23f51207ac/FLAGc1a14bc02 [2018-10-27 06:12:57,486 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:12:57,486 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/sv-benchmarks/c/reducercommutativity/sum10_true-unreach-call_true-termination.i [2018-10-27 06:12:57,492 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/bin-2019/uautomizer/data/d25ef98c4/396c15c3ccd74130945fbf23f51207ac/FLAGc1a14bc02 [2018-10-27 06:12:57,505 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/bin-2019/uautomizer/data/d25ef98c4/396c15c3ccd74130945fbf23f51207ac [2018-10-27 06:12:57,508 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:12:57,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:12:57,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:57,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:12:57,516 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:12:57,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54241dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57, skipping insertion in model container [2018-10-27 06:12:57,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:12:57,543 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:12:57,674 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:57,681 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:12:57,697 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:12:57,711 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:12:57,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57 WrapperNode [2018-10-27 06:12:57,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:12:57,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:57,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:12:57,712 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:12:57,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:12:57,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:12:57,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:12:57,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:12:57,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,773 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (1/1) ... [2018-10-27 06:12:57,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:12:57,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:12:57,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:12:57,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:12:57,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:12:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:12:57,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:12:57,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:12:57,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:12:58,434 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:12:58,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:58 BoogieIcfgContainer [2018-10-27 06:12:58,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:12:58,435 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:12:58,435 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:12:58,438 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:12:58,439 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:58,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:12:57" (1/3) ... [2018-10-27 06:12:58,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18df5a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:58, skipping insertion in model container [2018-10-27 06:12:58,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:58,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:12:57" (2/3) ... [2018-10-27 06:12:58,441 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18df5a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:12:58, skipping insertion in model container [2018-10-27 06:12:58,441 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:12:58,441 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:58" (3/3) ... [2018-10-27 06:12:58,443 INFO L375 chiAutomizerObserver]: Analyzing ICFG sum10_true-unreach-call_true-termination.i [2018-10-27 06:12:58,502 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:12:58,502 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:12:58,502 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:12:58,502 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:12:58,502 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:12:58,503 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:12:58,503 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:12:58,503 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:12:58,503 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:12:58,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2018-10-27 06:12:58,547 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2018-10-27 06:12:58,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:58,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:58,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:58,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:58,555 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:12:58,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2018-10-27 06:12:58,558 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 26 [2018-10-27 06:12:58,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:12:58,559 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:12:58,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:12:58,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:12:58,567 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 18#L23-4true [2018-10-27 06:12:58,569 INFO L795 eck$LassoCheckResult]: Loop: 18#L23-4true assume true; 37#L23-1true assume !!(main_~i~1 < 10); 52#L24true SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 51#L24-1true havoc main_#t~nondet3; 21#L23-3true main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 18#L23-4true [2018-10-27 06:12:58,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:58,575 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:12:58,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:58,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:58,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:58,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:58,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:58,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:58,680 INFO L82 PathProgramCache]: Analyzing trace with hash 34509928, now seen corresponding path program 1 times [2018-10-27 06:12:58,680 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:58,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:58,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:58,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:58,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:58,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:12:58,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1805949414, now seen corresponding path program 1 times [2018-10-27 06:12:58,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:12:58,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:12:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:12:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:12:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:12:59,026 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-27 06:12:59,110 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:12:59,112 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:12:59,112 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:12:59,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:12:59,112 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:12:59,113 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:12:59,113 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:12:59,113 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:12:59,113 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10_true-unreach-call_true-termination.i_Iteration1_Lasso [2018-10-27 06:12:59,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:12:59,114 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:12:59,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,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-10-27 06:12:59,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,323 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2018-10-27 06:12:59,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,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-10-27 06:12:59,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:12:59,649 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 06:12:59,756 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-27 06:12:59,909 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-27 06:13:00,321 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:00,324 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:00,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:13:00,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:00,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:00,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:00,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:00,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:00,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:00,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:00,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:00,334 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-10-27 06:13:00,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:00,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:00,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:00,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:00,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:00,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:00,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:00,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:00,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:13:00,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:00,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:00,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:00,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:00,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:00,340 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:00,345 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:00,345 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-10-27 06:13:00,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:00,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:00,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:00,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:00,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:00,347 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:00,347 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:00,348 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:00,348 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-10-27 06:13:00,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:00,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:00,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:00,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:00,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:00,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:00,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:00,371 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-10-27 06:13:00,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:00,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:00,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:00,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:00,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:00,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:00,446 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:13:00,509 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:13:00,512 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-10-27 06:13:00,514 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:13:00,519 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:13:00,519 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:13:00,520 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~1) = -2*ULTIMATE.start_main_~i~1 + 19 Supporting invariants [] [2018-10-27 06:13:00,533 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-10-27 06:13:00,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:00,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:00,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:00,646 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-10-27 06:13:00,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states. Second operand 4 states. [2018-10-27 06:13:00,721 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states.. Second operand 4 states. Result 144 states and 168 transitions. Complement of second has 7 states. [2018-10-27 06:13:00,724 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-10-27 06:13:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:13:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2018-10-27 06:13:00,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 113 transitions. Stem has 2 letters. Loop has 5 letters. [2018-10-27 06:13:00,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:00,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 113 transitions. Stem has 7 letters. Loop has 5 letters. [2018-10-27 06:13:00,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:00,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 113 transitions. Stem has 2 letters. Loop has 10 letters. [2018-10-27 06:13:00,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:00,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 168 transitions. [2018-10-27 06:13:00,741 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:00,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 46 states and 51 transitions. [2018-10-27 06:13:00,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2018-10-27 06:13:00,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:00,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. [2018-10-27 06:13:00,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:00,748 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-10-27 06:13:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. [2018-10-27 06:13:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-27 06:13:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 06:13:00,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-10-27 06:13:00,777 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-10-27 06:13:00,777 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-10-27 06:13:00,777 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:13:00,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 51 transitions. [2018-10-27 06:13:00,779 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:00,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:00,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:00,779 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:00,779 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:00,780 INFO L793 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 270#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 271#L23-4 assume true; 278#L23-1 assume !(main_~i~1 < 10); 279#L23-5 assume { :begin_inline_sum } true;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; 257#L9-4 [2018-10-27 06:13:00,780 INFO L795 eck$LassoCheckResult]: Loop: 257#L9-4 assume true; 258#L9-1 assume !!(sum_~i~0 < 10); 264#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 274#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 260#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 257#L9-4 [2018-10-27 06:13:00,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:00,780 INFO L82 PathProgramCache]: Analyzing trace with hash 28694797, now seen corresponding path program 1 times [2018-10-27 06:13:00,780 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:00,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:00,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:00,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:00,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:00,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:13:00,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:13:00,856 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:00,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:00,856 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 1 times [2018-10-27 06:13:00,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:00,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:00,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:00,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:00,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:00,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:13:00,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:13:00,972 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-10-27 06:13:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:01,004 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-10-27 06:13:01,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:13:01,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 55 transitions. [2018-10-27 06:13:01,010 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:01,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 50 states and 54 transitions. [2018-10-27 06:13:01,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:13:01,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:01,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 54 transitions. [2018-10-27 06:13:01,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:01,011 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-10-27 06:13:01,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 54 transitions. [2018-10-27 06:13:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-10-27 06:13:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 06:13:01,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-10-27 06:13:01,015 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-10-27 06:13:01,015 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-10-27 06:13:01,015 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:13:01,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 50 transitions. [2018-10-27 06:13:01,016 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:01,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:01,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:01,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:01,017 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:01,017 INFO L793 eck$LassoCheckResult]: Stem: 401#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 370#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 371#L23-4 assume true; 383#L23-1 assume !!(main_~i~1 < 10); 384#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 403#L24-1 havoc main_#t~nondet3; 399#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 398#L23-4 assume true; 381#L23-1 assume !(main_~i~1 < 10); 382#L23-5 assume { :begin_inline_sum } true;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; 360#L9-4 [2018-10-27 06:13:01,017 INFO L795 eck$LassoCheckResult]: Loop: 360#L9-4 assume true; 361#L9-1 assume !!(sum_~i~0 < 10); 367#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 377#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 363#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 360#L9-4 [2018-10-27 06:13:01,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:01,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2016318454, now seen corresponding path program 1 times [2018-10-27 06:13:01,017 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:01,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:01,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:01,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:01,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:01,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:01,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:01,071 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:01,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:01,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:01,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:01,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:01,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-27 06:13:01,145 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:01,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:01,145 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 2 times [2018-10-27 06:13:01,145 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:01,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:01,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:01,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:01,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:01,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:13:01,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:13:01,218 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-10-27 06:13:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:01,249 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-10-27 06:13:01,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:13:01,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 60 transitions. [2018-10-27 06:13:01,253 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:01,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 55 states and 59 transitions. [2018-10-27 06:13:01,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:13:01,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:01,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2018-10-27 06:13:01,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:01,254 INFO L705 BuchiCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-10-27 06:13:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2018-10-27 06:13:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-10-27 06:13:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-27 06:13:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-10-27 06:13:01,258 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-10-27 06:13:01,258 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-10-27 06:13:01,258 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:13:01,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 55 transitions. [2018-10-27 06:13:01,259 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:01,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:01,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:01,259 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1] [2018-10-27 06:13:01,260 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:01,260 INFO L793 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 508#L23-4 assume true; 535#L23-1 assume !!(main_~i~1 < 10); 545#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 544#L24-1 havoc main_#t~nondet3; 537#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 536#L23-4 assume true; 520#L23-1 assume !!(main_~i~1 < 10); 521#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 541#L24-1 havoc main_#t~nondet3; 542#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 543#L23-4 assume true; 518#L23-1 assume !(main_~i~1 < 10); 519#L23-5 assume { :begin_inline_sum } true;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; 497#L9-4 [2018-10-27 06:13:01,260 INFO L795 eck$LassoCheckResult]: Loop: 497#L9-4 assume true; 498#L9-1 assume !!(sum_~i~0 < 10); 504#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 514#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 500#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 497#L9-4 [2018-10-27 06:13:01,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:01,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1843081005, now seen corresponding path program 2 times [2018-10-27 06:13:01,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:01,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:01,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:01,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:01,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:01,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:01,305 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:01,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:13:01,337 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:13:01,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:01,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:01,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:01,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-10-27 06:13:01,471 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:01,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:01,471 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 3 times [2018-10-27 06:13:01,471 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:01,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:01,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:01,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:01,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:01,645 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:13:01,841 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:13:01,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:13:01,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:13:01,841 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-10-27 06:13:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:01,976 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-10-27 06:13:01,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:13:01,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 65 transitions. [2018-10-27 06:13:01,978 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:01,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 60 states and 64 transitions. [2018-10-27 06:13:01,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:13:01,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:01,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 64 transitions. [2018-10-27 06:13:01,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:01,980 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-10-27 06:13:01,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 64 transitions. [2018-10-27 06:13:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-10-27 06:13:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-27 06:13:01,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-10-27 06:13:01,983 INFO L728 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-27 06:13:01,984 INFO L608 BuchiCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-27 06:13:01,984 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:13:01,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 60 transitions. [2018-10-27 06:13:01,986 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:01,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:01,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:01,986 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-10-27 06:13:01,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:01,987 INFO L793 eck$LassoCheckResult]: Stem: 704#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 674#L23-4 assume true; 698#L23-1 assume !!(main_~i~1 < 10); 713#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 712#L24-1 havoc main_#t~nondet3; 711#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 699#L23-4 assume true; 683#L23-1 assume !!(main_~i~1 < 10); 684#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 705#L24-1 havoc main_#t~nondet3; 700#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 701#L23-4 assume true; 707#L23-1 assume !!(main_~i~1 < 10); 710#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 709#L24-1 havoc main_#t~nondet3; 708#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 706#L23-4 assume true; 681#L23-1 assume !(main_~i~1 < 10); 682#L23-5 assume { :begin_inline_sum } true;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; 660#L9-4 [2018-10-27 06:13:01,987 INFO L795 eck$LassoCheckResult]: Loop: 660#L9-4 assume true; 661#L9-1 assume !!(sum_~i~0 < 10); 667#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 677#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 663#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 660#L9-4 [2018-10-27 06:13:01,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:01,987 INFO L82 PathProgramCache]: Analyzing trace with hash -500373014, now seen corresponding path program 3 times [2018-10-27 06:13:01,987 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:01,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:01,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:01,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:01,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:02,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:02,090 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:02,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:13:02,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 06:13:02,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:02,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:02,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:02,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-27 06:13:02,201 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:02,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:02,202 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 4 times [2018-10-27 06:13:02,202 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:02,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:02,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:02,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:02,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:13:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:13:02,327 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-10-27 06:13:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:02,352 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-10-27 06:13:02,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:13:02,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 70 transitions. [2018-10-27 06:13:02,355 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:02,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 65 states and 69 transitions. [2018-10-27 06:13:02,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:13:02,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:02,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 69 transitions. [2018-10-27 06:13:02,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:02,357 INFO L705 BuchiCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-10-27 06:13:02,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 69 transitions. [2018-10-27 06:13:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-10-27 06:13:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 06:13:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-10-27 06:13:02,364 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-10-27 06:13:02,364 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-10-27 06:13:02,364 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:13:02,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 65 transitions. [2018-10-27 06:13:02,365 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:02,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:02,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:02,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 1, 1, 1, 1] [2018-10-27 06:13:02,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:02,366 INFO L793 eck$LassoCheckResult]: Stem: 892#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 859#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 860#L23-4 assume true; 887#L23-1 assume !!(main_~i~1 < 10); 907#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 906#L24-1 havoc main_#t~nondet3; 905#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 888#L23-4 assume true; 872#L23-1 assume !!(main_~i~1 < 10); 873#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 894#L24-1 havoc main_#t~nondet3; 889#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 890#L23-4 assume true; 904#L23-1 assume !!(main_~i~1 < 10); 903#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 902#L24-1 havoc main_#t~nondet3; 901#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 900#L23-4 assume true; 896#L23-1 assume !!(main_~i~1 < 10); 899#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 898#L24-1 havoc main_#t~nondet3; 897#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 895#L23-4 assume true; 870#L23-1 assume !(main_~i~1 < 10); 871#L23-5 assume { :begin_inline_sum } true;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; 849#L9-4 [2018-10-27 06:13:02,366 INFO L795 eck$LassoCheckResult]: Loop: 849#L9-4 assume true; 850#L9-1 assume !!(sum_~i~0 < 10); 856#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 866#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 852#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 849#L9-4 [2018-10-27 06:13:02,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:02,366 INFO L82 PathProgramCache]: Analyzing trace with hash 543382861, now seen corresponding path program 4 times [2018-10-27 06:13:02,366 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:02,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:02,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:02,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:02,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:02,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:02,593 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:02,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:13:02,642 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:13:02,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:02,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:02,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:02,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-27 06:13:02,690 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:02,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:02,691 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 5 times [2018-10-27 06:13:02,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:02,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:02,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:02,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:02,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:02,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:13:02,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:13:02,746 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-10-27 06:13:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:02,798 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-10-27 06:13:02,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:13:02,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 75 transitions. [2018-10-27 06:13:02,801 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:02,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 70 states and 74 transitions. [2018-10-27 06:13:02,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:13:02,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:02,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 74 transitions. [2018-10-27 06:13:02,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:02,803 INFO L705 BuchiCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-10-27 06:13:02,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 74 transitions. [2018-10-27 06:13:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-10-27 06:13:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-27 06:13:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-10-27 06:13:02,807 INFO L728 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-10-27 06:13:02,807 INFO L608 BuchiCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-10-27 06:13:02,807 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:13:02,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 70 transitions. [2018-10-27 06:13:02,808 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:02,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:02,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:02,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 1, 1, 1, 1] [2018-10-27 06:13:02,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:02,809 INFO L793 eck$LassoCheckResult]: Stem: 1108#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1079#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1080#L23-4 assume true; 1102#L23-1 assume !!(main_~i~1 < 10); 1127#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1126#L24-1 havoc main_#t~nondet3; 1125#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1103#L23-4 assume true; 1087#L23-1 assume !!(main_~i~1 < 10); 1088#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1109#L24-1 havoc main_#t~nondet3; 1104#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1105#L23-4 assume true; 1124#L23-1 assume !!(main_~i~1 < 10); 1123#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1122#L24-1 havoc main_#t~nondet3; 1121#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1120#L23-4 assume true; 1119#L23-1 assume !!(main_~i~1 < 10); 1118#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1117#L24-1 havoc main_#t~nondet3; 1116#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1115#L23-4 assume true; 1111#L23-1 assume !!(main_~i~1 < 10); 1114#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1113#L24-1 havoc main_#t~nondet3; 1112#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1110#L23-4 assume true; 1085#L23-1 assume !(main_~i~1 < 10); 1086#L23-5 assume { :begin_inline_sum } true;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; 1064#L9-4 [2018-10-27 06:13:02,809 INFO L795 eck$LassoCheckResult]: Loop: 1064#L9-4 assume true; 1065#L9-1 assume !!(sum_~i~0 < 10); 1071#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 1081#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1067#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 1064#L9-4 [2018-10-27 06:13:02,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:02,810 INFO L82 PathProgramCache]: Analyzing trace with hash 975998922, now seen corresponding path program 5 times [2018-10-27 06:13:02,810 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:02,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:02,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:02,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:02,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:02,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:02,884 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:02,896 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:13:02,940 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-27 06:13:02,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:02,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:02,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:02,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-27 06:13:02,973 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:02,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 6 times [2018-10-27 06:13:02,974 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:02,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:02,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:02,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:02,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:02,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:03,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:13:03,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:13:03,014 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-10-27 06:13:03,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:03,049 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-10-27 06:13:03,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:13:03,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 80 transitions. [2018-10-27 06:13:03,052 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:03,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 75 states and 79 transitions. [2018-10-27 06:13:03,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:13:03,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:03,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 79 transitions. [2018-10-27 06:13:03,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:03,054 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-10-27 06:13:03,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 79 transitions. [2018-10-27 06:13:03,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-10-27 06:13:03,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-27 06:13:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-10-27 06:13:03,059 INFO L728 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-10-27 06:13:03,059 INFO L608 BuchiCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-10-27 06:13:03,059 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:13:03,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 75 transitions. [2018-10-27 06:13:03,060 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:03,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:03,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:03,060 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 6, 1, 1, 1, 1] [2018-10-27 06:13:03,061 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:03,061 INFO L793 eck$LassoCheckResult]: Stem: 1349#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1320#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1321#L23-4 assume true; 1343#L23-1 assume !!(main_~i~1 < 10); 1373#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1372#L24-1 havoc main_#t~nondet3; 1371#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1344#L23-4 assume true; 1328#L23-1 assume !!(main_~i~1 < 10); 1329#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1350#L24-1 havoc main_#t~nondet3; 1345#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1346#L23-4 assume true; 1370#L23-1 assume !!(main_~i~1 < 10); 1369#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1368#L24-1 havoc main_#t~nondet3; 1367#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1366#L23-4 assume true; 1365#L23-1 assume !!(main_~i~1 < 10); 1364#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1363#L24-1 havoc main_#t~nondet3; 1362#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1361#L23-4 assume true; 1360#L23-1 assume !!(main_~i~1 < 10); 1359#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1358#L24-1 havoc main_#t~nondet3; 1357#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1356#L23-4 assume true; 1352#L23-1 assume !!(main_~i~1 < 10); 1355#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1354#L24-1 havoc main_#t~nondet3; 1353#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1351#L23-4 assume true; 1326#L23-1 assume !(main_~i~1 < 10); 1327#L23-5 assume { :begin_inline_sum } true;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; 1305#L9-4 [2018-10-27 06:13:03,061 INFO L795 eck$LassoCheckResult]: Loop: 1305#L9-4 assume true; 1306#L9-1 assume !!(sum_~i~0 < 10); 1312#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 1322#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1308#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 1305#L9-4 [2018-10-27 06:13:03,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash -39820435, now seen corresponding path program 6 times [2018-10-27 06:13:03,061 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:03,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:03,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:03,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:03,191 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:03,197 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:13:03,249 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-27 06:13:03,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:03,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:03,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:03,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-10-27 06:13:03,279 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:03,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:03,279 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 7 times [2018-10-27 06:13:03,279 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:03,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:03,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:03,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:03,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:03,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:13:03,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:13:03,315 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-10-27 06:13:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:03,527 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-10-27 06:13:03,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:13:03,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 85 transitions. [2018-10-27 06:13:03,529 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:03,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 80 states and 84 transitions. [2018-10-27 06:13:03,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:13:03,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:03,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 84 transitions. [2018-10-27 06:13:03,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:03,530 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-10-27 06:13:03,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 84 transitions. [2018-10-27 06:13:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2018-10-27 06:13:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-27 06:13:03,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-10-27 06:13:03,535 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-10-27 06:13:03,535 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-10-27 06:13:03,535 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:13:03,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 80 transitions. [2018-10-27 06:13:03,536 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:03,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:03,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:03,537 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 1, 1, 1, 1] [2018-10-27 06:13:03,537 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:03,537 INFO L793 eck$LassoCheckResult]: Stem: 1616#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1587#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1588#L23-4 assume true; 1610#L23-1 assume !!(main_~i~1 < 10); 1645#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1644#L24-1 havoc main_#t~nondet3; 1643#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1611#L23-4 assume true; 1595#L23-1 assume !!(main_~i~1 < 10); 1596#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1617#L24-1 havoc main_#t~nondet3; 1612#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1613#L23-4 assume true; 1642#L23-1 assume !!(main_~i~1 < 10); 1641#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1640#L24-1 havoc main_#t~nondet3; 1639#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1638#L23-4 assume true; 1637#L23-1 assume !!(main_~i~1 < 10); 1636#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1635#L24-1 havoc main_#t~nondet3; 1634#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1633#L23-4 assume true; 1632#L23-1 assume !!(main_~i~1 < 10); 1631#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1630#L24-1 havoc main_#t~nondet3; 1629#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1628#L23-4 assume true; 1627#L23-1 assume !!(main_~i~1 < 10); 1626#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1625#L24-1 havoc main_#t~nondet3; 1624#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1623#L23-4 assume true; 1619#L23-1 assume !!(main_~i~1 < 10); 1622#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1621#L24-1 havoc main_#t~nondet3; 1620#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1618#L23-4 assume true; 1593#L23-1 assume !(main_~i~1 < 10); 1594#L23-5 assume { :begin_inline_sum } true;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; 1572#L9-4 [2018-10-27 06:13:03,537 INFO L795 eck$LassoCheckResult]: Loop: 1572#L9-4 assume true; 1573#L9-1 assume !!(sum_~i~0 < 10); 1579#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 1589#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1575#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 1572#L9-4 [2018-10-27 06:13:03,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:03,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1900126806, now seen corresponding path program 7 times [2018-10-27 06:13:03,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:03,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:03,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:03,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:03,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:03,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:03,711 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:03,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:03,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:03,758 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:03,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:03,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-10-27 06:13:03,775 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:03,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:03,776 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 8 times [2018-10-27 06:13:03,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:03,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:03,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:03,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:03,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:13:03,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:13:03,807 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. cyclomatic complexity: 9 Second operand 11 states. [2018-10-27 06:13:03,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:03,844 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-10-27 06:13:03,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:13:03,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 90 transitions. [2018-10-27 06:13:03,846 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:03,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 85 states and 89 transitions. [2018-10-27 06:13:03,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:13:03,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:03,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 89 transitions. [2018-10-27 06:13:03,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:03,847 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-10-27 06:13:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 89 transitions. [2018-10-27 06:13:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-10-27 06:13:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-27 06:13:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-10-27 06:13:03,852 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-10-27 06:13:03,852 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-10-27 06:13:03,852 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:13:03,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 85 transitions. [2018-10-27 06:13:03,853 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:03,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:03,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:03,854 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 8, 8, 8, 8, 1, 1, 1, 1] [2018-10-27 06:13:03,854 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:03,854 INFO L793 eck$LassoCheckResult]: Stem: 1909#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1880#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 1881#L23-4 assume true; 1903#L23-1 assume !!(main_~i~1 < 10); 1943#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1942#L24-1 havoc main_#t~nondet3; 1941#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1904#L23-4 assume true; 1888#L23-1 assume !!(main_~i~1 < 10); 1889#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1910#L24-1 havoc main_#t~nondet3; 1905#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1906#L23-4 assume true; 1940#L23-1 assume !!(main_~i~1 < 10); 1939#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1938#L24-1 havoc main_#t~nondet3; 1937#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1936#L23-4 assume true; 1935#L23-1 assume !!(main_~i~1 < 10); 1934#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1933#L24-1 havoc main_#t~nondet3; 1932#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1931#L23-4 assume true; 1930#L23-1 assume !!(main_~i~1 < 10); 1929#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1928#L24-1 havoc main_#t~nondet3; 1927#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1926#L23-4 assume true; 1925#L23-1 assume !!(main_~i~1 < 10); 1924#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1923#L24-1 havoc main_#t~nondet3; 1922#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1921#L23-4 assume true; 1920#L23-1 assume !!(main_~i~1 < 10); 1919#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1918#L24-1 havoc main_#t~nondet3; 1917#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1916#L23-4 assume true; 1912#L23-1 assume !!(main_~i~1 < 10); 1915#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 1914#L24-1 havoc main_#t~nondet3; 1913#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 1911#L23-4 assume true; 1886#L23-1 assume !(main_~i~1 < 10); 1887#L23-5 assume { :begin_inline_sum } true;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; 1865#L9-4 [2018-10-27 06:13:03,854 INFO L795 eck$LassoCheckResult]: Loop: 1865#L9-4 assume true; 1866#L9-1 assume !!(sum_~i~0 < 10); 1872#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 1882#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 1868#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 1865#L9-4 [2018-10-27 06:13:03,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash 727990669, now seen corresponding path program 8 times [2018-10-27 06:13:03,855 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:03,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:03,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:03,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:03,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:03,951 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:03,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:13:03,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:13:03,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:03,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:04,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:04,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-10-27 06:13:04,038 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:04,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:04,038 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 9 times [2018-10-27 06:13:04,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:04,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:04,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:04,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:04,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 06:13:04,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 06:13:04,066 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-10-27 06:13:04,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:04,162 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2018-10-27 06:13:04,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:13:04,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 95 transitions. [2018-10-27 06:13:04,163 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:04,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 90 states and 94 transitions. [2018-10-27 06:13:04,163 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:13:04,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:04,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 94 transitions. [2018-10-27 06:13:04,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:04,164 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 94 transitions. [2018-10-27 06:13:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 94 transitions. [2018-10-27 06:13:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2018-10-27 06:13:04,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-27 06:13:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-10-27 06:13:04,166 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-10-27 06:13:04,166 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-10-27 06:13:04,167 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:13:04,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 90 transitions. [2018-10-27 06:13:04,167 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:04,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:04,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:04,168 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 9, 9, 1, 1, 1, 1] [2018-10-27 06:13:04,176 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:04,176 INFO L793 eck$LassoCheckResult]: Stem: 2227#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2195#L23-4 assume true; 2222#L23-1 assume !!(main_~i~1 < 10); 2267#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2266#L24-1 havoc main_#t~nondet3; 2265#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2223#L23-4 assume true; 2207#L23-1 assume !!(main_~i~1 < 10); 2208#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2229#L24-1 havoc main_#t~nondet3; 2224#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2225#L23-4 assume true; 2264#L23-1 assume !!(main_~i~1 < 10); 2263#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2262#L24-1 havoc main_#t~nondet3; 2261#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2260#L23-4 assume true; 2259#L23-1 assume !!(main_~i~1 < 10); 2258#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2257#L24-1 havoc main_#t~nondet3; 2256#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2255#L23-4 assume true; 2254#L23-1 assume !!(main_~i~1 < 10); 2253#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2252#L24-1 havoc main_#t~nondet3; 2251#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2250#L23-4 assume true; 2249#L23-1 assume !!(main_~i~1 < 10); 2248#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2247#L24-1 havoc main_#t~nondet3; 2246#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2245#L23-4 assume true; 2244#L23-1 assume !!(main_~i~1 < 10); 2243#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2242#L24-1 havoc main_#t~nondet3; 2241#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2240#L23-4 assume true; 2239#L23-1 assume !!(main_~i~1 < 10); 2238#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2237#L24-1 havoc main_#t~nondet3; 2236#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2235#L23-4 assume true; 2231#L23-1 assume !!(main_~i~1 < 10); 2234#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2233#L24-1 havoc main_#t~nondet3; 2232#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2230#L23-4 assume true; 2205#L23-1 assume !(main_~i~1 < 10); 2206#L23-5 assume { :begin_inline_sum } true;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; 2184#L9-4 [2018-10-27 06:13:04,177 INFO L795 eck$LassoCheckResult]: Loop: 2184#L9-4 assume true; 2185#L9-1 assume !!(sum_~i~0 < 10); 2191#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 2201#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2187#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 2184#L9-4 [2018-10-27 06:13:04,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:04,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1924115574, now seen corresponding path program 9 times [2018-10-27 06:13:04,177 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:04,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:04,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:04,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:04,310 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:04,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:13:04,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-27 06:13:04,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:04,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:04,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:04,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-10-27 06:13:04,426 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:04,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:04,426 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 10 times [2018-10-27 06:13:04,426 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:04,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:04,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:04,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:04,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 06:13:04,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:13:04,484 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-10-27 06:13:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:04,529 INFO L93 Difference]: Finished difference Result 93 states and 97 transitions. [2018-10-27 06:13:04,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:13:04,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 97 transitions. [2018-10-27 06:13:04,531 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:04,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 92 states and 96 transitions. [2018-10-27 06:13:04,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-10-27 06:13:04,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-10-27 06:13:04,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 96 transitions. [2018-10-27 06:13:04,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:04,532 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 96 transitions. [2018-10-27 06:13:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 96 transitions. [2018-10-27 06:13:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-10-27 06:13:04,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-27 06:13:04,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2018-10-27 06:13:04,534 INFO L728 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-10-27 06:13:04,534 INFO L608 BuchiCegarLoop]: Abstraction has 91 states and 95 transitions. [2018-10-27 06:13:04,535 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:13:04,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 95 transitions. [2018-10-27 06:13:04,535 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 21 [2018-10-27 06:13:04,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:04,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:04,538 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 1, 1, 1, 1] [2018-10-27 06:13:04,538 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:04,538 INFO L793 eck$LassoCheckResult]: Stem: 2569#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2537#L23-4 assume true; 2549#L23-1 assume !!(main_~i~1 < 10); 2550#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2570#L24-1 havoc main_#t~nondet3; 2566#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2564#L23-4 assume true; 2565#L23-1 assume !!(main_~i~1 < 10); 2614#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2613#L24-1 havoc main_#t~nondet3; 2612#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2611#L23-4 assume true; 2610#L23-1 assume !!(main_~i~1 < 10); 2609#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2608#L24-1 havoc main_#t~nondet3; 2607#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2606#L23-4 assume true; 2605#L23-1 assume !!(main_~i~1 < 10); 2604#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2603#L24-1 havoc main_#t~nondet3; 2602#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2601#L23-4 assume true; 2600#L23-1 assume !!(main_~i~1 < 10); 2599#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2598#L24-1 havoc main_#t~nondet3; 2597#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2596#L23-4 assume true; 2595#L23-1 assume !!(main_~i~1 < 10); 2594#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2593#L24-1 havoc main_#t~nondet3; 2592#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2591#L23-4 assume true; 2590#L23-1 assume !!(main_~i~1 < 10); 2589#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2588#L24-1 havoc main_#t~nondet3; 2587#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2586#L23-4 assume true; 2585#L23-1 assume !!(main_~i~1 < 10); 2584#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2583#L24-1 havoc main_#t~nondet3; 2582#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2581#L23-4 assume true; 2580#L23-1 assume !!(main_~i~1 < 10); 2579#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2578#L24-1 havoc main_#t~nondet3; 2577#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2576#L23-4 assume true; 2572#L23-1 assume !!(main_~i~1 < 10); 2575#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2574#L24-1 havoc main_#t~nondet3; 2573#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2571#L23-4 assume true; 2547#L23-1 assume !(main_~i~1 < 10); 2548#L23-5 assume { :begin_inline_sum } true;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; 2526#L9-4 [2018-10-27 06:13:04,539 INFO L795 eck$LassoCheckResult]: Loop: 2526#L9-4 assume true; 2527#L9-1 assume !!(sum_~i~0 < 10); 2533#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 2543#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2529#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 2526#L9-4 [2018-10-27 06:13:04,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash 822146989, now seen corresponding path program 10 times [2018-10-27 06:13:04,539 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:04,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:04,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:04,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:04,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:04,569 INFO L82 PathProgramCache]: Analyzing trace with hash 50733113, now seen corresponding path program 11 times [2018-10-27 06:13:04,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:04,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:04,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:04,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:04,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:04,577 INFO L82 PathProgramCache]: Analyzing trace with hash 344527885, now seen corresponding path program 1 times [2018-10-27 06:13:04,577 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:04,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:04,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:07,321 WARN L179 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 208 DAG size of output: 166 [2018-10-27 06:13:07,601 WARN L179 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-10-27 06:13:07,602 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:07,602 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:07,602 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:07,603 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:07,603 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:13:07,603 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:07,603 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:07,603 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:07,603 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10_true-unreach-call_true-termination.i_Iteration12_Lasso [2018-10-27 06:13:07,603 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:07,603 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:07,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:07,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:08,110 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:08,110 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:08,110 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-10-27 06:13:08,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:08,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:08,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:08,116 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,117 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-10-27 06:13:08,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:08,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:08,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:08,118 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,118 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-10-27 06:13:08,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:08,120 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:08,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,129 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-10-27 06:13:08,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:08,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:08,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:08,134 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,134 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-10-27 06:13:08,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:08,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:08,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:08,135 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,136 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-10-27 06:13:08,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:08,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:08,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:08,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,137 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-10-27 06:13:08,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:08,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:08,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:08,138 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,139 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-10-27 06:13:08,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:08,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:08,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:08,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,140 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-10-27 06:13:08,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:08,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:08,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:08,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,142 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-10-27 06:13:08,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:08,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:08,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,155 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-10-27 06:13:08,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:08,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:08,158 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:08,159 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-10-27 06:13:08,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:08,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:08,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:08,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:08,170 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:08,170 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:08,192 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:13:08,201 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:13:08,201 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:13:08,202 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:13:08,202 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:13:08,202 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:13:08,203 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_sum_~i~0) = -2*ULTIMATE.start_sum_~i~0 + 19 Supporting invariants [] [2018-10-27 06:13:08,240 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2018-10-27 06:13:08,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:08,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:08,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:08,285 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-10-27 06:13:08,285 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 95 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-10-27 06:13:08,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 95 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 105 states and 110 transitions. Complement of second has 7 states. [2018-10-27 06:13:08,369 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-10-27 06:13:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:13:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2018-10-27 06:13:08,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 55 letters. Loop has 5 letters. [2018-10-27 06:13:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 60 letters. Loop has 5 letters. [2018-10-27 06:13:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 55 letters. Loop has 10 letters. [2018-10-27 06:13:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:08,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 110 transitions. [2018-10-27 06:13:08,371 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:08,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 93 states and 98 transitions. [2018-10-27 06:13:08,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-10-27 06:13:08,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:13:08,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 98 transitions. [2018-10-27 06:13:08,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:08,372 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-10-27 06:13:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 98 transitions. [2018-10-27 06:13:08,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-10-27 06:13:08,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-27 06:13:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2018-10-27 06:13:08,375 INFO L728 BuchiCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-10-27 06:13:08,375 INFO L608 BuchiCegarLoop]: Abstraction has 93 states and 98 transitions. [2018-10-27 06:13:08,375 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:13:08,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 98 transitions. [2018-10-27 06:13:08,375 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:08,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:08,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:08,381 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:08,381 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:08,382 INFO L793 eck$LassoCheckResult]: Stem: 2991#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2958#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 2959#L23-4 assume true; 2986#L23-1 assume !!(main_~i~1 < 10); 3036#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3035#L24-1 havoc main_#t~nondet3; 3034#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2987#L23-4 assume true; 2971#L23-1 assume !!(main_~i~1 < 10); 2972#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2993#L24-1 havoc main_#t~nondet3; 2988#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2989#L23-4 assume true; 3033#L23-1 assume !!(main_~i~1 < 10); 3032#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3031#L24-1 havoc main_#t~nondet3; 3030#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3029#L23-4 assume true; 3028#L23-1 assume !!(main_~i~1 < 10); 3027#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3026#L24-1 havoc main_#t~nondet3; 3025#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3024#L23-4 assume true; 3023#L23-1 assume !!(main_~i~1 < 10); 3022#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3021#L24-1 havoc main_#t~nondet3; 3020#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3019#L23-4 assume true; 3018#L23-1 assume !!(main_~i~1 < 10); 3017#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3016#L24-1 havoc main_#t~nondet3; 3015#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3014#L23-4 assume true; 3013#L23-1 assume !!(main_~i~1 < 10); 3012#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3011#L24-1 havoc main_#t~nondet3; 3010#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3009#L23-4 assume true; 3008#L23-1 assume !!(main_~i~1 < 10); 3007#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3006#L24-1 havoc main_#t~nondet3; 3005#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3004#L23-4 assume true; 3003#L23-1 assume !!(main_~i~1 < 10); 3002#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3001#L24-1 havoc main_#t~nondet3; 3000#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2999#L23-4 assume true; 2995#L23-1 assume !!(main_~i~1 < 10); 2998#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 2997#L24-1 havoc main_#t~nondet3; 2996#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 2994#L23-4 assume true; 2969#L23-1 assume !(main_~i~1 < 10); 2970#L23-5 assume { :begin_inline_sum } true;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; 2946#L9-4 assume true; 2948#L9-1 assume !(sum_~i~0 < 10); 2954#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 2973#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 2953#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 2952#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 2950#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 2944#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 2945#L29-4 havoc main_#t~mem6; 2977#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 2974#L29-6 assume { :begin_inline_sum } true;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; 2960#L9-10 [2018-10-27 06:13:08,382 INFO L795 eck$LassoCheckResult]: Loop: 2960#L9-10 assume true; 2961#L9-7 assume !!(sum_~i~0 < 10); 2976#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 2984#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 2966#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 2960#L9-10 [2018-10-27 06:13:08,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:08,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1823236648, now seen corresponding path program 1 times [2018-10-27 06:13:08,382 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:08,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:08,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:08,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:08,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-27 06:13:08,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:13:08,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:13:08,467 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:08,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:08,467 INFO L82 PathProgramCache]: Analyzing trace with hash 75545043, now seen corresponding path program 1 times [2018-10-27 06:13:08,467 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:08,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:08,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:08,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:08,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:08,665 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:13:08,841 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:13:08,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:13:08,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:13:08,841 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-10-27 06:13:09,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:09,062 INFO L93 Difference]: Finished difference Result 108 states and 112 transitions. [2018-10-27 06:13:09,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:13:09,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 112 transitions. [2018-10-27 06:13:09,063 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:09,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 107 states and 111 transitions. [2018-10-27 06:13:09,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-10-27 06:13:09,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-10-27 06:13:09,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 111 transitions. [2018-10-27 06:13:09,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:09,064 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 111 transitions. [2018-10-27 06:13:09,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 111 transitions. [2018-10-27 06:13:09,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-10-27 06:13:09,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-27 06:13:09,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2018-10-27 06:13:09,066 INFO L728 BuchiCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-10-27 06:13:09,066 INFO L608 BuchiCegarLoop]: Abstraction has 95 states and 99 transitions. [2018-10-27 06:13:09,066 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:13:09,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 99 transitions. [2018-10-27 06:13:09,067 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:09,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:09,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:09,068 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:09,068 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:09,068 INFO L793 eck$LassoCheckResult]: Stem: 3199#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3171#L23-4 assume true; 3179#L23-1 assume !!(main_~i~1 < 10); 3180#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3200#L24-1 havoc main_#t~nondet3; 3196#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3193#L23-4 assume true; 3194#L23-1 assume !!(main_~i~1 < 10); 3245#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3244#L24-1 havoc main_#t~nondet3; 3243#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3242#L23-4 assume true; 3241#L23-1 assume !!(main_~i~1 < 10); 3240#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3239#L24-1 havoc main_#t~nondet3; 3238#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3237#L23-4 assume true; 3236#L23-1 assume !!(main_~i~1 < 10); 3235#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3234#L24-1 havoc main_#t~nondet3; 3233#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3232#L23-4 assume true; 3231#L23-1 assume !!(main_~i~1 < 10); 3230#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3229#L24-1 havoc main_#t~nondet3; 3228#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3227#L23-4 assume true; 3226#L23-1 assume !!(main_~i~1 < 10); 3225#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3224#L24-1 havoc main_#t~nondet3; 3223#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3222#L23-4 assume true; 3221#L23-1 assume !!(main_~i~1 < 10); 3220#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3219#L24-1 havoc main_#t~nondet3; 3218#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3217#L23-4 assume true; 3216#L23-1 assume !!(main_~i~1 < 10); 3215#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3214#L24-1 havoc main_#t~nondet3; 3213#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3212#L23-4 assume true; 3211#L23-1 assume !!(main_~i~1 < 10); 3210#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3209#L24-1 havoc main_#t~nondet3; 3208#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3207#L23-4 assume true; 3202#L23-1 assume !!(main_~i~1 < 10); 3206#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3205#L24-1 havoc main_#t~nondet3; 3204#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3201#L23-4 assume true; 3177#L23-1 assume !(main_~i~1 < 10); 3178#L23-5 assume { :begin_inline_sum } true;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; 3153#L9-4 assume true; 3154#L9-1 assume !!(sum_~i~0 < 10); 3162#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 3172#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3158#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 3155#L9-4 assume true; 3156#L9-1 assume !(sum_~i~0 < 10); 3161#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3181#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 3160#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 3159#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 3157#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 3151#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 3152#L29-4 havoc main_#t~mem6; 3184#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 3182#L29-6 assume { :begin_inline_sum } true;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; 3165#L9-10 assume true; 3166#L9-7 assume !!(sum_~i~0 < 10); 3183#L10-2 [2018-10-27 06:13:09,068 INFO L795 eck$LassoCheckResult]: Loop: 3183#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 3191#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3173#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 3174#L9-10 assume true; 3203#L9-7 assume !!(sum_~i~0 < 10); 3183#L10-2 [2018-10-27 06:13:09,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:09,068 INFO L82 PathProgramCache]: Analyzing trace with hash 462720413, now seen corresponding path program 1 times [2018-10-27 06:13:09,069 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:09,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:09,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:09,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:09,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-27 06:13:09,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:09,259 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:09,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:09,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2018-10-27 06:13:09,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:09,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-10-27 06:13:09,447 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:09,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:09,448 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 2 times [2018-10-27 06:13:09,448 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:09,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:09,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:09,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:09,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:09,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:09,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:09,606 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:13:09,742 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-27 06:13:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 06:13:09,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-27 06:13:09,743 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-10-27 06:13:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:09,882 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-10-27 06:13:09,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:13:09,883 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 127 transitions. [2018-10-27 06:13:09,884 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:09,884 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 122 states and 126 transitions. [2018-10-27 06:13:09,884 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2018-10-27 06:13:09,884 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-10-27 06:13:09,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 126 transitions. [2018-10-27 06:13:09,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:09,887 INFO L705 BuchiCegarLoop]: Abstraction has 122 states and 126 transitions. [2018-10-27 06:13:09,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 126 transitions. [2018-10-27 06:13:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 105. [2018-10-27 06:13:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-27 06:13:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2018-10-27 06:13:09,890 INFO L728 BuchiCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-10-27 06:13:09,890 INFO L608 BuchiCegarLoop]: Abstraction has 105 states and 109 transitions. [2018-10-27 06:13:09,890 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:13:09,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 109 transitions. [2018-10-27 06:13:09,890 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:09,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:09,891 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:09,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:09,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:09,905 INFO L793 eck$LassoCheckResult]: Stem: 3643#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3608#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 3609#L23-4 assume true; 3621#L23-1 assume !!(main_~i~1 < 10); 3622#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3645#L24-1 havoc main_#t~nondet3; 3641#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3637#L23-4 assume true; 3638#L23-1 assume !!(main_~i~1 < 10); 3697#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3696#L24-1 havoc main_#t~nondet3; 3695#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3694#L23-4 assume true; 3693#L23-1 assume !!(main_~i~1 < 10); 3692#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3691#L24-1 havoc main_#t~nondet3; 3690#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3689#L23-4 assume true; 3688#L23-1 assume !!(main_~i~1 < 10); 3687#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3686#L24-1 havoc main_#t~nondet3; 3685#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3684#L23-4 assume true; 3683#L23-1 assume !!(main_~i~1 < 10); 3682#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3681#L24-1 havoc main_#t~nondet3; 3680#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3679#L23-4 assume true; 3678#L23-1 assume !!(main_~i~1 < 10); 3677#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3676#L24-1 havoc main_#t~nondet3; 3675#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3674#L23-4 assume true; 3673#L23-1 assume !!(main_~i~1 < 10); 3672#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3671#L24-1 havoc main_#t~nondet3; 3670#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3669#L23-4 assume true; 3668#L23-1 assume !!(main_~i~1 < 10); 3667#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3666#L24-1 havoc main_#t~nondet3; 3665#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3664#L23-4 assume true; 3663#L23-1 assume !!(main_~i~1 < 10); 3661#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3659#L24-1 havoc main_#t~nondet3; 3657#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3656#L23-4 assume true; 3649#L23-1 assume !!(main_~i~1 < 10); 3655#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 3654#L24-1 havoc main_#t~nondet3; 3652#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 3648#L23-4 assume true; 3619#L23-1 assume !(main_~i~1 < 10); 3620#L23-5 assume { :begin_inline_sum } true;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; 3595#L9-4 assume true; 3596#L9-1 assume !!(sum_~i~0 < 10); 3651#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 3647#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3600#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 3597#L9-4 assume true; 3598#L9-1 assume !!(sum_~i~0 < 10); 3605#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 3615#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3640#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 3646#L9-4 assume true; 3603#L9-1 assume !(sum_~i~0 < 10); 3604#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 3623#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 3602#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 3601#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 3599#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 3593#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 3594#L29-4 havoc main_#t~mem6; 3627#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 3624#L29-6 assume { :begin_inline_sum } true;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; 3625#L9-10 assume true; 3662#L9-7 assume !!(sum_~i~0 < 10); 3660#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 3658#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3616#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 3610#L9-10 assume true; 3611#L9-7 assume !!(sum_~i~0 < 10); 3626#L10-2 [2018-10-27 06:13:09,905 INFO L795 eck$LassoCheckResult]: Loop: 3626#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 3634#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 3635#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 3653#L9-10 assume true; 3650#L9-7 assume !!(sum_~i~0 < 10); 3626#L10-2 [2018-10-27 06:13:09,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:09,906 INFO L82 PathProgramCache]: Analyzing trace with hash -84687487, now seen corresponding path program 1 times [2018-10-27 06:13:09,906 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:09,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:09,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:09,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:09,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:10,067 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 06:13:10,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:10,068 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:10,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:10,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:10,126 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-10-27 06:13:10,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:10,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-10-27 06:13:10,143 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:10,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:10,144 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 3 times [2018-10-27 06:13:10,144 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:10,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:10,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:10,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:10,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:10,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 06:13:10,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-27 06:13:10,185 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. cyclomatic complexity: 9 Second operand 6 states. [2018-10-27 06:13:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:10,258 INFO L93 Difference]: Finished difference Result 138 states and 142 transitions. [2018-10-27 06:13:10,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 06:13:10,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 142 transitions. [2018-10-27 06:13:10,259 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:10,260 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 137 states and 141 transitions. [2018-10-27 06:13:10,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2018-10-27 06:13:10,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2018-10-27 06:13:10,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 141 transitions. [2018-10-27 06:13:10,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:10,260 INFO L705 BuchiCegarLoop]: Abstraction has 137 states and 141 transitions. [2018-10-27 06:13:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 141 transitions. [2018-10-27 06:13:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-10-27 06:13:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-27 06:13:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2018-10-27 06:13:10,263 INFO L728 BuchiCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-10-27 06:13:10,263 INFO L608 BuchiCegarLoop]: Abstraction has 115 states and 119 transitions. [2018-10-27 06:13:10,263 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-10-27 06:13:10,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115 states and 119 transitions. [2018-10-27 06:13:10,264 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:10,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:10,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:10,269 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:10,269 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:10,269 INFO L793 eck$LassoCheckResult]: Stem: 4144#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4106#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4107#L23-4 assume true; 4119#L23-1 assume !!(main_~i~1 < 10); 4120#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4146#L24-1 havoc main_#t~nondet3; 4142#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4137#L23-4 assume true; 4138#L23-1 assume !!(main_~i~1 < 10); 4198#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4196#L24-1 havoc main_#t~nondet3; 4195#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4194#L23-4 assume true; 4193#L23-1 assume !!(main_~i~1 < 10); 4192#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4191#L24-1 havoc main_#t~nondet3; 4190#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4189#L23-4 assume true; 4188#L23-1 assume !!(main_~i~1 < 10); 4187#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4186#L24-1 havoc main_#t~nondet3; 4185#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4184#L23-4 assume true; 4183#L23-1 assume !!(main_~i~1 < 10); 4182#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4181#L24-1 havoc main_#t~nondet3; 4180#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4179#L23-4 assume true; 4178#L23-1 assume !!(main_~i~1 < 10); 4177#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4176#L24-1 havoc main_#t~nondet3; 4175#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4174#L23-4 assume true; 4173#L23-1 assume !!(main_~i~1 < 10); 4172#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4171#L24-1 havoc main_#t~nondet3; 4170#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4169#L23-4 assume true; 4168#L23-1 assume !!(main_~i~1 < 10); 4167#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4166#L24-1 havoc main_#t~nondet3; 4165#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4164#L23-4 assume true; 4163#L23-1 assume !!(main_~i~1 < 10); 4162#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4161#L24-1 havoc main_#t~nondet3; 4160#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4159#L23-4 assume true; 4151#L23-1 assume !!(main_~i~1 < 10); 4158#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4156#L24-1 havoc main_#t~nondet3; 4154#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4150#L23-4 assume true; 4117#L23-1 assume !(main_~i~1 < 10); 4118#L23-5 assume { :begin_inline_sum } true;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; 4093#L9-4 assume true; 4094#L9-1 assume !!(sum_~i~0 < 10); 4103#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 4113#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4098#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4095#L9-4 assume true; 4096#L9-1 assume !!(sum_~i~0 < 10); 4202#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 4140#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4141#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4200#L9-4 assume true; 4148#L9-1 assume !!(sum_~i~0 < 10); 4199#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 4197#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4149#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4147#L9-4 assume true; 4101#L9-1 assume !(sum_~i~0 < 10); 4102#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4121#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 4100#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 4099#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 4097#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 4091#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 4092#L29-4 havoc main_#t~mem6; 4125#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 4122#L29-6 assume { :begin_inline_sum } true;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; 4123#L9-10 assume true; 4205#L9-7 assume !!(sum_~i~0 < 10); 4135#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 4136#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4114#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4108#L9-10 assume true; 4109#L9-7 assume !!(sum_~i~0 < 10); 4124#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 4132#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4133#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4204#L9-10 assume true; 4203#L9-7 assume !!(sum_~i~0 < 10); 4153#L10-2 [2018-10-27 06:13:10,269 INFO L795 eck$LassoCheckResult]: Loop: 4153#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 4201#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4157#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4155#L9-10 assume true; 4152#L9-7 assume !!(sum_~i~0 < 10); 4153#L10-2 [2018-10-27 06:13:10,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:10,269 INFO L82 PathProgramCache]: Analyzing trace with hash 28759069, now seen corresponding path program 2 times [2018-10-27 06:13:10,269 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:10,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:10,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:10,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:10,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-10-27 06:13:10,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:10,684 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:10,697 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:13:10,756 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:13:10,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:10,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:10,820 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-10-27 06:13:10,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:10,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-10-27 06:13:10,841 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:10,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:10,841 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 4 times [2018-10-27 06:13:10,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:10,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:10,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:10,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:10,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:10,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:13:10,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:13:10,903 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-10-27 06:13:10,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:10,980 INFO L93 Difference]: Finished difference Result 153 states and 157 transitions. [2018-10-27 06:13:10,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 06:13:10,981 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 153 states and 157 transitions. [2018-10-27 06:13:10,982 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:10,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 153 states to 152 states and 156 transitions. [2018-10-27 06:13:10,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-10-27 06:13:10,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 78 [2018-10-27 06:13:10,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 156 transitions. [2018-10-27 06:13:10,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:10,983 INFO L705 BuchiCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-10-27 06:13:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 156 transitions. [2018-10-27 06:13:10,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 125. [2018-10-27 06:13:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-27 06:13:10,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2018-10-27 06:13:10,986 INFO L728 BuchiCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-10-27 06:13:10,986 INFO L608 BuchiCegarLoop]: Abstraction has 125 states and 129 transitions. [2018-10-27 06:13:10,986 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-10-27 06:13:10,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 129 transitions. [2018-10-27 06:13:10,986 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:10,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:10,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:10,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:10,988 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:10,988 INFO L793 eck$LassoCheckResult]: Stem: 4697#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 4665#L23-4 assume true; 4690#L23-1 assume !!(main_~i~1 < 10); 4751#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4698#L24-1 havoc main_#t~nondet3; 4694#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4691#L23-4 assume true; 4676#L23-1 assume !!(main_~i~1 < 10); 4677#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4699#L24-1 havoc main_#t~nondet3; 4748#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4747#L23-4 assume true; 4746#L23-1 assume !!(main_~i~1 < 10); 4745#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4744#L24-1 havoc main_#t~nondet3; 4743#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4742#L23-4 assume true; 4741#L23-1 assume !!(main_~i~1 < 10); 4740#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4739#L24-1 havoc main_#t~nondet3; 4738#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4737#L23-4 assume true; 4736#L23-1 assume !!(main_~i~1 < 10); 4735#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4734#L24-1 havoc main_#t~nondet3; 4733#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4732#L23-4 assume true; 4731#L23-1 assume !!(main_~i~1 < 10); 4730#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4729#L24-1 havoc main_#t~nondet3; 4728#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4727#L23-4 assume true; 4726#L23-1 assume !!(main_~i~1 < 10); 4725#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4724#L24-1 havoc main_#t~nondet3; 4723#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4722#L23-4 assume true; 4721#L23-1 assume !!(main_~i~1 < 10); 4720#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4719#L24-1 havoc main_#t~nondet3; 4718#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4717#L23-4 assume true; 4716#L23-1 assume !!(main_~i~1 < 10); 4715#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4714#L24-1 havoc main_#t~nondet3; 4713#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4712#L23-4 assume true; 4704#L23-1 assume !!(main_~i~1 < 10); 4711#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 4709#L24-1 havoc main_#t~nondet3; 4707#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 4703#L23-4 assume true; 4674#L23-1 assume !(main_~i~1 < 10); 4675#L23-5 assume { :begin_inline_sum } true;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; 4647#L9-4 assume true; 4648#L9-1 assume !!(sum_~i~0 < 10); 4668#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 4669#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4693#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4649#L9-4 assume true; 4650#L9-1 assume !!(sum_~i~0 < 10); 4658#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 4769#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4652#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4653#L9-4 assume true; 4768#L9-1 assume !!(sum_~i~0 < 10); 4767#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 4766#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4765#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4764#L9-4 assume true; 4701#L9-1 assume !!(sum_~i~0 < 10); 4752#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 4749#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4702#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4700#L9-4 assume true; 4656#L9-1 assume !(sum_~i~0 < 10); 4657#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 4678#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 4655#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 4654#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 4651#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 4645#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 4646#L29-4 havoc main_#t~mem6; 4681#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 4679#L29-6 assume { :begin_inline_sum } true;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; 4666#L9-10 assume true; 4667#L9-7 assume !!(sum_~i~0 < 10); 4680#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 4688#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4670#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4671#L9-10 assume true; 4763#L9-7 assume !!(sum_~i~0 < 10); 4762#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 4761#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4760#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4759#L9-10 assume true; 4758#L9-7 assume !!(sum_~i~0 < 10); 4757#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 4756#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4755#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4754#L9-10 assume true; 4753#L9-7 assume !!(sum_~i~0 < 10); 4706#L10-2 [2018-10-27 06:13:10,988 INFO L795 eck$LassoCheckResult]: Loop: 4706#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 4750#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 4710#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 4708#L9-10 assume true; 4705#L9-7 assume !!(sum_~i~0 < 10); 4706#L10-2 [2018-10-27 06:13:10,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:10,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1011777791, now seen corresponding path program 3 times [2018-10-27 06:13:10,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:10,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:10,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:10,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-10-27 06:13:11,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:11,167 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:11,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:13:11,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-27 06:13:11,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:11,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:11,342 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2018-10-27 06:13:11,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:11,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-10-27 06:13:11,368 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:11,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:11,368 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 5 times [2018-10-27 06:13:11,369 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:11,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:11,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:11,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:11,500 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:13:11,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 06:13:11,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-27 06:13:11,533 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. cyclomatic complexity: 9 Second operand 8 states. [2018-10-27 06:13:11,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:11,606 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-10-27 06:13:11,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:13:11,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 172 transitions. [2018-10-27 06:13:11,607 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:11,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 167 states and 171 transitions. [2018-10-27 06:13:11,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2018-10-27 06:13:11,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2018-10-27 06:13:11,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 171 transitions. [2018-10-27 06:13:11,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:11,609 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 171 transitions. [2018-10-27 06:13:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 171 transitions. [2018-10-27 06:13:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 135. [2018-10-27 06:13:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-27 06:13:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2018-10-27 06:13:11,611 INFO L728 BuchiCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-10-27 06:13:11,611 INFO L608 BuchiCegarLoop]: Abstraction has 135 states and 139 transitions. [2018-10-27 06:13:11,612 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-10-27 06:13:11,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 135 states and 139 transitions. [2018-10-27 06:13:11,612 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:11,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:11,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:11,613 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:11,613 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:11,614 INFO L793 eck$LassoCheckResult]: Stem: 5309#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5275#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5276#L23-4 assume true; 5301#L23-1 assume !!(main_~i~1 < 10); 5312#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5313#L24-1 havoc main_#t~nondet3; 5306#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5302#L23-4 assume true; 5283#L23-1 assume !!(main_~i~1 < 10); 5284#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5310#L24-1 havoc main_#t~nondet3; 5311#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5361#L23-4 assume true; 5360#L23-1 assume !!(main_~i~1 < 10); 5359#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5358#L24-1 havoc main_#t~nondet3; 5357#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5356#L23-4 assume true; 5355#L23-1 assume !!(main_~i~1 < 10); 5354#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5353#L24-1 havoc main_#t~nondet3; 5352#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5351#L23-4 assume true; 5350#L23-1 assume !!(main_~i~1 < 10); 5349#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5348#L24-1 havoc main_#t~nondet3; 5347#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5346#L23-4 assume true; 5345#L23-1 assume !!(main_~i~1 < 10); 5344#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5343#L24-1 havoc main_#t~nondet3; 5342#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5341#L23-4 assume true; 5340#L23-1 assume !!(main_~i~1 < 10); 5339#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5338#L24-1 havoc main_#t~nondet3; 5337#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5336#L23-4 assume true; 5335#L23-1 assume !!(main_~i~1 < 10); 5334#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5333#L24-1 havoc main_#t~nondet3; 5332#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5331#L23-4 assume true; 5330#L23-1 assume !!(main_~i~1 < 10); 5329#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5328#L24-1 havoc main_#t~nondet3; 5327#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5326#L23-4 assume true; 5318#L23-1 assume !!(main_~i~1 < 10); 5325#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5323#L24-1 havoc main_#t~nondet3; 5321#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5317#L23-4 assume true; 5281#L23-1 assume !(main_~i~1 < 10); 5282#L23-5 assume { :begin_inline_sum } true;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; 5257#L9-4 assume true; 5258#L9-1 assume !!(sum_~i~0 < 10); 5267#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 5277#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5262#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5259#L9-4 assume true; 5260#L9-1 assume !!(sum_~i~0 < 10); 5378#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 5304#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5305#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5375#L9-4 assume true; 5374#L9-1 assume !!(sum_~i~0 < 10); 5373#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 5372#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5371#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5370#L9-4 assume true; 5369#L9-1 assume !!(sum_~i~0 < 10); 5368#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 5367#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5366#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5365#L9-4 assume true; 5315#L9-1 assume !!(sum_~i~0 < 10); 5363#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 5362#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5316#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5314#L9-4 assume true; 5265#L9-1 assume !(sum_~i~0 < 10); 5266#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 5285#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 5264#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 5263#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 5261#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 5255#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 5256#L29-4 havoc main_#t~mem6; 5290#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 5286#L29-6 assume { :begin_inline_sum } true;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; 5287#L9-10 assume true; 5288#L9-7 assume !!(sum_~i~0 < 10); 5289#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 5297#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5278#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5270#L9-10 assume true; 5271#L9-7 assume !!(sum_~i~0 < 10); 5299#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 5300#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5389#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5388#L9-10 assume true; 5387#L9-7 assume !!(sum_~i~0 < 10); 5386#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 5385#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5384#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5383#L9-10 assume true; 5382#L9-7 assume !!(sum_~i~0 < 10); 5381#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 5380#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5379#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5377#L9-10 assume true; 5376#L9-7 assume !!(sum_~i~0 < 10); 5320#L10-2 [2018-10-27 06:13:11,614 INFO L795 eck$LassoCheckResult]: Loop: 5320#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 5364#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5324#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5322#L9-10 assume true; 5319#L9-7 assume !!(sum_~i~0 < 10); 5320#L10-2 [2018-10-27 06:13:11,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:11,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1394804067, now seen corresponding path program 4 times [2018-10-27 06:13:11,614 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:11,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:11,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:11,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:11,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:11,761 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2018-10-27 06:13:11,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:11,761 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:11,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:13:11,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:13:11,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:11,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2018-10-27 06:13:11,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:11,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-10-27 06:13:11,840 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:11,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:11,840 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 6 times [2018-10-27 06:13:11,840 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:11,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:11,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:11,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:11,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 06:13:11,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-27 06:13:11,879 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. cyclomatic complexity: 9 Second operand 9 states. [2018-10-27 06:13:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:11,968 INFO L93 Difference]: Finished difference Result 183 states and 187 transitions. [2018-10-27 06:13:11,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 06:13:11,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 183 states and 187 transitions. [2018-10-27 06:13:11,969 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:11,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 183 states to 182 states and 186 transitions. [2018-10-27 06:13:11,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2018-10-27 06:13:11,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2018-10-27 06:13:11,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 186 transitions. [2018-10-27 06:13:11,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:11,971 INFO L705 BuchiCegarLoop]: Abstraction has 182 states and 186 transitions. [2018-10-27 06:13:11,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 186 transitions. [2018-10-27 06:13:11,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 145. [2018-10-27 06:13:11,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-27 06:13:11,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2018-10-27 06:13:11,977 INFO L728 BuchiCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-10-27 06:13:11,977 INFO L608 BuchiCegarLoop]: Abstraction has 145 states and 149 transitions. [2018-10-27 06:13:11,977 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-10-27 06:13:11,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 149 transitions. [2018-10-27 06:13:11,978 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:11,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:11,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:11,979 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:11,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:11,980 INFO L793 eck$LassoCheckResult]: Stem: 5972#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5937#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 5938#L23-4 assume true; 5967#L23-1 assume !!(main_~i~1 < 10); 6027#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5974#L24-1 havoc main_#t~nondet3; 5970#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5968#L23-4 assume true; 5951#L23-1 assume !!(main_~i~1 < 10); 5952#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5975#L24-1 havoc main_#t~nondet3; 6024#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6023#L23-4 assume true; 6022#L23-1 assume !!(main_~i~1 < 10); 6021#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6020#L24-1 havoc main_#t~nondet3; 6019#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6018#L23-4 assume true; 6017#L23-1 assume !!(main_~i~1 < 10); 6016#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6015#L24-1 havoc main_#t~nondet3; 6014#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6013#L23-4 assume true; 6012#L23-1 assume !!(main_~i~1 < 10); 6011#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6010#L24-1 havoc main_#t~nondet3; 6009#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6008#L23-4 assume true; 6007#L23-1 assume !!(main_~i~1 < 10); 6006#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6005#L24-1 havoc main_#t~nondet3; 6004#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6003#L23-4 assume true; 6002#L23-1 assume !!(main_~i~1 < 10); 6001#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6000#L24-1 havoc main_#t~nondet3; 5999#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5998#L23-4 assume true; 5997#L23-1 assume !!(main_~i~1 < 10); 5996#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5995#L24-1 havoc main_#t~nondet3; 5994#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5993#L23-4 assume true; 5992#L23-1 assume !!(main_~i~1 < 10); 5991#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5990#L24-1 havoc main_#t~nondet3; 5989#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5988#L23-4 assume true; 5980#L23-1 assume !!(main_~i~1 < 10); 5987#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 5985#L24-1 havoc main_#t~nondet3; 5983#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 5979#L23-4 assume true; 5949#L23-1 assume !(main_~i~1 < 10); 5950#L23-5 assume { :begin_inline_sum } true;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; 5923#L9-4 assume true; 5924#L9-1 assume !!(sum_~i~0 < 10); 5934#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6065#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6064#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5925#L9-4 assume true; 5926#L9-1 assume !!(sum_~i~0 < 10); 5944#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 5945#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5928#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5929#L9-4 assume true; 6063#L9-1 assume !!(sum_~i~0 < 10); 6062#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6061#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6060#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6059#L9-4 assume true; 6058#L9-1 assume !!(sum_~i~0 < 10); 6057#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6056#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6055#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6054#L9-4 assume true; 6053#L9-1 assume !!(sum_~i~0 < 10); 6052#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6050#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6048#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6046#L9-4 assume true; 5977#L9-1 assume !!(sum_~i~0 < 10); 6028#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6025#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5978#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5976#L9-4 assume true; 5932#L9-1 assume !(sum_~i~0 < 10); 5933#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 5953#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 5931#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 5930#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 5927#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 5921#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 5922#L29-4 havoc main_#t~mem6; 5957#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 5954#L29-6 assume { :begin_inline_sum } true;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; 5955#L9-10 assume true; 6051#L9-7 assume !!(sum_~i~0 < 10); 6049#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6047#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5946#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5939#L9-10 assume true; 5940#L9-7 assume !!(sum_~i~0 < 10); 5956#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 5964#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5965#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6045#L9-10 assume true; 6044#L9-7 assume !!(sum_~i~0 < 10); 6043#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6042#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6041#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6040#L9-10 assume true; 6039#L9-7 assume !!(sum_~i~0 < 10); 6038#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6037#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6036#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6035#L9-10 assume true; 6034#L9-7 assume !!(sum_~i~0 < 10); 6033#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6032#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6031#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6030#L9-10 assume true; 6029#L9-7 assume !!(sum_~i~0 < 10); 5982#L10-2 [2018-10-27 06:13:11,980 INFO L795 eck$LassoCheckResult]: Loop: 5982#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6026#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 5986#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 5984#L9-10 assume true; 5981#L9-7 assume !!(sum_~i~0 < 10); 5982#L10-2 [2018-10-27 06:13:11,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:11,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1937725569, now seen corresponding path program 5 times [2018-10-27 06:13:11,988 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:11,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:11,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:11,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:12,159 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-27 06:13:12,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:12,159 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:12,166 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:13:12,214 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-10-27 06:13:12,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:12,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:12,260 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-10-27 06:13:12,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:12,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-10-27 06:13:12,280 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:12,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:12,280 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 7 times [2018-10-27 06:13:12,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:12,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:12,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:12,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:12,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:12,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:12,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:13:12,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:13:12,338 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. cyclomatic complexity: 9 Second operand 10 states. [2018-10-27 06:13:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:12,491 INFO L93 Difference]: Finished difference Result 198 states and 202 transitions. [2018-10-27 06:13:12,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 06:13:12,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 202 transitions. [2018-10-27 06:13:12,492 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:12,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 197 states and 201 transitions. [2018-10-27 06:13:12,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2018-10-27 06:13:12,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2018-10-27 06:13:12,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 197 states and 201 transitions. [2018-10-27 06:13:12,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:12,494 INFO L705 BuchiCegarLoop]: Abstraction has 197 states and 201 transitions. [2018-10-27 06:13:12,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states and 201 transitions. [2018-10-27 06:13:12,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 155. [2018-10-27 06:13:12,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-27 06:13:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-10-27 06:13:12,500 INFO L728 BuchiCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-10-27 06:13:12,501 INFO L608 BuchiCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-10-27 06:13:12,501 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-10-27 06:13:12,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 155 states and 159 transitions. [2018-10-27 06:13:12,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:12,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:12,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:12,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:12,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:12,503 INFO L793 eck$LassoCheckResult]: Stem: 6692#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6658#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 6659#L23-4 assume true; 6686#L23-1 assume !!(main_~i~1 < 10); 6747#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6694#L24-1 havoc main_#t~nondet3; 6690#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6687#L23-4 assume true; 6672#L23-1 assume !!(main_~i~1 < 10); 6673#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6695#L24-1 havoc main_#t~nondet3; 6744#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6743#L23-4 assume true; 6742#L23-1 assume !!(main_~i~1 < 10); 6741#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6740#L24-1 havoc main_#t~nondet3; 6739#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6738#L23-4 assume true; 6737#L23-1 assume !!(main_~i~1 < 10); 6736#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6735#L24-1 havoc main_#t~nondet3; 6734#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6733#L23-4 assume true; 6732#L23-1 assume !!(main_~i~1 < 10); 6731#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6730#L24-1 havoc main_#t~nondet3; 6729#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6728#L23-4 assume true; 6727#L23-1 assume !!(main_~i~1 < 10); 6726#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6725#L24-1 havoc main_#t~nondet3; 6724#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6723#L23-4 assume true; 6722#L23-1 assume !!(main_~i~1 < 10); 6721#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6720#L24-1 havoc main_#t~nondet3; 6719#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6718#L23-4 assume true; 6717#L23-1 assume !!(main_~i~1 < 10); 6716#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6715#L24-1 havoc main_#t~nondet3; 6714#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6713#L23-4 assume true; 6712#L23-1 assume !!(main_~i~1 < 10); 6711#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6710#L24-1 havoc main_#t~nondet3; 6709#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6708#L23-4 assume true; 6700#L23-1 assume !!(main_~i~1 < 10); 6707#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 6705#L24-1 havoc main_#t~nondet3; 6703#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 6699#L23-4 assume true; 6670#L23-1 assume !(main_~i~1 < 10); 6671#L23-5 assume { :begin_inline_sum } true;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; 6645#L9-4 assume true; 6646#L9-1 assume !!(sum_~i~0 < 10); 6797#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6796#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6650#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6647#L9-4 assume true; 6648#L9-1 assume !!(sum_~i~0 < 10); 6655#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6665#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6689#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6795#L9-4 assume true; 6794#L9-1 assume !!(sum_~i~0 < 10); 6793#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6792#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6791#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6790#L9-4 assume true; 6788#L9-1 assume !!(sum_~i~0 < 10); 6786#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6784#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6782#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6780#L9-4 assume true; 6778#L9-1 assume !!(sum_~i~0 < 10); 6776#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6774#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6772#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6770#L9-4 assume true; 6768#L9-1 assume !!(sum_~i~0 < 10); 6766#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6764#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6762#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6760#L9-4 assume true; 6697#L9-1 assume !!(sum_~i~0 < 10); 6748#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 6745#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6698#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6696#L9-4 assume true; 6653#L9-1 assume !(sum_~i~0 < 10); 6654#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 6674#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 6652#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 6651#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 6649#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 6643#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 6644#L29-4 havoc main_#t~mem6; 6677#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 6675#L29-6 assume { :begin_inline_sum } true;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; 6660#L9-10 assume true; 6661#L9-7 assume !!(sum_~i~0 < 10); 6676#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6684#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6666#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6667#L9-10 assume true; 6789#L9-7 assume !!(sum_~i~0 < 10); 6787#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6785#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6783#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6781#L9-10 assume true; 6779#L9-7 assume !!(sum_~i~0 < 10); 6777#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6775#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6773#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6771#L9-10 assume true; 6769#L9-7 assume !!(sum_~i~0 < 10); 6767#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6765#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6763#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6761#L9-10 assume true; 6759#L9-7 assume !!(sum_~i~0 < 10); 6758#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6757#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6756#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6755#L9-10 assume true; 6754#L9-7 assume !!(sum_~i~0 < 10); 6753#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6752#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6751#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6750#L9-10 assume true; 6749#L9-7 assume !!(sum_~i~0 < 10); 6702#L10-2 [2018-10-27 06:13:12,503 INFO L795 eck$LassoCheckResult]: Loop: 6702#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 6746#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 6706#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 6704#L9-10 assume true; 6701#L9-7 assume !!(sum_~i~0 < 10); 6702#L10-2 [2018-10-27 06:13:12,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash 145686813, now seen corresponding path program 6 times [2018-10-27 06:13:12,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:12,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:12,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:12,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:12,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2018-10-27 06:13:12,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:12,704 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:12,711 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:13:12,821 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-10-27 06:13:12,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:12,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:12,838 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2018-10-27 06:13:12,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:12,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-10-27 06:13:12,859 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:12,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:12,859 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 8 times [2018-10-27 06:13:12,859 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:12,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:12,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:12,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:12,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:12,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 06:13:12,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-27 06:13:12,893 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. cyclomatic complexity: 9 Second operand 11 states. [2018-10-27 06:13:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:12,968 INFO L93 Difference]: Finished difference Result 213 states and 217 transitions. [2018-10-27 06:13:12,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:13:12,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 217 transitions. [2018-10-27 06:13:12,969 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:12,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 212 states and 216 transitions. [2018-10-27 06:13:12,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2018-10-27 06:13:12,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2018-10-27 06:13:12,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 216 transitions. [2018-10-27 06:13:12,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:12,971 INFO L705 BuchiCegarLoop]: Abstraction has 212 states and 216 transitions. [2018-10-27 06:13:12,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 216 transitions. [2018-10-27 06:13:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 165. [2018-10-27 06:13:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-27 06:13:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2018-10-27 06:13:12,973 INFO L728 BuchiCegarLoop]: Abstraction has 165 states and 169 transitions. [2018-10-27 06:13:12,973 INFO L608 BuchiCegarLoop]: Abstraction has 165 states and 169 transitions. [2018-10-27 06:13:12,973 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-10-27 06:13:12,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 169 transitions. [2018-10-27 06:13:12,974 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:12,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:12,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:12,977 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:12,977 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:12,977 INFO L793 eck$LassoCheckResult]: Stem: 7469#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 7437#L23-4 assume true; 7464#L23-1 assume !!(main_~i~1 < 10); 7524#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7471#L24-1 havoc main_#t~nondet3; 7467#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 7465#L23-4 assume true; 7450#L23-1 assume !!(main_~i~1 < 10); 7451#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7472#L24-1 havoc main_#t~nondet3; 7521#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 7520#L23-4 assume true; 7519#L23-1 assume !!(main_~i~1 < 10); 7518#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7517#L24-1 havoc main_#t~nondet3; 7516#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 7515#L23-4 assume true; 7514#L23-1 assume !!(main_~i~1 < 10); 7513#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7512#L24-1 havoc main_#t~nondet3; 7511#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 7510#L23-4 assume true; 7509#L23-1 assume !!(main_~i~1 < 10); 7508#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7507#L24-1 havoc main_#t~nondet3; 7506#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 7505#L23-4 assume true; 7504#L23-1 assume !!(main_~i~1 < 10); 7503#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7502#L24-1 havoc main_#t~nondet3; 7501#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 7500#L23-4 assume true; 7499#L23-1 assume !!(main_~i~1 < 10); 7498#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7497#L24-1 havoc main_#t~nondet3; 7496#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 7495#L23-4 assume true; 7494#L23-1 assume !!(main_~i~1 < 10); 7493#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7492#L24-1 havoc main_#t~nondet3; 7491#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 7490#L23-4 assume true; 7489#L23-1 assume !!(main_~i~1 < 10); 7488#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7487#L24-1 havoc main_#t~nondet3; 7486#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 7485#L23-4 assume true; 7477#L23-1 assume !!(main_~i~1 < 10); 7484#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 7482#L24-1 havoc main_#t~nondet3; 7480#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 7476#L23-4 assume true; 7448#L23-1 assume !(main_~i~1 < 10); 7449#L23-5 assume { :begin_inline_sum } true;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; 7423#L9-4 assume true; 7424#L9-1 assume !!(sum_~i~0 < 10); 7433#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 7443#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7428#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7425#L9-4 assume true; 7426#L9-1 assume !!(sum_~i~0 < 10); 7583#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 7581#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7579#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7577#L9-4 assume true; 7575#L9-1 assume !!(sum_~i~0 < 10); 7573#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 7571#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7569#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7567#L9-4 assume true; 7565#L9-1 assume !!(sum_~i~0 < 10); 7563#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 7561#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7559#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7557#L9-4 assume true; 7555#L9-1 assume !!(sum_~i~0 < 10); 7553#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 7551#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7549#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7547#L9-4 assume true; 7545#L9-1 assume !!(sum_~i~0 < 10); 7543#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 7541#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7539#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7537#L9-4 assume true; 7535#L9-1 assume !!(sum_~i~0 < 10); 7533#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 7531#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7529#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7527#L9-4 assume true; 7474#L9-1 assume !!(sum_~i~0 < 10); 7525#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 7522#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7475#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7473#L9-4 assume true; 7431#L9-1 assume !(sum_~i~0 < 10); 7432#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 7452#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 7430#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 7429#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 7427#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 7421#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 7422#L29-4 havoc main_#t~mem6; 7455#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 7453#L29-6 assume { :begin_inline_sum } true;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; 7438#L9-10 assume true; 7439#L9-7 assume !!(sum_~i~0 < 10); 7454#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 7462#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7444#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7445#L9-10 assume true; 7585#L9-7 assume !!(sum_~i~0 < 10); 7584#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 7582#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7580#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7578#L9-10 assume true; 7576#L9-7 assume !!(sum_~i~0 < 10); 7574#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 7572#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7570#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7568#L9-10 assume true; 7566#L9-7 assume !!(sum_~i~0 < 10); 7564#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 7562#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7560#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7558#L9-10 assume true; 7556#L9-7 assume !!(sum_~i~0 < 10); 7554#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 7552#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7550#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7548#L9-10 assume true; 7546#L9-7 assume !!(sum_~i~0 < 10); 7544#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 7542#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7540#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7538#L9-10 assume true; 7536#L9-7 assume !!(sum_~i~0 < 10); 7534#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 7532#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7530#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7528#L9-10 assume true; 7526#L9-7 assume !!(sum_~i~0 < 10); 7479#L10-2 [2018-10-27 06:13:12,977 INFO L795 eck$LassoCheckResult]: Loop: 7479#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 7523#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 7483#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 7481#L9-10 assume true; 7478#L9-7 assume !!(sum_~i~0 < 10); 7479#L10-2 [2018-10-27 06:13:12,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:12,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1135956481, now seen corresponding path program 7 times [2018-10-27 06:13:12,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:12,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:12,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:12,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:12,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:13,126 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-10-27 06:13:13,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:13,126 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:13,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:13,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:13,226 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-10-27 06:13:13,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:13,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-10-27 06:13:13,243 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:13,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:13,243 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 9 times [2018-10-27 06:13:13,243 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:13,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:13,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:13,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-27 06:13:13,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-27 06:13:13,289 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. cyclomatic complexity: 9 Second operand 12 states. [2018-10-27 06:13:13,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:13,423 INFO L93 Difference]: Finished difference Result 228 states and 232 transitions. [2018-10-27 06:13:13,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-27 06:13:13,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 228 states and 232 transitions. [2018-10-27 06:13:13,425 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:13,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 228 states to 227 states and 231 transitions. [2018-10-27 06:13:13,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 128 [2018-10-27 06:13:13,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-10-27 06:13:13,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 231 transitions. [2018-10-27 06:13:13,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:13,426 INFO L705 BuchiCegarLoop]: Abstraction has 227 states and 231 transitions. [2018-10-27 06:13:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states and 231 transitions. [2018-10-27 06:13:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 175. [2018-10-27 06:13:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-27 06:13:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2018-10-27 06:13:13,429 INFO L728 BuchiCegarLoop]: Abstraction has 175 states and 179 transitions. [2018-10-27 06:13:13,429 INFO L608 BuchiCegarLoop]: Abstraction has 175 states and 179 transitions. [2018-10-27 06:13:13,429 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-10-27 06:13:13,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 179 transitions. [2018-10-27 06:13:13,430 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:13,430 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:13,430 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:13,431 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:13,431 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:13,431 INFO L793 eck$LassoCheckResult]: Stem: 8305#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 8274#L23-4 assume true; 8284#L23-1 assume !!(main_~i~1 < 10); 8285#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8356#L24-1 havoc main_#t~nondet3; 8355#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 8298#L23-4 assume true; 8299#L23-1 assume !!(main_~i~1 < 10); 8307#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8306#L24-1 havoc main_#t~nondet3; 8301#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 8302#L23-4 assume true; 8354#L23-1 assume !!(main_~i~1 < 10); 8353#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8352#L24-1 havoc main_#t~nondet3; 8351#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 8350#L23-4 assume true; 8349#L23-1 assume !!(main_~i~1 < 10); 8348#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8347#L24-1 havoc main_#t~nondet3; 8346#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 8345#L23-4 assume true; 8344#L23-1 assume !!(main_~i~1 < 10); 8343#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8342#L24-1 havoc main_#t~nondet3; 8341#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 8340#L23-4 assume true; 8339#L23-1 assume !!(main_~i~1 < 10); 8338#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8337#L24-1 havoc main_#t~nondet3; 8336#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 8335#L23-4 assume true; 8334#L23-1 assume !!(main_~i~1 < 10); 8333#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8332#L24-1 havoc main_#t~nondet3; 8331#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 8330#L23-4 assume true; 8329#L23-1 assume !!(main_~i~1 < 10); 8328#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8327#L24-1 havoc main_#t~nondet3; 8326#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 8325#L23-4 assume true; 8324#L23-1 assume !!(main_~i~1 < 10); 8323#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8322#L24-1 havoc main_#t~nondet3; 8321#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 8320#L23-4 assume true; 8312#L23-1 assume !!(main_~i~1 < 10); 8319#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 8317#L24-1 havoc main_#t~nondet3; 8315#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 8311#L23-4 assume true; 8282#L23-1 assume !(main_~i~1 < 10); 8283#L23-5 assume { :begin_inline_sum } true;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; 8257#L9-4 assume true; 8258#L9-1 assume !!(sum_~i~0 < 10); 8267#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 8277#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8262#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8259#L9-4 assume true; 8260#L9-1 assume !!(sum_~i~0 < 10); 8427#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 8425#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8423#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8421#L9-4 assume true; 8419#L9-1 assume !!(sum_~i~0 < 10); 8417#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 8415#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8413#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8411#L9-4 assume true; 8409#L9-1 assume !!(sum_~i~0 < 10); 8407#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 8405#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8403#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8401#L9-4 assume true; 8399#L9-1 assume !!(sum_~i~0 < 10); 8397#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 8395#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8393#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8391#L9-4 assume true; 8389#L9-1 assume !!(sum_~i~0 < 10); 8387#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 8385#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8383#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8381#L9-4 assume true; 8379#L9-1 assume !!(sum_~i~0 < 10); 8377#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 8375#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8373#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8371#L9-4 assume true; 8369#L9-1 assume !!(sum_~i~0 < 10); 8367#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 8365#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8363#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8361#L9-4 assume true; 8309#L9-1 assume !!(sum_~i~0 < 10); 8359#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 8357#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8310#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8308#L9-4 assume true; 8265#L9-1 assume !(sum_~i~0 < 10); 8266#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 8286#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 8264#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 8263#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 8261#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 8255#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 8256#L29-4 havoc main_#t~mem6; 8289#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 8287#L29-6 assume { :begin_inline_sum } true;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; 8275#L9-10 assume true; 8276#L9-7 assume !!(sum_~i~0 < 10); 8288#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 8296#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8278#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8279#L9-10 assume true; 8429#L9-7 assume !!(sum_~i~0 < 10); 8428#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 8426#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8424#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8422#L9-10 assume true; 8420#L9-7 assume !!(sum_~i~0 < 10); 8418#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 8416#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8414#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8412#L9-10 assume true; 8410#L9-7 assume !!(sum_~i~0 < 10); 8408#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 8406#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8404#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8402#L9-10 assume true; 8400#L9-7 assume !!(sum_~i~0 < 10); 8398#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 8396#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8394#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8392#L9-10 assume true; 8390#L9-7 assume !!(sum_~i~0 < 10); 8388#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 8386#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8384#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8382#L9-10 assume true; 8380#L9-7 assume !!(sum_~i~0 < 10); 8378#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 8376#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8374#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8372#L9-10 assume true; 8370#L9-7 assume !!(sum_~i~0 < 10); 8368#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 8366#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8364#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8362#L9-10 assume true; 8360#L9-7 assume !!(sum_~i~0 < 10); 8314#L10-2 [2018-10-27 06:13:13,432 INFO L795 eck$LassoCheckResult]: Loop: 8314#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 8358#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 8318#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 8316#L9-10 assume true; 8313#L9-7 assume !!(sum_~i~0 < 10); 8314#L10-2 [2018-10-27 06:13:13,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:13,432 INFO L82 PathProgramCache]: Analyzing trace with hash 248833949, now seen corresponding path program 8 times [2018-10-27 06:13:13,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:13,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:13,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:13,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:13,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2018-10-27 06:13:13,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:13,612 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/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-10-27 06:13:13,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:13:13,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:13:13,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:13,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:13,768 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 401 trivial. 0 not checked. [2018-10-27 06:13:13,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:13:13,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-10-27 06:13:13,801 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:13:13,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 10 times [2018-10-27 06:13:13,801 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:13,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:13,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:13,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:13,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:13,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 06:13:13,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-27 06:13:13,859 INFO L87 Difference]: Start difference. First operand 175 states and 179 transitions. cyclomatic complexity: 9 Second operand 13 states. [2018-10-27 06:13:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:13,962 INFO L93 Difference]: Finished difference Result 234 states and 238 transitions. [2018-10-27 06:13:13,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-27 06:13:13,962 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 234 states and 238 transitions. [2018-10-27 06:13:13,963 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:13,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 234 states to 233 states and 237 transitions. [2018-10-27 06:13:13,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 132 [2018-10-27 06:13:13,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 132 [2018-10-27 06:13:13,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 237 transitions. [2018-10-27 06:13:13,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:13,965 INFO L705 BuchiCegarLoop]: Abstraction has 233 states and 237 transitions. [2018-10-27 06:13:13,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 237 transitions. [2018-10-27 06:13:13,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 185. [2018-10-27 06:13:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-27 06:13:13,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 189 transitions. [2018-10-27 06:13:13,967 INFO L728 BuchiCegarLoop]: Abstraction has 185 states and 189 transitions. [2018-10-27 06:13:13,968 INFO L608 BuchiCegarLoop]: Abstraction has 185 states and 189 transitions. [2018-10-27 06:13:13,968 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-10-27 06:13:13,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 185 states and 189 transitions. [2018-10-27 06:13:13,970 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2018-10-27 06:13:13,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:13,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:13,971 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:13,971 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:13:13,971 INFO L793 eck$LassoCheckResult]: Stem: 9188#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 9153#L23-4 assume true; 9166#L23-1 assume !!(main_~i~1 < 10); 9167#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9277#L24-1 havoc main_#t~nondet3; 9186#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 9182#L23-4 assume true; 9183#L23-1 assume !!(main_~i~1 < 10); 9192#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9190#L24-1 havoc main_#t~nondet3; 9191#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 9272#L23-4 assume true; 9270#L23-1 assume !!(main_~i~1 < 10); 9268#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9266#L24-1 havoc main_#t~nondet3; 9264#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 9262#L23-4 assume true; 9260#L23-1 assume !!(main_~i~1 < 10); 9258#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9256#L24-1 havoc main_#t~nondet3; 9254#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 9252#L23-4 assume true; 9250#L23-1 assume !!(main_~i~1 < 10); 9248#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9246#L24-1 havoc main_#t~nondet3; 9244#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 9242#L23-4 assume true; 9240#L23-1 assume !!(main_~i~1 < 10); 9238#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9236#L24-1 havoc main_#t~nondet3; 9234#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 9232#L23-4 assume true; 9230#L23-1 assume !!(main_~i~1 < 10); 9228#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9226#L24-1 havoc main_#t~nondet3; 9224#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 9222#L23-4 assume true; 9220#L23-1 assume !!(main_~i~1 < 10); 9218#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9216#L24-1 havoc main_#t~nondet3; 9215#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 9214#L23-4 assume true; 9213#L23-1 assume !!(main_~i~1 < 10); 9212#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9211#L24-1 havoc main_#t~nondet3; 9210#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 9208#L23-4 assume true; 9199#L23-1 assume !!(main_~i~1 < 10); 9206#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 9204#L24-1 havoc main_#t~nondet3; 9202#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 9198#L23-4 assume true; 9164#L23-1 assume !(main_~i~1 < 10); 9165#L23-5 assume { :begin_inline_sum } true;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; 9138#L9-4 assume true; 9139#L9-1 assume !!(sum_~i~0 < 10); 9159#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 9160#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9320#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9140#L9-4 assume true; 9141#L9-1 assume !!(sum_~i~0 < 10); 9149#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 9185#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9143#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9144#L9-4 assume true; 9319#L9-1 assume !!(sum_~i~0 < 10); 9318#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 9317#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9316#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9315#L9-4 assume true; 9314#L9-1 assume !!(sum_~i~0 < 10); 9313#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 9312#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9311#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9310#L9-4 assume true; 9309#L9-1 assume !!(sum_~i~0 < 10); 9308#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 9307#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9306#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9305#L9-4 assume true; 9304#L9-1 assume !!(sum_~i~0 < 10); 9303#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 9302#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9301#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9300#L9-4 assume true; 9299#L9-1 assume !!(sum_~i~0 < 10); 9298#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 9297#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9296#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9295#L9-4 assume true; 9294#L9-1 assume !!(sum_~i~0 < 10); 9293#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 9291#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9289#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9288#L9-4 assume true; 9286#L9-1 assume !!(sum_~i~0 < 10); 9283#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 9281#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9279#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9276#L9-4 assume true; 9194#L9-1 assume !!(sum_~i~0 < 10); 9197#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 9196#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9195#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9193#L9-4 assume true; 9147#L9-1 assume !(sum_~i~0 < 10); 9148#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 9168#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 9146#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 9145#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 9142#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 9136#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 9137#L29-4 havoc main_#t~mem6; 9172#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 9169#L29-6 assume { :begin_inline_sum } true;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; 9170#L9-10 assume true; 9292#L9-7 assume !!(sum_~i~0 < 10); 9290#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 9179#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9161#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9154#L9-10 assume true; 9155#L9-7 assume !!(sum_~i~0 < 10); 9171#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 9181#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9287#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9285#L9-10 assume true; 9284#L9-7 assume !!(sum_~i~0 < 10); 9282#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 9280#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9278#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9275#L9-10 assume true; 9274#L9-7 assume !!(sum_~i~0 < 10); 9273#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 9271#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9269#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9267#L9-10 assume true; 9265#L9-7 assume !!(sum_~i~0 < 10); 9263#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 9261#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9259#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9257#L9-10 assume true; 9255#L9-7 assume !!(sum_~i~0 < 10); 9253#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 9251#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9249#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9247#L9-10 assume true; 9245#L9-7 assume !!(sum_~i~0 < 10); 9243#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 9241#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9239#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9237#L9-10 assume true; 9235#L9-7 assume !!(sum_~i~0 < 10); 9233#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 9231#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9229#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9227#L9-10 assume true; 9225#L9-7 assume !!(sum_~i~0 < 10); 9223#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 9221#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9219#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9217#L9-10 assume true; 9209#L9-7 assume !!(sum_~i~0 < 10); 9201#L10-2 [2018-10-27 06:13:13,971 INFO L795 eck$LassoCheckResult]: Loop: 9201#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 9207#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 9205#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 9203#L9-10 assume true; 9200#L9-7 assume !!(sum_~i~0 < 10); 9201#L10-2 [2018-10-27 06:13:13,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash 531327873, now seen corresponding path program 9 times [2018-10-27 06:13:13,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:13,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:13,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:13,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:13,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:14,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:14,284 INFO L82 PathProgramCache]: Analyzing trace with hash 81148413, now seen corresponding path program 11 times [2018-10-27 06:13:14,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:14,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:14,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:14,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:14,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:14,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:14,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1761738365, now seen corresponding path program 10 times [2018-10-27 06:13:14,293 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:14,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:14,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:14,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:14,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:15,361 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 207 proven. 38 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 06:13:15,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:13:15,362 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f21281ad-b58b-4254-bbdd-0fdb7cc62325/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:13:15,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:13:15,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:13:15,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:13:15,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-10-27 06:13:15,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 06:13:15,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 24 [2018-10-27 06:13:15,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 06:13:15,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=388, Unknown=0, NotChecked=0, Total=600 [2018-10-27 06:13:15,625 INFO L87 Difference]: Start difference. First operand 185 states and 189 transitions. cyclomatic complexity: 9 Second operand 25 states. [2018-10-27 06:13:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:13:16,059 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2018-10-27 06:13:16,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 06:13:16,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 233 states and 234 transitions. [2018-10-27 06:13:16,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:13:16,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 233 states to 178 states and 179 transitions. [2018-10-27 06:13:16,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2018-10-27 06:13:16,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 128 [2018-10-27 06:13:16,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 178 states and 179 transitions. [2018-10-27 06:13:16,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:13:16,063 INFO L705 BuchiCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-10-27 06:13:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states and 179 transitions. [2018-10-27 06:13:16,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-10-27 06:13:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-27 06:13:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2018-10-27 06:13:16,065 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-10-27 06:13:16,065 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 179 transitions. [2018-10-27 06:13:16,065 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-10-27 06:13:16,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 179 transitions. [2018-10-27 06:13:16,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-10-27 06:13:16,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:13:16,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:13:16,067 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:13:16,067 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:13:16,067 INFO L793 eck$LassoCheckResult]: Stem: 10159#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10134#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 40;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#x~0.base, main_~#x~0.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;main_~i~1 := 0; 10135#L23-4 assume true; 10152#L23-1 assume !!(main_~i~1 < 10); 10295#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10294#L24-1 havoc main_#t~nondet3; 10293#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 10153#L23-4 assume true; 10143#L23-1 assume !!(main_~i~1 < 10); 10144#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10160#L24-1 havoc main_#t~nondet3; 10155#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 10156#L23-4 assume true; 10292#L23-1 assume !!(main_~i~1 < 10); 10291#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10290#L24-1 havoc main_#t~nondet3; 10289#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 10288#L23-4 assume true; 10287#L23-1 assume !!(main_~i~1 < 10); 10286#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10285#L24-1 havoc main_#t~nondet3; 10284#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 10283#L23-4 assume true; 10282#L23-1 assume !!(main_~i~1 < 10); 10281#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10280#L24-1 havoc main_#t~nondet3; 10279#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 10278#L23-4 assume true; 10277#L23-1 assume !!(main_~i~1 < 10); 10276#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10275#L24-1 havoc main_#t~nondet3; 10274#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 10273#L23-4 assume true; 10272#L23-1 assume !!(main_~i~1 < 10); 10271#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10270#L24-1 havoc main_#t~nondet3; 10269#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 10268#L23-4 assume true; 10267#L23-1 assume !!(main_~i~1 < 10); 10266#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10265#L24-1 havoc main_#t~nondet3; 10264#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 10263#L23-4 assume true; 10262#L23-1 assume !!(main_~i~1 < 10); 10261#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10260#L24-1 havoc main_#t~nondet3; 10259#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 10258#L23-4 assume true; 10254#L23-1 assume !!(main_~i~1 < 10); 10257#L24 SUMMARY for call write~int(main_#t~nondet3, main_~#x~0.base, main_~#x~0.offset + main_~i~1 * 4, 4); srcloc: L24 10256#L24-1 havoc main_#t~nondet3; 10255#L23-3 main_#t~post2 := main_~i~1;main_~i~1 := main_#t~post2 + 1;havoc main_#t~post2; 10253#L23-4 assume true; 10141#L23-1 assume !(main_~i~1 < 10); 10142#L23-5 assume { :begin_inline_sum } true;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; 10120#L9-4 assume true; 10121#L9-1 assume !!(sum_~i~0 < 10); 10127#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 10136#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10123#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10124#L9-4 assume true; 10252#L9-1 assume !!(sum_~i~0 < 10); 10251#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 10250#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10249#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10248#L9-4 assume true; 10246#L9-1 assume !!(sum_~i~0 < 10); 10244#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 10242#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10240#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10238#L9-4 assume true; 10236#L9-1 assume !!(sum_~i~0 < 10); 10234#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 10232#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10230#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10228#L9-4 assume true; 10226#L9-1 assume !!(sum_~i~0 < 10); 10224#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 10222#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10220#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10218#L9-4 assume true; 10216#L9-1 assume !!(sum_~i~0 < 10); 10214#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 10212#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10210#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10208#L9-4 assume true; 10206#L9-1 assume !!(sum_~i~0 < 10); 10204#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 10202#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10200#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10198#L9-4 assume true; 10196#L9-1 assume !!(sum_~i~0 < 10); 10194#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 10192#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10190#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10188#L9-4 assume true; 10186#L9-1 assume !!(sum_~i~0 < 10); 10184#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 10182#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10180#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10178#L9-4 assume true; 10176#L9-1 assume !!(sum_~i~0 < 10); 10174#L10 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10 10172#L10-1 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10170#L9-3 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10168#L9-4 assume true; 10166#L9-1 assume !(sum_~i~0 < 10); 10149#L9-5 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 10145#L12 main_#t~ret4 := sum_#res;assume { :end_inline_sum } true;main_~ret~1 := main_#t~ret4;havoc main_#t~ret4; 10126#L29 SUMMARY for call main_#t~mem5 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29 10125#L29-1 main_~temp~0 := main_#t~mem5;havoc main_#t~mem5; 10122#L29-2 SUMMARY for call main_#t~mem6 := read~int(main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-2 10118#L29-3 SUMMARY for call write~int(main_#t~mem6, main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L29-3 10119#L29-4 havoc main_#t~mem6; 10148#L29-5 SUMMARY for call write~int(main_~temp~0, main_~#x~0.base, main_~#x~0.offset + 4, 4); srcloc: L29-5 10146#L29-6 assume { :begin_inline_sum } true;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; 10130#L9-10 assume true; 10131#L9-7 assume !!(sum_~i~0 < 10); 10147#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 10150#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10137#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10138#L9-10 assume true; 10247#L9-7 assume !!(sum_~i~0 < 10); 10245#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 10243#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10241#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10239#L9-10 assume true; 10237#L9-7 assume !!(sum_~i~0 < 10); 10235#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 10233#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10231#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10229#L9-10 assume true; 10227#L9-7 assume !!(sum_~i~0 < 10); 10225#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 10223#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10221#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10219#L9-10 assume true; 10217#L9-7 assume !!(sum_~i~0 < 10); 10215#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 10213#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10211#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10209#L9-10 assume true; 10207#L9-7 assume !!(sum_~i~0 < 10); 10205#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 10203#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10201#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10199#L9-10 assume true; 10197#L9-7 assume !!(sum_~i~0 < 10); 10195#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 10193#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10191#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10189#L9-10 assume true; 10187#L9-7 assume !!(sum_~i~0 < 10); 10185#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 10183#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10181#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10179#L9-10 assume true; 10177#L9-7 assume !!(sum_~i~0 < 10); 10175#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 10173#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10171#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10169#L9-10 assume true; 10167#L9-7 assume !!(sum_~i~0 < 10); 10165#L10-2 SUMMARY for call sum_#t~mem1 := read~int(sum_~x.base, sum_~x.offset + sum_~i~0 * 4, 4); srcloc: L10-2 10164#L10-3 sum_~ret~0 := sum_~ret~0 + sum_#t~mem1;havoc sum_#t~mem1; 10163#L9-9 sum_#t~post0 := sum_~i~0;sum_~i~0 := sum_#t~post0 + 1;havoc sum_#t~post0; 10162#L9-10 assume true; 10161#L9-7 assume !(sum_~i~0 < 10); 10154#L9-11 sum_#res := (if sum_~ret~0 % 4294967296 <= 2147483647 then sum_~ret~0 % 4294967296 else sum_~ret~0 % 4294967296 - 4294967296); 10139#L12-1 main_#t~ret7 := sum_#res;assume { :end_inline_sum } true;main_~ret2~0 := main_#t~ret7;havoc main_#t~ret7; 10140#L31 SUMMARY for call main_#t~mem8 := read~int(main_~#x~0.base, main_~#x~0.offset + 0, 4); srcloc: L31 10128#L31-1 main_~temp~0 := main_#t~mem8;havoc main_#t~mem8;main_~i~2 := 0; 10129#L32-4 [2018-10-27 06:13:16,067 INFO L795 eck$LassoCheckResult]: Loop: 10129#L32-4 assume true; 10132#L32-1 assume !!(main_~i~2 < 9); 10133#L33 SUMMARY for call main_#t~mem10 := read~int(main_~#x~0.base, main_~#x~0.offset + (main_~i~2 + 1) * 4, 4); srcloc: L33 10158#L33-1 SUMMARY for call write~int(main_#t~mem10, main_~#x~0.base, main_~#x~0.offset + main_~i~2 * 4, 4); srcloc: L33-1 10157#L33-2 havoc main_#t~mem10; 10151#L32-3 main_#t~post9 := main_~i~2;main_~i~2 := main_#t~post9 + 1;havoc main_#t~post9; 10129#L32-4 [2018-10-27 06:13:16,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:16,068 INFO L82 PathProgramCache]: Analyzing trace with hash 45445214, now seen corresponding path program 1 times [2018-10-27 06:13:16,068 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:16,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:16,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:13:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:16,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1331818359, now seen corresponding path program 1 times [2018-10-27 06:13:16,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:16,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:16,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:16,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:16,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash 153290534, now seen corresponding path program 1 times [2018-10-27 06:13:16,343 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:13:16,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:13:16,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:16,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:13:16,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:13:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:13:16,761 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-10-27 06:13:31,247 WARN L179 SmtUtils]: Spent 14.47 s on a formula simplification. DAG size of input: 584 DAG size of output: 450 [2018-10-27 06:13:34,389 WARN L179 SmtUtils]: Spent 3.03 s on a formula simplification. DAG size of input: 185 DAG size of output: 182 [2018-10-27 06:13:34,392 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:13:34,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:13:34,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:13:34,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:13:34,392 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:13:34,392 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:13:34,392 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:13:34,392 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:13:34,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: sum10_true-unreach-call_true-termination.i_Iteration24_Lasso [2018-10-27 06:13:34,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:13:34,393 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:13:34,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:34,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-10-27 06:13:35,740 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-10-27 06:13:36,384 WARN L179 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 114 [2018-10-27 06:13:36,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:13:36,737 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2018-10-27 06:13:37,102 WARN L179 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2018-10-27 06:13:37,195 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:13:37,196 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:13:37,196 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-10-27 06:13:37,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,204 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-10-27 06:13:37,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,205 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-10-27 06:13:37,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,207 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-10-27 06:13:37,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:37,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:37,209 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,209 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-10-27 06:13:37,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,211 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,211 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-10-27 06:13:37,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,212 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,212 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-10-27 06:13:37,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,214 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,214 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-10-27 06:13:37,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,215 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,216 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-10-27 06:13:37,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,216 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:37,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,221 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:37,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:37,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,236 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-10-27 06:13:37,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:37,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:37,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,239 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-10-27 06:13:37,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,239 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:13:37,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,241 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:13:37,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:37,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,245 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-10-27 06:13:37,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:37,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:37,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,249 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-10-27 06:13:37,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:37,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:37,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,252 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-10-27 06:13:37,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,254 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-10-27 06:13:37,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,255 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-10-27 06:13:37,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,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-10-27 06:13:37,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:13:37,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:13:37,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:13:37,258 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,259 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-10-27 06:13:37,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:37,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:37,263 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:13:37,263 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-10-27 06:13:37,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:13:37,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:13:37,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:13:37,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:13:37,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:13:37,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:13:37,283 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:13:37,297 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:13:37,298 INFO L444 ModelExtractionUtils]: 25 out of 34 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-10-27 06:13:37,298 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:13:37,299 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:13:37,299 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:13:37,299 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~2) = -2*ULTIMATE.start_main_~i~2 + 17 Supporting invariants [] [2018-10-27 06:13:38,336 INFO L297 tatePredicateManager]: 106 out of 106 supporting invariants were superfluous and have been removed [2018-10-27 06:13:38,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:13:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:38,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:13:38,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:13:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:13:38,562 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-10-27 06:13:38,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 178 states and 179 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-10-27 06:13:38,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 178 states and 179 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 184 states and 186 transitions. Complement of second has 6 states. [2018-10-27 06:13:38,634 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-10-27 06:13:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-27 06:13:38,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2018-10-27 06:13:38,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 172 letters. Loop has 6 letters. [2018-10-27 06:13:38,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:38,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 178 letters. Loop has 6 letters. [2018-10-27 06:13:38,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:38,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 40 transitions. Stem has 172 letters. Loop has 12 letters. [2018-10-27 06:13:38,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:13:38,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 186 transitions. [2018-10-27 06:13:38,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:13:38,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 0 states and 0 transitions. [2018-10-27 06:13:38,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:13:38,638 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:13:38,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:13:38,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:13:38,639 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:38,639 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:38,639 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:13:38,639 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-10-27 06:13:38,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:13:38,639 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:13:38,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:13:38,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:13:38 BoogieIcfgContainer [2018-10-27 06:13:38,652 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:13:38,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:13:38,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:13:38,652 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:13:38,653 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:12:58" (3/4) ... [2018-10-27 06:13:38,656 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:13:38,656 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:13:38,659 INFO L168 Benchmark]: Toolchain (without parser) took 41150.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.5 MB). Free memory was 961.8 MB in the beginning and 867.6 MB in the end (delta: 94.2 MB). Peak memory consumption was 364.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:38,660 INFO L168 Benchmark]: CDTParser took 0.57 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-10-27 06:13:38,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 201.79 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:38,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.61 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 948.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:38,663 INFO L168 Benchmark]: Boogie Preprocessor took 26.27 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:13:38,663 INFO L168 Benchmark]: RCFGBuilder took 656.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:38,663 INFO L168 Benchmark]: BuchiAutomizer took 40216.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.0 MB). Free memory was 1.1 GB in the beginning and 875.6 MB in the end (delta: 247.8 MB). Peak memory consumption was 366.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:13:38,664 INFO L168 Benchmark]: Witness Printer took 4.10 ms. Allocated memory is still 1.3 GB. Free memory is still 867.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:13:38,666 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.57 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 201.79 ms. Allocated memory is still 1.0 GB. Free memory was 961.8 MB in the beginning and 951.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 38.61 ms. Allocated memory is still 1.0 GB. Free memory was 951.1 MB in the beginning and 948.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 26.27 ms. Allocated memory is still 1.0 GB. Free memory is still 948.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 656.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40216.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 119.0 MB). Free memory was 1.1 GB in the beginning and 875.6 MB in the end (delta: 247.8 MB). Peak memory consumption was 366.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.10 ms. Allocated memory is still 1.3 GB. Free memory is still 867.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 24 terminating modules (21 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 19 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 17 and consists of 4 locations. 21 modules have a trivial ranking function, the largest among these consists of 25 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.1s and 25 iterations. TraceHistogramMax:11. Analysis of lassos took 36.8s. Construction of modules took 2.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 23. Automata minimization 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 373 StatesRemovedByMinimization, 20 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 185 states and ocurred in iteration 22. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1029 SDtfs, 1400 SDslu, 3928 SDs, 0 SdLazy, 1301 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU20 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1123 mio100 ax100 hnf99 lsp139 ukn59 mio100 lsp54 div96 bol100 ite100 ukn100 eq170 hnf84 smp87 dnf162 smp83 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 32 VariablesLoop: 4 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...