java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_partition_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 22:46:48,989 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 22:46:48,991 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 22:46:49,008 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 22:46:49,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 22:46:49,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 22:46:49,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 22:46:49,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 22:46:49,014 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 22:46:49,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 22:46:49,015 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 22:46:49,016 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 22:46:49,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 22:46:49,018 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 22:46:49,019 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 22:46:49,019 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 22:46:49,020 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 22:46:49,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 22:46:49,024 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 22:46:49,025 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 22:46:49,027 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 22:46:49,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 22:46:49,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 22:46:49,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 22:46:49,031 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 22:46:49,031 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 22:46:49,032 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 22:46:49,033 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 22:46:49,034 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 22:46:49,035 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 22:46:49,035 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 22:46:49,036 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 22:46:49,036 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 22:46:49,036 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 22:46:49,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 22:46:49,038 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 22:46:49,038 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 22:46:49,062 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 22:46:49,062 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 22:46:49,063 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 22:46:49,063 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 22:46:49,064 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 22:46:49,065 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 22:46:49,065 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 22:46:49,065 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 22:46:49,065 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 22:46:49,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 22:46:49,066 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 22:46:49,066 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 22:46:49,066 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 22:46:49,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 22:46:49,066 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 22:46:49,068 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 22:46:49,068 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 22:46:49,068 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 22:46:49,068 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 22:46:49,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 22:46:49,069 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 22:46:49,069 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 22:46:49,069 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 22:46:49,069 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:46:49,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 22:46:49,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 22:46:49,071 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 22:46:49,071 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 22:46:49,071 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 22:46:49,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 22:46:49,071 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 22:46:49,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 22:46:49,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 22:46:49,154 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 22:46:49,155 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 22:46:49,156 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 22:46:49,156 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_false-unreach-call_ground.i [2018-11-18 22:46:49,213 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb64c1fd/716725b5b9c54759842c1717cca9b56d/FLAG1a79fa15b [2018-11-18 22:46:49,662 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 22:46:49,663 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_false-unreach-call_ground.i [2018-11-18 22:46:49,669 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb64c1fd/716725b5b9c54759842c1717cca9b56d/FLAG1a79fa15b [2018-11-18 22:46:50,082 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bb64c1fd/716725b5b9c54759842c1717cca9b56d [2018-11-18 22:46:50,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 22:46:50,093 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 22:46:50,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 22:46:50,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 22:46:50,098 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 22:46:50,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:46:50" (1/1) ... [2018-11-18 22:46:50,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@232b35d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50, skipping insertion in model container [2018-11-18 22:46:50,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:46:50" (1/1) ... [2018-11-18 22:46:50,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 22:46:50,140 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 22:46:50,376 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:46:50,380 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 22:46:50,405 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 22:46:50,425 INFO L195 MainTranslator]: Completed translation [2018-11-18 22:46:50,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50 WrapperNode [2018-11-18 22:46:50,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 22:46:50,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 22:46:50,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 22:46:50,427 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 22:46:50,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50" (1/1) ... [2018-11-18 22:46:50,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50" (1/1) ... [2018-11-18 22:46:50,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50" (1/1) ... [2018-11-18 22:46:50,447 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50" (1/1) ... [2018-11-18 22:46:50,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50" (1/1) ... [2018-11-18 22:46:50,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50" (1/1) ... [2018-11-18 22:46:50,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50" (1/1) ... [2018-11-18 22:46:50,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 22:46:50,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 22:46:50,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 22:46:50,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 22:46:50,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 22:46:50,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 22:46:50,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 22:46:50,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 22:46:50,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 22:46:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 22:46:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 22:46:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 22:46:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 22:46:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 22:46:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 22:46:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 22:46:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 22:46:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 22:46:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 22:46:51,338 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 22:46:51,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:46:51 BoogieIcfgContainer [2018-11-18 22:46:51,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 22:46:51,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 22:46:51,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 22:46:51,344 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 22:46:51,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:46:50" (1/3) ... [2018-11-18 22:46:51,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9efc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:46:51, skipping insertion in model container [2018-11-18 22:46:51,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:46:50" (2/3) ... [2018-11-18 22:46:51,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c9efc34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:46:51, skipping insertion in model container [2018-11-18 22:46:51,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:46:51" (3/3) ... [2018-11-18 22:46:51,347 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_partition_false-unreach-call_ground.i [2018-11-18 22:46:51,356 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 22:46:51,365 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 22:46:51,383 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 22:46:51,425 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 22:46:51,426 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 22:46:51,426 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 22:46:51,426 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 22:46:51,426 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 22:46:51,427 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 22:46:51,427 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 22:46:51,427 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 22:46:51,427 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 22:46:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-18 22:46:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 22:46:51,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:51,453 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:51,456 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:51,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1664759166, now seen corresponding path program 1 times [2018-11-18 22:46:51,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:51,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:51,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:51,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:51,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:51,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-18 22:46:51,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41#true} is VALID [2018-11-18 22:46:51,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-18 22:46:51,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #95#return; {41#true} is VALID [2018-11-18 22:46:51,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2018-11-18 22:46:51,618 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {41#true} is VALID [2018-11-18 22:46:51,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#true} assume !true; {42#false} is VALID [2018-11-18 22:46:51,619 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#false} ~a~0 := 0; {42#false} is VALID [2018-11-18 22:46:51,619 INFO L273 TraceCheckUtils]: 8: Hoare triple {42#false} assume !true; {42#false} is VALID [2018-11-18 22:46:51,620 INFO L273 TraceCheckUtils]: 9: Hoare triple {42#false} havoc ~x~0;~x~0 := 0; {42#false} is VALID [2018-11-18 22:46:51,620 INFO L273 TraceCheckUtils]: 10: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-18 22:46:51,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {42#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {42#false} is VALID [2018-11-18 22:46:51,621 INFO L256 TraceCheckUtils]: 12: Hoare triple {42#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {42#false} is VALID [2018-11-18 22:46:51,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2018-11-18 22:46:51,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2018-11-18 22:46:51,622 INFO L273 TraceCheckUtils]: 15: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-18 22:46:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:46:51,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:46:51,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 22:46:51,633 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 22:46:51,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:51,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 22:46:51,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:51,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 22:46:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 22:46:51,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:46:51,856 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-18 22:46:52,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:52,026 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2018-11-18 22:46:52,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 22:46:52,026 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 22:46:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:46:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-18 22:46:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 22:46:52,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2018-11-18 22:46:52,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2018-11-18 22:46:52,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:52,350 INFO L225 Difference]: With dead ends: 66 [2018-11-18 22:46:52,350 INFO L226 Difference]: Without dead ends: 33 [2018-11-18 22:46:52,355 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 22:46:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-18 22:46:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-18 22:46:52,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:52,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-18 22:46:52,541 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-18 22:46:52,542 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-18 22:46:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:52,553 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-18 22:46:52,554 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-18 22:46:52,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:52,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:52,556 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-18 22:46:52,556 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-18 22:46:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:52,570 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-18 22:46:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-18 22:46:52,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:52,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:52,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:52,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 22:46:52,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-18 22:46:52,581 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 16 [2018-11-18 22:46:52,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:52,581 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-18 22:46:52,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 22:46:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-18 22:46:52,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 22:46:52,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:52,584 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:52,586 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:52,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:52,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1908524499, now seen corresponding path program 1 times [2018-11-18 22:46:52,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:52,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:52,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:52,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:52,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {238#true} is VALID [2018-11-18 22:46:52,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {238#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {238#true} is VALID [2018-11-18 22:46:52,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2018-11-18 22:46:52,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #95#return; {238#true} is VALID [2018-11-18 22:46:52,679 INFO L256 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret8 := main(); {238#true} is VALID [2018-11-18 22:46:52,695 INFO L273 TraceCheckUtils]: 5: Hoare triple {238#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {240#(= main_~a~0 0)} is VALID [2018-11-18 22:46:52,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {240#(= main_~a~0 0)} assume true; {240#(= main_~a~0 0)} is VALID [2018-11-18 22:46:52,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {240#(= main_~a~0 0)} assume !(~a~0 < 100000); {239#false} is VALID [2018-11-18 22:46:52,706 INFO L273 TraceCheckUtils]: 8: Hoare triple {239#false} ~a~0 := 0; {239#false} is VALID [2018-11-18 22:46:52,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {239#false} assume true; {239#false} is VALID [2018-11-18 22:46:52,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {239#false} assume !(~a~0 < 100000); {239#false} is VALID [2018-11-18 22:46:52,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {239#false} havoc ~x~0;~x~0 := 0; {239#false} is VALID [2018-11-18 22:46:52,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {239#false} assume true; {239#false} is VALID [2018-11-18 22:46:52,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {239#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {239#false} is VALID [2018-11-18 22:46:52,707 INFO L256 TraceCheckUtils]: 14: Hoare triple {239#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {239#false} is VALID [2018-11-18 22:46:52,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {239#false} ~cond := #in~cond; {239#false} is VALID [2018-11-18 22:46:52,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {239#false} assume 0 == ~cond; {239#false} is VALID [2018-11-18 22:46:52,710 INFO L273 TraceCheckUtils]: 17: Hoare triple {239#false} assume !false; {239#false} is VALID [2018-11-18 22:46:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 22:46:52,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 22:46:52,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 22:46:52,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 22:46:52,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:52,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 22:46:52,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:52,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 22:46:52,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 22:46:52,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:46:52,852 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-11-18 22:46:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:53,381 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-11-18 22:46:53,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 22:46:53,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 22:46:53,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:53,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:46:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-18 22:46:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 22:46:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-18 22:46:53,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-18 22:46:53,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:53,544 INFO L225 Difference]: With dead ends: 64 [2018-11-18 22:46:53,545 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 22:46:53,546 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 22:46:53,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 22:46:53,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-11-18 22:46:53,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:53,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 37 states. [2018-11-18 22:46:53,565 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 37 states. [2018-11-18 22:46:53,565 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 37 states. [2018-11-18 22:46:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:53,569 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-18 22:46:53,569 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-18 22:46:53,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:53,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:53,571 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 41 states. [2018-11-18 22:46:53,571 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 41 states. [2018-11-18 22:46:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:53,575 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-18 22:46:53,575 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-18 22:46:53,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:53,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:53,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:53,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 22:46:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-11-18 22:46:53,579 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 18 [2018-11-18 22:46:53,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:53,580 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-11-18 22:46:53,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 22:46:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-11-18 22:46:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 22:46:53,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:53,581 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:53,582 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:53,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:53,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2046552275, now seen corresponding path program 1 times [2018-11-18 22:46:53,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:53,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:53,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:53,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:53,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:53,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {458#true} is VALID [2018-11-18 22:46:53,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {458#true} is VALID [2018-11-18 22:46:53,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-18 22:46:53,715 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #95#return; {458#true} is VALID [2018-11-18 22:46:53,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret8 := main(); {458#true} is VALID [2018-11-18 22:46:53,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {458#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {460#(= main_~a~0 0)} is VALID [2018-11-18 22:46:53,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {460#(= main_~a~0 0)} assume true; {460#(= main_~a~0 0)} is VALID [2018-11-18 22:46:53,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {460#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {460#(= main_~a~0 0)} is VALID [2018-11-18 22:46:53,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {460#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {460#(= main_~a~0 0)} is VALID [2018-11-18 22:46:53,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {460#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {461#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:53,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {461#(<= main_~a~0 1)} assume true; {461#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:53,731 INFO L273 TraceCheckUtils]: 11: Hoare triple {461#(<= main_~a~0 1)} assume !(~a~0 < 100000); {459#false} is VALID [2018-11-18 22:46:53,731 INFO L273 TraceCheckUtils]: 12: Hoare triple {459#false} ~a~0 := 0; {459#false} is VALID [2018-11-18 22:46:53,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-18 22:46:53,732 INFO L273 TraceCheckUtils]: 14: Hoare triple {459#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {459#false} is VALID [2018-11-18 22:46:53,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {459#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {459#false} is VALID [2018-11-18 22:46:53,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {459#false} ~a~0 := 1 + ~a~0; {459#false} is VALID [2018-11-18 22:46:53,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-18 22:46:53,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {459#false} assume !(~a~0 < 100000); {459#false} is VALID [2018-11-18 22:46:53,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {459#false} havoc ~x~0;~x~0 := 0; {459#false} is VALID [2018-11-18 22:46:53,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-18 22:46:53,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {459#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {459#false} is VALID [2018-11-18 22:46:53,734 INFO L256 TraceCheckUtils]: 22: Hoare triple {459#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {459#false} is VALID [2018-11-18 22:46:53,735 INFO L273 TraceCheckUtils]: 23: Hoare triple {459#false} ~cond := #in~cond; {459#false} is VALID [2018-11-18 22:46:53,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {459#false} assume 0 == ~cond; {459#false} is VALID [2018-11-18 22:46:53,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {459#false} assume !false; {459#false} is VALID [2018-11-18 22:46:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:46:53,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:53,738 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:53,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:53,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:54,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {458#true} is VALID [2018-11-18 22:46:54,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {458#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {458#true} is VALID [2018-11-18 22:46:54,139 INFO L273 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2018-11-18 22:46:54,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #95#return; {458#true} is VALID [2018-11-18 22:46:54,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret8 := main(); {458#true} is VALID [2018-11-18 22:46:54,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {458#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {480#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:54,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {480#(<= main_~a~0 0)} assume true; {480#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:54,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {480#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {480#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:54,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {480#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {480#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:54,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {480#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {461#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:54,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {461#(<= main_~a~0 1)} assume true; {461#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:54,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {461#(<= main_~a~0 1)} assume !(~a~0 < 100000); {459#false} is VALID [2018-11-18 22:46:54,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {459#false} ~a~0 := 0; {459#false} is VALID [2018-11-18 22:46:54,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-18 22:46:54,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {459#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {459#false} is VALID [2018-11-18 22:46:54,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {459#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {459#false} is VALID [2018-11-18 22:46:54,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {459#false} ~a~0 := 1 + ~a~0; {459#false} is VALID [2018-11-18 22:46:54,154 INFO L273 TraceCheckUtils]: 17: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-18 22:46:54,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {459#false} assume !(~a~0 < 100000); {459#false} is VALID [2018-11-18 22:46:54,154 INFO L273 TraceCheckUtils]: 19: Hoare triple {459#false} havoc ~x~0;~x~0 := 0; {459#false} is VALID [2018-11-18 22:46:54,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {459#false} assume true; {459#false} is VALID [2018-11-18 22:46:54,155 INFO L273 TraceCheckUtils]: 21: Hoare triple {459#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {459#false} is VALID [2018-11-18 22:46:54,155 INFO L256 TraceCheckUtils]: 22: Hoare triple {459#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {459#false} is VALID [2018-11-18 22:46:54,156 INFO L273 TraceCheckUtils]: 23: Hoare triple {459#false} ~cond := #in~cond; {459#false} is VALID [2018-11-18 22:46:54,156 INFO L273 TraceCheckUtils]: 24: Hoare triple {459#false} assume 0 == ~cond; {459#false} is VALID [2018-11-18 22:46:54,156 INFO L273 TraceCheckUtils]: 25: Hoare triple {459#false} assume !false; {459#false} is VALID [2018-11-18 22:46:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 22:46:54,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:54,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-18 22:46:54,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-18 22:46:54,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:54,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 22:46:54,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:54,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 22:46:54,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 22:46:54,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:46:54,287 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 5 states. [2018-11-18 22:46:54,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:54,599 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-18 22:46:54,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 22:46:54,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-18 22:46:54,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:54,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:46:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2018-11-18 22:46:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 22:46:54,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2018-11-18 22:46:54,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2018-11-18 22:46:54,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:54,792 INFO L225 Difference]: With dead ends: 74 [2018-11-18 22:46:54,793 INFO L226 Difference]: Without dead ends: 49 [2018-11-18 22:46:54,793 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 22:46:54,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-18 22:46:54,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-18 22:46:54,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:54,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-18 22:46:54,815 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-18 22:46:54,815 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-18 22:46:54,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:54,820 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-18 22:46:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-18 22:46:54,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:54,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:54,822 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-18 22:46:54,822 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-18 22:46:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:54,825 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2018-11-18 22:46:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2018-11-18 22:46:54,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:54,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:54,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:54,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 22:46:54,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2018-11-18 22:46:54,830 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 26 [2018-11-18 22:46:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:54,830 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2018-11-18 22:46:54,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 22:46:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2018-11-18 22:46:54,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 22:46:54,832 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:54,832 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:54,832 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:54,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:54,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1733295661, now seen corresponding path program 2 times [2018-11-18 22:46:54,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:54,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:54,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:54,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:46:54,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:54,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {794#true} is VALID [2018-11-18 22:46:54,942 INFO L273 TraceCheckUtils]: 1: Hoare triple {794#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {794#true} is VALID [2018-11-18 22:46:54,943 INFO L273 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2018-11-18 22:46:54,943 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #95#return; {794#true} is VALID [2018-11-18 22:46:54,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret8 := main(); {794#true} is VALID [2018-11-18 22:46:54,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {794#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {796#(= main_~a~0 0)} is VALID [2018-11-18 22:46:54,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {796#(= main_~a~0 0)} assume true; {796#(= main_~a~0 0)} is VALID [2018-11-18 22:46:54,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {796#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {796#(= main_~a~0 0)} is VALID [2018-11-18 22:46:54,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {796#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {796#(= main_~a~0 0)} is VALID [2018-11-18 22:46:54,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {796#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {797#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:54,961 INFO L273 TraceCheckUtils]: 10: Hoare triple {797#(<= main_~a~0 1)} assume true; {797#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:54,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {797#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {797#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:54,963 INFO L273 TraceCheckUtils]: 12: Hoare triple {797#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {797#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:54,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {797#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {798#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:54,965 INFO L273 TraceCheckUtils]: 14: Hoare triple {798#(<= main_~a~0 2)} assume true; {798#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:54,967 INFO L273 TraceCheckUtils]: 15: Hoare triple {798#(<= main_~a~0 2)} assume !(~a~0 < 100000); {795#false} is VALID [2018-11-18 22:46:54,967 INFO L273 TraceCheckUtils]: 16: Hoare triple {795#false} ~a~0 := 0; {795#false} is VALID [2018-11-18 22:46:54,967 INFO L273 TraceCheckUtils]: 17: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-18 22:46:54,967 INFO L273 TraceCheckUtils]: 18: Hoare triple {795#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {795#false} is VALID [2018-11-18 22:46:54,968 INFO L273 TraceCheckUtils]: 19: Hoare triple {795#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {795#false} is VALID [2018-11-18 22:46:54,968 INFO L273 TraceCheckUtils]: 20: Hoare triple {795#false} ~a~0 := 1 + ~a~0; {795#false} is VALID [2018-11-18 22:46:54,968 INFO L273 TraceCheckUtils]: 21: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-18 22:46:54,969 INFO L273 TraceCheckUtils]: 22: Hoare triple {795#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {795#false} is VALID [2018-11-18 22:46:54,969 INFO L273 TraceCheckUtils]: 23: Hoare triple {795#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {795#false} is VALID [2018-11-18 22:46:54,969 INFO L273 TraceCheckUtils]: 24: Hoare triple {795#false} ~a~0 := 1 + ~a~0; {795#false} is VALID [2018-11-18 22:46:54,969 INFO L273 TraceCheckUtils]: 25: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-18 22:46:54,970 INFO L273 TraceCheckUtils]: 26: Hoare triple {795#false} assume !(~a~0 < 100000); {795#false} is VALID [2018-11-18 22:46:54,970 INFO L273 TraceCheckUtils]: 27: Hoare triple {795#false} havoc ~x~0;~x~0 := 0; {795#false} is VALID [2018-11-18 22:46:54,970 INFO L273 TraceCheckUtils]: 28: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-18 22:46:54,971 INFO L273 TraceCheckUtils]: 29: Hoare triple {795#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {795#false} is VALID [2018-11-18 22:46:54,971 INFO L256 TraceCheckUtils]: 30: Hoare triple {795#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {795#false} is VALID [2018-11-18 22:46:54,971 INFO L273 TraceCheckUtils]: 31: Hoare triple {795#false} ~cond := #in~cond; {795#false} is VALID [2018-11-18 22:46:54,971 INFO L273 TraceCheckUtils]: 32: Hoare triple {795#false} assume 0 == ~cond; {795#false} is VALID [2018-11-18 22:46:54,972 INFO L273 TraceCheckUtils]: 33: Hoare triple {795#false} assume !false; {795#false} is VALID [2018-11-18 22:46:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 22:46:54,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:54,974 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:54,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:46:55,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:46:55,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:55,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:55,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {794#true} call ULTIMATE.init(); {794#true} is VALID [2018-11-18 22:46:55,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {794#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {794#true} is VALID [2018-11-18 22:46:55,173 INFO L273 TraceCheckUtils]: 2: Hoare triple {794#true} assume true; {794#true} is VALID [2018-11-18 22:46:55,174 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {794#true} {794#true} #95#return; {794#true} is VALID [2018-11-18 22:46:55,174 INFO L256 TraceCheckUtils]: 4: Hoare triple {794#true} call #t~ret8 := main(); {794#true} is VALID [2018-11-18 22:46:55,188 INFO L273 TraceCheckUtils]: 5: Hoare triple {794#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {817#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:55,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {817#(<= main_~a~0 0)} assume true; {817#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:55,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {817#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {817#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:55,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {817#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {817#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:55,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {817#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {797#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:55,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {797#(<= main_~a~0 1)} assume true; {797#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:55,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {797#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {797#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:55,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {797#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {797#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:55,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {797#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {798#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:55,206 INFO L273 TraceCheckUtils]: 14: Hoare triple {798#(<= main_~a~0 2)} assume true; {798#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:55,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {798#(<= main_~a~0 2)} assume !(~a~0 < 100000); {795#false} is VALID [2018-11-18 22:46:55,208 INFO L273 TraceCheckUtils]: 16: Hoare triple {795#false} ~a~0 := 0; {795#false} is VALID [2018-11-18 22:46:55,208 INFO L273 TraceCheckUtils]: 17: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-18 22:46:55,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {795#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {795#false} is VALID [2018-11-18 22:46:55,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {795#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {795#false} is VALID [2018-11-18 22:46:55,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {795#false} ~a~0 := 1 + ~a~0; {795#false} is VALID [2018-11-18 22:46:55,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-18 22:46:55,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {795#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {795#false} is VALID [2018-11-18 22:46:55,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {795#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {795#false} is VALID [2018-11-18 22:46:55,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {795#false} ~a~0 := 1 + ~a~0; {795#false} is VALID [2018-11-18 22:46:55,211 INFO L273 TraceCheckUtils]: 25: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-18 22:46:55,211 INFO L273 TraceCheckUtils]: 26: Hoare triple {795#false} assume !(~a~0 < 100000); {795#false} is VALID [2018-11-18 22:46:55,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {795#false} havoc ~x~0;~x~0 := 0; {795#false} is VALID [2018-11-18 22:46:55,212 INFO L273 TraceCheckUtils]: 28: Hoare triple {795#false} assume true; {795#false} is VALID [2018-11-18 22:46:55,212 INFO L273 TraceCheckUtils]: 29: Hoare triple {795#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {795#false} is VALID [2018-11-18 22:46:55,212 INFO L256 TraceCheckUtils]: 30: Hoare triple {795#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {795#false} is VALID [2018-11-18 22:46:55,213 INFO L273 TraceCheckUtils]: 31: Hoare triple {795#false} ~cond := #in~cond; {795#false} is VALID [2018-11-18 22:46:55,213 INFO L273 TraceCheckUtils]: 32: Hoare triple {795#false} assume 0 == ~cond; {795#false} is VALID [2018-11-18 22:46:55,213 INFO L273 TraceCheckUtils]: 33: Hoare triple {795#false} assume !false; {795#false} is VALID [2018-11-18 22:46:55,216 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 22:46:55,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:55,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-18 22:46:55,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-18 22:46:55,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:55,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 22:46:55,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:55,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 22:46:55,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 22:46:55,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:46:55,291 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand 6 states. [2018-11-18 22:46:55,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:55,599 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2018-11-18 22:46:55,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 22:46:55,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-11-18 22:46:55,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:55,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:46:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2018-11-18 22:46:55,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 22:46:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2018-11-18 22:46:55,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 98 transitions. [2018-11-18 22:46:55,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:55,893 INFO L225 Difference]: With dead ends: 86 [2018-11-18 22:46:55,894 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 22:46:55,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 22:46:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 22:46:55,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2018-11-18 22:46:55,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:55,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 53 states. [2018-11-18 22:46:55,935 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 53 states. [2018-11-18 22:46:55,936 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 53 states. [2018-11-18 22:46:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:55,939 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-18 22:46:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-18 22:46:55,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:55,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:55,941 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 57 states. [2018-11-18 22:46:55,941 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 57 states. [2018-11-18 22:46:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:55,944 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2018-11-18 22:46:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2018-11-18 22:46:55,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:55,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:55,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:55,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:55,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-18 22:46:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-11-18 22:46:55,948 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 34 [2018-11-18 22:46:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:55,949 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-11-18 22:46:55,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 22:46:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-11-18 22:46:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-18 22:46:55,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:55,950 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:55,951 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:55,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:55,951 INFO L82 PathProgramCache]: Analyzing trace with hash 203231443, now seen corresponding path program 3 times [2018-11-18 22:46:55,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:55,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:55,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:55,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:55,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:56,089 INFO L256 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2018-11-18 22:46:56,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {1196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1196#true} is VALID [2018-11-18 22:46:56,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-18 22:46:56,091 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #95#return; {1196#true} is VALID [2018-11-18 22:46:56,091 INFO L256 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret8 := main(); {1196#true} is VALID [2018-11-18 22:46:56,092 INFO L273 TraceCheckUtils]: 5: Hoare triple {1196#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {1198#(= main_~a~0 0)} is VALID [2018-11-18 22:46:56,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {1198#(= main_~a~0 0)} assume true; {1198#(= main_~a~0 0)} is VALID [2018-11-18 22:46:56,095 INFO L273 TraceCheckUtils]: 7: Hoare triple {1198#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1198#(= main_~a~0 0)} is VALID [2018-11-18 22:46:56,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {1198#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1198#(= main_~a~0 0)} is VALID [2018-11-18 22:46:56,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {1198#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {1199#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:56,100 INFO L273 TraceCheckUtils]: 10: Hoare triple {1199#(<= main_~a~0 1)} assume true; {1199#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:56,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {1199#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1199#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:56,101 INFO L273 TraceCheckUtils]: 12: Hoare triple {1199#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1199#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:56,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {1199#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {1200#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:56,102 INFO L273 TraceCheckUtils]: 14: Hoare triple {1200#(<= main_~a~0 2)} assume true; {1200#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:56,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {1200#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1200#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:56,102 INFO L273 TraceCheckUtils]: 16: Hoare triple {1200#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1200#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:56,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {1200#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {1201#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:56,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {1201#(<= main_~a~0 3)} assume true; {1201#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:56,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {1201#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1197#false} is VALID [2018-11-18 22:46:56,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {1197#false} ~a~0 := 0; {1197#false} is VALID [2018-11-18 22:46:56,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-18 22:46:56,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {1197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1197#false} is VALID [2018-11-18 22:46:56,108 INFO L273 TraceCheckUtils]: 23: Hoare triple {1197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1197#false} is VALID [2018-11-18 22:46:56,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {1197#false} ~a~0 := 1 + ~a~0; {1197#false} is VALID [2018-11-18 22:46:56,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-18 22:46:56,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {1197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1197#false} is VALID [2018-11-18 22:46:56,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {1197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1197#false} is VALID [2018-11-18 22:46:56,109 INFO L273 TraceCheckUtils]: 28: Hoare triple {1197#false} ~a~0 := 1 + ~a~0; {1197#false} is VALID [2018-11-18 22:46:56,109 INFO L273 TraceCheckUtils]: 29: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-18 22:46:56,109 INFO L273 TraceCheckUtils]: 30: Hoare triple {1197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1197#false} is VALID [2018-11-18 22:46:56,109 INFO L273 TraceCheckUtils]: 31: Hoare triple {1197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1197#false} is VALID [2018-11-18 22:46:56,110 INFO L273 TraceCheckUtils]: 32: Hoare triple {1197#false} ~a~0 := 1 + ~a~0; {1197#false} is VALID [2018-11-18 22:46:56,110 INFO L273 TraceCheckUtils]: 33: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-18 22:46:56,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {1197#false} assume !(~a~0 < 100000); {1197#false} is VALID [2018-11-18 22:46:56,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {1197#false} havoc ~x~0;~x~0 := 0; {1197#false} is VALID [2018-11-18 22:46:56,110 INFO L273 TraceCheckUtils]: 36: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-18 22:46:56,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {1197#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {1197#false} is VALID [2018-11-18 22:46:56,111 INFO L256 TraceCheckUtils]: 38: Hoare triple {1197#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {1197#false} is VALID [2018-11-18 22:46:56,111 INFO L273 TraceCheckUtils]: 39: Hoare triple {1197#false} ~cond := #in~cond; {1197#false} is VALID [2018-11-18 22:46:56,112 INFO L273 TraceCheckUtils]: 40: Hoare triple {1197#false} assume 0 == ~cond; {1197#false} is VALID [2018-11-18 22:46:56,112 INFO L273 TraceCheckUtils]: 41: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2018-11-18 22:46:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 22:46:56,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:56,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:56,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:46:56,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 22:46:56,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:56,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:56,288 INFO L256 TraceCheckUtils]: 0: Hoare triple {1196#true} call ULTIMATE.init(); {1196#true} is VALID [2018-11-18 22:46:56,288 INFO L273 TraceCheckUtils]: 1: Hoare triple {1196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1196#true} is VALID [2018-11-18 22:46:56,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-18 22:46:56,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1196#true} {1196#true} #95#return; {1196#true} is VALID [2018-11-18 22:46:56,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {1196#true} call #t~ret8 := main(); {1196#true} is VALID [2018-11-18 22:46:56,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {1196#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {1196#true} is VALID [2018-11-18 22:46:56,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-18 22:46:56,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {1196#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1196#true} is VALID [2018-11-18 22:46:56,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {1196#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1196#true} is VALID [2018-11-18 22:46:56,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {1196#true} ~a~0 := 1 + ~a~0; {1196#true} is VALID [2018-11-18 22:46:56,291 INFO L273 TraceCheckUtils]: 10: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-18 22:46:56,292 INFO L273 TraceCheckUtils]: 11: Hoare triple {1196#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1196#true} is VALID [2018-11-18 22:46:56,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {1196#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1196#true} is VALID [2018-11-18 22:46:56,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {1196#true} ~a~0 := 1 + ~a~0; {1196#true} is VALID [2018-11-18 22:46:56,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-18 22:46:56,293 INFO L273 TraceCheckUtils]: 15: Hoare triple {1196#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1196#true} is VALID [2018-11-18 22:46:56,293 INFO L273 TraceCheckUtils]: 16: Hoare triple {1196#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1196#true} is VALID [2018-11-18 22:46:56,294 INFO L273 TraceCheckUtils]: 17: Hoare triple {1196#true} ~a~0 := 1 + ~a~0; {1196#true} is VALID [2018-11-18 22:46:56,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {1196#true} assume true; {1196#true} is VALID [2018-11-18 22:46:56,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {1196#true} assume !(~a~0 < 100000); {1196#true} is VALID [2018-11-18 22:46:56,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {1196#true} ~a~0 := 0; {1265#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:56,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {1265#(<= main_~a~0 0)} assume true; {1265#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:56,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {1265#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1265#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:56,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {1265#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1265#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:56,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {1265#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {1199#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:56,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {1199#(<= main_~a~0 1)} assume true; {1199#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:56,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {1199#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1199#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:56,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {1199#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1199#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:56,307 INFO L273 TraceCheckUtils]: 28: Hoare triple {1199#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {1200#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:56,307 INFO L273 TraceCheckUtils]: 29: Hoare triple {1200#(<= main_~a~0 2)} assume true; {1200#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:56,309 INFO L273 TraceCheckUtils]: 30: Hoare triple {1200#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1200#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:56,309 INFO L273 TraceCheckUtils]: 31: Hoare triple {1200#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1200#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:56,311 INFO L273 TraceCheckUtils]: 32: Hoare triple {1200#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {1201#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:56,311 INFO L273 TraceCheckUtils]: 33: Hoare triple {1201#(<= main_~a~0 3)} assume true; {1201#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:56,312 INFO L273 TraceCheckUtils]: 34: Hoare triple {1201#(<= main_~a~0 3)} assume !(~a~0 < 100000); {1197#false} is VALID [2018-11-18 22:46:56,312 INFO L273 TraceCheckUtils]: 35: Hoare triple {1197#false} havoc ~x~0;~x~0 := 0; {1197#false} is VALID [2018-11-18 22:46:56,312 INFO L273 TraceCheckUtils]: 36: Hoare triple {1197#false} assume true; {1197#false} is VALID [2018-11-18 22:46:56,313 INFO L273 TraceCheckUtils]: 37: Hoare triple {1197#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {1197#false} is VALID [2018-11-18 22:46:56,313 INFO L256 TraceCheckUtils]: 38: Hoare triple {1197#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {1197#false} is VALID [2018-11-18 22:46:56,314 INFO L273 TraceCheckUtils]: 39: Hoare triple {1197#false} ~cond := #in~cond; {1197#false} is VALID [2018-11-18 22:46:56,314 INFO L273 TraceCheckUtils]: 40: Hoare triple {1197#false} assume 0 == ~cond; {1197#false} is VALID [2018-11-18 22:46:56,314 INFO L273 TraceCheckUtils]: 41: Hoare triple {1197#false} assume !false; {1197#false} is VALID [2018-11-18 22:46:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 22:46:56,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:56,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-18 22:46:56,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-18 22:46:56,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:56,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 22:46:56,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:56,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 22:46:56,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 22:46:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:46:56,421 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 7 states. [2018-11-18 22:46:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:56,740 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-11-18 22:46:56,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 22:46:56,740 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-11-18 22:46:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:56,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:46:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2018-11-18 22:46:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 22:46:56,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2018-11-18 22:46:56,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 108 transitions. [2018-11-18 22:46:56,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:56,878 INFO L225 Difference]: With dead ends: 98 [2018-11-18 22:46:56,878 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 22:46:56,879 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 22:46:56,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 22:46:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-11-18 22:46:56,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:56,933 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 61 states. [2018-11-18 22:46:56,933 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 61 states. [2018-11-18 22:46:56,933 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 61 states. [2018-11-18 22:46:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:56,937 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-18 22:46:56,937 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2018-11-18 22:46:56,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:56,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:56,938 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 65 states. [2018-11-18 22:46:56,938 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 65 states. [2018-11-18 22:46:56,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:56,941 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2018-11-18 22:46:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2018-11-18 22:46:56,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:56,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:56,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:56,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 22:46:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2018-11-18 22:46:56,946 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 42 [2018-11-18 22:46:56,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:56,946 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2018-11-18 22:46:56,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 22:46:56,946 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2018-11-18 22:46:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 22:46:56,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:56,948 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:56,948 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:56,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:56,949 INFO L82 PathProgramCache]: Analyzing trace with hash 285349331, now seen corresponding path program 4 times [2018-11-18 22:46:56,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:56,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:56,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:56,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:57,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2018-11-18 22:46:57,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {1664#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1664#true} is VALID [2018-11-18 22:46:57,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2018-11-18 22:46:57,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #95#return; {1664#true} is VALID [2018-11-18 22:46:57,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret8 := main(); {1664#true} is VALID [2018-11-18 22:46:57,111 INFO L273 TraceCheckUtils]: 5: Hoare triple {1664#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {1666#(= main_~a~0 0)} is VALID [2018-11-18 22:46:57,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {1666#(= main_~a~0 0)} assume true; {1666#(= main_~a~0 0)} is VALID [2018-11-18 22:46:57,112 INFO L273 TraceCheckUtils]: 7: Hoare triple {1666#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1666#(= main_~a~0 0)} is VALID [2018-11-18 22:46:57,113 INFO L273 TraceCheckUtils]: 8: Hoare triple {1666#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1666#(= main_~a~0 0)} is VALID [2018-11-18 22:46:57,113 INFO L273 TraceCheckUtils]: 9: Hoare triple {1666#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {1667#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:57,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {1667#(<= main_~a~0 1)} assume true; {1667#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:57,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {1667#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1667#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:57,114 INFO L273 TraceCheckUtils]: 12: Hoare triple {1667#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1667#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:57,115 INFO L273 TraceCheckUtils]: 13: Hoare triple {1667#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {1668#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:57,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {1668#(<= main_~a~0 2)} assume true; {1668#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:57,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {1668#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1668#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:57,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1668#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:57,124 INFO L273 TraceCheckUtils]: 17: Hoare triple {1668#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {1669#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:57,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(<= main_~a~0 3)} assume true; {1669#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:57,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {1669#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1669#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:57,129 INFO L273 TraceCheckUtils]: 20: Hoare triple {1669#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1669#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:57,130 INFO L273 TraceCheckUtils]: 21: Hoare triple {1669#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {1670#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:57,131 INFO L273 TraceCheckUtils]: 22: Hoare triple {1670#(<= main_~a~0 4)} assume true; {1670#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:57,131 INFO L273 TraceCheckUtils]: 23: Hoare triple {1670#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1665#false} is VALID [2018-11-18 22:46:57,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {1665#false} ~a~0 := 0; {1665#false} is VALID [2018-11-18 22:46:57,132 INFO L273 TraceCheckUtils]: 25: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1665#false} is VALID [2018-11-18 22:46:57,132 INFO L273 TraceCheckUtils]: 27: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1665#false} is VALID [2018-11-18 22:46:57,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {1665#false} ~a~0 := 1 + ~a~0; {1665#false} is VALID [2018-11-18 22:46:57,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,133 INFO L273 TraceCheckUtils]: 30: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1665#false} is VALID [2018-11-18 22:46:57,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1665#false} is VALID [2018-11-18 22:46:57,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {1665#false} ~a~0 := 1 + ~a~0; {1665#false} is VALID [2018-11-18 22:46:57,134 INFO L273 TraceCheckUtils]: 33: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1665#false} is VALID [2018-11-18 22:46:57,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1665#false} is VALID [2018-11-18 22:46:57,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {1665#false} ~a~0 := 1 + ~a~0; {1665#false} is VALID [2018-11-18 22:46:57,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,135 INFO L273 TraceCheckUtils]: 38: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1665#false} is VALID [2018-11-18 22:46:57,135 INFO L273 TraceCheckUtils]: 39: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1665#false} is VALID [2018-11-18 22:46:57,135 INFO L273 TraceCheckUtils]: 40: Hoare triple {1665#false} ~a~0 := 1 + ~a~0; {1665#false} is VALID [2018-11-18 22:46:57,135 INFO L273 TraceCheckUtils]: 41: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,136 INFO L273 TraceCheckUtils]: 42: Hoare triple {1665#false} assume !(~a~0 < 100000); {1665#false} is VALID [2018-11-18 22:46:57,136 INFO L273 TraceCheckUtils]: 43: Hoare triple {1665#false} havoc ~x~0;~x~0 := 0; {1665#false} is VALID [2018-11-18 22:46:57,136 INFO L273 TraceCheckUtils]: 44: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,136 INFO L273 TraceCheckUtils]: 45: Hoare triple {1665#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {1665#false} is VALID [2018-11-18 22:46:57,136 INFO L256 TraceCheckUtils]: 46: Hoare triple {1665#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {1665#false} is VALID [2018-11-18 22:46:57,137 INFO L273 TraceCheckUtils]: 47: Hoare triple {1665#false} ~cond := #in~cond; {1665#false} is VALID [2018-11-18 22:46:57,137 INFO L273 TraceCheckUtils]: 48: Hoare triple {1665#false} assume 0 == ~cond; {1665#false} is VALID [2018-11-18 22:46:57,137 INFO L273 TraceCheckUtils]: 49: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2018-11-18 22:46:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 22:46:57,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:57,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:57,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:46:57,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:46:57,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:57,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:57,525 INFO L256 TraceCheckUtils]: 0: Hoare triple {1664#true} call ULTIMATE.init(); {1664#true} is VALID [2018-11-18 22:46:57,526 INFO L273 TraceCheckUtils]: 1: Hoare triple {1664#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1664#true} is VALID [2018-11-18 22:46:57,526 INFO L273 TraceCheckUtils]: 2: Hoare triple {1664#true} assume true; {1664#true} is VALID [2018-11-18 22:46:57,526 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1664#true} {1664#true} #95#return; {1664#true} is VALID [2018-11-18 22:46:57,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {1664#true} call #t~ret8 := main(); {1664#true} is VALID [2018-11-18 22:46:57,527 INFO L273 TraceCheckUtils]: 5: Hoare triple {1664#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {1689#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:57,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {1689#(<= main_~a~0 0)} assume true; {1689#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:57,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {1689#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1689#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:57,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {1689#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1689#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:57,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {1689#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {1667#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:57,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {1667#(<= main_~a~0 1)} assume true; {1667#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:57,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {1667#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1667#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:57,531 INFO L273 TraceCheckUtils]: 12: Hoare triple {1667#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1667#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:57,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {1667#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {1668#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:57,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {1668#(<= main_~a~0 2)} assume true; {1668#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:57,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {1668#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1668#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:57,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {1668#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1668#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:57,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {1668#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {1669#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:57,535 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(<= main_~a~0 3)} assume true; {1669#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:57,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {1669#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1669#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:57,536 INFO L273 TraceCheckUtils]: 20: Hoare triple {1669#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {1669#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:57,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {1669#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {1670#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:57,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {1670#(<= main_~a~0 4)} assume true; {1670#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:57,538 INFO L273 TraceCheckUtils]: 23: Hoare triple {1670#(<= main_~a~0 4)} assume !(~a~0 < 100000); {1665#false} is VALID [2018-11-18 22:46:57,539 INFO L273 TraceCheckUtils]: 24: Hoare triple {1665#false} ~a~0 := 0; {1665#false} is VALID [2018-11-18 22:46:57,539 INFO L273 TraceCheckUtils]: 25: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,539 INFO L273 TraceCheckUtils]: 26: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1665#false} is VALID [2018-11-18 22:46:57,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1665#false} is VALID [2018-11-18 22:46:57,540 INFO L273 TraceCheckUtils]: 28: Hoare triple {1665#false} ~a~0 := 1 + ~a~0; {1665#false} is VALID [2018-11-18 22:46:57,540 INFO L273 TraceCheckUtils]: 29: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,540 INFO L273 TraceCheckUtils]: 30: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1665#false} is VALID [2018-11-18 22:46:57,540 INFO L273 TraceCheckUtils]: 31: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1665#false} is VALID [2018-11-18 22:46:57,541 INFO L273 TraceCheckUtils]: 32: Hoare triple {1665#false} ~a~0 := 1 + ~a~0; {1665#false} is VALID [2018-11-18 22:46:57,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,541 INFO L273 TraceCheckUtils]: 34: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1665#false} is VALID [2018-11-18 22:46:57,541 INFO L273 TraceCheckUtils]: 35: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1665#false} is VALID [2018-11-18 22:46:57,541 INFO L273 TraceCheckUtils]: 36: Hoare triple {1665#false} ~a~0 := 1 + ~a~0; {1665#false} is VALID [2018-11-18 22:46:57,542 INFO L273 TraceCheckUtils]: 37: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,542 INFO L273 TraceCheckUtils]: 38: Hoare triple {1665#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {1665#false} is VALID [2018-11-18 22:46:57,542 INFO L273 TraceCheckUtils]: 39: Hoare triple {1665#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {1665#false} is VALID [2018-11-18 22:46:57,542 INFO L273 TraceCheckUtils]: 40: Hoare triple {1665#false} ~a~0 := 1 + ~a~0; {1665#false} is VALID [2018-11-18 22:46:57,543 INFO L273 TraceCheckUtils]: 41: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,543 INFO L273 TraceCheckUtils]: 42: Hoare triple {1665#false} assume !(~a~0 < 100000); {1665#false} is VALID [2018-11-18 22:46:57,543 INFO L273 TraceCheckUtils]: 43: Hoare triple {1665#false} havoc ~x~0;~x~0 := 0; {1665#false} is VALID [2018-11-18 22:46:57,543 INFO L273 TraceCheckUtils]: 44: Hoare triple {1665#false} assume true; {1665#false} is VALID [2018-11-18 22:46:57,543 INFO L273 TraceCheckUtils]: 45: Hoare triple {1665#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {1665#false} is VALID [2018-11-18 22:46:57,543 INFO L256 TraceCheckUtils]: 46: Hoare triple {1665#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {1665#false} is VALID [2018-11-18 22:46:57,544 INFO L273 TraceCheckUtils]: 47: Hoare triple {1665#false} ~cond := #in~cond; {1665#false} is VALID [2018-11-18 22:46:57,544 INFO L273 TraceCheckUtils]: 48: Hoare triple {1665#false} assume 0 == ~cond; {1665#false} is VALID [2018-11-18 22:46:57,544 INFO L273 TraceCheckUtils]: 49: Hoare triple {1665#false} assume !false; {1665#false} is VALID [2018-11-18 22:46:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-18 22:46:57,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:57,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-18 22:46:57,566 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-18 22:46:57,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:57,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 22:46:57,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:57,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 22:46:57,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 22:46:57,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:46:57,638 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand 8 states. [2018-11-18 22:46:58,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:58,066 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2018-11-18 22:46:58,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 22:46:58,066 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-18 22:46:58,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:58,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:46:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2018-11-18 22:46:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 22:46:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2018-11-18 22:46:58,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 118 transitions. [2018-11-18 22:46:58,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:58,222 INFO L225 Difference]: With dead ends: 110 [2018-11-18 22:46:58,222 INFO L226 Difference]: Without dead ends: 73 [2018-11-18 22:46:58,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 22:46:58,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-18 22:46:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-11-18 22:46:58,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:58,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 69 states. [2018-11-18 22:46:58,254 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 69 states. [2018-11-18 22:46:58,254 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 69 states. [2018-11-18 22:46:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:58,258 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-18 22:46:58,258 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-18 22:46:58,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:58,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:58,259 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 73 states. [2018-11-18 22:46:58,259 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 73 states. [2018-11-18 22:46:58,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:58,262 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2018-11-18 22:46:58,262 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2018-11-18 22:46:58,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:58,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:58,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:58,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:58,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-18 22:46:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-11-18 22:46:58,266 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 50 [2018-11-18 22:46:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:58,266 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-11-18 22:46:58,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 22:46:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-11-18 22:46:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-18 22:46:58,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:58,268 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:58,268 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:58,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:58,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1566699309, now seen corresponding path program 5 times [2018-11-18 22:46:58,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:58,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:58,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:58,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:58,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:58,471 INFO L256 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2198#true} is VALID [2018-11-18 22:46:58,471 INFO L273 TraceCheckUtils]: 1: Hoare triple {2198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2198#true} is VALID [2018-11-18 22:46:58,471 INFO L273 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-18 22:46:58,472 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #95#return; {2198#true} is VALID [2018-11-18 22:46:58,472 INFO L256 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret8 := main(); {2198#true} is VALID [2018-11-18 22:46:58,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {2198#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {2200#(= main_~a~0 0)} is VALID [2018-11-18 22:46:58,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {2200#(= main_~a~0 0)} assume true; {2200#(= main_~a~0 0)} is VALID [2018-11-18 22:46:58,473 INFO L273 TraceCheckUtils]: 7: Hoare triple {2200#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2200#(= main_~a~0 0)} is VALID [2018-11-18 22:46:58,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {2200#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2200#(= main_~a~0 0)} is VALID [2018-11-18 22:46:58,474 INFO L273 TraceCheckUtils]: 9: Hoare triple {2200#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {2201#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:58,475 INFO L273 TraceCheckUtils]: 10: Hoare triple {2201#(<= main_~a~0 1)} assume true; {2201#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:58,475 INFO L273 TraceCheckUtils]: 11: Hoare triple {2201#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2201#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:58,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {2201#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2201#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:58,477 INFO L273 TraceCheckUtils]: 13: Hoare triple {2201#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {2202#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:58,477 INFO L273 TraceCheckUtils]: 14: Hoare triple {2202#(<= main_~a~0 2)} assume true; {2202#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:58,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {2202#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2202#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:58,478 INFO L273 TraceCheckUtils]: 16: Hoare triple {2202#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2202#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:58,484 INFO L273 TraceCheckUtils]: 17: Hoare triple {2202#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {2203#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:58,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {2203#(<= main_~a~0 3)} assume true; {2203#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:58,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {2203#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2203#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:58,488 INFO L273 TraceCheckUtils]: 20: Hoare triple {2203#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2203#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:58,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {2203#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {2204#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:58,489 INFO L273 TraceCheckUtils]: 22: Hoare triple {2204#(<= main_~a~0 4)} assume true; {2204#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:58,489 INFO L273 TraceCheckUtils]: 23: Hoare triple {2204#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2204#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:58,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {2204#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2204#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:58,490 INFO L273 TraceCheckUtils]: 25: Hoare triple {2204#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {2205#(<= main_~a~0 5)} is VALID [2018-11-18 22:46:58,490 INFO L273 TraceCheckUtils]: 26: Hoare triple {2205#(<= main_~a~0 5)} assume true; {2205#(<= main_~a~0 5)} is VALID [2018-11-18 22:46:58,491 INFO L273 TraceCheckUtils]: 27: Hoare triple {2205#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2199#false} is VALID [2018-11-18 22:46:58,491 INFO L273 TraceCheckUtils]: 28: Hoare triple {2199#false} ~a~0 := 0; {2199#false} is VALID [2018-11-18 22:46:58,491 INFO L273 TraceCheckUtils]: 29: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-18 22:46:58,492 INFO L273 TraceCheckUtils]: 30: Hoare triple {2199#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2199#false} is VALID [2018-11-18 22:46:58,492 INFO L273 TraceCheckUtils]: 31: Hoare triple {2199#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2199#false} is VALID [2018-11-18 22:46:58,492 INFO L273 TraceCheckUtils]: 32: Hoare triple {2199#false} ~a~0 := 1 + ~a~0; {2199#false} is VALID [2018-11-18 22:46:58,493 INFO L273 TraceCheckUtils]: 33: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-18 22:46:58,493 INFO L273 TraceCheckUtils]: 34: Hoare triple {2199#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2199#false} is VALID [2018-11-18 22:46:58,493 INFO L273 TraceCheckUtils]: 35: Hoare triple {2199#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2199#false} is VALID [2018-11-18 22:46:58,493 INFO L273 TraceCheckUtils]: 36: Hoare triple {2199#false} ~a~0 := 1 + ~a~0; {2199#false} is VALID [2018-11-18 22:46:58,494 INFO L273 TraceCheckUtils]: 37: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-18 22:46:58,494 INFO L273 TraceCheckUtils]: 38: Hoare triple {2199#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2199#false} is VALID [2018-11-18 22:46:58,494 INFO L273 TraceCheckUtils]: 39: Hoare triple {2199#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2199#false} is VALID [2018-11-18 22:46:58,495 INFO L273 TraceCheckUtils]: 40: Hoare triple {2199#false} ~a~0 := 1 + ~a~0; {2199#false} is VALID [2018-11-18 22:46:58,495 INFO L273 TraceCheckUtils]: 41: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-18 22:46:58,495 INFO L273 TraceCheckUtils]: 42: Hoare triple {2199#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2199#false} is VALID [2018-11-18 22:46:58,495 INFO L273 TraceCheckUtils]: 43: Hoare triple {2199#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2199#false} is VALID [2018-11-18 22:46:58,496 INFO L273 TraceCheckUtils]: 44: Hoare triple {2199#false} ~a~0 := 1 + ~a~0; {2199#false} is VALID [2018-11-18 22:46:58,496 INFO L273 TraceCheckUtils]: 45: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-18 22:46:58,496 INFO L273 TraceCheckUtils]: 46: Hoare triple {2199#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2199#false} is VALID [2018-11-18 22:46:58,497 INFO L273 TraceCheckUtils]: 47: Hoare triple {2199#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2199#false} is VALID [2018-11-18 22:46:58,497 INFO L273 TraceCheckUtils]: 48: Hoare triple {2199#false} ~a~0 := 1 + ~a~0; {2199#false} is VALID [2018-11-18 22:46:58,497 INFO L273 TraceCheckUtils]: 49: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-18 22:46:58,497 INFO L273 TraceCheckUtils]: 50: Hoare triple {2199#false} assume !(~a~0 < 100000); {2199#false} is VALID [2018-11-18 22:46:58,498 INFO L273 TraceCheckUtils]: 51: Hoare triple {2199#false} havoc ~x~0;~x~0 := 0; {2199#false} is VALID [2018-11-18 22:46:58,498 INFO L273 TraceCheckUtils]: 52: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-18 22:46:58,498 INFO L273 TraceCheckUtils]: 53: Hoare triple {2199#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {2199#false} is VALID [2018-11-18 22:46:58,498 INFO L256 TraceCheckUtils]: 54: Hoare triple {2199#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {2199#false} is VALID [2018-11-18 22:46:58,499 INFO L273 TraceCheckUtils]: 55: Hoare triple {2199#false} ~cond := #in~cond; {2199#false} is VALID [2018-11-18 22:46:58,499 INFO L273 TraceCheckUtils]: 56: Hoare triple {2199#false} assume 0 == ~cond; {2199#false} is VALID [2018-11-18 22:46:58,499 INFO L273 TraceCheckUtils]: 57: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2018-11-18 22:46:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-18 22:46:58,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:46:58,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:46:58,533 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:46:58,722 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-18 22:46:58,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:46:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:46:58,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:46:58,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {2198#true} call ULTIMATE.init(); {2198#true} is VALID [2018-11-18 22:46:58,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {2198#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2198#true} is VALID [2018-11-18 22:46:58,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-18 22:46:58,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2198#true} {2198#true} #95#return; {2198#true} is VALID [2018-11-18 22:46:58,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {2198#true} call #t~ret8 := main(); {2198#true} is VALID [2018-11-18 22:46:58,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {2198#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {2198#true} is VALID [2018-11-18 22:46:58,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-18 22:46:58,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {2198#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2198#true} is VALID [2018-11-18 22:46:58,900 INFO L273 TraceCheckUtils]: 8: Hoare triple {2198#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2198#true} is VALID [2018-11-18 22:46:58,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {2198#true} ~a~0 := 1 + ~a~0; {2198#true} is VALID [2018-11-18 22:46:58,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-18 22:46:58,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {2198#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2198#true} is VALID [2018-11-18 22:46:58,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {2198#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2198#true} is VALID [2018-11-18 22:46:58,900 INFO L273 TraceCheckUtils]: 13: Hoare triple {2198#true} ~a~0 := 1 + ~a~0; {2198#true} is VALID [2018-11-18 22:46:58,901 INFO L273 TraceCheckUtils]: 14: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-18 22:46:58,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {2198#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2198#true} is VALID [2018-11-18 22:46:58,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {2198#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2198#true} is VALID [2018-11-18 22:46:58,901 INFO L273 TraceCheckUtils]: 17: Hoare triple {2198#true} ~a~0 := 1 + ~a~0; {2198#true} is VALID [2018-11-18 22:46:58,901 INFO L273 TraceCheckUtils]: 18: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-18 22:46:58,901 INFO L273 TraceCheckUtils]: 19: Hoare triple {2198#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2198#true} is VALID [2018-11-18 22:46:58,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {2198#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2198#true} is VALID [2018-11-18 22:46:58,901 INFO L273 TraceCheckUtils]: 21: Hoare triple {2198#true} ~a~0 := 1 + ~a~0; {2198#true} is VALID [2018-11-18 22:46:58,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-18 22:46:58,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {2198#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2198#true} is VALID [2018-11-18 22:46:58,902 INFO L273 TraceCheckUtils]: 24: Hoare triple {2198#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2198#true} is VALID [2018-11-18 22:46:58,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {2198#true} ~a~0 := 1 + ~a~0; {2198#true} is VALID [2018-11-18 22:46:58,902 INFO L273 TraceCheckUtils]: 26: Hoare triple {2198#true} assume true; {2198#true} is VALID [2018-11-18 22:46:58,902 INFO L273 TraceCheckUtils]: 27: Hoare triple {2198#true} assume !(~a~0 < 100000); {2198#true} is VALID [2018-11-18 22:46:58,903 INFO L273 TraceCheckUtils]: 28: Hoare triple {2198#true} ~a~0 := 0; {2293#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:58,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {2293#(<= main_~a~0 0)} assume true; {2293#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:58,917 INFO L273 TraceCheckUtils]: 30: Hoare triple {2293#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2293#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:58,917 INFO L273 TraceCheckUtils]: 31: Hoare triple {2293#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2293#(<= main_~a~0 0)} is VALID [2018-11-18 22:46:58,918 INFO L273 TraceCheckUtils]: 32: Hoare triple {2293#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {2201#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:58,918 INFO L273 TraceCheckUtils]: 33: Hoare triple {2201#(<= main_~a~0 1)} assume true; {2201#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:58,925 INFO L273 TraceCheckUtils]: 34: Hoare triple {2201#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2201#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:58,926 INFO L273 TraceCheckUtils]: 35: Hoare triple {2201#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2201#(<= main_~a~0 1)} is VALID [2018-11-18 22:46:58,927 INFO L273 TraceCheckUtils]: 36: Hoare triple {2201#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {2202#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:58,927 INFO L273 TraceCheckUtils]: 37: Hoare triple {2202#(<= main_~a~0 2)} assume true; {2202#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:58,930 INFO L273 TraceCheckUtils]: 38: Hoare triple {2202#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2202#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:58,930 INFO L273 TraceCheckUtils]: 39: Hoare triple {2202#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2202#(<= main_~a~0 2)} is VALID [2018-11-18 22:46:58,930 INFO L273 TraceCheckUtils]: 40: Hoare triple {2202#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {2203#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:58,931 INFO L273 TraceCheckUtils]: 41: Hoare triple {2203#(<= main_~a~0 3)} assume true; {2203#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:58,931 INFO L273 TraceCheckUtils]: 42: Hoare triple {2203#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2203#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:58,931 INFO L273 TraceCheckUtils]: 43: Hoare triple {2203#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2203#(<= main_~a~0 3)} is VALID [2018-11-18 22:46:58,932 INFO L273 TraceCheckUtils]: 44: Hoare triple {2203#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {2204#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:58,932 INFO L273 TraceCheckUtils]: 45: Hoare triple {2204#(<= main_~a~0 4)} assume true; {2204#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:58,933 INFO L273 TraceCheckUtils]: 46: Hoare triple {2204#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2204#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:58,933 INFO L273 TraceCheckUtils]: 47: Hoare triple {2204#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2204#(<= main_~a~0 4)} is VALID [2018-11-18 22:46:58,933 INFO L273 TraceCheckUtils]: 48: Hoare triple {2204#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {2205#(<= main_~a~0 5)} is VALID [2018-11-18 22:46:58,934 INFO L273 TraceCheckUtils]: 49: Hoare triple {2205#(<= main_~a~0 5)} assume true; {2205#(<= main_~a~0 5)} is VALID [2018-11-18 22:46:58,934 INFO L273 TraceCheckUtils]: 50: Hoare triple {2205#(<= main_~a~0 5)} assume !(~a~0 < 100000); {2199#false} is VALID [2018-11-18 22:46:58,935 INFO L273 TraceCheckUtils]: 51: Hoare triple {2199#false} havoc ~x~0;~x~0 := 0; {2199#false} is VALID [2018-11-18 22:46:58,935 INFO L273 TraceCheckUtils]: 52: Hoare triple {2199#false} assume true; {2199#false} is VALID [2018-11-18 22:46:58,935 INFO L273 TraceCheckUtils]: 53: Hoare triple {2199#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {2199#false} is VALID [2018-11-18 22:46:58,935 INFO L256 TraceCheckUtils]: 54: Hoare triple {2199#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {2199#false} is VALID [2018-11-18 22:46:58,935 INFO L273 TraceCheckUtils]: 55: Hoare triple {2199#false} ~cond := #in~cond; {2199#false} is VALID [2018-11-18 22:46:58,936 INFO L273 TraceCheckUtils]: 56: Hoare triple {2199#false} assume 0 == ~cond; {2199#false} is VALID [2018-11-18 22:46:58,936 INFO L273 TraceCheckUtils]: 57: Hoare triple {2199#false} assume !false; {2199#false} is VALID [2018-11-18 22:46:58,938 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-18 22:46:58,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:46:58,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-18 22:46:58,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-18 22:46:58,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:46:58,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 22:46:59,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:59,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 22:46:59,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 22:46:59,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:46:59,080 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 9 states. [2018-11-18 22:46:59,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:59,675 INFO L93 Difference]: Finished difference Result 122 states and 150 transitions. [2018-11-18 22:46:59,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 22:46:59,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-18 22:46:59,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:46:59,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:46:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2018-11-18 22:46:59,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 22:46:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 128 transitions. [2018-11-18 22:46:59,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 128 transitions. [2018-11-18 22:46:59,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:46:59,804 INFO L225 Difference]: With dead ends: 122 [2018-11-18 22:46:59,804 INFO L226 Difference]: Without dead ends: 81 [2018-11-18 22:46:59,805 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 22:46:59,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-18 22:46:59,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2018-11-18 22:46:59,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:46:59,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 77 states. [2018-11-18 22:46:59,859 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 77 states. [2018-11-18 22:46:59,860 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 77 states. [2018-11-18 22:46:59,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:59,863 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2018-11-18 22:46:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2018-11-18 22:46:59,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:59,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:59,863 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 81 states. [2018-11-18 22:46:59,864 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 81 states. [2018-11-18 22:46:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:46:59,867 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2018-11-18 22:46:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2018-11-18 22:46:59,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:46:59,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:46:59,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:46:59,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:46:59,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 22:46:59,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2018-11-18 22:46:59,871 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 58 [2018-11-18 22:46:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:46:59,871 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2018-11-18 22:46:59,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 22:46:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2018-11-18 22:46:59,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 22:46:59,873 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:46:59,873 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:46:59,873 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:46:59,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:46:59,874 INFO L82 PathProgramCache]: Analyzing trace with hash 984613331, now seen corresponding path program 6 times [2018-11-18 22:46:59,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:46:59,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:46:59,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:59,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:46:59,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:46:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:00,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {2798#true} call ULTIMATE.init(); {2798#true} is VALID [2018-11-18 22:47:00,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {2798#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2798#true} is VALID [2018-11-18 22:47:00,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-18 22:47:00,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2798#true} {2798#true} #95#return; {2798#true} is VALID [2018-11-18 22:47:00,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {2798#true} call #t~ret8 := main(); {2798#true} is VALID [2018-11-18 22:47:00,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {2798#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {2800#(= main_~a~0 0)} is VALID [2018-11-18 22:47:00,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {2800#(= main_~a~0 0)} assume true; {2800#(= main_~a~0 0)} is VALID [2018-11-18 22:47:00,174 INFO L273 TraceCheckUtils]: 7: Hoare triple {2800#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2800#(= main_~a~0 0)} is VALID [2018-11-18 22:47:00,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {2800#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2800#(= main_~a~0 0)} is VALID [2018-11-18 22:47:00,175 INFO L273 TraceCheckUtils]: 9: Hoare triple {2800#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {2801#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:00,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {2801#(<= main_~a~0 1)} assume true; {2801#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:00,176 INFO L273 TraceCheckUtils]: 11: Hoare triple {2801#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2801#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:00,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {2801#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2801#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:00,177 INFO L273 TraceCheckUtils]: 13: Hoare triple {2801#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {2802#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:00,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {2802#(<= main_~a~0 2)} assume true; {2802#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:00,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {2802#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2802#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:00,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {2802#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2802#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:00,180 INFO L273 TraceCheckUtils]: 17: Hoare triple {2802#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {2803#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:00,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {2803#(<= main_~a~0 3)} assume true; {2803#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:00,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {2803#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2803#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:00,192 INFO L273 TraceCheckUtils]: 20: Hoare triple {2803#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2803#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:00,192 INFO L273 TraceCheckUtils]: 21: Hoare triple {2803#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {2804#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:00,193 INFO L273 TraceCheckUtils]: 22: Hoare triple {2804#(<= main_~a~0 4)} assume true; {2804#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:00,193 INFO L273 TraceCheckUtils]: 23: Hoare triple {2804#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2804#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:00,193 INFO L273 TraceCheckUtils]: 24: Hoare triple {2804#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2804#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:00,194 INFO L273 TraceCheckUtils]: 25: Hoare triple {2804#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {2805#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:00,194 INFO L273 TraceCheckUtils]: 26: Hoare triple {2805#(<= main_~a~0 5)} assume true; {2805#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:00,194 INFO L273 TraceCheckUtils]: 27: Hoare triple {2805#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2805#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:00,195 INFO L273 TraceCheckUtils]: 28: Hoare triple {2805#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2805#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:00,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {2805#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {2806#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:00,196 INFO L273 TraceCheckUtils]: 30: Hoare triple {2806#(<= main_~a~0 6)} assume true; {2806#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:00,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {2806#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2799#false} is VALID [2018-11-18 22:47:00,196 INFO L273 TraceCheckUtils]: 32: Hoare triple {2799#false} ~a~0 := 0; {2799#false} is VALID [2018-11-18 22:47:00,197 INFO L273 TraceCheckUtils]: 33: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-18 22:47:00,197 INFO L273 TraceCheckUtils]: 34: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2799#false} is VALID [2018-11-18 22:47:00,197 INFO L273 TraceCheckUtils]: 35: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2799#false} is VALID [2018-11-18 22:47:00,197 INFO L273 TraceCheckUtils]: 36: Hoare triple {2799#false} ~a~0 := 1 + ~a~0; {2799#false} is VALID [2018-11-18 22:47:00,198 INFO L273 TraceCheckUtils]: 37: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-18 22:47:00,198 INFO L273 TraceCheckUtils]: 38: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2799#false} is VALID [2018-11-18 22:47:00,198 INFO L273 TraceCheckUtils]: 39: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2799#false} is VALID [2018-11-18 22:47:00,198 INFO L273 TraceCheckUtils]: 40: Hoare triple {2799#false} ~a~0 := 1 + ~a~0; {2799#false} is VALID [2018-11-18 22:47:00,198 INFO L273 TraceCheckUtils]: 41: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-18 22:47:00,199 INFO L273 TraceCheckUtils]: 42: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2799#false} is VALID [2018-11-18 22:47:00,199 INFO L273 TraceCheckUtils]: 43: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2799#false} is VALID [2018-11-18 22:47:00,199 INFO L273 TraceCheckUtils]: 44: Hoare triple {2799#false} ~a~0 := 1 + ~a~0; {2799#false} is VALID [2018-11-18 22:47:00,199 INFO L273 TraceCheckUtils]: 45: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-18 22:47:00,200 INFO L273 TraceCheckUtils]: 46: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2799#false} is VALID [2018-11-18 22:47:00,201 INFO L273 TraceCheckUtils]: 47: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2799#false} is VALID [2018-11-18 22:47:00,201 INFO L273 TraceCheckUtils]: 48: Hoare triple {2799#false} ~a~0 := 1 + ~a~0; {2799#false} is VALID [2018-11-18 22:47:00,201 INFO L273 TraceCheckUtils]: 49: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-18 22:47:00,201 INFO L273 TraceCheckUtils]: 50: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2799#false} is VALID [2018-11-18 22:47:00,201 INFO L273 TraceCheckUtils]: 51: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2799#false} is VALID [2018-11-18 22:47:00,201 INFO L273 TraceCheckUtils]: 52: Hoare triple {2799#false} ~a~0 := 1 + ~a~0; {2799#false} is VALID [2018-11-18 22:47:00,202 INFO L273 TraceCheckUtils]: 53: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-18 22:47:00,202 INFO L273 TraceCheckUtils]: 54: Hoare triple {2799#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2799#false} is VALID [2018-11-18 22:47:00,202 INFO L273 TraceCheckUtils]: 55: Hoare triple {2799#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2799#false} is VALID [2018-11-18 22:47:00,202 INFO L273 TraceCheckUtils]: 56: Hoare triple {2799#false} ~a~0 := 1 + ~a~0; {2799#false} is VALID [2018-11-18 22:47:00,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-18 22:47:00,203 INFO L273 TraceCheckUtils]: 58: Hoare triple {2799#false} assume !(~a~0 < 100000); {2799#false} is VALID [2018-11-18 22:47:00,203 INFO L273 TraceCheckUtils]: 59: Hoare triple {2799#false} havoc ~x~0;~x~0 := 0; {2799#false} is VALID [2018-11-18 22:47:00,203 INFO L273 TraceCheckUtils]: 60: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-18 22:47:00,203 INFO L273 TraceCheckUtils]: 61: Hoare triple {2799#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {2799#false} is VALID [2018-11-18 22:47:00,204 INFO L256 TraceCheckUtils]: 62: Hoare triple {2799#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {2799#false} is VALID [2018-11-18 22:47:00,204 INFO L273 TraceCheckUtils]: 63: Hoare triple {2799#false} ~cond := #in~cond; {2799#false} is VALID [2018-11-18 22:47:00,204 INFO L273 TraceCheckUtils]: 64: Hoare triple {2799#false} assume 0 == ~cond; {2799#false} is VALID [2018-11-18 22:47:00,204 INFO L273 TraceCheckUtils]: 65: Hoare triple {2799#false} assume !false; {2799#false} is VALID [2018-11-18 22:47:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 22:47:00,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:00,210 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:00,226 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:47:00,433 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-18 22:47:00,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:00,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:00,716 INFO L256 TraceCheckUtils]: 0: Hoare triple {2798#true} call ULTIMATE.init(); {2798#true} is VALID [2018-11-18 22:47:00,716 INFO L273 TraceCheckUtils]: 1: Hoare triple {2798#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2798#true} is VALID [2018-11-18 22:47:00,716 INFO L273 TraceCheckUtils]: 2: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-18 22:47:00,717 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2798#true} {2798#true} #95#return; {2798#true} is VALID [2018-11-18 22:47:00,717 INFO L256 TraceCheckUtils]: 4: Hoare triple {2798#true} call #t~ret8 := main(); {2798#true} is VALID [2018-11-18 22:47:00,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {2798#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {2798#true} is VALID [2018-11-18 22:47:00,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-18 22:47:00,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2798#true} is VALID [2018-11-18 22:47:00,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2798#true} is VALID [2018-11-18 22:47:00,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {2798#true} ~a~0 := 1 + ~a~0; {2798#true} is VALID [2018-11-18 22:47:00,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-18 22:47:00,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2798#true} is VALID [2018-11-18 22:47:00,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2798#true} is VALID [2018-11-18 22:47:00,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {2798#true} ~a~0 := 1 + ~a~0; {2798#true} is VALID [2018-11-18 22:47:00,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-18 22:47:00,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2798#true} is VALID [2018-11-18 22:47:00,719 INFO L273 TraceCheckUtils]: 16: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2798#true} is VALID [2018-11-18 22:47:00,719 INFO L273 TraceCheckUtils]: 17: Hoare triple {2798#true} ~a~0 := 1 + ~a~0; {2798#true} is VALID [2018-11-18 22:47:00,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-18 22:47:00,719 INFO L273 TraceCheckUtils]: 19: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2798#true} is VALID [2018-11-18 22:47:00,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2798#true} is VALID [2018-11-18 22:47:00,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {2798#true} ~a~0 := 1 + ~a~0; {2798#true} is VALID [2018-11-18 22:47:00,720 INFO L273 TraceCheckUtils]: 22: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-18 22:47:00,720 INFO L273 TraceCheckUtils]: 23: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2798#true} is VALID [2018-11-18 22:47:00,720 INFO L273 TraceCheckUtils]: 24: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2798#true} is VALID [2018-11-18 22:47:00,720 INFO L273 TraceCheckUtils]: 25: Hoare triple {2798#true} ~a~0 := 1 + ~a~0; {2798#true} is VALID [2018-11-18 22:47:00,720 INFO L273 TraceCheckUtils]: 26: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-18 22:47:00,720 INFO L273 TraceCheckUtils]: 27: Hoare triple {2798#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2798#true} is VALID [2018-11-18 22:47:00,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {2798#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {2798#true} is VALID [2018-11-18 22:47:00,721 INFO L273 TraceCheckUtils]: 29: Hoare triple {2798#true} ~a~0 := 1 + ~a~0; {2798#true} is VALID [2018-11-18 22:47:00,721 INFO L273 TraceCheckUtils]: 30: Hoare triple {2798#true} assume true; {2798#true} is VALID [2018-11-18 22:47:00,721 INFO L273 TraceCheckUtils]: 31: Hoare triple {2798#true} assume !(~a~0 < 100000); {2798#true} is VALID [2018-11-18 22:47:00,726 INFO L273 TraceCheckUtils]: 32: Hoare triple {2798#true} ~a~0 := 0; {2906#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:00,726 INFO L273 TraceCheckUtils]: 33: Hoare triple {2906#(<= main_~a~0 0)} assume true; {2906#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:00,727 INFO L273 TraceCheckUtils]: 34: Hoare triple {2906#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2906#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:00,727 INFO L273 TraceCheckUtils]: 35: Hoare triple {2906#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2906#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:00,727 INFO L273 TraceCheckUtils]: 36: Hoare triple {2906#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {2801#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:00,728 INFO L273 TraceCheckUtils]: 37: Hoare triple {2801#(<= main_~a~0 1)} assume true; {2801#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:00,728 INFO L273 TraceCheckUtils]: 38: Hoare triple {2801#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2801#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:00,728 INFO L273 TraceCheckUtils]: 39: Hoare triple {2801#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2801#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:00,729 INFO L273 TraceCheckUtils]: 40: Hoare triple {2801#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {2802#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:00,729 INFO L273 TraceCheckUtils]: 41: Hoare triple {2802#(<= main_~a~0 2)} assume true; {2802#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:00,729 INFO L273 TraceCheckUtils]: 42: Hoare triple {2802#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2802#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:00,730 INFO L273 TraceCheckUtils]: 43: Hoare triple {2802#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2802#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:00,730 INFO L273 TraceCheckUtils]: 44: Hoare triple {2802#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {2803#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:00,731 INFO L273 TraceCheckUtils]: 45: Hoare triple {2803#(<= main_~a~0 3)} assume true; {2803#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:00,731 INFO L273 TraceCheckUtils]: 46: Hoare triple {2803#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2803#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:00,732 INFO L273 TraceCheckUtils]: 47: Hoare triple {2803#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2803#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:00,733 INFO L273 TraceCheckUtils]: 48: Hoare triple {2803#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {2804#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:00,733 INFO L273 TraceCheckUtils]: 49: Hoare triple {2804#(<= main_~a~0 4)} assume true; {2804#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:00,734 INFO L273 TraceCheckUtils]: 50: Hoare triple {2804#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2804#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:00,734 INFO L273 TraceCheckUtils]: 51: Hoare triple {2804#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2804#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:00,735 INFO L273 TraceCheckUtils]: 52: Hoare triple {2804#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {2805#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:00,735 INFO L273 TraceCheckUtils]: 53: Hoare triple {2805#(<= main_~a~0 5)} assume true; {2805#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:00,736 INFO L273 TraceCheckUtils]: 54: Hoare triple {2805#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {2805#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:00,736 INFO L273 TraceCheckUtils]: 55: Hoare triple {2805#(<= main_~a~0 5)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {2805#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:00,737 INFO L273 TraceCheckUtils]: 56: Hoare triple {2805#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {2806#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:00,738 INFO L273 TraceCheckUtils]: 57: Hoare triple {2806#(<= main_~a~0 6)} assume true; {2806#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:00,738 INFO L273 TraceCheckUtils]: 58: Hoare triple {2806#(<= main_~a~0 6)} assume !(~a~0 < 100000); {2799#false} is VALID [2018-11-18 22:47:00,738 INFO L273 TraceCheckUtils]: 59: Hoare triple {2799#false} havoc ~x~0;~x~0 := 0; {2799#false} is VALID [2018-11-18 22:47:00,739 INFO L273 TraceCheckUtils]: 60: Hoare triple {2799#false} assume true; {2799#false} is VALID [2018-11-18 22:47:00,739 INFO L273 TraceCheckUtils]: 61: Hoare triple {2799#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {2799#false} is VALID [2018-11-18 22:47:00,739 INFO L256 TraceCheckUtils]: 62: Hoare triple {2799#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {2799#false} is VALID [2018-11-18 22:47:00,739 INFO L273 TraceCheckUtils]: 63: Hoare triple {2799#false} ~cond := #in~cond; {2799#false} is VALID [2018-11-18 22:47:00,740 INFO L273 TraceCheckUtils]: 64: Hoare triple {2799#false} assume 0 == ~cond; {2799#false} is VALID [2018-11-18 22:47:00,740 INFO L273 TraceCheckUtils]: 65: Hoare triple {2799#false} assume !false; {2799#false} is VALID [2018-11-18 22:47:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-11-18 22:47:00,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:00,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-18 22:47:00,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-11-18 22:47:00,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:00,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 22:47:00,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:00,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 22:47:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 22:47:00,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:47:00,878 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 10 states. [2018-11-18 22:47:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:01,355 INFO L93 Difference]: Finished difference Result 134 states and 165 transitions. [2018-11-18 22:47:01,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 22:47:01,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2018-11-18 22:47:01,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:47:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2018-11-18 22:47:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 22:47:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 138 transitions. [2018-11-18 22:47:01,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 138 transitions. [2018-11-18 22:47:01,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:01,559 INFO L225 Difference]: With dead ends: 134 [2018-11-18 22:47:01,559 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 22:47:01,560 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 22:47:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 22:47:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-11-18 22:47:01,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:01,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 85 states. [2018-11-18 22:47:01,616 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 85 states. [2018-11-18 22:47:01,616 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 85 states. [2018-11-18 22:47:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:01,619 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2018-11-18 22:47:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2018-11-18 22:47:01,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:01,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:01,620 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 89 states. [2018-11-18 22:47:01,620 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 89 states. [2018-11-18 22:47:01,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:01,623 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2018-11-18 22:47:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 109 transitions. [2018-11-18 22:47:01,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:01,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:01,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:01,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-18 22:47:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2018-11-18 22:47:01,627 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 66 [2018-11-18 22:47:01,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:01,628 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2018-11-18 22:47:01,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 22:47:01,628 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2018-11-18 22:47:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 22:47:01,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:01,629 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:01,629 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:01,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:01,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1854478125, now seen corresponding path program 7 times [2018-11-18 22:47:01,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:01,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:01,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:01,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:01,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {3464#true} call ULTIMATE.init(); {3464#true} is VALID [2018-11-18 22:47:01,888 INFO L273 TraceCheckUtils]: 1: Hoare triple {3464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3464#true} is VALID [2018-11-18 22:47:01,888 INFO L273 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2018-11-18 22:47:01,888 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3464#true} #95#return; {3464#true} is VALID [2018-11-18 22:47:01,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {3464#true} call #t~ret8 := main(); {3464#true} is VALID [2018-11-18 22:47:01,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {3464#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {3466#(= main_~a~0 0)} is VALID [2018-11-18 22:47:01,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {3466#(= main_~a~0 0)} assume true; {3466#(= main_~a~0 0)} is VALID [2018-11-18 22:47:01,890 INFO L273 TraceCheckUtils]: 7: Hoare triple {3466#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3466#(= main_~a~0 0)} is VALID [2018-11-18 22:47:01,890 INFO L273 TraceCheckUtils]: 8: Hoare triple {3466#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3466#(= main_~a~0 0)} is VALID [2018-11-18 22:47:01,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {3466#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {3467#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:01,891 INFO L273 TraceCheckUtils]: 10: Hoare triple {3467#(<= main_~a~0 1)} assume true; {3467#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:01,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {3467#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3467#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:01,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {3467#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3467#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:01,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {3467#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {3468#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:01,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {3468#(<= main_~a~0 2)} assume true; {3468#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:01,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {3468#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3468#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:01,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {3468#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3468#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:01,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {3468#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {3469#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:01,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {3469#(<= main_~a~0 3)} assume true; {3469#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:01,895 INFO L273 TraceCheckUtils]: 19: Hoare triple {3469#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3469#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:01,895 INFO L273 TraceCheckUtils]: 20: Hoare triple {3469#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3469#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:01,896 INFO L273 TraceCheckUtils]: 21: Hoare triple {3469#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {3470#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:01,896 INFO L273 TraceCheckUtils]: 22: Hoare triple {3470#(<= main_~a~0 4)} assume true; {3470#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:01,897 INFO L273 TraceCheckUtils]: 23: Hoare triple {3470#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3470#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:01,897 INFO L273 TraceCheckUtils]: 24: Hoare triple {3470#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3470#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:01,898 INFO L273 TraceCheckUtils]: 25: Hoare triple {3470#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {3471#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:01,899 INFO L273 TraceCheckUtils]: 26: Hoare triple {3471#(<= main_~a~0 5)} assume true; {3471#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:01,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {3471#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3471#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:01,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {3471#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3471#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:01,900 INFO L273 TraceCheckUtils]: 29: Hoare triple {3471#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {3472#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:01,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {3472#(<= main_~a~0 6)} assume true; {3472#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:01,901 INFO L273 TraceCheckUtils]: 31: Hoare triple {3472#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3472#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:01,902 INFO L273 TraceCheckUtils]: 32: Hoare triple {3472#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3472#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:01,902 INFO L273 TraceCheckUtils]: 33: Hoare triple {3472#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {3473#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:01,903 INFO L273 TraceCheckUtils]: 34: Hoare triple {3473#(<= main_~a~0 7)} assume true; {3473#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:01,904 INFO L273 TraceCheckUtils]: 35: Hoare triple {3473#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3465#false} is VALID [2018-11-18 22:47:01,904 INFO L273 TraceCheckUtils]: 36: Hoare triple {3465#false} ~a~0 := 0; {3465#false} is VALID [2018-11-18 22:47:01,904 INFO L273 TraceCheckUtils]: 37: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:01,904 INFO L273 TraceCheckUtils]: 38: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:01,904 INFO L273 TraceCheckUtils]: 39: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:01,905 INFO L273 TraceCheckUtils]: 40: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:01,905 INFO L273 TraceCheckUtils]: 41: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:01,905 INFO L273 TraceCheckUtils]: 42: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:01,905 INFO L273 TraceCheckUtils]: 43: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:01,905 INFO L273 TraceCheckUtils]: 44: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:01,906 INFO L273 TraceCheckUtils]: 45: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:01,906 INFO L273 TraceCheckUtils]: 46: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:01,906 INFO L273 TraceCheckUtils]: 47: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:01,906 INFO L273 TraceCheckUtils]: 48: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:01,906 INFO L273 TraceCheckUtils]: 49: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:01,907 INFO L273 TraceCheckUtils]: 50: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:01,907 INFO L273 TraceCheckUtils]: 51: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:01,907 INFO L273 TraceCheckUtils]: 52: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:01,907 INFO L273 TraceCheckUtils]: 53: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:01,908 INFO L273 TraceCheckUtils]: 54: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:01,908 INFO L273 TraceCheckUtils]: 55: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:01,908 INFO L273 TraceCheckUtils]: 56: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:01,908 INFO L273 TraceCheckUtils]: 57: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:01,908 INFO L273 TraceCheckUtils]: 58: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:01,908 INFO L273 TraceCheckUtils]: 59: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:01,908 INFO L273 TraceCheckUtils]: 60: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:01,909 INFO L273 TraceCheckUtils]: 61: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:01,909 INFO L273 TraceCheckUtils]: 62: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:01,909 INFO L273 TraceCheckUtils]: 63: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:01,909 INFO L273 TraceCheckUtils]: 64: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:01,909 INFO L273 TraceCheckUtils]: 65: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:01,909 INFO L273 TraceCheckUtils]: 66: Hoare triple {3465#false} assume !(~a~0 < 100000); {3465#false} is VALID [2018-11-18 22:47:01,909 INFO L273 TraceCheckUtils]: 67: Hoare triple {3465#false} havoc ~x~0;~x~0 := 0; {3465#false} is VALID [2018-11-18 22:47:01,909 INFO L273 TraceCheckUtils]: 68: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:01,910 INFO L273 TraceCheckUtils]: 69: Hoare triple {3465#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {3465#false} is VALID [2018-11-18 22:47:01,910 INFO L256 TraceCheckUtils]: 70: Hoare triple {3465#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {3465#false} is VALID [2018-11-18 22:47:01,910 INFO L273 TraceCheckUtils]: 71: Hoare triple {3465#false} ~cond := #in~cond; {3465#false} is VALID [2018-11-18 22:47:01,910 INFO L273 TraceCheckUtils]: 72: Hoare triple {3465#false} assume 0 == ~cond; {3465#false} is VALID [2018-11-18 22:47:01,910 INFO L273 TraceCheckUtils]: 73: Hoare triple {3465#false} assume !false; {3465#false} is VALID [2018-11-18 22:47:01,913 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-18 22:47:01,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:01,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:01,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:47:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:02,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:02,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {3464#true} call ULTIMATE.init(); {3464#true} is VALID [2018-11-18 22:47:02,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {3464#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3464#true} is VALID [2018-11-18 22:47:02,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2018-11-18 22:47:02,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3464#true} #95#return; {3464#true} is VALID [2018-11-18 22:47:02,210 INFO L256 TraceCheckUtils]: 4: Hoare triple {3464#true} call #t~ret8 := main(); {3464#true} is VALID [2018-11-18 22:47:02,211 INFO L273 TraceCheckUtils]: 5: Hoare triple {3464#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {3492#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:02,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {3492#(<= main_~a~0 0)} assume true; {3492#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:02,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {3492#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3492#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:02,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {3492#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3492#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:02,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {3492#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {3467#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:02,213 INFO L273 TraceCheckUtils]: 10: Hoare triple {3467#(<= main_~a~0 1)} assume true; {3467#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:02,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {3467#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3467#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:02,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {3467#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3467#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:02,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {3467#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {3468#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:02,215 INFO L273 TraceCheckUtils]: 14: Hoare triple {3468#(<= main_~a~0 2)} assume true; {3468#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:02,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {3468#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3468#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:02,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {3468#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3468#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:02,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {3468#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {3469#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:02,217 INFO L273 TraceCheckUtils]: 18: Hoare triple {3469#(<= main_~a~0 3)} assume true; {3469#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:02,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {3469#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3469#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:02,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {3469#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3469#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:02,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {3469#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {3470#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:02,219 INFO L273 TraceCheckUtils]: 22: Hoare triple {3470#(<= main_~a~0 4)} assume true; {3470#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:02,220 INFO L273 TraceCheckUtils]: 23: Hoare triple {3470#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3470#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:02,220 INFO L273 TraceCheckUtils]: 24: Hoare triple {3470#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3470#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:02,221 INFO L273 TraceCheckUtils]: 25: Hoare triple {3470#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {3471#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:02,222 INFO L273 TraceCheckUtils]: 26: Hoare triple {3471#(<= main_~a~0 5)} assume true; {3471#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:02,222 INFO L273 TraceCheckUtils]: 27: Hoare triple {3471#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3471#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:02,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {3471#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3471#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:02,247 INFO L273 TraceCheckUtils]: 29: Hoare triple {3471#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {3472#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:02,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {3472#(<= main_~a~0 6)} assume true; {3472#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:02,247 INFO L273 TraceCheckUtils]: 31: Hoare triple {3472#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3472#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:02,248 INFO L273 TraceCheckUtils]: 32: Hoare triple {3472#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {3472#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:02,248 INFO L273 TraceCheckUtils]: 33: Hoare triple {3472#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {3473#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:02,252 INFO L273 TraceCheckUtils]: 34: Hoare triple {3473#(<= main_~a~0 7)} assume true; {3473#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:02,252 INFO L273 TraceCheckUtils]: 35: Hoare triple {3473#(<= main_~a~0 7)} assume !(~a~0 < 100000); {3465#false} is VALID [2018-11-18 22:47:02,252 INFO L273 TraceCheckUtils]: 36: Hoare triple {3465#false} ~a~0 := 0; {3465#false} is VALID [2018-11-18 22:47:02,252 INFO L273 TraceCheckUtils]: 37: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:02,253 INFO L273 TraceCheckUtils]: 38: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:02,253 INFO L273 TraceCheckUtils]: 39: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:02,253 INFO L273 TraceCheckUtils]: 40: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:02,253 INFO L273 TraceCheckUtils]: 41: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:02,253 INFO L273 TraceCheckUtils]: 42: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:02,253 INFO L273 TraceCheckUtils]: 43: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:02,253 INFO L273 TraceCheckUtils]: 44: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:02,253 INFO L273 TraceCheckUtils]: 45: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:02,254 INFO L273 TraceCheckUtils]: 46: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:02,254 INFO L273 TraceCheckUtils]: 47: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:02,254 INFO L273 TraceCheckUtils]: 48: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:02,254 INFO L273 TraceCheckUtils]: 49: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:02,254 INFO L273 TraceCheckUtils]: 50: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:02,254 INFO L273 TraceCheckUtils]: 51: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:02,254 INFO L273 TraceCheckUtils]: 52: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:02,254 INFO L273 TraceCheckUtils]: 53: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:02,255 INFO L273 TraceCheckUtils]: 54: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:02,256 INFO L273 TraceCheckUtils]: 55: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:02,256 INFO L273 TraceCheckUtils]: 56: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:02,256 INFO L273 TraceCheckUtils]: 57: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:02,256 INFO L273 TraceCheckUtils]: 58: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:02,256 INFO L273 TraceCheckUtils]: 59: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:02,257 INFO L273 TraceCheckUtils]: 60: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:02,257 INFO L273 TraceCheckUtils]: 61: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:02,257 INFO L273 TraceCheckUtils]: 62: Hoare triple {3465#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {3465#false} is VALID [2018-11-18 22:47:02,257 INFO L273 TraceCheckUtils]: 63: Hoare triple {3465#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {3465#false} is VALID [2018-11-18 22:47:02,257 INFO L273 TraceCheckUtils]: 64: Hoare triple {3465#false} ~a~0 := 1 + ~a~0; {3465#false} is VALID [2018-11-18 22:47:02,258 INFO L273 TraceCheckUtils]: 65: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:02,258 INFO L273 TraceCheckUtils]: 66: Hoare triple {3465#false} assume !(~a~0 < 100000); {3465#false} is VALID [2018-11-18 22:47:02,258 INFO L273 TraceCheckUtils]: 67: Hoare triple {3465#false} havoc ~x~0;~x~0 := 0; {3465#false} is VALID [2018-11-18 22:47:02,258 INFO L273 TraceCheckUtils]: 68: Hoare triple {3465#false} assume true; {3465#false} is VALID [2018-11-18 22:47:02,258 INFO L273 TraceCheckUtils]: 69: Hoare triple {3465#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {3465#false} is VALID [2018-11-18 22:47:02,258 INFO L256 TraceCheckUtils]: 70: Hoare triple {3465#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {3465#false} is VALID [2018-11-18 22:47:02,259 INFO L273 TraceCheckUtils]: 71: Hoare triple {3465#false} ~cond := #in~cond; {3465#false} is VALID [2018-11-18 22:47:02,259 INFO L273 TraceCheckUtils]: 72: Hoare triple {3465#false} assume 0 == ~cond; {3465#false} is VALID [2018-11-18 22:47:02,259 INFO L273 TraceCheckUtils]: 73: Hoare triple {3465#false} assume !false; {3465#false} is VALID [2018-11-18 22:47:02,263 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-18 22:47:02,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:02,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-18 22:47:02,291 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-18 22:47:02,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:02,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 22:47:02,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:02,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 22:47:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 22:47:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:47:02,346 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 11 states. [2018-11-18 22:47:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:02,631 INFO L93 Difference]: Finished difference Result 146 states and 180 transitions. [2018-11-18 22:47:02,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 22:47:02,632 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-18 22:47:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:47:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2018-11-18 22:47:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 22:47:02,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2018-11-18 22:47:02,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 148 transitions. [2018-11-18 22:47:02,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:02,825 INFO L225 Difference]: With dead ends: 146 [2018-11-18 22:47:02,825 INFO L226 Difference]: Without dead ends: 97 [2018-11-18 22:47:02,826 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 22:47:02,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-18 22:47:02,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-11-18 22:47:02,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:02,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 93 states. [2018-11-18 22:47:02,853 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 93 states. [2018-11-18 22:47:02,853 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 93 states. [2018-11-18 22:47:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:02,857 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2018-11-18 22:47:02,857 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2018-11-18 22:47:02,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:02,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:02,858 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 97 states. [2018-11-18 22:47:02,858 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 97 states. [2018-11-18 22:47:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:02,862 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2018-11-18 22:47:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2018-11-18 22:47:02,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:02,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:02,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:02,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 22:47:02,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 113 transitions. [2018-11-18 22:47:02,866 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 113 transitions. Word has length 74 [2018-11-18 22:47:02,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:02,867 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 113 transitions. [2018-11-18 22:47:02,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 22:47:02,867 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 113 transitions. [2018-11-18 22:47:02,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-18 22:47:02,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:02,868 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:02,868 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:02,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:02,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1571931603, now seen corresponding path program 8 times [2018-11-18 22:47:02,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:02,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:02,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:02,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:47:02,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:03,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {4196#true} call ULTIMATE.init(); {4196#true} is VALID [2018-11-18 22:47:03,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {4196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4196#true} is VALID [2018-11-18 22:47:03,088 INFO L273 TraceCheckUtils]: 2: Hoare triple {4196#true} assume true; {4196#true} is VALID [2018-11-18 22:47:03,088 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4196#true} {4196#true} #95#return; {4196#true} is VALID [2018-11-18 22:47:03,088 INFO L256 TraceCheckUtils]: 4: Hoare triple {4196#true} call #t~ret8 := main(); {4196#true} is VALID [2018-11-18 22:47:03,088 INFO L273 TraceCheckUtils]: 5: Hoare triple {4196#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {4198#(= main_~a~0 0)} is VALID [2018-11-18 22:47:03,089 INFO L273 TraceCheckUtils]: 6: Hoare triple {4198#(= main_~a~0 0)} assume true; {4198#(= main_~a~0 0)} is VALID [2018-11-18 22:47:03,089 INFO L273 TraceCheckUtils]: 7: Hoare triple {4198#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4198#(= main_~a~0 0)} is VALID [2018-11-18 22:47:03,090 INFO L273 TraceCheckUtils]: 8: Hoare triple {4198#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4198#(= main_~a~0 0)} is VALID [2018-11-18 22:47:03,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {4198#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {4199#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:03,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {4199#(<= main_~a~0 1)} assume true; {4199#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:03,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {4199#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4199#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:03,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {4199#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4199#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:03,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {4199#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {4200#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:03,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {4200#(<= main_~a~0 2)} assume true; {4200#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:03,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {4200#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4200#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:03,093 INFO L273 TraceCheckUtils]: 16: Hoare triple {4200#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4200#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:03,094 INFO L273 TraceCheckUtils]: 17: Hoare triple {4200#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {4201#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:03,094 INFO L273 TraceCheckUtils]: 18: Hoare triple {4201#(<= main_~a~0 3)} assume true; {4201#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:03,095 INFO L273 TraceCheckUtils]: 19: Hoare triple {4201#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4201#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:03,095 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4201#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:03,096 INFO L273 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {4202#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:03,096 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~a~0 4)} assume true; {4202#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:03,097 INFO L273 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4202#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:03,097 INFO L273 TraceCheckUtils]: 24: Hoare triple {4202#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4202#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:03,098 INFO L273 TraceCheckUtils]: 25: Hoare triple {4202#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {4203#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:03,099 INFO L273 TraceCheckUtils]: 26: Hoare triple {4203#(<= main_~a~0 5)} assume true; {4203#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:03,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {4203#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4203#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:03,100 INFO L273 TraceCheckUtils]: 28: Hoare triple {4203#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4203#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:03,100 INFO L273 TraceCheckUtils]: 29: Hoare triple {4203#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {4204#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:03,101 INFO L273 TraceCheckUtils]: 30: Hoare triple {4204#(<= main_~a~0 6)} assume true; {4204#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:03,101 INFO L273 TraceCheckUtils]: 31: Hoare triple {4204#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4204#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:03,102 INFO L273 TraceCheckUtils]: 32: Hoare triple {4204#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4204#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:03,103 INFO L273 TraceCheckUtils]: 33: Hoare triple {4204#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {4205#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:03,103 INFO L273 TraceCheckUtils]: 34: Hoare triple {4205#(<= main_~a~0 7)} assume true; {4205#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:03,104 INFO L273 TraceCheckUtils]: 35: Hoare triple {4205#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4205#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:03,104 INFO L273 TraceCheckUtils]: 36: Hoare triple {4205#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4205#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:03,105 INFO L273 TraceCheckUtils]: 37: Hoare triple {4205#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {4206#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:03,105 INFO L273 TraceCheckUtils]: 38: Hoare triple {4206#(<= main_~a~0 8)} assume true; {4206#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:03,122 INFO L273 TraceCheckUtils]: 39: Hoare triple {4206#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4197#false} is VALID [2018-11-18 22:47:03,122 INFO L273 TraceCheckUtils]: 40: Hoare triple {4197#false} ~a~0 := 0; {4197#false} is VALID [2018-11-18 22:47:03,122 INFO L273 TraceCheckUtils]: 41: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,122 INFO L273 TraceCheckUtils]: 42: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,123 INFO L273 TraceCheckUtils]: 43: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,123 INFO L273 TraceCheckUtils]: 44: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,123 INFO L273 TraceCheckUtils]: 45: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,123 INFO L273 TraceCheckUtils]: 46: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,123 INFO L273 TraceCheckUtils]: 48: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,124 INFO L273 TraceCheckUtils]: 49: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,124 INFO L273 TraceCheckUtils]: 50: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,124 INFO L273 TraceCheckUtils]: 51: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,124 INFO L273 TraceCheckUtils]: 52: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,124 INFO L273 TraceCheckUtils]: 53: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,124 INFO L273 TraceCheckUtils]: 54: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,125 INFO L273 TraceCheckUtils]: 55: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,125 INFO L273 TraceCheckUtils]: 56: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,125 INFO L273 TraceCheckUtils]: 57: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,125 INFO L273 TraceCheckUtils]: 58: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,125 INFO L273 TraceCheckUtils]: 59: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,125 INFO L273 TraceCheckUtils]: 60: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,126 INFO L273 TraceCheckUtils]: 61: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,126 INFO L273 TraceCheckUtils]: 62: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,126 INFO L273 TraceCheckUtils]: 63: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,126 INFO L273 TraceCheckUtils]: 64: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,126 INFO L273 TraceCheckUtils]: 65: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,127 INFO L273 TraceCheckUtils]: 66: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,127 INFO L273 TraceCheckUtils]: 67: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,127 INFO L273 TraceCheckUtils]: 68: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,127 INFO L273 TraceCheckUtils]: 69: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,127 INFO L273 TraceCheckUtils]: 70: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,127 INFO L273 TraceCheckUtils]: 71: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,128 INFO L273 TraceCheckUtils]: 72: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,128 INFO L273 TraceCheckUtils]: 73: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,128 INFO L273 TraceCheckUtils]: 74: Hoare triple {4197#false} assume !(~a~0 < 100000); {4197#false} is VALID [2018-11-18 22:47:03,128 INFO L273 TraceCheckUtils]: 75: Hoare triple {4197#false} havoc ~x~0;~x~0 := 0; {4197#false} is VALID [2018-11-18 22:47:03,128 INFO L273 TraceCheckUtils]: 76: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,129 INFO L273 TraceCheckUtils]: 77: Hoare triple {4197#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,129 INFO L256 TraceCheckUtils]: 78: Hoare triple {4197#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {4197#false} is VALID [2018-11-18 22:47:03,129 INFO L273 TraceCheckUtils]: 79: Hoare triple {4197#false} ~cond := #in~cond; {4197#false} is VALID [2018-11-18 22:47:03,129 INFO L273 TraceCheckUtils]: 80: Hoare triple {4197#false} assume 0 == ~cond; {4197#false} is VALID [2018-11-18 22:47:03,129 INFO L273 TraceCheckUtils]: 81: Hoare triple {4197#false} assume !false; {4197#false} is VALID [2018-11-18 22:47:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-18 22:47:03,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:03,134 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:03,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:47:03,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:47:03,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:03,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:03,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {4196#true} call ULTIMATE.init(); {4196#true} is VALID [2018-11-18 22:47:03,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {4196#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4196#true} is VALID [2018-11-18 22:47:03,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {4196#true} assume true; {4196#true} is VALID [2018-11-18 22:47:03,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4196#true} {4196#true} #95#return; {4196#true} is VALID [2018-11-18 22:47:03,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {4196#true} call #t~ret8 := main(); {4196#true} is VALID [2018-11-18 22:47:03,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {4196#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {4225#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:03,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {4225#(<= main_~a~0 0)} assume true; {4225#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:03,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {4225#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4225#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:03,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {4225#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4225#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:03,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {4225#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {4199#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:03,356 INFO L273 TraceCheckUtils]: 10: Hoare triple {4199#(<= main_~a~0 1)} assume true; {4199#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:03,357 INFO L273 TraceCheckUtils]: 11: Hoare triple {4199#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4199#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:03,357 INFO L273 TraceCheckUtils]: 12: Hoare triple {4199#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4199#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:03,358 INFO L273 TraceCheckUtils]: 13: Hoare triple {4199#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {4200#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:03,358 INFO L273 TraceCheckUtils]: 14: Hoare triple {4200#(<= main_~a~0 2)} assume true; {4200#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:03,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {4200#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4200#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:03,359 INFO L273 TraceCheckUtils]: 16: Hoare triple {4200#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4200#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:03,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {4200#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {4201#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:03,360 INFO L273 TraceCheckUtils]: 18: Hoare triple {4201#(<= main_~a~0 3)} assume true; {4201#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:03,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {4201#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4201#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:03,361 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4201#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:03,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {4202#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:03,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~a~0 4)} assume true; {4202#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:03,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4202#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:03,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {4202#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4202#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:03,364 INFO L273 TraceCheckUtils]: 25: Hoare triple {4202#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {4203#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:03,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {4203#(<= main_~a~0 5)} assume true; {4203#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:03,365 INFO L273 TraceCheckUtils]: 27: Hoare triple {4203#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4203#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:03,366 INFO L273 TraceCheckUtils]: 28: Hoare triple {4203#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4203#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:03,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {4203#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {4204#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:03,367 INFO L273 TraceCheckUtils]: 30: Hoare triple {4204#(<= main_~a~0 6)} assume true; {4204#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:03,368 INFO L273 TraceCheckUtils]: 31: Hoare triple {4204#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4204#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:03,368 INFO L273 TraceCheckUtils]: 32: Hoare triple {4204#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4204#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:03,369 INFO L273 TraceCheckUtils]: 33: Hoare triple {4204#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {4205#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:03,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {4205#(<= main_~a~0 7)} assume true; {4205#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:03,370 INFO L273 TraceCheckUtils]: 35: Hoare triple {4205#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4205#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:03,370 INFO L273 TraceCheckUtils]: 36: Hoare triple {4205#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4205#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:03,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {4205#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {4206#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:03,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {4206#(<= main_~a~0 8)} assume true; {4206#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:03,372 INFO L273 TraceCheckUtils]: 39: Hoare triple {4206#(<= main_~a~0 8)} assume !(~a~0 < 100000); {4197#false} is VALID [2018-11-18 22:47:03,372 INFO L273 TraceCheckUtils]: 40: Hoare triple {4197#false} ~a~0 := 0; {4197#false} is VALID [2018-11-18 22:47:03,373 INFO L273 TraceCheckUtils]: 41: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,373 INFO L273 TraceCheckUtils]: 42: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,373 INFO L273 TraceCheckUtils]: 43: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,373 INFO L273 TraceCheckUtils]: 44: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,373 INFO L273 TraceCheckUtils]: 45: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,374 INFO L273 TraceCheckUtils]: 46: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,374 INFO L273 TraceCheckUtils]: 47: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,374 INFO L273 TraceCheckUtils]: 48: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,374 INFO L273 TraceCheckUtils]: 49: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,374 INFO L273 TraceCheckUtils]: 50: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,375 INFO L273 TraceCheckUtils]: 51: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,375 INFO L273 TraceCheckUtils]: 52: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,375 INFO L273 TraceCheckUtils]: 53: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,375 INFO L273 TraceCheckUtils]: 54: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,375 INFO L273 TraceCheckUtils]: 55: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,376 INFO L273 TraceCheckUtils]: 56: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,376 INFO L273 TraceCheckUtils]: 57: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,376 INFO L273 TraceCheckUtils]: 58: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,376 INFO L273 TraceCheckUtils]: 59: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,376 INFO L273 TraceCheckUtils]: 60: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,376 INFO L273 TraceCheckUtils]: 61: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,376 INFO L273 TraceCheckUtils]: 62: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,377 INFO L273 TraceCheckUtils]: 63: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,377 INFO L273 TraceCheckUtils]: 64: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,377 INFO L273 TraceCheckUtils]: 65: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,377 INFO L273 TraceCheckUtils]: 66: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,377 INFO L273 TraceCheckUtils]: 67: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,377 INFO L273 TraceCheckUtils]: 68: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,378 INFO L273 TraceCheckUtils]: 69: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,378 INFO L273 TraceCheckUtils]: 70: Hoare triple {4197#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,378 INFO L273 TraceCheckUtils]: 71: Hoare triple {4197#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4197#false} is VALID [2018-11-18 22:47:03,378 INFO L273 TraceCheckUtils]: 72: Hoare triple {4197#false} ~a~0 := 1 + ~a~0; {4197#false} is VALID [2018-11-18 22:47:03,378 INFO L273 TraceCheckUtils]: 73: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,378 INFO L273 TraceCheckUtils]: 74: Hoare triple {4197#false} assume !(~a~0 < 100000); {4197#false} is VALID [2018-11-18 22:47:03,379 INFO L273 TraceCheckUtils]: 75: Hoare triple {4197#false} havoc ~x~0;~x~0 := 0; {4197#false} is VALID [2018-11-18 22:47:03,379 INFO L273 TraceCheckUtils]: 76: Hoare triple {4197#false} assume true; {4197#false} is VALID [2018-11-18 22:47:03,379 INFO L273 TraceCheckUtils]: 77: Hoare triple {4197#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {4197#false} is VALID [2018-11-18 22:47:03,379 INFO L256 TraceCheckUtils]: 78: Hoare triple {4197#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {4197#false} is VALID [2018-11-18 22:47:03,379 INFO L273 TraceCheckUtils]: 79: Hoare triple {4197#false} ~cond := #in~cond; {4197#false} is VALID [2018-11-18 22:47:03,379 INFO L273 TraceCheckUtils]: 80: Hoare triple {4197#false} assume 0 == ~cond; {4197#false} is VALID [2018-11-18 22:47:03,380 INFO L273 TraceCheckUtils]: 81: Hoare triple {4197#false} assume !false; {4197#false} is VALID [2018-11-18 22:47:03,384 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-11-18 22:47:03,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:03,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-18 22:47:03,405 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2018-11-18 22:47:03,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:03,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 22:47:03,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:03,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 22:47:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 22:47:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:47:03,458 INFO L87 Difference]: Start difference. First operand 93 states and 113 transitions. Second operand 12 states. [2018-11-18 22:47:03,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:03,992 INFO L93 Difference]: Finished difference Result 158 states and 195 transitions. [2018-11-18 22:47:03,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 22:47:03,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 82 [2018-11-18 22:47:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:47:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2018-11-18 22:47:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 22:47:04,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 158 transitions. [2018-11-18 22:47:04,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 158 transitions. [2018-11-18 22:47:04,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:04,618 INFO L225 Difference]: With dead ends: 158 [2018-11-18 22:47:04,618 INFO L226 Difference]: Without dead ends: 105 [2018-11-18 22:47:04,619 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 22:47:04,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-18 22:47:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2018-11-18 22:47:05,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:05,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 101 states. [2018-11-18 22:47:05,056 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 101 states. [2018-11-18 22:47:05,056 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 101 states. [2018-11-18 22:47:05,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:05,059 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-11-18 22:47:05,059 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2018-11-18 22:47:05,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:05,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:05,060 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 105 states. [2018-11-18 22:47:05,060 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 105 states. [2018-11-18 22:47:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:05,063 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-11-18 22:47:05,063 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2018-11-18 22:47:05,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:05,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:05,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:05,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-18 22:47:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2018-11-18 22:47:05,067 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 82 [2018-11-18 22:47:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:05,068 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2018-11-18 22:47:05,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 22:47:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2018-11-18 22:47:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-18 22:47:05,069 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:05,069 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:05,069 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:05,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:05,070 INFO L82 PathProgramCache]: Analyzing trace with hash 346003667, now seen corresponding path program 9 times [2018-11-18 22:47:05,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:05,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:05,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:05,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:05,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:05,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {4994#true} call ULTIMATE.init(); {4994#true} is VALID [2018-11-18 22:47:05,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {4994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4994#true} is VALID [2018-11-18 22:47:05,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {4994#true} assume true; {4994#true} is VALID [2018-11-18 22:47:05,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4994#true} {4994#true} #95#return; {4994#true} is VALID [2018-11-18 22:47:05,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {4994#true} call #t~ret8 := main(); {4994#true} is VALID [2018-11-18 22:47:05,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {4994#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {4996#(= main_~a~0 0)} is VALID [2018-11-18 22:47:05,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {4996#(= main_~a~0 0)} assume true; {4996#(= main_~a~0 0)} is VALID [2018-11-18 22:47:05,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {4996#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4996#(= main_~a~0 0)} is VALID [2018-11-18 22:47:05,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {4996#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4996#(= main_~a~0 0)} is VALID [2018-11-18 22:47:05,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {4996#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {4997#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:05,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {4997#(<= main_~a~0 1)} assume true; {4997#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:05,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {4997#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4997#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:05,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {4997#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4997#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:05,355 INFO L273 TraceCheckUtils]: 13: Hoare triple {4997#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {4998#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:05,356 INFO L273 TraceCheckUtils]: 14: Hoare triple {4998#(<= main_~a~0 2)} assume true; {4998#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:05,356 INFO L273 TraceCheckUtils]: 15: Hoare triple {4998#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4998#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:05,357 INFO L273 TraceCheckUtils]: 16: Hoare triple {4998#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4998#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:05,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {4998#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {4999#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:05,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {4999#(<= main_~a~0 3)} assume true; {4999#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:05,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {4999#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4999#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:05,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {4999#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4999#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:05,360 INFO L273 TraceCheckUtils]: 21: Hoare triple {4999#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {5000#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:05,361 INFO L273 TraceCheckUtils]: 22: Hoare triple {5000#(<= main_~a~0 4)} assume true; {5000#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:05,361 INFO L273 TraceCheckUtils]: 23: Hoare triple {5000#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5000#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:05,362 INFO L273 TraceCheckUtils]: 24: Hoare triple {5000#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5000#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:05,363 INFO L273 TraceCheckUtils]: 25: Hoare triple {5000#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {5001#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:05,363 INFO L273 TraceCheckUtils]: 26: Hoare triple {5001#(<= main_~a~0 5)} assume true; {5001#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:05,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {5001#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5001#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:05,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {5001#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5001#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:05,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {5001#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {5002#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:05,366 INFO L273 TraceCheckUtils]: 30: Hoare triple {5002#(<= main_~a~0 6)} assume true; {5002#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:05,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {5002#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5002#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:05,367 INFO L273 TraceCheckUtils]: 32: Hoare triple {5002#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5002#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:05,368 INFO L273 TraceCheckUtils]: 33: Hoare triple {5002#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {5003#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:05,369 INFO L273 TraceCheckUtils]: 34: Hoare triple {5003#(<= main_~a~0 7)} assume true; {5003#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:05,369 INFO L273 TraceCheckUtils]: 35: Hoare triple {5003#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5003#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:05,370 INFO L273 TraceCheckUtils]: 36: Hoare triple {5003#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5003#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:05,371 INFO L273 TraceCheckUtils]: 37: Hoare triple {5003#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {5004#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:05,371 INFO L273 TraceCheckUtils]: 38: Hoare triple {5004#(<= main_~a~0 8)} assume true; {5004#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:05,372 INFO L273 TraceCheckUtils]: 39: Hoare triple {5004#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5004#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:05,372 INFO L273 TraceCheckUtils]: 40: Hoare triple {5004#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5004#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:05,373 INFO L273 TraceCheckUtils]: 41: Hoare triple {5004#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {5005#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:05,374 INFO L273 TraceCheckUtils]: 42: Hoare triple {5005#(<= main_~a~0 9)} assume true; {5005#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:05,375 INFO L273 TraceCheckUtils]: 43: Hoare triple {5005#(<= main_~a~0 9)} assume !(~a~0 < 100000); {4995#false} is VALID [2018-11-18 22:47:05,375 INFO L273 TraceCheckUtils]: 44: Hoare triple {4995#false} ~a~0 := 0; {4995#false} is VALID [2018-11-18 22:47:05,375 INFO L273 TraceCheckUtils]: 45: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,375 INFO L273 TraceCheckUtils]: 46: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,376 INFO L273 TraceCheckUtils]: 47: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,376 INFO L273 TraceCheckUtils]: 48: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,376 INFO L273 TraceCheckUtils]: 49: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,376 INFO L273 TraceCheckUtils]: 50: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,377 INFO L273 TraceCheckUtils]: 51: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,377 INFO L273 TraceCheckUtils]: 52: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,377 INFO L273 TraceCheckUtils]: 53: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,377 INFO L273 TraceCheckUtils]: 54: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,377 INFO L273 TraceCheckUtils]: 55: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,378 INFO L273 TraceCheckUtils]: 56: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,378 INFO L273 TraceCheckUtils]: 57: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,378 INFO L273 TraceCheckUtils]: 58: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,378 INFO L273 TraceCheckUtils]: 59: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,378 INFO L273 TraceCheckUtils]: 60: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,379 INFO L273 TraceCheckUtils]: 61: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,379 INFO L273 TraceCheckUtils]: 62: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,379 INFO L273 TraceCheckUtils]: 63: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,379 INFO L273 TraceCheckUtils]: 64: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,379 INFO L273 TraceCheckUtils]: 65: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,380 INFO L273 TraceCheckUtils]: 66: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,380 INFO L273 TraceCheckUtils]: 67: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,380 INFO L273 TraceCheckUtils]: 68: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,380 INFO L273 TraceCheckUtils]: 69: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,381 INFO L273 TraceCheckUtils]: 70: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,381 INFO L273 TraceCheckUtils]: 71: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,381 INFO L273 TraceCheckUtils]: 72: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,381 INFO L273 TraceCheckUtils]: 73: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,381 INFO L273 TraceCheckUtils]: 74: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,382 INFO L273 TraceCheckUtils]: 75: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,382 INFO L273 TraceCheckUtils]: 76: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,382 INFO L273 TraceCheckUtils]: 77: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,382 INFO L273 TraceCheckUtils]: 78: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,383 INFO L273 TraceCheckUtils]: 79: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,383 INFO L273 TraceCheckUtils]: 80: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,383 INFO L273 TraceCheckUtils]: 81: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,383 INFO L273 TraceCheckUtils]: 82: Hoare triple {4995#false} assume !(~a~0 < 100000); {4995#false} is VALID [2018-11-18 22:47:05,383 INFO L273 TraceCheckUtils]: 83: Hoare triple {4995#false} havoc ~x~0;~x~0 := 0; {4995#false} is VALID [2018-11-18 22:47:05,384 INFO L273 TraceCheckUtils]: 84: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,384 INFO L273 TraceCheckUtils]: 85: Hoare triple {4995#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,384 INFO L256 TraceCheckUtils]: 86: Hoare triple {4995#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {4995#false} is VALID [2018-11-18 22:47:05,384 INFO L273 TraceCheckUtils]: 87: Hoare triple {4995#false} ~cond := #in~cond; {4995#false} is VALID [2018-11-18 22:47:05,384 INFO L273 TraceCheckUtils]: 88: Hoare triple {4995#false} assume 0 == ~cond; {4995#false} is VALID [2018-11-18 22:47:05,385 INFO L273 TraceCheckUtils]: 89: Hoare triple {4995#false} assume !false; {4995#false} is VALID [2018-11-18 22:47:05,395 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-18 22:47:05,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:05,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:05,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:47:05,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-18 22:47:05,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:05,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:05,715 INFO L256 TraceCheckUtils]: 0: Hoare triple {4994#true} call ULTIMATE.init(); {4994#true} is VALID [2018-11-18 22:47:05,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {4994#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4994#true} is VALID [2018-11-18 22:47:05,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {4994#true} assume true; {4994#true} is VALID [2018-11-18 22:47:05,716 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4994#true} {4994#true} #95#return; {4994#true} is VALID [2018-11-18 22:47:05,716 INFO L256 TraceCheckUtils]: 4: Hoare triple {4994#true} call #t~ret8 := main(); {4994#true} is VALID [2018-11-18 22:47:05,717 INFO L273 TraceCheckUtils]: 5: Hoare triple {4994#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {5024#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:05,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {5024#(<= main_~a~0 0)} assume true; {5024#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:05,718 INFO L273 TraceCheckUtils]: 7: Hoare triple {5024#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5024#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:05,718 INFO L273 TraceCheckUtils]: 8: Hoare triple {5024#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5024#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:05,719 INFO L273 TraceCheckUtils]: 9: Hoare triple {5024#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {4997#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:05,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {4997#(<= main_~a~0 1)} assume true; {4997#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:05,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {4997#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4997#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:05,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {4997#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4997#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:05,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {4997#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {4998#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:05,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {4998#(<= main_~a~0 2)} assume true; {4998#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:05,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {4998#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4998#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:05,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {4998#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4998#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:05,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {4998#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {4999#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:05,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {4999#(<= main_~a~0 3)} assume true; {4999#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:05,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {4999#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4999#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:05,725 INFO L273 TraceCheckUtils]: 20: Hoare triple {4999#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {4999#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:05,726 INFO L273 TraceCheckUtils]: 21: Hoare triple {4999#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {5000#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:05,726 INFO L273 TraceCheckUtils]: 22: Hoare triple {5000#(<= main_~a~0 4)} assume true; {5000#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:05,727 INFO L273 TraceCheckUtils]: 23: Hoare triple {5000#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5000#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:05,727 INFO L273 TraceCheckUtils]: 24: Hoare triple {5000#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5000#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:05,728 INFO L273 TraceCheckUtils]: 25: Hoare triple {5000#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {5001#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:05,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {5001#(<= main_~a~0 5)} assume true; {5001#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:05,729 INFO L273 TraceCheckUtils]: 27: Hoare triple {5001#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5001#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:05,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {5001#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5001#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:05,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {5001#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {5002#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:05,731 INFO L273 TraceCheckUtils]: 30: Hoare triple {5002#(<= main_~a~0 6)} assume true; {5002#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:05,731 INFO L273 TraceCheckUtils]: 31: Hoare triple {5002#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5002#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:05,732 INFO L273 TraceCheckUtils]: 32: Hoare triple {5002#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5002#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:05,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {5002#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {5003#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:05,733 INFO L273 TraceCheckUtils]: 34: Hoare triple {5003#(<= main_~a~0 7)} assume true; {5003#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:05,733 INFO L273 TraceCheckUtils]: 35: Hoare triple {5003#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5003#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:05,734 INFO L273 TraceCheckUtils]: 36: Hoare triple {5003#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5003#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:05,734 INFO L273 TraceCheckUtils]: 37: Hoare triple {5003#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {5004#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:05,735 INFO L273 TraceCheckUtils]: 38: Hoare triple {5004#(<= main_~a~0 8)} assume true; {5004#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:05,735 INFO L273 TraceCheckUtils]: 39: Hoare triple {5004#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5004#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:05,736 INFO L273 TraceCheckUtils]: 40: Hoare triple {5004#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5004#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:05,737 INFO L273 TraceCheckUtils]: 41: Hoare triple {5004#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {5005#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:05,737 INFO L273 TraceCheckUtils]: 42: Hoare triple {5005#(<= main_~a~0 9)} assume true; {5005#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:05,738 INFO L273 TraceCheckUtils]: 43: Hoare triple {5005#(<= main_~a~0 9)} assume !(~a~0 < 100000); {4995#false} is VALID [2018-11-18 22:47:05,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {4995#false} ~a~0 := 0; {4995#false} is VALID [2018-11-18 22:47:05,738 INFO L273 TraceCheckUtils]: 45: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,738 INFO L273 TraceCheckUtils]: 46: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,739 INFO L273 TraceCheckUtils]: 47: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,739 INFO L273 TraceCheckUtils]: 48: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,739 INFO L273 TraceCheckUtils]: 49: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,739 INFO L273 TraceCheckUtils]: 50: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,739 INFO L273 TraceCheckUtils]: 51: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,740 INFO L273 TraceCheckUtils]: 52: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,740 INFO L273 TraceCheckUtils]: 53: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,740 INFO L273 TraceCheckUtils]: 54: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,740 INFO L273 TraceCheckUtils]: 55: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,740 INFO L273 TraceCheckUtils]: 56: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,741 INFO L273 TraceCheckUtils]: 57: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,741 INFO L273 TraceCheckUtils]: 58: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,741 INFO L273 TraceCheckUtils]: 59: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,741 INFO L273 TraceCheckUtils]: 60: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,741 INFO L273 TraceCheckUtils]: 61: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,741 INFO L273 TraceCheckUtils]: 62: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,741 INFO L273 TraceCheckUtils]: 63: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,741 INFO L273 TraceCheckUtils]: 64: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,742 INFO L273 TraceCheckUtils]: 65: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,742 INFO L273 TraceCheckUtils]: 66: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,742 INFO L273 TraceCheckUtils]: 67: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,742 INFO L273 TraceCheckUtils]: 68: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,742 INFO L273 TraceCheckUtils]: 69: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,742 INFO L273 TraceCheckUtils]: 70: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,742 INFO L273 TraceCheckUtils]: 71: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,742 INFO L273 TraceCheckUtils]: 72: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,743 INFO L273 TraceCheckUtils]: 73: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,743 INFO L273 TraceCheckUtils]: 74: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,743 INFO L273 TraceCheckUtils]: 75: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,743 INFO L273 TraceCheckUtils]: 76: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,743 INFO L273 TraceCheckUtils]: 77: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,743 INFO L273 TraceCheckUtils]: 78: Hoare triple {4995#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,743 INFO L273 TraceCheckUtils]: 79: Hoare triple {4995#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {4995#false} is VALID [2018-11-18 22:47:05,743 INFO L273 TraceCheckUtils]: 80: Hoare triple {4995#false} ~a~0 := 1 + ~a~0; {4995#false} is VALID [2018-11-18 22:47:05,744 INFO L273 TraceCheckUtils]: 81: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,744 INFO L273 TraceCheckUtils]: 82: Hoare triple {4995#false} assume !(~a~0 < 100000); {4995#false} is VALID [2018-11-18 22:47:05,744 INFO L273 TraceCheckUtils]: 83: Hoare triple {4995#false} havoc ~x~0;~x~0 := 0; {4995#false} is VALID [2018-11-18 22:47:05,744 INFO L273 TraceCheckUtils]: 84: Hoare triple {4995#false} assume true; {4995#false} is VALID [2018-11-18 22:47:05,744 INFO L273 TraceCheckUtils]: 85: Hoare triple {4995#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {4995#false} is VALID [2018-11-18 22:47:05,744 INFO L256 TraceCheckUtils]: 86: Hoare triple {4995#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {4995#false} is VALID [2018-11-18 22:47:05,744 INFO L273 TraceCheckUtils]: 87: Hoare triple {4995#false} ~cond := #in~cond; {4995#false} is VALID [2018-11-18 22:47:05,744 INFO L273 TraceCheckUtils]: 88: Hoare triple {4995#false} assume 0 == ~cond; {4995#false} is VALID [2018-11-18 22:47:05,745 INFO L273 TraceCheckUtils]: 89: Hoare triple {4995#false} assume !false; {4995#false} is VALID [2018-11-18 22:47:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-18 22:47:05,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:05,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-18 22:47:05,772 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2018-11-18 22:47:05,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:05,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 22:47:05,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:05,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 22:47:05,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 22:47:05,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:47:05,827 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand 13 states. [2018-11-18 22:47:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:06,563 INFO L93 Difference]: Finished difference Result 170 states and 210 transitions. [2018-11-18 22:47:06,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 22:47:06,563 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2018-11-18 22:47:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:47:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2018-11-18 22:47:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 22:47:06,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 168 transitions. [2018-11-18 22:47:06,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 168 transitions. [2018-11-18 22:47:06,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:06,752 INFO L225 Difference]: With dead ends: 170 [2018-11-18 22:47:06,752 INFO L226 Difference]: Without dead ends: 113 [2018-11-18 22:47:06,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-18 22:47:06,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-18 22:47:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2018-11-18 22:47:06,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:06,840 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 109 states. [2018-11-18 22:47:06,840 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 109 states. [2018-11-18 22:47:06,840 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 109 states. [2018-11-18 22:47:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:06,842 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2018-11-18 22:47:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2018-11-18 22:47:06,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:06,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:06,843 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 113 states. [2018-11-18 22:47:06,843 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 113 states. [2018-11-18 22:47:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:06,845 INFO L93 Difference]: Finished difference Result 113 states and 139 transitions. [2018-11-18 22:47:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 139 transitions. [2018-11-18 22:47:06,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:06,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:06,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:06,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-18 22:47:06,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2018-11-18 22:47:06,848 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 90 [2018-11-18 22:47:06,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:06,848 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2018-11-18 22:47:06,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 22:47:06,849 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2018-11-18 22:47:06,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-18 22:47:06,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:06,850 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:06,850 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:06,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:06,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1442881069, now seen corresponding path program 10 times [2018-11-18 22:47:06,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:06,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:06,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:06,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:06,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:07,469 INFO L256 TraceCheckUtils]: 0: Hoare triple {5858#true} call ULTIMATE.init(); {5858#true} is VALID [2018-11-18 22:47:07,470 INFO L273 TraceCheckUtils]: 1: Hoare triple {5858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5858#true} is VALID [2018-11-18 22:47:07,470 INFO L273 TraceCheckUtils]: 2: Hoare triple {5858#true} assume true; {5858#true} is VALID [2018-11-18 22:47:07,470 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5858#true} {5858#true} #95#return; {5858#true} is VALID [2018-11-18 22:47:07,470 INFO L256 TraceCheckUtils]: 4: Hoare triple {5858#true} call #t~ret8 := main(); {5858#true} is VALID [2018-11-18 22:47:07,470 INFO L273 TraceCheckUtils]: 5: Hoare triple {5858#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {5860#(= main_~a~0 0)} is VALID [2018-11-18 22:47:07,471 INFO L273 TraceCheckUtils]: 6: Hoare triple {5860#(= main_~a~0 0)} assume true; {5860#(= main_~a~0 0)} is VALID [2018-11-18 22:47:07,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {5860#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5860#(= main_~a~0 0)} is VALID [2018-11-18 22:47:07,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {5860#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5860#(= main_~a~0 0)} is VALID [2018-11-18 22:47:07,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {5860#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {5861#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:07,472 INFO L273 TraceCheckUtils]: 10: Hoare triple {5861#(<= main_~a~0 1)} assume true; {5861#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:07,472 INFO L273 TraceCheckUtils]: 11: Hoare triple {5861#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5861#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:07,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {5861#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5861#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:07,473 INFO L273 TraceCheckUtils]: 13: Hoare triple {5861#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {5862#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:07,474 INFO L273 TraceCheckUtils]: 14: Hoare triple {5862#(<= main_~a~0 2)} assume true; {5862#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:07,474 INFO L273 TraceCheckUtils]: 15: Hoare triple {5862#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5862#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:07,475 INFO L273 TraceCheckUtils]: 16: Hoare triple {5862#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5862#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:07,475 INFO L273 TraceCheckUtils]: 17: Hoare triple {5862#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {5863#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:07,476 INFO L273 TraceCheckUtils]: 18: Hoare triple {5863#(<= main_~a~0 3)} assume true; {5863#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:07,476 INFO L273 TraceCheckUtils]: 19: Hoare triple {5863#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5863#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:07,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {5863#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5863#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:07,478 INFO L273 TraceCheckUtils]: 21: Hoare triple {5863#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {5864#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:07,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {5864#(<= main_~a~0 4)} assume true; {5864#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:07,479 INFO L273 TraceCheckUtils]: 23: Hoare triple {5864#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5864#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:07,479 INFO L273 TraceCheckUtils]: 24: Hoare triple {5864#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5864#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:07,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {5864#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {5865#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:07,480 INFO L273 TraceCheckUtils]: 26: Hoare triple {5865#(<= main_~a~0 5)} assume true; {5865#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:07,481 INFO L273 TraceCheckUtils]: 27: Hoare triple {5865#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5865#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:07,481 INFO L273 TraceCheckUtils]: 28: Hoare triple {5865#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5865#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:07,482 INFO L273 TraceCheckUtils]: 29: Hoare triple {5865#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {5866#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:07,483 INFO L273 TraceCheckUtils]: 30: Hoare triple {5866#(<= main_~a~0 6)} assume true; {5866#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:07,483 INFO L273 TraceCheckUtils]: 31: Hoare triple {5866#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5866#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:07,484 INFO L273 TraceCheckUtils]: 32: Hoare triple {5866#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5866#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:07,484 INFO L273 TraceCheckUtils]: 33: Hoare triple {5866#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {5867#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:07,485 INFO L273 TraceCheckUtils]: 34: Hoare triple {5867#(<= main_~a~0 7)} assume true; {5867#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:07,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {5867#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5867#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:07,486 INFO L273 TraceCheckUtils]: 36: Hoare triple {5867#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5867#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:07,486 INFO L273 TraceCheckUtils]: 37: Hoare triple {5867#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {5868#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:07,487 INFO L273 TraceCheckUtils]: 38: Hoare triple {5868#(<= main_~a~0 8)} assume true; {5868#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:07,487 INFO L273 TraceCheckUtils]: 39: Hoare triple {5868#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5868#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:07,488 INFO L273 TraceCheckUtils]: 40: Hoare triple {5868#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5868#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:07,489 INFO L273 TraceCheckUtils]: 41: Hoare triple {5868#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {5869#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:07,489 INFO L273 TraceCheckUtils]: 42: Hoare triple {5869#(<= main_~a~0 9)} assume true; {5869#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:07,490 INFO L273 TraceCheckUtils]: 43: Hoare triple {5869#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5869#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:07,490 INFO L273 TraceCheckUtils]: 44: Hoare triple {5869#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5869#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:07,491 INFO L273 TraceCheckUtils]: 45: Hoare triple {5869#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {5870#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:07,491 INFO L273 TraceCheckUtils]: 46: Hoare triple {5870#(<= main_~a~0 10)} assume true; {5870#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:07,492 INFO L273 TraceCheckUtils]: 47: Hoare triple {5870#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5859#false} is VALID [2018-11-18 22:47:07,492 INFO L273 TraceCheckUtils]: 48: Hoare triple {5859#false} ~a~0 := 0; {5859#false} is VALID [2018-11-18 22:47:07,492 INFO L273 TraceCheckUtils]: 49: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,493 INFO L273 TraceCheckUtils]: 50: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,493 INFO L273 TraceCheckUtils]: 51: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:07,493 INFO L273 TraceCheckUtils]: 52: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:07,494 INFO L273 TraceCheckUtils]: 53: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,494 INFO L273 TraceCheckUtils]: 54: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,494 INFO L273 TraceCheckUtils]: 55: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:07,494 INFO L273 TraceCheckUtils]: 56: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:07,494 INFO L273 TraceCheckUtils]: 57: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,495 INFO L273 TraceCheckUtils]: 58: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,495 INFO L273 TraceCheckUtils]: 59: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:07,495 INFO L273 TraceCheckUtils]: 60: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:07,495 INFO L273 TraceCheckUtils]: 61: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,495 INFO L273 TraceCheckUtils]: 62: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,496 INFO L273 TraceCheckUtils]: 63: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:07,496 INFO L273 TraceCheckUtils]: 64: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:07,496 INFO L273 TraceCheckUtils]: 65: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,496 INFO L273 TraceCheckUtils]: 66: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,496 INFO L273 TraceCheckUtils]: 67: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:07,496 INFO L273 TraceCheckUtils]: 68: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:07,497 INFO L273 TraceCheckUtils]: 69: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,497 INFO L273 TraceCheckUtils]: 70: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,497 INFO L273 TraceCheckUtils]: 71: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:07,497 INFO L273 TraceCheckUtils]: 72: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:07,497 INFO L273 TraceCheckUtils]: 73: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,497 INFO L273 TraceCheckUtils]: 74: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,498 INFO L273 TraceCheckUtils]: 75: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:07,498 INFO L273 TraceCheckUtils]: 76: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:07,498 INFO L273 TraceCheckUtils]: 77: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,498 INFO L273 TraceCheckUtils]: 78: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,498 INFO L273 TraceCheckUtils]: 79: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:07,498 INFO L273 TraceCheckUtils]: 80: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:07,499 INFO L273 TraceCheckUtils]: 81: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,499 INFO L273 TraceCheckUtils]: 82: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,499 INFO L273 TraceCheckUtils]: 83: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:07,499 INFO L273 TraceCheckUtils]: 84: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:07,499 INFO L273 TraceCheckUtils]: 85: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,499 INFO L273 TraceCheckUtils]: 86: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,500 INFO L273 TraceCheckUtils]: 87: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:07,500 INFO L273 TraceCheckUtils]: 88: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:07,500 INFO L273 TraceCheckUtils]: 89: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,500 INFO L273 TraceCheckUtils]: 90: Hoare triple {5859#false} assume !(~a~0 < 100000); {5859#false} is VALID [2018-11-18 22:47:07,500 INFO L273 TraceCheckUtils]: 91: Hoare triple {5859#false} havoc ~x~0;~x~0 := 0; {5859#false} is VALID [2018-11-18 22:47:07,500 INFO L273 TraceCheckUtils]: 92: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:07,501 INFO L273 TraceCheckUtils]: 93: Hoare triple {5859#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {5859#false} is VALID [2018-11-18 22:47:07,501 INFO L256 TraceCheckUtils]: 94: Hoare triple {5859#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {5859#false} is VALID [2018-11-18 22:47:07,501 INFO L273 TraceCheckUtils]: 95: Hoare triple {5859#false} ~cond := #in~cond; {5859#false} is VALID [2018-11-18 22:47:07,501 INFO L273 TraceCheckUtils]: 96: Hoare triple {5859#false} assume 0 == ~cond; {5859#false} is VALID [2018-11-18 22:47:07,501 INFO L273 TraceCheckUtils]: 97: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2018-11-18 22:47:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 22:47:07,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:07,508 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:07,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:47:08,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:47:08,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:08,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:08,374 INFO L256 TraceCheckUtils]: 0: Hoare triple {5858#true} call ULTIMATE.init(); {5858#true} is VALID [2018-11-18 22:47:08,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {5858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5858#true} is VALID [2018-11-18 22:47:08,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {5858#true} assume true; {5858#true} is VALID [2018-11-18 22:47:08,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5858#true} {5858#true} #95#return; {5858#true} is VALID [2018-11-18 22:47:08,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {5858#true} call #t~ret8 := main(); {5858#true} is VALID [2018-11-18 22:47:08,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {5858#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {5889#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:08,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {5889#(<= main_~a~0 0)} assume true; {5889#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:08,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {5889#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5889#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:08,377 INFO L273 TraceCheckUtils]: 8: Hoare triple {5889#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5889#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:08,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {5889#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {5861#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:08,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {5861#(<= main_~a~0 1)} assume true; {5861#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:08,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {5861#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5861#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:08,379 INFO L273 TraceCheckUtils]: 12: Hoare triple {5861#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5861#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:08,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {5861#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {5862#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:08,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {5862#(<= main_~a~0 2)} assume true; {5862#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:08,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {5862#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5862#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:08,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {5862#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5862#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:08,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {5862#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {5863#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:08,382 INFO L273 TraceCheckUtils]: 18: Hoare triple {5863#(<= main_~a~0 3)} assume true; {5863#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:08,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {5863#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5863#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:08,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {5863#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5863#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:08,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {5863#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {5864#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:08,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {5864#(<= main_~a~0 4)} assume true; {5864#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:08,385 INFO L273 TraceCheckUtils]: 23: Hoare triple {5864#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5864#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:08,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {5864#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5864#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:08,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {5864#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {5865#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:08,387 INFO L273 TraceCheckUtils]: 26: Hoare triple {5865#(<= main_~a~0 5)} assume true; {5865#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:08,387 INFO L273 TraceCheckUtils]: 27: Hoare triple {5865#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5865#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:08,388 INFO L273 TraceCheckUtils]: 28: Hoare triple {5865#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5865#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:08,388 INFO L273 TraceCheckUtils]: 29: Hoare triple {5865#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {5866#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:08,389 INFO L273 TraceCheckUtils]: 30: Hoare triple {5866#(<= main_~a~0 6)} assume true; {5866#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:08,389 INFO L273 TraceCheckUtils]: 31: Hoare triple {5866#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5866#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:08,390 INFO L273 TraceCheckUtils]: 32: Hoare triple {5866#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5866#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:08,391 INFO L273 TraceCheckUtils]: 33: Hoare triple {5866#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {5867#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:08,391 INFO L273 TraceCheckUtils]: 34: Hoare triple {5867#(<= main_~a~0 7)} assume true; {5867#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:08,392 INFO L273 TraceCheckUtils]: 35: Hoare triple {5867#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5867#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:08,392 INFO L273 TraceCheckUtils]: 36: Hoare triple {5867#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5867#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:08,393 INFO L273 TraceCheckUtils]: 37: Hoare triple {5867#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {5868#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:08,393 INFO L273 TraceCheckUtils]: 38: Hoare triple {5868#(<= main_~a~0 8)} assume true; {5868#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:08,394 INFO L273 TraceCheckUtils]: 39: Hoare triple {5868#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5868#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:08,394 INFO L273 TraceCheckUtils]: 40: Hoare triple {5868#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5868#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:08,395 INFO L273 TraceCheckUtils]: 41: Hoare triple {5868#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {5869#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:08,396 INFO L273 TraceCheckUtils]: 42: Hoare triple {5869#(<= main_~a~0 9)} assume true; {5869#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:08,396 INFO L273 TraceCheckUtils]: 43: Hoare triple {5869#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5869#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:08,397 INFO L273 TraceCheckUtils]: 44: Hoare triple {5869#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {5869#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:08,397 INFO L273 TraceCheckUtils]: 45: Hoare triple {5869#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {5870#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:08,398 INFO L273 TraceCheckUtils]: 46: Hoare triple {5870#(<= main_~a~0 10)} assume true; {5870#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:08,398 INFO L273 TraceCheckUtils]: 47: Hoare triple {5870#(<= main_~a~0 10)} assume !(~a~0 < 100000); {5859#false} is VALID [2018-11-18 22:47:08,399 INFO L273 TraceCheckUtils]: 48: Hoare triple {5859#false} ~a~0 := 0; {5859#false} is VALID [2018-11-18 22:47:08,399 INFO L273 TraceCheckUtils]: 49: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,399 INFO L273 TraceCheckUtils]: 50: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,399 INFO L273 TraceCheckUtils]: 51: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:08,399 INFO L273 TraceCheckUtils]: 52: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:08,400 INFO L273 TraceCheckUtils]: 53: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,400 INFO L273 TraceCheckUtils]: 54: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,400 INFO L273 TraceCheckUtils]: 55: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:08,400 INFO L273 TraceCheckUtils]: 56: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:08,400 INFO L273 TraceCheckUtils]: 57: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,401 INFO L273 TraceCheckUtils]: 58: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,401 INFO L273 TraceCheckUtils]: 59: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:08,401 INFO L273 TraceCheckUtils]: 60: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:08,401 INFO L273 TraceCheckUtils]: 61: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,401 INFO L273 TraceCheckUtils]: 62: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,401 INFO L273 TraceCheckUtils]: 63: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:08,402 INFO L273 TraceCheckUtils]: 64: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:08,402 INFO L273 TraceCheckUtils]: 65: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,402 INFO L273 TraceCheckUtils]: 66: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,402 INFO L273 TraceCheckUtils]: 67: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:08,402 INFO L273 TraceCheckUtils]: 68: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:08,402 INFO L273 TraceCheckUtils]: 69: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,402 INFO L273 TraceCheckUtils]: 70: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,403 INFO L273 TraceCheckUtils]: 71: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:08,403 INFO L273 TraceCheckUtils]: 72: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:08,403 INFO L273 TraceCheckUtils]: 73: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,403 INFO L273 TraceCheckUtils]: 74: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,403 INFO L273 TraceCheckUtils]: 75: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:08,403 INFO L273 TraceCheckUtils]: 76: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:08,403 INFO L273 TraceCheckUtils]: 77: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,403 INFO L273 TraceCheckUtils]: 78: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,404 INFO L273 TraceCheckUtils]: 79: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:08,404 INFO L273 TraceCheckUtils]: 80: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:08,404 INFO L273 TraceCheckUtils]: 81: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,404 INFO L273 TraceCheckUtils]: 82: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,404 INFO L273 TraceCheckUtils]: 83: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:08,404 INFO L273 TraceCheckUtils]: 84: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:08,404 INFO L273 TraceCheckUtils]: 85: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,404 INFO L273 TraceCheckUtils]: 86: Hoare triple {5859#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,404 INFO L273 TraceCheckUtils]: 87: Hoare triple {5859#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {5859#false} is VALID [2018-11-18 22:47:08,405 INFO L273 TraceCheckUtils]: 88: Hoare triple {5859#false} ~a~0 := 1 + ~a~0; {5859#false} is VALID [2018-11-18 22:47:08,405 INFO L273 TraceCheckUtils]: 89: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,405 INFO L273 TraceCheckUtils]: 90: Hoare triple {5859#false} assume !(~a~0 < 100000); {5859#false} is VALID [2018-11-18 22:47:08,405 INFO L273 TraceCheckUtils]: 91: Hoare triple {5859#false} havoc ~x~0;~x~0 := 0; {5859#false} is VALID [2018-11-18 22:47:08,405 INFO L273 TraceCheckUtils]: 92: Hoare triple {5859#false} assume true; {5859#false} is VALID [2018-11-18 22:47:08,405 INFO L273 TraceCheckUtils]: 93: Hoare triple {5859#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {5859#false} is VALID [2018-11-18 22:47:08,405 INFO L256 TraceCheckUtils]: 94: Hoare triple {5859#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {5859#false} is VALID [2018-11-18 22:47:08,405 INFO L273 TraceCheckUtils]: 95: Hoare triple {5859#false} ~cond := #in~cond; {5859#false} is VALID [2018-11-18 22:47:08,406 INFO L273 TraceCheckUtils]: 96: Hoare triple {5859#false} assume 0 == ~cond; {5859#false} is VALID [2018-11-18 22:47:08,406 INFO L273 TraceCheckUtils]: 97: Hoare triple {5859#false} assume !false; {5859#false} is VALID [2018-11-18 22:47:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-18 22:47:08,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:08,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-18 22:47:08,432 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2018-11-18 22:47:08,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:08,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 22:47:08,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:08,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 22:47:08,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 22:47:08,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:47:08,493 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand 14 states. [2018-11-18 22:47:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:09,203 INFO L93 Difference]: Finished difference Result 182 states and 225 transitions. [2018-11-18 22:47:09,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 22:47:09,204 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2018-11-18 22:47:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:09,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:47:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2018-11-18 22:47:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 22:47:09,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 178 transitions. [2018-11-18 22:47:09,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 178 transitions. [2018-11-18 22:47:10,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:10,005 INFO L225 Difference]: With dead ends: 182 [2018-11-18 22:47:10,006 INFO L226 Difference]: Without dead ends: 121 [2018-11-18 22:47:10,006 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-18 22:47:10,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-18 22:47:10,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2018-11-18 22:47:10,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:10,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 117 states. [2018-11-18 22:47:10,043 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 117 states. [2018-11-18 22:47:10,043 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 117 states. [2018-11-18 22:47:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:10,047 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2018-11-18 22:47:10,047 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2018-11-18 22:47:10,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:10,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:10,047 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 121 states. [2018-11-18 22:47:10,048 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 121 states. [2018-11-18 22:47:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:10,050 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2018-11-18 22:47:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 149 transitions. [2018-11-18 22:47:10,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:10,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:10,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:10,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 22:47:10,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2018-11-18 22:47:10,054 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 98 [2018-11-18 22:47:10,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:10,055 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2018-11-18 22:47:10,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 22:47:10,055 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2018-11-18 22:47:10,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-18 22:47:10,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:10,056 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:10,057 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:10,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:10,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1343234259, now seen corresponding path program 11 times [2018-11-18 22:47:10,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:10,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:10,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:10,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:10,700 INFO L256 TraceCheckUtils]: 0: Hoare triple {6788#true} call ULTIMATE.init(); {6788#true} is VALID [2018-11-18 22:47:10,700 INFO L273 TraceCheckUtils]: 1: Hoare triple {6788#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6788#true} is VALID [2018-11-18 22:47:10,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:10,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6788#true} {6788#true} #95#return; {6788#true} is VALID [2018-11-18 22:47:10,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {6788#true} call #t~ret8 := main(); {6788#true} is VALID [2018-11-18 22:47:10,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {6788#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {6790#(= main_~a~0 0)} is VALID [2018-11-18 22:47:10,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {6790#(= main_~a~0 0)} assume true; {6790#(= main_~a~0 0)} is VALID [2018-11-18 22:47:10,703 INFO L273 TraceCheckUtils]: 7: Hoare triple {6790#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6790#(= main_~a~0 0)} is VALID [2018-11-18 22:47:10,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {6790#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6790#(= main_~a~0 0)} is VALID [2018-11-18 22:47:10,703 INFO L273 TraceCheckUtils]: 9: Hoare triple {6790#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {6791#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:10,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {6791#(<= main_~a~0 1)} assume true; {6791#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:10,704 INFO L273 TraceCheckUtils]: 11: Hoare triple {6791#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6791#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:10,704 INFO L273 TraceCheckUtils]: 12: Hoare triple {6791#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6791#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:10,705 INFO L273 TraceCheckUtils]: 13: Hoare triple {6791#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {6792#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:10,705 INFO L273 TraceCheckUtils]: 14: Hoare triple {6792#(<= main_~a~0 2)} assume true; {6792#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:10,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {6792#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6792#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:10,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {6792#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6792#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:10,707 INFO L273 TraceCheckUtils]: 17: Hoare triple {6792#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {6793#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:10,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {6793#(<= main_~a~0 3)} assume true; {6793#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:10,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {6793#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6793#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:10,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {6793#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6793#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:10,709 INFO L273 TraceCheckUtils]: 21: Hoare triple {6793#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {6794#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:10,709 INFO L273 TraceCheckUtils]: 22: Hoare triple {6794#(<= main_~a~0 4)} assume true; {6794#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:10,710 INFO L273 TraceCheckUtils]: 23: Hoare triple {6794#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6794#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:10,710 INFO L273 TraceCheckUtils]: 24: Hoare triple {6794#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6794#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:10,711 INFO L273 TraceCheckUtils]: 25: Hoare triple {6794#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {6795#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:10,711 INFO L273 TraceCheckUtils]: 26: Hoare triple {6795#(<= main_~a~0 5)} assume true; {6795#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:10,712 INFO L273 TraceCheckUtils]: 27: Hoare triple {6795#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6795#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:10,712 INFO L273 TraceCheckUtils]: 28: Hoare triple {6795#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6795#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:10,713 INFO L273 TraceCheckUtils]: 29: Hoare triple {6795#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {6796#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:10,714 INFO L273 TraceCheckUtils]: 30: Hoare triple {6796#(<= main_~a~0 6)} assume true; {6796#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:10,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {6796#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6796#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:10,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {6796#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6796#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:10,715 INFO L273 TraceCheckUtils]: 33: Hoare triple {6796#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {6797#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:10,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {6797#(<= main_~a~0 7)} assume true; {6797#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:10,716 INFO L273 TraceCheckUtils]: 35: Hoare triple {6797#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6797#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:10,717 INFO L273 TraceCheckUtils]: 36: Hoare triple {6797#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6797#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:10,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {6797#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {6798#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:10,718 INFO L273 TraceCheckUtils]: 38: Hoare triple {6798#(<= main_~a~0 8)} assume true; {6798#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:10,718 INFO L273 TraceCheckUtils]: 39: Hoare triple {6798#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6798#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:10,719 INFO L273 TraceCheckUtils]: 40: Hoare triple {6798#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6798#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:10,720 INFO L273 TraceCheckUtils]: 41: Hoare triple {6798#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {6799#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:10,720 INFO L273 TraceCheckUtils]: 42: Hoare triple {6799#(<= main_~a~0 9)} assume true; {6799#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:10,721 INFO L273 TraceCheckUtils]: 43: Hoare triple {6799#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6799#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:10,721 INFO L273 TraceCheckUtils]: 44: Hoare triple {6799#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6799#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:10,722 INFO L273 TraceCheckUtils]: 45: Hoare triple {6799#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {6800#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:10,722 INFO L273 TraceCheckUtils]: 46: Hoare triple {6800#(<= main_~a~0 10)} assume true; {6800#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:10,723 INFO L273 TraceCheckUtils]: 47: Hoare triple {6800#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6800#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:10,723 INFO L273 TraceCheckUtils]: 48: Hoare triple {6800#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6800#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:10,724 INFO L273 TraceCheckUtils]: 49: Hoare triple {6800#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {6801#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:10,724 INFO L273 TraceCheckUtils]: 50: Hoare triple {6801#(<= main_~a~0 11)} assume true; {6801#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:10,725 INFO L273 TraceCheckUtils]: 51: Hoare triple {6801#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6789#false} is VALID [2018-11-18 22:47:10,725 INFO L273 TraceCheckUtils]: 52: Hoare triple {6789#false} ~a~0 := 0; {6789#false} is VALID [2018-11-18 22:47:10,726 INFO L273 TraceCheckUtils]: 53: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,726 INFO L273 TraceCheckUtils]: 54: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,726 INFO L273 TraceCheckUtils]: 55: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,726 INFO L273 TraceCheckUtils]: 56: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,726 INFO L273 TraceCheckUtils]: 57: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,727 INFO L273 TraceCheckUtils]: 58: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,727 INFO L273 TraceCheckUtils]: 59: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,727 INFO L273 TraceCheckUtils]: 60: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,727 INFO L273 TraceCheckUtils]: 61: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,727 INFO L273 TraceCheckUtils]: 62: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,727 INFO L273 TraceCheckUtils]: 63: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,728 INFO L273 TraceCheckUtils]: 64: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,728 INFO L273 TraceCheckUtils]: 65: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,728 INFO L273 TraceCheckUtils]: 66: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,728 INFO L273 TraceCheckUtils]: 67: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,728 INFO L273 TraceCheckUtils]: 68: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,728 INFO L273 TraceCheckUtils]: 69: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,728 INFO L273 TraceCheckUtils]: 70: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,728 INFO L273 TraceCheckUtils]: 71: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,729 INFO L273 TraceCheckUtils]: 72: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,729 INFO L273 TraceCheckUtils]: 73: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,729 INFO L273 TraceCheckUtils]: 74: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,729 INFO L273 TraceCheckUtils]: 75: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,729 INFO L273 TraceCheckUtils]: 76: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,730 INFO L273 TraceCheckUtils]: 77: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,730 INFO L273 TraceCheckUtils]: 78: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,730 INFO L273 TraceCheckUtils]: 79: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,730 INFO L273 TraceCheckUtils]: 80: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,730 INFO L273 TraceCheckUtils]: 81: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,730 INFO L273 TraceCheckUtils]: 82: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,731 INFO L273 TraceCheckUtils]: 83: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,731 INFO L273 TraceCheckUtils]: 84: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,731 INFO L273 TraceCheckUtils]: 85: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,731 INFO L273 TraceCheckUtils]: 86: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,731 INFO L273 TraceCheckUtils]: 87: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,731 INFO L273 TraceCheckUtils]: 88: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,732 INFO L273 TraceCheckUtils]: 89: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,732 INFO L273 TraceCheckUtils]: 90: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,732 INFO L273 TraceCheckUtils]: 91: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,732 INFO L273 TraceCheckUtils]: 92: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,732 INFO L273 TraceCheckUtils]: 93: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,732 INFO L273 TraceCheckUtils]: 94: Hoare triple {6789#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,733 INFO L273 TraceCheckUtils]: 95: Hoare triple {6789#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6789#false} is VALID [2018-11-18 22:47:10,733 INFO L273 TraceCheckUtils]: 96: Hoare triple {6789#false} ~a~0 := 1 + ~a~0; {6789#false} is VALID [2018-11-18 22:47:10,733 INFO L273 TraceCheckUtils]: 97: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,733 INFO L273 TraceCheckUtils]: 98: Hoare triple {6789#false} assume !(~a~0 < 100000); {6789#false} is VALID [2018-11-18 22:47:10,733 INFO L273 TraceCheckUtils]: 99: Hoare triple {6789#false} havoc ~x~0;~x~0 := 0; {6789#false} is VALID [2018-11-18 22:47:10,733 INFO L273 TraceCheckUtils]: 100: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:10,734 INFO L273 TraceCheckUtils]: 101: Hoare triple {6789#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {6789#false} is VALID [2018-11-18 22:47:10,734 INFO L256 TraceCheckUtils]: 102: Hoare triple {6789#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {6789#false} is VALID [2018-11-18 22:47:10,734 INFO L273 TraceCheckUtils]: 103: Hoare triple {6789#false} ~cond := #in~cond; {6789#false} is VALID [2018-11-18 22:47:10,734 INFO L273 TraceCheckUtils]: 104: Hoare triple {6789#false} assume 0 == ~cond; {6789#false} is VALID [2018-11-18 22:47:10,734 INFO L273 TraceCheckUtils]: 105: Hoare triple {6789#false} assume !false; {6789#false} is VALID [2018-11-18 22:47:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-18 22:47:10,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:10,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:10,758 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:47:12,977 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-18 22:47:12,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:12,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:13,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {6788#true} call ULTIMATE.init(); {6788#true} is VALID [2018-11-18 22:47:13,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {6788#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6788#true} is VALID [2018-11-18 22:47:13,135 INFO L273 TraceCheckUtils]: 2: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6788#true} {6788#true} #95#return; {6788#true} is VALID [2018-11-18 22:47:13,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {6788#true} call #t~ret8 := main(); {6788#true} is VALID [2018-11-18 22:47:13,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {6788#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {6788#true} is VALID [2018-11-18 22:47:13,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,136 INFO L273 TraceCheckUtils]: 8: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,136 INFO L273 TraceCheckUtils]: 9: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,136 INFO L273 TraceCheckUtils]: 10: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,137 INFO L273 TraceCheckUtils]: 11: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,137 INFO L273 TraceCheckUtils]: 12: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,137 INFO L273 TraceCheckUtils]: 14: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,137 INFO L273 TraceCheckUtils]: 15: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,137 INFO L273 TraceCheckUtils]: 16: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,138 INFO L273 TraceCheckUtils]: 18: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,138 INFO L273 TraceCheckUtils]: 21: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,138 INFO L273 TraceCheckUtils]: 24: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,138 INFO L273 TraceCheckUtils]: 25: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,139 INFO L273 TraceCheckUtils]: 26: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,139 INFO L273 TraceCheckUtils]: 27: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,139 INFO L273 TraceCheckUtils]: 28: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,139 INFO L273 TraceCheckUtils]: 30: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,139 INFO L273 TraceCheckUtils]: 31: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,139 INFO L273 TraceCheckUtils]: 32: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,139 INFO L273 TraceCheckUtils]: 33: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,140 INFO L273 TraceCheckUtils]: 37: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,140 INFO L273 TraceCheckUtils]: 38: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,140 INFO L273 TraceCheckUtils]: 39: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,140 INFO L273 TraceCheckUtils]: 40: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,140 INFO L273 TraceCheckUtils]: 41: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,141 INFO L273 TraceCheckUtils]: 42: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,141 INFO L273 TraceCheckUtils]: 43: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,141 INFO L273 TraceCheckUtils]: 44: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,141 INFO L273 TraceCheckUtils]: 45: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,141 INFO L273 TraceCheckUtils]: 46: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,141 INFO L273 TraceCheckUtils]: 47: Hoare triple {6788#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6788#true} is VALID [2018-11-18 22:47:13,141 INFO L273 TraceCheckUtils]: 48: Hoare triple {6788#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {6788#true} is VALID [2018-11-18 22:47:13,141 INFO L273 TraceCheckUtils]: 49: Hoare triple {6788#true} ~a~0 := 1 + ~a~0; {6788#true} is VALID [2018-11-18 22:47:13,141 INFO L273 TraceCheckUtils]: 50: Hoare triple {6788#true} assume true; {6788#true} is VALID [2018-11-18 22:47:13,142 INFO L273 TraceCheckUtils]: 51: Hoare triple {6788#true} assume !(~a~0 < 100000); {6788#true} is VALID [2018-11-18 22:47:13,142 INFO L273 TraceCheckUtils]: 52: Hoare triple {6788#true} ~a~0 := 0; {6961#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:13,142 INFO L273 TraceCheckUtils]: 53: Hoare triple {6961#(<= main_~a~0 0)} assume true; {6961#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:13,143 INFO L273 TraceCheckUtils]: 54: Hoare triple {6961#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6961#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:13,143 INFO L273 TraceCheckUtils]: 55: Hoare triple {6961#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6961#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:13,143 INFO L273 TraceCheckUtils]: 56: Hoare triple {6961#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {6791#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:13,144 INFO L273 TraceCheckUtils]: 57: Hoare triple {6791#(<= main_~a~0 1)} assume true; {6791#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:13,144 INFO L273 TraceCheckUtils]: 58: Hoare triple {6791#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6791#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:13,144 INFO L273 TraceCheckUtils]: 59: Hoare triple {6791#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6791#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:13,145 INFO L273 TraceCheckUtils]: 60: Hoare triple {6791#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {6792#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:13,145 INFO L273 TraceCheckUtils]: 61: Hoare triple {6792#(<= main_~a~0 2)} assume true; {6792#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:13,145 INFO L273 TraceCheckUtils]: 62: Hoare triple {6792#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6792#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:13,146 INFO L273 TraceCheckUtils]: 63: Hoare triple {6792#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6792#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:13,146 INFO L273 TraceCheckUtils]: 64: Hoare triple {6792#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {6793#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:13,147 INFO L273 TraceCheckUtils]: 65: Hoare triple {6793#(<= main_~a~0 3)} assume true; {6793#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:13,147 INFO L273 TraceCheckUtils]: 66: Hoare triple {6793#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6793#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:13,148 INFO L273 TraceCheckUtils]: 67: Hoare triple {6793#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6793#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:13,149 INFO L273 TraceCheckUtils]: 68: Hoare triple {6793#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {6794#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:13,149 INFO L273 TraceCheckUtils]: 69: Hoare triple {6794#(<= main_~a~0 4)} assume true; {6794#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:13,150 INFO L273 TraceCheckUtils]: 70: Hoare triple {6794#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6794#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:13,150 INFO L273 TraceCheckUtils]: 71: Hoare triple {6794#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6794#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:13,151 INFO L273 TraceCheckUtils]: 72: Hoare triple {6794#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {6795#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:13,151 INFO L273 TraceCheckUtils]: 73: Hoare triple {6795#(<= main_~a~0 5)} assume true; {6795#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:13,152 INFO L273 TraceCheckUtils]: 74: Hoare triple {6795#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6795#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:13,152 INFO L273 TraceCheckUtils]: 75: Hoare triple {6795#(<= main_~a~0 5)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6795#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:13,153 INFO L273 TraceCheckUtils]: 76: Hoare triple {6795#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {6796#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:13,153 INFO L273 TraceCheckUtils]: 77: Hoare triple {6796#(<= main_~a~0 6)} assume true; {6796#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:13,154 INFO L273 TraceCheckUtils]: 78: Hoare triple {6796#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6796#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:13,154 INFO L273 TraceCheckUtils]: 79: Hoare triple {6796#(<= main_~a~0 6)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6796#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:13,155 INFO L273 TraceCheckUtils]: 80: Hoare triple {6796#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {6797#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:13,156 INFO L273 TraceCheckUtils]: 81: Hoare triple {6797#(<= main_~a~0 7)} assume true; {6797#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:13,156 INFO L273 TraceCheckUtils]: 82: Hoare triple {6797#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6797#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:13,156 INFO L273 TraceCheckUtils]: 83: Hoare triple {6797#(<= main_~a~0 7)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6797#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:13,157 INFO L273 TraceCheckUtils]: 84: Hoare triple {6797#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {6798#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:13,158 INFO L273 TraceCheckUtils]: 85: Hoare triple {6798#(<= main_~a~0 8)} assume true; {6798#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:13,158 INFO L273 TraceCheckUtils]: 86: Hoare triple {6798#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6798#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:13,159 INFO L273 TraceCheckUtils]: 87: Hoare triple {6798#(<= main_~a~0 8)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6798#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:13,159 INFO L273 TraceCheckUtils]: 88: Hoare triple {6798#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {6799#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:13,160 INFO L273 TraceCheckUtils]: 89: Hoare triple {6799#(<= main_~a~0 9)} assume true; {6799#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:13,160 INFO L273 TraceCheckUtils]: 90: Hoare triple {6799#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6799#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:13,161 INFO L273 TraceCheckUtils]: 91: Hoare triple {6799#(<= main_~a~0 9)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6799#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:13,161 INFO L273 TraceCheckUtils]: 92: Hoare triple {6799#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {6800#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:13,162 INFO L273 TraceCheckUtils]: 93: Hoare triple {6800#(<= main_~a~0 10)} assume true; {6800#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:13,162 INFO L273 TraceCheckUtils]: 94: Hoare triple {6800#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {6800#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:13,163 INFO L273 TraceCheckUtils]: 95: Hoare triple {6800#(<= main_~a~0 10)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {6800#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:13,164 INFO L273 TraceCheckUtils]: 96: Hoare triple {6800#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {6801#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:13,164 INFO L273 TraceCheckUtils]: 97: Hoare triple {6801#(<= main_~a~0 11)} assume true; {6801#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:13,165 INFO L273 TraceCheckUtils]: 98: Hoare triple {6801#(<= main_~a~0 11)} assume !(~a~0 < 100000); {6789#false} is VALID [2018-11-18 22:47:13,165 INFO L273 TraceCheckUtils]: 99: Hoare triple {6789#false} havoc ~x~0;~x~0 := 0; {6789#false} is VALID [2018-11-18 22:47:13,165 INFO L273 TraceCheckUtils]: 100: Hoare triple {6789#false} assume true; {6789#false} is VALID [2018-11-18 22:47:13,165 INFO L273 TraceCheckUtils]: 101: Hoare triple {6789#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {6789#false} is VALID [2018-11-18 22:47:13,166 INFO L256 TraceCheckUtils]: 102: Hoare triple {6789#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {6789#false} is VALID [2018-11-18 22:47:13,166 INFO L273 TraceCheckUtils]: 103: Hoare triple {6789#false} ~cond := #in~cond; {6789#false} is VALID [2018-11-18 22:47:13,166 INFO L273 TraceCheckUtils]: 104: Hoare triple {6789#false} assume 0 == ~cond; {6789#false} is VALID [2018-11-18 22:47:13,166 INFO L273 TraceCheckUtils]: 105: Hoare triple {6789#false} assume !false; {6789#false} is VALID [2018-11-18 22:47:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2018-11-18 22:47:13,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:13,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-18 22:47:13,194 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2018-11-18 22:47:13,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:13,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-18 22:47:13,298 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:13,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 22:47:13,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 22:47:13,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:47:13,299 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand 15 states. [2018-11-18 22:47:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:13,892 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2018-11-18 22:47:13,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 22:47:13,892 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2018-11-18 22:47:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:13,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:47:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 188 transitions. [2018-11-18 22:47:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-18 22:47:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 188 transitions. [2018-11-18 22:47:13,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 188 transitions. [2018-11-18 22:47:14,533 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:14,536 INFO L225 Difference]: With dead ends: 194 [2018-11-18 22:47:14,536 INFO L226 Difference]: Without dead ends: 129 [2018-11-18 22:47:14,537 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-18 22:47:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-18 22:47:14,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-11-18 22:47:14,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:14,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 125 states. [2018-11-18 22:47:14,656 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 125 states. [2018-11-18 22:47:14,656 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 125 states. [2018-11-18 22:47:14,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:14,660 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-18 22:47:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2018-11-18 22:47:14,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:14,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:14,661 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 129 states. [2018-11-18 22:47:14,662 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 129 states. [2018-11-18 22:47:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:14,664 INFO L93 Difference]: Finished difference Result 129 states and 159 transitions. [2018-11-18 22:47:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 159 transitions. [2018-11-18 22:47:14,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:14,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:14,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:14,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 22:47:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 153 transitions. [2018-11-18 22:47:14,667 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 153 transitions. Word has length 106 [2018-11-18 22:47:14,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:14,667 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 153 transitions. [2018-11-18 22:47:14,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 22:47:14,667 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 153 transitions. [2018-11-18 22:47:14,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-18 22:47:14,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:14,668 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:14,668 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:14,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:14,669 INFO L82 PathProgramCache]: Analyzing trace with hash 932238803, now seen corresponding path program 12 times [2018-11-18 22:47:14,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:14,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:14,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:14,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:14,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:15,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {7784#true} call ULTIMATE.init(); {7784#true} is VALID [2018-11-18 22:47:15,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {7784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7784#true} is VALID [2018-11-18 22:47:15,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {7784#true} assume true; {7784#true} is VALID [2018-11-18 22:47:15,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7784#true} {7784#true} #95#return; {7784#true} is VALID [2018-11-18 22:47:15,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {7784#true} call #t~ret8 := main(); {7784#true} is VALID [2018-11-18 22:47:15,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {7784#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {7786#(= main_~a~0 0)} is VALID [2018-11-18 22:47:15,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {7786#(= main_~a~0 0)} assume true; {7786#(= main_~a~0 0)} is VALID [2018-11-18 22:47:15,714 INFO L273 TraceCheckUtils]: 7: Hoare triple {7786#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7786#(= main_~a~0 0)} is VALID [2018-11-18 22:47:15,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {7786#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7786#(= main_~a~0 0)} is VALID [2018-11-18 22:47:15,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {7786#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {7787#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:15,715 INFO L273 TraceCheckUtils]: 10: Hoare triple {7787#(<= main_~a~0 1)} assume true; {7787#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:15,715 INFO L273 TraceCheckUtils]: 11: Hoare triple {7787#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7787#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:15,716 INFO L273 TraceCheckUtils]: 12: Hoare triple {7787#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7787#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:15,717 INFO L273 TraceCheckUtils]: 13: Hoare triple {7787#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {7788#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:15,717 INFO L273 TraceCheckUtils]: 14: Hoare triple {7788#(<= main_~a~0 2)} assume true; {7788#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:15,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {7788#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7788#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:15,718 INFO L273 TraceCheckUtils]: 16: Hoare triple {7788#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7788#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:15,719 INFO L273 TraceCheckUtils]: 17: Hoare triple {7788#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {7789#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:15,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {7789#(<= main_~a~0 3)} assume true; {7789#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:15,720 INFO L273 TraceCheckUtils]: 19: Hoare triple {7789#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7789#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:15,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {7789#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7789#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:15,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {7789#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {7790#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:15,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {7790#(<= main_~a~0 4)} assume true; {7790#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:15,723 INFO L273 TraceCheckUtils]: 23: Hoare triple {7790#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7790#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:15,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {7790#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7790#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:15,724 INFO L273 TraceCheckUtils]: 25: Hoare triple {7790#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {7791#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:15,725 INFO L273 TraceCheckUtils]: 26: Hoare triple {7791#(<= main_~a~0 5)} assume true; {7791#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:15,725 INFO L273 TraceCheckUtils]: 27: Hoare triple {7791#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7791#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:15,726 INFO L273 TraceCheckUtils]: 28: Hoare triple {7791#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7791#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:15,727 INFO L273 TraceCheckUtils]: 29: Hoare triple {7791#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {7792#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:15,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {7792#(<= main_~a~0 6)} assume true; {7792#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:15,728 INFO L273 TraceCheckUtils]: 31: Hoare triple {7792#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7792#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:15,728 INFO L273 TraceCheckUtils]: 32: Hoare triple {7792#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7792#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:15,729 INFO L273 TraceCheckUtils]: 33: Hoare triple {7792#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {7793#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:15,730 INFO L273 TraceCheckUtils]: 34: Hoare triple {7793#(<= main_~a~0 7)} assume true; {7793#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:15,730 INFO L273 TraceCheckUtils]: 35: Hoare triple {7793#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7793#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:15,731 INFO L273 TraceCheckUtils]: 36: Hoare triple {7793#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7793#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:15,732 INFO L273 TraceCheckUtils]: 37: Hoare triple {7793#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {7794#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:15,732 INFO L273 TraceCheckUtils]: 38: Hoare triple {7794#(<= main_~a~0 8)} assume true; {7794#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:15,733 INFO L273 TraceCheckUtils]: 39: Hoare triple {7794#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7794#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:15,734 INFO L273 TraceCheckUtils]: 40: Hoare triple {7794#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7794#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:15,734 INFO L273 TraceCheckUtils]: 41: Hoare triple {7794#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {7795#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:15,735 INFO L273 TraceCheckUtils]: 42: Hoare triple {7795#(<= main_~a~0 9)} assume true; {7795#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:15,736 INFO L273 TraceCheckUtils]: 43: Hoare triple {7795#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7795#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:15,736 INFO L273 TraceCheckUtils]: 44: Hoare triple {7795#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7795#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:15,737 INFO L273 TraceCheckUtils]: 45: Hoare triple {7795#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {7796#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:15,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {7796#(<= main_~a~0 10)} assume true; {7796#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:15,738 INFO L273 TraceCheckUtils]: 47: Hoare triple {7796#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7796#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:15,739 INFO L273 TraceCheckUtils]: 48: Hoare triple {7796#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7796#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:15,739 INFO L273 TraceCheckUtils]: 49: Hoare triple {7796#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {7797#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:15,740 INFO L273 TraceCheckUtils]: 50: Hoare triple {7797#(<= main_~a~0 11)} assume true; {7797#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:15,741 INFO L273 TraceCheckUtils]: 51: Hoare triple {7797#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7797#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:15,741 INFO L273 TraceCheckUtils]: 52: Hoare triple {7797#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7797#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:15,742 INFO L273 TraceCheckUtils]: 53: Hoare triple {7797#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {7798#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:15,743 INFO L273 TraceCheckUtils]: 54: Hoare triple {7798#(<= main_~a~0 12)} assume true; {7798#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:15,743 INFO L273 TraceCheckUtils]: 55: Hoare triple {7798#(<= main_~a~0 12)} assume !(~a~0 < 100000); {7785#false} is VALID [2018-11-18 22:47:15,744 INFO L273 TraceCheckUtils]: 56: Hoare triple {7785#false} ~a~0 := 0; {7785#false} is VALID [2018-11-18 22:47:15,744 INFO L273 TraceCheckUtils]: 57: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,744 INFO L273 TraceCheckUtils]: 58: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,744 INFO L273 TraceCheckUtils]: 59: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,745 INFO L273 TraceCheckUtils]: 60: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,745 INFO L273 TraceCheckUtils]: 61: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,745 INFO L273 TraceCheckUtils]: 62: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,745 INFO L273 TraceCheckUtils]: 63: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,746 INFO L273 TraceCheckUtils]: 64: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,746 INFO L273 TraceCheckUtils]: 65: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,746 INFO L273 TraceCheckUtils]: 66: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,746 INFO L273 TraceCheckUtils]: 67: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,746 INFO L273 TraceCheckUtils]: 68: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,746 INFO L273 TraceCheckUtils]: 69: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,747 INFO L273 TraceCheckUtils]: 70: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,747 INFO L273 TraceCheckUtils]: 71: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,747 INFO L273 TraceCheckUtils]: 72: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,747 INFO L273 TraceCheckUtils]: 73: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,747 INFO L273 TraceCheckUtils]: 74: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,747 INFO L273 TraceCheckUtils]: 75: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,747 INFO L273 TraceCheckUtils]: 76: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,748 INFO L273 TraceCheckUtils]: 77: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,748 INFO L273 TraceCheckUtils]: 78: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,748 INFO L273 TraceCheckUtils]: 79: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,748 INFO L273 TraceCheckUtils]: 80: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,748 INFO L273 TraceCheckUtils]: 81: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,748 INFO L273 TraceCheckUtils]: 82: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,749 INFO L273 TraceCheckUtils]: 83: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,749 INFO L273 TraceCheckUtils]: 84: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,749 INFO L273 TraceCheckUtils]: 85: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,749 INFO L273 TraceCheckUtils]: 86: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,749 INFO L273 TraceCheckUtils]: 87: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,749 INFO L273 TraceCheckUtils]: 88: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,749 INFO L273 TraceCheckUtils]: 89: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,750 INFO L273 TraceCheckUtils]: 90: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,750 INFO L273 TraceCheckUtils]: 91: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,750 INFO L273 TraceCheckUtils]: 92: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,750 INFO L273 TraceCheckUtils]: 93: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,750 INFO L273 TraceCheckUtils]: 94: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,750 INFO L273 TraceCheckUtils]: 95: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,751 INFO L273 TraceCheckUtils]: 96: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,751 INFO L273 TraceCheckUtils]: 97: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,751 INFO L273 TraceCheckUtils]: 98: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,751 INFO L273 TraceCheckUtils]: 99: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,751 INFO L273 TraceCheckUtils]: 100: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,751 INFO L273 TraceCheckUtils]: 101: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,751 INFO L273 TraceCheckUtils]: 102: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,752 INFO L273 TraceCheckUtils]: 103: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:15,752 INFO L273 TraceCheckUtils]: 104: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:15,752 INFO L273 TraceCheckUtils]: 105: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,752 INFO L273 TraceCheckUtils]: 106: Hoare triple {7785#false} assume !(~a~0 < 100000); {7785#false} is VALID [2018-11-18 22:47:15,752 INFO L273 TraceCheckUtils]: 107: Hoare triple {7785#false} havoc ~x~0;~x~0 := 0; {7785#false} is VALID [2018-11-18 22:47:15,753 INFO L273 TraceCheckUtils]: 108: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:15,753 INFO L273 TraceCheckUtils]: 109: Hoare triple {7785#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {7785#false} is VALID [2018-11-18 22:47:15,753 INFO L256 TraceCheckUtils]: 110: Hoare triple {7785#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {7785#false} is VALID [2018-11-18 22:47:15,753 INFO L273 TraceCheckUtils]: 111: Hoare triple {7785#false} ~cond := #in~cond; {7785#false} is VALID [2018-11-18 22:47:15,753 INFO L273 TraceCheckUtils]: 112: Hoare triple {7785#false} assume 0 == ~cond; {7785#false} is VALID [2018-11-18 22:47:15,754 INFO L273 TraceCheckUtils]: 113: Hoare triple {7785#false} assume !false; {7785#false} is VALID [2018-11-18 22:47:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-18 22:47:15,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:15,771 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:15,786 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:47:17,424 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-18 22:47:17,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:17,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:17,656 INFO L256 TraceCheckUtils]: 0: Hoare triple {7784#true} call ULTIMATE.init(); {7784#true} is VALID [2018-11-18 22:47:17,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {7784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7784#true} is VALID [2018-11-18 22:47:17,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {7784#true} assume true; {7784#true} is VALID [2018-11-18 22:47:17,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7784#true} {7784#true} #95#return; {7784#true} is VALID [2018-11-18 22:47:17,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {7784#true} call #t~ret8 := main(); {7784#true} is VALID [2018-11-18 22:47:17,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {7784#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {7817#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:17,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {7817#(<= main_~a~0 0)} assume true; {7817#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:17,659 INFO L273 TraceCheckUtils]: 7: Hoare triple {7817#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7817#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:17,660 INFO L273 TraceCheckUtils]: 8: Hoare triple {7817#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7817#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:17,660 INFO L273 TraceCheckUtils]: 9: Hoare triple {7817#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {7787#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:17,661 INFO L273 TraceCheckUtils]: 10: Hoare triple {7787#(<= main_~a~0 1)} assume true; {7787#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:17,661 INFO L273 TraceCheckUtils]: 11: Hoare triple {7787#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7787#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:17,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {7787#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7787#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:17,662 INFO L273 TraceCheckUtils]: 13: Hoare triple {7787#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {7788#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:17,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {7788#(<= main_~a~0 2)} assume true; {7788#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:17,663 INFO L273 TraceCheckUtils]: 15: Hoare triple {7788#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7788#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:17,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {7788#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7788#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:17,665 INFO L273 TraceCheckUtils]: 17: Hoare triple {7788#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {7789#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:17,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {7789#(<= main_~a~0 3)} assume true; {7789#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:17,666 INFO L273 TraceCheckUtils]: 19: Hoare triple {7789#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7789#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:17,667 INFO L273 TraceCheckUtils]: 20: Hoare triple {7789#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7789#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:17,667 INFO L273 TraceCheckUtils]: 21: Hoare triple {7789#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {7790#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:17,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {7790#(<= main_~a~0 4)} assume true; {7790#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:17,669 INFO L273 TraceCheckUtils]: 23: Hoare triple {7790#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7790#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:17,669 INFO L273 TraceCheckUtils]: 24: Hoare triple {7790#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7790#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:17,670 INFO L273 TraceCheckUtils]: 25: Hoare triple {7790#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {7791#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:17,670 INFO L273 TraceCheckUtils]: 26: Hoare triple {7791#(<= main_~a~0 5)} assume true; {7791#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:17,671 INFO L273 TraceCheckUtils]: 27: Hoare triple {7791#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7791#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:17,672 INFO L273 TraceCheckUtils]: 28: Hoare triple {7791#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7791#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:17,672 INFO L273 TraceCheckUtils]: 29: Hoare triple {7791#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {7792#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:17,673 INFO L273 TraceCheckUtils]: 30: Hoare triple {7792#(<= main_~a~0 6)} assume true; {7792#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:17,674 INFO L273 TraceCheckUtils]: 31: Hoare triple {7792#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7792#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:17,674 INFO L273 TraceCheckUtils]: 32: Hoare triple {7792#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7792#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:17,675 INFO L273 TraceCheckUtils]: 33: Hoare triple {7792#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {7793#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:17,676 INFO L273 TraceCheckUtils]: 34: Hoare triple {7793#(<= main_~a~0 7)} assume true; {7793#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:17,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {7793#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7793#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:17,677 INFO L273 TraceCheckUtils]: 36: Hoare triple {7793#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7793#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:17,677 INFO L273 TraceCheckUtils]: 37: Hoare triple {7793#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {7794#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:17,678 INFO L273 TraceCheckUtils]: 38: Hoare triple {7794#(<= main_~a~0 8)} assume true; {7794#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:17,679 INFO L273 TraceCheckUtils]: 39: Hoare triple {7794#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7794#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:17,679 INFO L273 TraceCheckUtils]: 40: Hoare triple {7794#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7794#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:17,680 INFO L273 TraceCheckUtils]: 41: Hoare triple {7794#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {7795#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:17,681 INFO L273 TraceCheckUtils]: 42: Hoare triple {7795#(<= main_~a~0 9)} assume true; {7795#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:17,681 INFO L273 TraceCheckUtils]: 43: Hoare triple {7795#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7795#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:17,682 INFO L273 TraceCheckUtils]: 44: Hoare triple {7795#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7795#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:17,683 INFO L273 TraceCheckUtils]: 45: Hoare triple {7795#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {7796#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:17,683 INFO L273 TraceCheckUtils]: 46: Hoare triple {7796#(<= main_~a~0 10)} assume true; {7796#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:17,684 INFO L273 TraceCheckUtils]: 47: Hoare triple {7796#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7796#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:17,684 INFO L273 TraceCheckUtils]: 48: Hoare triple {7796#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7796#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:17,685 INFO L273 TraceCheckUtils]: 49: Hoare triple {7796#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {7797#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:17,686 INFO L273 TraceCheckUtils]: 50: Hoare triple {7797#(<= main_~a~0 11)} assume true; {7797#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:17,686 INFO L273 TraceCheckUtils]: 51: Hoare triple {7797#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7797#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:17,687 INFO L273 TraceCheckUtils]: 52: Hoare triple {7797#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {7797#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:17,688 INFO L273 TraceCheckUtils]: 53: Hoare triple {7797#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {7798#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:17,688 INFO L273 TraceCheckUtils]: 54: Hoare triple {7798#(<= main_~a~0 12)} assume true; {7798#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:17,689 INFO L273 TraceCheckUtils]: 55: Hoare triple {7798#(<= main_~a~0 12)} assume !(~a~0 < 100000); {7785#false} is VALID [2018-11-18 22:47:17,689 INFO L273 TraceCheckUtils]: 56: Hoare triple {7785#false} ~a~0 := 0; {7785#false} is VALID [2018-11-18 22:47:17,689 INFO L273 TraceCheckUtils]: 57: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,690 INFO L273 TraceCheckUtils]: 58: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,690 INFO L273 TraceCheckUtils]: 59: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,690 INFO L273 TraceCheckUtils]: 60: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,691 INFO L273 TraceCheckUtils]: 62: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,691 INFO L273 TraceCheckUtils]: 63: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,691 INFO L273 TraceCheckUtils]: 64: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,691 INFO L273 TraceCheckUtils]: 65: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,691 INFO L273 TraceCheckUtils]: 66: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,692 INFO L273 TraceCheckUtils]: 67: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,692 INFO L273 TraceCheckUtils]: 68: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,692 INFO L273 TraceCheckUtils]: 69: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,692 INFO L273 TraceCheckUtils]: 70: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,692 INFO L273 TraceCheckUtils]: 71: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,692 INFO L273 TraceCheckUtils]: 72: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,693 INFO L273 TraceCheckUtils]: 73: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,693 INFO L273 TraceCheckUtils]: 74: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,693 INFO L273 TraceCheckUtils]: 75: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,693 INFO L273 TraceCheckUtils]: 76: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,693 INFO L273 TraceCheckUtils]: 77: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,693 INFO L273 TraceCheckUtils]: 78: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,693 INFO L273 TraceCheckUtils]: 79: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,694 INFO L273 TraceCheckUtils]: 80: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,694 INFO L273 TraceCheckUtils]: 81: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,694 INFO L273 TraceCheckUtils]: 82: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,694 INFO L273 TraceCheckUtils]: 83: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,694 INFO L273 TraceCheckUtils]: 84: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,694 INFO L273 TraceCheckUtils]: 85: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,694 INFO L273 TraceCheckUtils]: 86: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,695 INFO L273 TraceCheckUtils]: 87: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,695 INFO L273 TraceCheckUtils]: 88: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,695 INFO L273 TraceCheckUtils]: 89: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,695 INFO L273 TraceCheckUtils]: 90: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,695 INFO L273 TraceCheckUtils]: 91: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,695 INFO L273 TraceCheckUtils]: 92: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,696 INFO L273 TraceCheckUtils]: 93: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,696 INFO L273 TraceCheckUtils]: 94: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,696 INFO L273 TraceCheckUtils]: 95: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,696 INFO L273 TraceCheckUtils]: 96: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,696 INFO L273 TraceCheckUtils]: 97: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,696 INFO L273 TraceCheckUtils]: 98: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,696 INFO L273 TraceCheckUtils]: 99: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,697 INFO L273 TraceCheckUtils]: 100: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,697 INFO L273 TraceCheckUtils]: 101: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,697 INFO L273 TraceCheckUtils]: 102: Hoare triple {7785#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,697 INFO L273 TraceCheckUtils]: 103: Hoare triple {7785#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {7785#false} is VALID [2018-11-18 22:47:17,697 INFO L273 TraceCheckUtils]: 104: Hoare triple {7785#false} ~a~0 := 1 + ~a~0; {7785#false} is VALID [2018-11-18 22:47:17,698 INFO L273 TraceCheckUtils]: 105: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,698 INFO L273 TraceCheckUtils]: 106: Hoare triple {7785#false} assume !(~a~0 < 100000); {7785#false} is VALID [2018-11-18 22:47:17,698 INFO L273 TraceCheckUtils]: 107: Hoare triple {7785#false} havoc ~x~0;~x~0 := 0; {7785#false} is VALID [2018-11-18 22:47:17,698 INFO L273 TraceCheckUtils]: 108: Hoare triple {7785#false} assume true; {7785#false} is VALID [2018-11-18 22:47:17,698 INFO L273 TraceCheckUtils]: 109: Hoare triple {7785#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {7785#false} is VALID [2018-11-18 22:47:17,699 INFO L256 TraceCheckUtils]: 110: Hoare triple {7785#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {7785#false} is VALID [2018-11-18 22:47:17,699 INFO L273 TraceCheckUtils]: 111: Hoare triple {7785#false} ~cond := #in~cond; {7785#false} is VALID [2018-11-18 22:47:17,699 INFO L273 TraceCheckUtils]: 112: Hoare triple {7785#false} assume 0 == ~cond; {7785#false} is VALID [2018-11-18 22:47:17,699 INFO L273 TraceCheckUtils]: 113: Hoare triple {7785#false} assume !false; {7785#false} is VALID [2018-11-18 22:47:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2018-11-18 22:47:17,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:17,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-18 22:47:17,736 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 114 [2018-11-18 22:47:17,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:17,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-18 22:47:17,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:17,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 22:47:17,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 22:47:17,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:47:17,819 INFO L87 Difference]: Start difference. First operand 125 states and 153 transitions. Second operand 16 states. [2018-11-18 22:47:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:18,539 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2018-11-18 22:47:18,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 22:47:18,539 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 114 [2018-11-18 22:47:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:47:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 198 transitions. [2018-11-18 22:47:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 22:47:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 198 transitions. [2018-11-18 22:47:18,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 198 transitions. [2018-11-18 22:47:18,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:18,714 INFO L225 Difference]: With dead ends: 206 [2018-11-18 22:47:18,714 INFO L226 Difference]: Without dead ends: 137 [2018-11-18 22:47:18,715 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-18 22:47:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-18 22:47:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2018-11-18 22:47:18,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:18,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 133 states. [2018-11-18 22:47:18,741 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 133 states. [2018-11-18 22:47:18,741 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 133 states. [2018-11-18 22:47:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:18,744 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2018-11-18 22:47:18,744 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2018-11-18 22:47:18,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:18,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:18,745 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 137 states. [2018-11-18 22:47:18,745 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 137 states. [2018-11-18 22:47:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:18,747 INFO L93 Difference]: Finished difference Result 137 states and 169 transitions. [2018-11-18 22:47:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 169 transitions. [2018-11-18 22:47:18,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:18,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:18,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:18,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-18 22:47:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2018-11-18 22:47:18,751 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 114 [2018-11-18 22:47:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:18,751 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2018-11-18 22:47:18,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 22:47:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2018-11-18 22:47:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-18 22:47:18,753 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:18,753 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:18,753 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:18,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:18,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1338015955, now seen corresponding path program 13 times [2018-11-18 22:47:18,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:18,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:18,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:18,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:18,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:19,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {8846#true} call ULTIMATE.init(); {8846#true} is VALID [2018-11-18 22:47:19,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {8846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8846#true} is VALID [2018-11-18 22:47:19,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {8846#true} assume true; {8846#true} is VALID [2018-11-18 22:47:19,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8846#true} {8846#true} #95#return; {8846#true} is VALID [2018-11-18 22:47:19,838 INFO L256 TraceCheckUtils]: 4: Hoare triple {8846#true} call #t~ret8 := main(); {8846#true} is VALID [2018-11-18 22:47:19,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {8846#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {8848#(= main_~a~0 0)} is VALID [2018-11-18 22:47:19,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {8848#(= main_~a~0 0)} assume true; {8848#(= main_~a~0 0)} is VALID [2018-11-18 22:47:19,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {8848#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8848#(= main_~a~0 0)} is VALID [2018-11-18 22:47:19,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {8848#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8848#(= main_~a~0 0)} is VALID [2018-11-18 22:47:19,840 INFO L273 TraceCheckUtils]: 9: Hoare triple {8848#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {8849#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:19,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {8849#(<= main_~a~0 1)} assume true; {8849#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:19,841 INFO L273 TraceCheckUtils]: 11: Hoare triple {8849#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8849#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:19,841 INFO L273 TraceCheckUtils]: 12: Hoare triple {8849#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8849#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:19,842 INFO L273 TraceCheckUtils]: 13: Hoare triple {8849#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {8850#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:19,842 INFO L273 TraceCheckUtils]: 14: Hoare triple {8850#(<= main_~a~0 2)} assume true; {8850#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:19,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {8850#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8850#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:19,843 INFO L273 TraceCheckUtils]: 16: Hoare triple {8850#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8850#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:19,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {8850#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {8851#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:19,844 INFO L273 TraceCheckUtils]: 18: Hoare triple {8851#(<= main_~a~0 3)} assume true; {8851#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:19,845 INFO L273 TraceCheckUtils]: 19: Hoare triple {8851#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8851#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:19,845 INFO L273 TraceCheckUtils]: 20: Hoare triple {8851#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8851#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:19,846 INFO L273 TraceCheckUtils]: 21: Hoare triple {8851#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {8852#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:19,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {8852#(<= main_~a~0 4)} assume true; {8852#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:19,847 INFO L273 TraceCheckUtils]: 23: Hoare triple {8852#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8852#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:19,848 INFO L273 TraceCheckUtils]: 24: Hoare triple {8852#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8852#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:19,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {8852#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {8853#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:19,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {8853#(<= main_~a~0 5)} assume true; {8853#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:19,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {8853#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8853#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:19,850 INFO L273 TraceCheckUtils]: 28: Hoare triple {8853#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8853#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:19,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {8853#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {8854#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:19,851 INFO L273 TraceCheckUtils]: 30: Hoare triple {8854#(<= main_~a~0 6)} assume true; {8854#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:19,851 INFO L273 TraceCheckUtils]: 31: Hoare triple {8854#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8854#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:19,852 INFO L273 TraceCheckUtils]: 32: Hoare triple {8854#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8854#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:19,853 INFO L273 TraceCheckUtils]: 33: Hoare triple {8854#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {8855#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:19,853 INFO L273 TraceCheckUtils]: 34: Hoare triple {8855#(<= main_~a~0 7)} assume true; {8855#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:19,854 INFO L273 TraceCheckUtils]: 35: Hoare triple {8855#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8855#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:19,854 INFO L273 TraceCheckUtils]: 36: Hoare triple {8855#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8855#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:19,855 INFO L273 TraceCheckUtils]: 37: Hoare triple {8855#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {8856#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:19,855 INFO L273 TraceCheckUtils]: 38: Hoare triple {8856#(<= main_~a~0 8)} assume true; {8856#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:19,856 INFO L273 TraceCheckUtils]: 39: Hoare triple {8856#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8856#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:19,856 INFO L273 TraceCheckUtils]: 40: Hoare triple {8856#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8856#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:19,857 INFO L273 TraceCheckUtils]: 41: Hoare triple {8856#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {8857#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:19,857 INFO L273 TraceCheckUtils]: 42: Hoare triple {8857#(<= main_~a~0 9)} assume true; {8857#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:19,858 INFO L273 TraceCheckUtils]: 43: Hoare triple {8857#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8857#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:19,858 INFO L273 TraceCheckUtils]: 44: Hoare triple {8857#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8857#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:19,859 INFO L273 TraceCheckUtils]: 45: Hoare triple {8857#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {8858#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:19,859 INFO L273 TraceCheckUtils]: 46: Hoare triple {8858#(<= main_~a~0 10)} assume true; {8858#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:19,860 INFO L273 TraceCheckUtils]: 47: Hoare triple {8858#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8858#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:19,860 INFO L273 TraceCheckUtils]: 48: Hoare triple {8858#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8858#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:19,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {8858#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {8859#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:19,862 INFO L273 TraceCheckUtils]: 50: Hoare triple {8859#(<= main_~a~0 11)} assume true; {8859#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:19,862 INFO L273 TraceCheckUtils]: 51: Hoare triple {8859#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8859#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:19,863 INFO L273 TraceCheckUtils]: 52: Hoare triple {8859#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8859#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:19,863 INFO L273 TraceCheckUtils]: 53: Hoare triple {8859#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {8860#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:19,864 INFO L273 TraceCheckUtils]: 54: Hoare triple {8860#(<= main_~a~0 12)} assume true; {8860#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:19,864 INFO L273 TraceCheckUtils]: 55: Hoare triple {8860#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8860#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:19,865 INFO L273 TraceCheckUtils]: 56: Hoare triple {8860#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8860#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:19,865 INFO L273 TraceCheckUtils]: 57: Hoare triple {8860#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {8861#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:19,866 INFO L273 TraceCheckUtils]: 58: Hoare triple {8861#(<= main_~a~0 13)} assume true; {8861#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:19,867 INFO L273 TraceCheckUtils]: 59: Hoare triple {8861#(<= main_~a~0 13)} assume !(~a~0 < 100000); {8847#false} is VALID [2018-11-18 22:47:19,867 INFO L273 TraceCheckUtils]: 60: Hoare triple {8847#false} ~a~0 := 0; {8847#false} is VALID [2018-11-18 22:47:19,867 INFO L273 TraceCheckUtils]: 61: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,867 INFO L273 TraceCheckUtils]: 62: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,867 INFO L273 TraceCheckUtils]: 63: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,868 INFO L273 TraceCheckUtils]: 64: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,868 INFO L273 TraceCheckUtils]: 65: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,868 INFO L273 TraceCheckUtils]: 66: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,868 INFO L273 TraceCheckUtils]: 67: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,868 INFO L273 TraceCheckUtils]: 68: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,868 INFO L273 TraceCheckUtils]: 69: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,869 INFO L273 TraceCheckUtils]: 70: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,869 INFO L273 TraceCheckUtils]: 71: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,869 INFO L273 TraceCheckUtils]: 72: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,869 INFO L273 TraceCheckUtils]: 73: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,869 INFO L273 TraceCheckUtils]: 74: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,870 INFO L273 TraceCheckUtils]: 75: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,870 INFO L273 TraceCheckUtils]: 76: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,870 INFO L273 TraceCheckUtils]: 77: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,870 INFO L273 TraceCheckUtils]: 78: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,870 INFO L273 TraceCheckUtils]: 79: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,871 INFO L273 TraceCheckUtils]: 80: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,871 INFO L273 TraceCheckUtils]: 81: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,871 INFO L273 TraceCheckUtils]: 82: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,871 INFO L273 TraceCheckUtils]: 83: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,871 INFO L273 TraceCheckUtils]: 84: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,871 INFO L273 TraceCheckUtils]: 85: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,872 INFO L273 TraceCheckUtils]: 86: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,872 INFO L273 TraceCheckUtils]: 87: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,872 INFO L273 TraceCheckUtils]: 88: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,872 INFO L273 TraceCheckUtils]: 89: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,872 INFO L273 TraceCheckUtils]: 90: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,872 INFO L273 TraceCheckUtils]: 91: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,872 INFO L273 TraceCheckUtils]: 92: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,872 INFO L273 TraceCheckUtils]: 93: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,873 INFO L273 TraceCheckUtils]: 94: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,873 INFO L273 TraceCheckUtils]: 95: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,873 INFO L273 TraceCheckUtils]: 96: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,873 INFO L273 TraceCheckUtils]: 97: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,873 INFO L273 TraceCheckUtils]: 98: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,873 INFO L273 TraceCheckUtils]: 99: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,873 INFO L273 TraceCheckUtils]: 100: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,873 INFO L273 TraceCheckUtils]: 101: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,873 INFO L273 TraceCheckUtils]: 102: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,874 INFO L273 TraceCheckUtils]: 103: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,874 INFO L273 TraceCheckUtils]: 104: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,874 INFO L273 TraceCheckUtils]: 105: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,874 INFO L273 TraceCheckUtils]: 106: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,874 INFO L273 TraceCheckUtils]: 107: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,874 INFO L273 TraceCheckUtils]: 108: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,874 INFO L273 TraceCheckUtils]: 109: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,874 INFO L273 TraceCheckUtils]: 110: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,874 INFO L273 TraceCheckUtils]: 111: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:19,875 INFO L273 TraceCheckUtils]: 112: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:19,875 INFO L273 TraceCheckUtils]: 113: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,875 INFO L273 TraceCheckUtils]: 114: Hoare triple {8847#false} assume !(~a~0 < 100000); {8847#false} is VALID [2018-11-18 22:47:19,875 INFO L273 TraceCheckUtils]: 115: Hoare triple {8847#false} havoc ~x~0;~x~0 := 0; {8847#false} is VALID [2018-11-18 22:47:19,875 INFO L273 TraceCheckUtils]: 116: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:19,875 INFO L273 TraceCheckUtils]: 117: Hoare triple {8847#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {8847#false} is VALID [2018-11-18 22:47:19,875 INFO L256 TraceCheckUtils]: 118: Hoare triple {8847#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {8847#false} is VALID [2018-11-18 22:47:19,875 INFO L273 TraceCheckUtils]: 119: Hoare triple {8847#false} ~cond := #in~cond; {8847#false} is VALID [2018-11-18 22:47:19,876 INFO L273 TraceCheckUtils]: 120: Hoare triple {8847#false} assume 0 == ~cond; {8847#false} is VALID [2018-11-18 22:47:19,876 INFO L273 TraceCheckUtils]: 121: Hoare triple {8847#false} assume !false; {8847#false} is VALID [2018-11-18 22:47:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-11-18 22:47:19,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:19,883 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:19,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:47:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:19,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:20,316 INFO L256 TraceCheckUtils]: 0: Hoare triple {8846#true} call ULTIMATE.init(); {8846#true} is VALID [2018-11-18 22:47:20,316 INFO L273 TraceCheckUtils]: 1: Hoare triple {8846#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8846#true} is VALID [2018-11-18 22:47:20,316 INFO L273 TraceCheckUtils]: 2: Hoare triple {8846#true} assume true; {8846#true} is VALID [2018-11-18 22:47:20,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8846#true} {8846#true} #95#return; {8846#true} is VALID [2018-11-18 22:47:20,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {8846#true} call #t~ret8 := main(); {8846#true} is VALID [2018-11-18 22:47:20,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {8846#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {8880#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:20,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {8880#(<= main_~a~0 0)} assume true; {8880#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:20,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {8880#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8880#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:20,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {8880#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8880#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:20,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {8880#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {8849#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:20,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {8849#(<= main_~a~0 1)} assume true; {8849#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:20,321 INFO L273 TraceCheckUtils]: 11: Hoare triple {8849#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8849#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:20,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {8849#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8849#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:20,322 INFO L273 TraceCheckUtils]: 13: Hoare triple {8849#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {8850#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:20,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {8850#(<= main_~a~0 2)} assume true; {8850#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:20,323 INFO L273 TraceCheckUtils]: 15: Hoare triple {8850#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8850#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:20,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {8850#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8850#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:20,324 INFO L273 TraceCheckUtils]: 17: Hoare triple {8850#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {8851#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:20,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {8851#(<= main_~a~0 3)} assume true; {8851#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:20,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {8851#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8851#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:20,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {8851#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8851#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:20,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {8851#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {8852#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:20,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {8852#(<= main_~a~0 4)} assume true; {8852#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:20,328 INFO L273 TraceCheckUtils]: 23: Hoare triple {8852#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8852#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:20,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {8852#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8852#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:20,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {8852#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {8853#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:20,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {8853#(<= main_~a~0 5)} assume true; {8853#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:20,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {8853#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8853#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:20,330 INFO L273 TraceCheckUtils]: 28: Hoare triple {8853#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8853#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:20,331 INFO L273 TraceCheckUtils]: 29: Hoare triple {8853#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {8854#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:20,331 INFO L273 TraceCheckUtils]: 30: Hoare triple {8854#(<= main_~a~0 6)} assume true; {8854#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:20,332 INFO L273 TraceCheckUtils]: 31: Hoare triple {8854#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8854#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:20,332 INFO L273 TraceCheckUtils]: 32: Hoare triple {8854#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8854#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:20,333 INFO L273 TraceCheckUtils]: 33: Hoare triple {8854#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {8855#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:20,333 INFO L273 TraceCheckUtils]: 34: Hoare triple {8855#(<= main_~a~0 7)} assume true; {8855#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:20,334 INFO L273 TraceCheckUtils]: 35: Hoare triple {8855#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8855#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:20,334 INFO L273 TraceCheckUtils]: 36: Hoare triple {8855#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8855#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:20,335 INFO L273 TraceCheckUtils]: 37: Hoare triple {8855#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {8856#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:20,336 INFO L273 TraceCheckUtils]: 38: Hoare triple {8856#(<= main_~a~0 8)} assume true; {8856#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:20,336 INFO L273 TraceCheckUtils]: 39: Hoare triple {8856#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8856#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:20,337 INFO L273 TraceCheckUtils]: 40: Hoare triple {8856#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8856#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:20,337 INFO L273 TraceCheckUtils]: 41: Hoare triple {8856#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {8857#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:20,338 INFO L273 TraceCheckUtils]: 42: Hoare triple {8857#(<= main_~a~0 9)} assume true; {8857#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:20,338 INFO L273 TraceCheckUtils]: 43: Hoare triple {8857#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8857#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:20,339 INFO L273 TraceCheckUtils]: 44: Hoare triple {8857#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8857#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:20,339 INFO L273 TraceCheckUtils]: 45: Hoare triple {8857#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {8858#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:20,340 INFO L273 TraceCheckUtils]: 46: Hoare triple {8858#(<= main_~a~0 10)} assume true; {8858#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:20,340 INFO L273 TraceCheckUtils]: 47: Hoare triple {8858#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8858#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:20,341 INFO L273 TraceCheckUtils]: 48: Hoare triple {8858#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8858#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:20,342 INFO L273 TraceCheckUtils]: 49: Hoare triple {8858#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {8859#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:20,342 INFO L273 TraceCheckUtils]: 50: Hoare triple {8859#(<= main_~a~0 11)} assume true; {8859#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:20,343 INFO L273 TraceCheckUtils]: 51: Hoare triple {8859#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8859#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:20,343 INFO L273 TraceCheckUtils]: 52: Hoare triple {8859#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8859#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:20,344 INFO L273 TraceCheckUtils]: 53: Hoare triple {8859#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {8860#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:20,344 INFO L273 TraceCheckUtils]: 54: Hoare triple {8860#(<= main_~a~0 12)} assume true; {8860#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:20,345 INFO L273 TraceCheckUtils]: 55: Hoare triple {8860#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8860#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:20,345 INFO L273 TraceCheckUtils]: 56: Hoare triple {8860#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {8860#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:20,346 INFO L273 TraceCheckUtils]: 57: Hoare triple {8860#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {8861#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:20,346 INFO L273 TraceCheckUtils]: 58: Hoare triple {8861#(<= main_~a~0 13)} assume true; {8861#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:20,347 INFO L273 TraceCheckUtils]: 59: Hoare triple {8861#(<= main_~a~0 13)} assume !(~a~0 < 100000); {8847#false} is VALID [2018-11-18 22:47:20,347 INFO L273 TraceCheckUtils]: 60: Hoare triple {8847#false} ~a~0 := 0; {8847#false} is VALID [2018-11-18 22:47:20,347 INFO L273 TraceCheckUtils]: 61: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,348 INFO L273 TraceCheckUtils]: 62: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,348 INFO L273 TraceCheckUtils]: 63: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,348 INFO L273 TraceCheckUtils]: 64: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,348 INFO L273 TraceCheckUtils]: 65: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,348 INFO L273 TraceCheckUtils]: 66: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,348 INFO L273 TraceCheckUtils]: 67: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,349 INFO L273 TraceCheckUtils]: 68: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,349 INFO L273 TraceCheckUtils]: 69: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,349 INFO L273 TraceCheckUtils]: 70: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,349 INFO L273 TraceCheckUtils]: 71: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,349 INFO L273 TraceCheckUtils]: 72: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,350 INFO L273 TraceCheckUtils]: 73: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,350 INFO L273 TraceCheckUtils]: 74: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,350 INFO L273 TraceCheckUtils]: 75: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,350 INFO L273 TraceCheckUtils]: 76: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,350 INFO L273 TraceCheckUtils]: 77: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,350 INFO L273 TraceCheckUtils]: 78: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,351 INFO L273 TraceCheckUtils]: 79: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,351 INFO L273 TraceCheckUtils]: 80: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,351 INFO L273 TraceCheckUtils]: 81: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,351 INFO L273 TraceCheckUtils]: 82: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,351 INFO L273 TraceCheckUtils]: 83: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,351 INFO L273 TraceCheckUtils]: 84: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,351 INFO L273 TraceCheckUtils]: 85: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,351 INFO L273 TraceCheckUtils]: 86: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,352 INFO L273 TraceCheckUtils]: 87: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,352 INFO L273 TraceCheckUtils]: 88: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,352 INFO L273 TraceCheckUtils]: 89: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,352 INFO L273 TraceCheckUtils]: 90: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,352 INFO L273 TraceCheckUtils]: 91: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,352 INFO L273 TraceCheckUtils]: 92: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,352 INFO L273 TraceCheckUtils]: 93: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,352 INFO L273 TraceCheckUtils]: 94: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,352 INFO L273 TraceCheckUtils]: 95: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,353 INFO L273 TraceCheckUtils]: 96: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,353 INFO L273 TraceCheckUtils]: 97: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,353 INFO L273 TraceCheckUtils]: 98: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,353 INFO L273 TraceCheckUtils]: 99: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,353 INFO L273 TraceCheckUtils]: 100: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,353 INFO L273 TraceCheckUtils]: 101: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,353 INFO L273 TraceCheckUtils]: 102: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,353 INFO L273 TraceCheckUtils]: 103: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,353 INFO L273 TraceCheckUtils]: 104: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,354 INFO L273 TraceCheckUtils]: 105: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,354 INFO L273 TraceCheckUtils]: 106: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,354 INFO L273 TraceCheckUtils]: 107: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,354 INFO L273 TraceCheckUtils]: 108: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,354 INFO L273 TraceCheckUtils]: 109: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,354 INFO L273 TraceCheckUtils]: 110: Hoare triple {8847#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,354 INFO L273 TraceCheckUtils]: 111: Hoare triple {8847#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {8847#false} is VALID [2018-11-18 22:47:20,354 INFO L273 TraceCheckUtils]: 112: Hoare triple {8847#false} ~a~0 := 1 + ~a~0; {8847#false} is VALID [2018-11-18 22:47:20,355 INFO L273 TraceCheckUtils]: 113: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,355 INFO L273 TraceCheckUtils]: 114: Hoare triple {8847#false} assume !(~a~0 < 100000); {8847#false} is VALID [2018-11-18 22:47:20,355 INFO L273 TraceCheckUtils]: 115: Hoare triple {8847#false} havoc ~x~0;~x~0 := 0; {8847#false} is VALID [2018-11-18 22:47:20,355 INFO L273 TraceCheckUtils]: 116: Hoare triple {8847#false} assume true; {8847#false} is VALID [2018-11-18 22:47:20,355 INFO L273 TraceCheckUtils]: 117: Hoare triple {8847#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {8847#false} is VALID [2018-11-18 22:47:20,355 INFO L256 TraceCheckUtils]: 118: Hoare triple {8847#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {8847#false} is VALID [2018-11-18 22:47:20,355 INFO L273 TraceCheckUtils]: 119: Hoare triple {8847#false} ~cond := #in~cond; {8847#false} is VALID [2018-11-18 22:47:20,355 INFO L273 TraceCheckUtils]: 120: Hoare triple {8847#false} assume 0 == ~cond; {8847#false} is VALID [2018-11-18 22:47:20,355 INFO L273 TraceCheckUtils]: 121: Hoare triple {8847#false} assume !false; {8847#false} is VALID [2018-11-18 22:47:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 338 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2018-11-18 22:47:20,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:20,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-18 22:47:20,383 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2018-11-18 22:47:20,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:20,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-18 22:47:20,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:20,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 22:47:20,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 22:47:20,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:47:20,453 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand 17 states. [2018-11-18 22:47:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:21,075 INFO L93 Difference]: Finished difference Result 218 states and 270 transitions. [2018-11-18 22:47:21,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 22:47:21,075 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 122 [2018-11-18 22:47:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:47:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 208 transitions. [2018-11-18 22:47:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-18 22:47:21,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 208 transitions. [2018-11-18 22:47:21,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 208 transitions. [2018-11-18 22:47:21,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:21,278 INFO L225 Difference]: With dead ends: 218 [2018-11-18 22:47:21,279 INFO L226 Difference]: Without dead ends: 145 [2018-11-18 22:47:21,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-18 22:47:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-18 22:47:21,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 141. [2018-11-18 22:47:21,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:21,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 141 states. [2018-11-18 22:47:21,375 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 141 states. [2018-11-18 22:47:21,375 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 141 states. [2018-11-18 22:47:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:21,379 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2018-11-18 22:47:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2018-11-18 22:47:21,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:21,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:21,380 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 145 states. [2018-11-18 22:47:21,380 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 145 states. [2018-11-18 22:47:21,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:21,382 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2018-11-18 22:47:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2018-11-18 22:47:21,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:21,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:21,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:21,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-18 22:47:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 173 transitions. [2018-11-18 22:47:21,385 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 173 transitions. Word has length 122 [2018-11-18 22:47:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:21,385 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 173 transitions. [2018-11-18 22:47:21,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 22:47:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 173 transitions. [2018-11-18 22:47:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 22:47:21,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:21,386 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:21,387 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:21,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:21,387 INFO L82 PathProgramCache]: Analyzing trace with hash 106832339, now seen corresponding path program 14 times [2018-11-18 22:47:21,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:21,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:21,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:21,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:47:21,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:21,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {9974#true} call ULTIMATE.init(); {9974#true} is VALID [2018-11-18 22:47:21,862 INFO L273 TraceCheckUtils]: 1: Hoare triple {9974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9974#true} is VALID [2018-11-18 22:47:21,862 INFO L273 TraceCheckUtils]: 2: Hoare triple {9974#true} assume true; {9974#true} is VALID [2018-11-18 22:47:21,862 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9974#true} {9974#true} #95#return; {9974#true} is VALID [2018-11-18 22:47:21,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {9974#true} call #t~ret8 := main(); {9974#true} is VALID [2018-11-18 22:47:21,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {9974#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {9976#(= main_~a~0 0)} is VALID [2018-11-18 22:47:21,863 INFO L273 TraceCheckUtils]: 6: Hoare triple {9976#(= main_~a~0 0)} assume true; {9976#(= main_~a~0 0)} is VALID [2018-11-18 22:47:21,863 INFO L273 TraceCheckUtils]: 7: Hoare triple {9976#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9976#(= main_~a~0 0)} is VALID [2018-11-18 22:47:21,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {9976#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9976#(= main_~a~0 0)} is VALID [2018-11-18 22:47:21,865 INFO L273 TraceCheckUtils]: 9: Hoare triple {9976#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {9977#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:21,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {9977#(<= main_~a~0 1)} assume true; {9977#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:21,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {9977#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9977#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:21,866 INFO L273 TraceCheckUtils]: 12: Hoare triple {9977#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9977#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:21,867 INFO L273 TraceCheckUtils]: 13: Hoare triple {9977#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {9978#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:21,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {9978#(<= main_~a~0 2)} assume true; {9978#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:21,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {9978#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9978#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:21,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {9978#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9978#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:21,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {9978#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {9979#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:21,869 INFO L273 TraceCheckUtils]: 18: Hoare triple {9979#(<= main_~a~0 3)} assume true; {9979#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:21,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {9979#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9979#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:21,870 INFO L273 TraceCheckUtils]: 20: Hoare triple {9979#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9979#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:21,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {9979#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {9980#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:21,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {9980#(<= main_~a~0 4)} assume true; {9980#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:21,872 INFO L273 TraceCheckUtils]: 23: Hoare triple {9980#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9980#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:21,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {9980#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9980#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:21,873 INFO L273 TraceCheckUtils]: 25: Hoare triple {9980#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {9981#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:21,874 INFO L273 TraceCheckUtils]: 26: Hoare triple {9981#(<= main_~a~0 5)} assume true; {9981#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:21,874 INFO L273 TraceCheckUtils]: 27: Hoare triple {9981#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9981#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:21,875 INFO L273 TraceCheckUtils]: 28: Hoare triple {9981#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9981#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:21,875 INFO L273 TraceCheckUtils]: 29: Hoare triple {9981#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {9982#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:21,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {9982#(<= main_~a~0 6)} assume true; {9982#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:21,876 INFO L273 TraceCheckUtils]: 31: Hoare triple {9982#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9982#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:21,877 INFO L273 TraceCheckUtils]: 32: Hoare triple {9982#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9982#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:21,877 INFO L273 TraceCheckUtils]: 33: Hoare triple {9982#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {9983#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:21,878 INFO L273 TraceCheckUtils]: 34: Hoare triple {9983#(<= main_~a~0 7)} assume true; {9983#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:21,878 INFO L273 TraceCheckUtils]: 35: Hoare triple {9983#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9983#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:21,879 INFO L273 TraceCheckUtils]: 36: Hoare triple {9983#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9983#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:21,880 INFO L273 TraceCheckUtils]: 37: Hoare triple {9983#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {9984#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:21,880 INFO L273 TraceCheckUtils]: 38: Hoare triple {9984#(<= main_~a~0 8)} assume true; {9984#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:21,881 INFO L273 TraceCheckUtils]: 39: Hoare triple {9984#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9984#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:21,881 INFO L273 TraceCheckUtils]: 40: Hoare triple {9984#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9984#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:21,882 INFO L273 TraceCheckUtils]: 41: Hoare triple {9984#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {9985#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:21,882 INFO L273 TraceCheckUtils]: 42: Hoare triple {9985#(<= main_~a~0 9)} assume true; {9985#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:21,883 INFO L273 TraceCheckUtils]: 43: Hoare triple {9985#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9985#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:21,883 INFO L273 TraceCheckUtils]: 44: Hoare triple {9985#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9985#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:21,884 INFO L273 TraceCheckUtils]: 45: Hoare triple {9985#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {9986#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:21,884 INFO L273 TraceCheckUtils]: 46: Hoare triple {9986#(<= main_~a~0 10)} assume true; {9986#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:21,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {9986#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9986#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:21,885 INFO L273 TraceCheckUtils]: 48: Hoare triple {9986#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9986#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:21,886 INFO L273 TraceCheckUtils]: 49: Hoare triple {9986#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {9987#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:21,887 INFO L273 TraceCheckUtils]: 50: Hoare triple {9987#(<= main_~a~0 11)} assume true; {9987#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:21,887 INFO L273 TraceCheckUtils]: 51: Hoare triple {9987#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9987#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:21,887 INFO L273 TraceCheckUtils]: 52: Hoare triple {9987#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9987#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:21,888 INFO L273 TraceCheckUtils]: 53: Hoare triple {9987#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {9988#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:21,889 INFO L273 TraceCheckUtils]: 54: Hoare triple {9988#(<= main_~a~0 12)} assume true; {9988#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:21,889 INFO L273 TraceCheckUtils]: 55: Hoare triple {9988#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9988#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:21,890 INFO L273 TraceCheckUtils]: 56: Hoare triple {9988#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9988#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:21,890 INFO L273 TraceCheckUtils]: 57: Hoare triple {9988#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {9989#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:21,891 INFO L273 TraceCheckUtils]: 58: Hoare triple {9989#(<= main_~a~0 13)} assume true; {9989#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:21,891 INFO L273 TraceCheckUtils]: 59: Hoare triple {9989#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9989#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:21,892 INFO L273 TraceCheckUtils]: 60: Hoare triple {9989#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9989#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:21,892 INFO L273 TraceCheckUtils]: 61: Hoare triple {9989#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {9990#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:21,893 INFO L273 TraceCheckUtils]: 62: Hoare triple {9990#(<= main_~a~0 14)} assume true; {9990#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:21,894 INFO L273 TraceCheckUtils]: 63: Hoare triple {9990#(<= main_~a~0 14)} assume !(~a~0 < 100000); {9975#false} is VALID [2018-11-18 22:47:21,894 INFO L273 TraceCheckUtils]: 64: Hoare triple {9975#false} ~a~0 := 0; {9975#false} is VALID [2018-11-18 22:47:21,894 INFO L273 TraceCheckUtils]: 65: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,894 INFO L273 TraceCheckUtils]: 66: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,894 INFO L273 TraceCheckUtils]: 67: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,895 INFO L273 TraceCheckUtils]: 68: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,895 INFO L273 TraceCheckUtils]: 69: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,895 INFO L273 TraceCheckUtils]: 70: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,895 INFO L273 TraceCheckUtils]: 71: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,895 INFO L273 TraceCheckUtils]: 72: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,895 INFO L273 TraceCheckUtils]: 73: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,896 INFO L273 TraceCheckUtils]: 74: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,896 INFO L273 TraceCheckUtils]: 75: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,896 INFO L273 TraceCheckUtils]: 76: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,896 INFO L273 TraceCheckUtils]: 77: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,896 INFO L273 TraceCheckUtils]: 78: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,896 INFO L273 TraceCheckUtils]: 79: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,897 INFO L273 TraceCheckUtils]: 80: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,897 INFO L273 TraceCheckUtils]: 81: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,897 INFO L273 TraceCheckUtils]: 82: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,897 INFO L273 TraceCheckUtils]: 83: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,897 INFO L273 TraceCheckUtils]: 84: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,897 INFO L273 TraceCheckUtils]: 85: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,897 INFO L273 TraceCheckUtils]: 86: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,897 INFO L273 TraceCheckUtils]: 87: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,898 INFO L273 TraceCheckUtils]: 88: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,898 INFO L273 TraceCheckUtils]: 89: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,898 INFO L273 TraceCheckUtils]: 90: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,898 INFO L273 TraceCheckUtils]: 91: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,898 INFO L273 TraceCheckUtils]: 92: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,898 INFO L273 TraceCheckUtils]: 93: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,898 INFO L273 TraceCheckUtils]: 94: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,898 INFO L273 TraceCheckUtils]: 95: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,898 INFO L273 TraceCheckUtils]: 96: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,899 INFO L273 TraceCheckUtils]: 97: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,899 INFO L273 TraceCheckUtils]: 98: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,899 INFO L273 TraceCheckUtils]: 99: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,899 INFO L273 TraceCheckUtils]: 100: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,899 INFO L273 TraceCheckUtils]: 101: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,899 INFO L273 TraceCheckUtils]: 102: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,899 INFO L273 TraceCheckUtils]: 103: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,899 INFO L273 TraceCheckUtils]: 104: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,899 INFO L273 TraceCheckUtils]: 105: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,900 INFO L273 TraceCheckUtils]: 106: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,900 INFO L273 TraceCheckUtils]: 107: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,900 INFO L273 TraceCheckUtils]: 108: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,900 INFO L273 TraceCheckUtils]: 109: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,900 INFO L273 TraceCheckUtils]: 110: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,900 INFO L273 TraceCheckUtils]: 111: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,900 INFO L273 TraceCheckUtils]: 112: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,900 INFO L273 TraceCheckUtils]: 113: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,901 INFO L273 TraceCheckUtils]: 114: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,901 INFO L273 TraceCheckUtils]: 115: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,901 INFO L273 TraceCheckUtils]: 116: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,901 INFO L273 TraceCheckUtils]: 117: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,901 INFO L273 TraceCheckUtils]: 118: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,901 INFO L273 TraceCheckUtils]: 119: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:21,901 INFO L273 TraceCheckUtils]: 120: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:21,901 INFO L273 TraceCheckUtils]: 121: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,901 INFO L273 TraceCheckUtils]: 122: Hoare triple {9975#false} assume !(~a~0 < 100000); {9975#false} is VALID [2018-11-18 22:47:21,902 INFO L273 TraceCheckUtils]: 123: Hoare triple {9975#false} havoc ~x~0;~x~0 := 0; {9975#false} is VALID [2018-11-18 22:47:21,902 INFO L273 TraceCheckUtils]: 124: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:21,902 INFO L273 TraceCheckUtils]: 125: Hoare triple {9975#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {9975#false} is VALID [2018-11-18 22:47:21,902 INFO L256 TraceCheckUtils]: 126: Hoare triple {9975#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {9975#false} is VALID [2018-11-18 22:47:21,902 INFO L273 TraceCheckUtils]: 127: Hoare triple {9975#false} ~cond := #in~cond; {9975#false} is VALID [2018-11-18 22:47:21,902 INFO L273 TraceCheckUtils]: 128: Hoare triple {9975#false} assume 0 == ~cond; {9975#false} is VALID [2018-11-18 22:47:21,902 INFO L273 TraceCheckUtils]: 129: Hoare triple {9975#false} assume !false; {9975#false} is VALID [2018-11-18 22:47:21,911 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-18 22:47:21,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:21,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:21,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:47:21,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:47:21,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:22,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:22,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {9974#true} call ULTIMATE.init(); {9974#true} is VALID [2018-11-18 22:47:22,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {9974#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9974#true} is VALID [2018-11-18 22:47:22,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {9974#true} assume true; {9974#true} is VALID [2018-11-18 22:47:22,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9974#true} {9974#true} #95#return; {9974#true} is VALID [2018-11-18 22:47:22,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {9974#true} call #t~ret8 := main(); {9974#true} is VALID [2018-11-18 22:47:22,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {9974#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {10009#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:22,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {10009#(<= main_~a~0 0)} assume true; {10009#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:22,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {10009#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {10009#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:22,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {10009#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {10009#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:22,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {10009#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {9977#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:22,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {9977#(<= main_~a~0 1)} assume true; {9977#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:22,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {9977#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9977#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:22,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {9977#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9977#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:22,390 INFO L273 TraceCheckUtils]: 13: Hoare triple {9977#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {9978#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:22,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {9978#(<= main_~a~0 2)} assume true; {9978#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:22,391 INFO L273 TraceCheckUtils]: 15: Hoare triple {9978#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9978#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:22,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {9978#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9978#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:22,392 INFO L273 TraceCheckUtils]: 17: Hoare triple {9978#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {9979#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:22,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {9979#(<= main_~a~0 3)} assume true; {9979#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:22,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {9979#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9979#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:22,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {9979#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9979#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:22,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {9979#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {9980#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:22,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {9980#(<= main_~a~0 4)} assume true; {9980#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:22,396 INFO L273 TraceCheckUtils]: 23: Hoare triple {9980#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9980#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:22,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {9980#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9980#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:22,397 INFO L273 TraceCheckUtils]: 25: Hoare triple {9980#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {9981#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:22,397 INFO L273 TraceCheckUtils]: 26: Hoare triple {9981#(<= main_~a~0 5)} assume true; {9981#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:22,398 INFO L273 TraceCheckUtils]: 27: Hoare triple {9981#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9981#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:22,398 INFO L273 TraceCheckUtils]: 28: Hoare triple {9981#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9981#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:22,399 INFO L273 TraceCheckUtils]: 29: Hoare triple {9981#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {9982#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:22,399 INFO L273 TraceCheckUtils]: 30: Hoare triple {9982#(<= main_~a~0 6)} assume true; {9982#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:22,400 INFO L273 TraceCheckUtils]: 31: Hoare triple {9982#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9982#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:22,400 INFO L273 TraceCheckUtils]: 32: Hoare triple {9982#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9982#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:22,401 INFO L273 TraceCheckUtils]: 33: Hoare triple {9982#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {9983#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:22,401 INFO L273 TraceCheckUtils]: 34: Hoare triple {9983#(<= main_~a~0 7)} assume true; {9983#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:22,402 INFO L273 TraceCheckUtils]: 35: Hoare triple {9983#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9983#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:22,402 INFO L273 TraceCheckUtils]: 36: Hoare triple {9983#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9983#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:22,403 INFO L273 TraceCheckUtils]: 37: Hoare triple {9983#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {9984#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:22,404 INFO L273 TraceCheckUtils]: 38: Hoare triple {9984#(<= main_~a~0 8)} assume true; {9984#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:22,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {9984#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9984#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:22,405 INFO L273 TraceCheckUtils]: 40: Hoare triple {9984#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9984#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:22,405 INFO L273 TraceCheckUtils]: 41: Hoare triple {9984#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {9985#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:22,406 INFO L273 TraceCheckUtils]: 42: Hoare triple {9985#(<= main_~a~0 9)} assume true; {9985#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:22,406 INFO L273 TraceCheckUtils]: 43: Hoare triple {9985#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9985#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:22,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {9985#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9985#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:22,407 INFO L273 TraceCheckUtils]: 45: Hoare triple {9985#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {9986#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:22,408 INFO L273 TraceCheckUtils]: 46: Hoare triple {9986#(<= main_~a~0 10)} assume true; {9986#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:22,408 INFO L273 TraceCheckUtils]: 47: Hoare triple {9986#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9986#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:22,409 INFO L273 TraceCheckUtils]: 48: Hoare triple {9986#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9986#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:22,409 INFO L273 TraceCheckUtils]: 49: Hoare triple {9986#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {9987#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:22,410 INFO L273 TraceCheckUtils]: 50: Hoare triple {9987#(<= main_~a~0 11)} assume true; {9987#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:22,410 INFO L273 TraceCheckUtils]: 51: Hoare triple {9987#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9987#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:22,411 INFO L273 TraceCheckUtils]: 52: Hoare triple {9987#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9987#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:22,412 INFO L273 TraceCheckUtils]: 53: Hoare triple {9987#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {9988#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:22,412 INFO L273 TraceCheckUtils]: 54: Hoare triple {9988#(<= main_~a~0 12)} assume true; {9988#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:22,413 INFO L273 TraceCheckUtils]: 55: Hoare triple {9988#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9988#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:22,413 INFO L273 TraceCheckUtils]: 56: Hoare triple {9988#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9988#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:22,414 INFO L273 TraceCheckUtils]: 57: Hoare triple {9988#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {9989#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:22,414 INFO L273 TraceCheckUtils]: 58: Hoare triple {9989#(<= main_~a~0 13)} assume true; {9989#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:22,415 INFO L273 TraceCheckUtils]: 59: Hoare triple {9989#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9989#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:22,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {9989#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {9989#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:22,416 INFO L273 TraceCheckUtils]: 61: Hoare triple {9989#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {9990#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:22,416 INFO L273 TraceCheckUtils]: 62: Hoare triple {9990#(<= main_~a~0 14)} assume true; {9990#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:22,417 INFO L273 TraceCheckUtils]: 63: Hoare triple {9990#(<= main_~a~0 14)} assume !(~a~0 < 100000); {9975#false} is VALID [2018-11-18 22:47:22,417 INFO L273 TraceCheckUtils]: 64: Hoare triple {9975#false} ~a~0 := 0; {9975#false} is VALID [2018-11-18 22:47:22,417 INFO L273 TraceCheckUtils]: 65: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,418 INFO L273 TraceCheckUtils]: 67: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,418 INFO L273 TraceCheckUtils]: 68: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,418 INFO L273 TraceCheckUtils]: 69: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,418 INFO L273 TraceCheckUtils]: 70: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,419 INFO L273 TraceCheckUtils]: 71: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,419 INFO L273 TraceCheckUtils]: 72: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,419 INFO L273 TraceCheckUtils]: 73: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,419 INFO L273 TraceCheckUtils]: 74: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,419 INFO L273 TraceCheckUtils]: 75: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,419 INFO L273 TraceCheckUtils]: 76: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,420 INFO L273 TraceCheckUtils]: 77: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,420 INFO L273 TraceCheckUtils]: 78: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,420 INFO L273 TraceCheckUtils]: 79: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,420 INFO L273 TraceCheckUtils]: 80: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,420 INFO L273 TraceCheckUtils]: 81: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,420 INFO L273 TraceCheckUtils]: 82: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,420 INFO L273 TraceCheckUtils]: 83: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,420 INFO L273 TraceCheckUtils]: 84: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,420 INFO L273 TraceCheckUtils]: 85: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,421 INFO L273 TraceCheckUtils]: 86: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,421 INFO L273 TraceCheckUtils]: 87: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,421 INFO L273 TraceCheckUtils]: 88: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,421 INFO L273 TraceCheckUtils]: 89: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,421 INFO L273 TraceCheckUtils]: 90: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,421 INFO L273 TraceCheckUtils]: 91: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,421 INFO L273 TraceCheckUtils]: 92: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,421 INFO L273 TraceCheckUtils]: 93: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,421 INFO L273 TraceCheckUtils]: 94: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,422 INFO L273 TraceCheckUtils]: 95: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,422 INFO L273 TraceCheckUtils]: 96: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,422 INFO L273 TraceCheckUtils]: 97: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,422 INFO L273 TraceCheckUtils]: 98: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,422 INFO L273 TraceCheckUtils]: 99: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,422 INFO L273 TraceCheckUtils]: 100: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,422 INFO L273 TraceCheckUtils]: 101: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,422 INFO L273 TraceCheckUtils]: 102: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,422 INFO L273 TraceCheckUtils]: 103: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,423 INFO L273 TraceCheckUtils]: 104: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,423 INFO L273 TraceCheckUtils]: 105: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,423 INFO L273 TraceCheckUtils]: 106: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,423 INFO L273 TraceCheckUtils]: 107: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,423 INFO L273 TraceCheckUtils]: 108: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,423 INFO L273 TraceCheckUtils]: 109: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,423 INFO L273 TraceCheckUtils]: 110: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,423 INFO L273 TraceCheckUtils]: 111: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,424 INFO L273 TraceCheckUtils]: 112: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,424 INFO L273 TraceCheckUtils]: 113: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,424 INFO L273 TraceCheckUtils]: 114: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,424 INFO L273 TraceCheckUtils]: 115: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,424 INFO L273 TraceCheckUtils]: 116: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,424 INFO L273 TraceCheckUtils]: 117: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,424 INFO L273 TraceCheckUtils]: 118: Hoare triple {9975#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,424 INFO L273 TraceCheckUtils]: 119: Hoare triple {9975#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {9975#false} is VALID [2018-11-18 22:47:22,424 INFO L273 TraceCheckUtils]: 120: Hoare triple {9975#false} ~a~0 := 1 + ~a~0; {9975#false} is VALID [2018-11-18 22:47:22,425 INFO L273 TraceCheckUtils]: 121: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,425 INFO L273 TraceCheckUtils]: 122: Hoare triple {9975#false} assume !(~a~0 < 100000); {9975#false} is VALID [2018-11-18 22:47:22,425 INFO L273 TraceCheckUtils]: 123: Hoare triple {9975#false} havoc ~x~0;~x~0 := 0; {9975#false} is VALID [2018-11-18 22:47:22,425 INFO L273 TraceCheckUtils]: 124: Hoare triple {9975#false} assume true; {9975#false} is VALID [2018-11-18 22:47:22,425 INFO L273 TraceCheckUtils]: 125: Hoare triple {9975#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {9975#false} is VALID [2018-11-18 22:47:22,425 INFO L256 TraceCheckUtils]: 126: Hoare triple {9975#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {9975#false} is VALID [2018-11-18 22:47:22,425 INFO L273 TraceCheckUtils]: 127: Hoare triple {9975#false} ~cond := #in~cond; {9975#false} is VALID [2018-11-18 22:47:22,425 INFO L273 TraceCheckUtils]: 128: Hoare triple {9975#false} assume 0 == ~cond; {9975#false} is VALID [2018-11-18 22:47:22,425 INFO L273 TraceCheckUtils]: 129: Hoare triple {9975#false} assume !false; {9975#false} is VALID [2018-11-18 22:47:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2018-11-18 22:47:22,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:22,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-18 22:47:22,453 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 130 [2018-11-18 22:47:22,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:22,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 22:47:22,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:22,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 22:47:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 22:47:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:47:22,527 INFO L87 Difference]: Start difference. First operand 141 states and 173 transitions. Second operand 18 states. [2018-11-18 22:47:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:23,101 INFO L93 Difference]: Finished difference Result 230 states and 285 transitions. [2018-11-18 22:47:23,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 22:47:23,101 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 130 [2018-11-18 22:47:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:23,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:47:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 218 transitions. [2018-11-18 22:47:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 22:47:23,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 218 transitions. [2018-11-18 22:47:23,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 218 transitions. [2018-11-18 22:47:23,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:23,294 INFO L225 Difference]: With dead ends: 230 [2018-11-18 22:47:23,295 INFO L226 Difference]: Without dead ends: 153 [2018-11-18 22:47:23,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-18 22:47:23,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-18 22:47:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2018-11-18 22:47:23,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:23,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 149 states. [2018-11-18 22:47:23,321 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 149 states. [2018-11-18 22:47:23,321 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 149 states. [2018-11-18 22:47:23,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:23,324 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2018-11-18 22:47:23,324 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 189 transitions. [2018-11-18 22:47:23,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:23,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:23,325 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 153 states. [2018-11-18 22:47:23,325 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 153 states. [2018-11-18 22:47:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:23,328 INFO L93 Difference]: Finished difference Result 153 states and 189 transitions. [2018-11-18 22:47:23,328 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 189 transitions. [2018-11-18 22:47:23,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:23,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:23,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:23,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-18 22:47:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 183 transitions. [2018-11-18 22:47:23,332 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 183 transitions. Word has length 130 [2018-11-18 22:47:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:23,332 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 183 transitions. [2018-11-18 22:47:23,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 22:47:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2018-11-18 22:47:23,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-18 22:47:23,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:23,334 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:23,335 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:23,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:23,335 INFO L82 PathProgramCache]: Analyzing trace with hash 128497875, now seen corresponding path program 15 times [2018-11-18 22:47:23,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:23,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:23,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:23,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:23,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:23,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {11168#true} call ULTIMATE.init(); {11168#true} is VALID [2018-11-18 22:47:23,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {11168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11168#true} is VALID [2018-11-18 22:47:23,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:23,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11168#true} {11168#true} #95#return; {11168#true} is VALID [2018-11-18 22:47:23,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {11168#true} call #t~ret8 := main(); {11168#true} is VALID [2018-11-18 22:47:23,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {11168#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {11170#(= main_~a~0 0)} is VALID [2018-11-18 22:47:23,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {11170#(= main_~a~0 0)} assume true; {11170#(= main_~a~0 0)} is VALID [2018-11-18 22:47:23,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {11170#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11170#(= main_~a~0 0)} is VALID [2018-11-18 22:47:23,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {11170#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11170#(= main_~a~0 0)} is VALID [2018-11-18 22:47:23,669 INFO L273 TraceCheckUtils]: 9: Hoare triple {11170#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {11171#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:23,670 INFO L273 TraceCheckUtils]: 10: Hoare triple {11171#(<= main_~a~0 1)} assume true; {11171#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:23,670 INFO L273 TraceCheckUtils]: 11: Hoare triple {11171#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11171#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:23,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {11171#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11171#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:23,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {11171#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {11172#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:23,671 INFO L273 TraceCheckUtils]: 14: Hoare triple {11172#(<= main_~a~0 2)} assume true; {11172#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:23,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {11172#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11172#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:23,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {11172#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11172#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:23,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {11172#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {11173#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:23,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {11173#(<= main_~a~0 3)} assume true; {11173#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:23,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {11173#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11173#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:23,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {11173#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11173#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:23,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {11173#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {11174#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:23,675 INFO L273 TraceCheckUtils]: 22: Hoare triple {11174#(<= main_~a~0 4)} assume true; {11174#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:23,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {11174#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11174#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:23,676 INFO L273 TraceCheckUtils]: 24: Hoare triple {11174#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11174#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:23,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {11174#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {11175#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:23,678 INFO L273 TraceCheckUtils]: 26: Hoare triple {11175#(<= main_~a~0 5)} assume true; {11175#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:23,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {11175#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11175#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:23,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {11175#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11175#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:23,679 INFO L273 TraceCheckUtils]: 29: Hoare triple {11175#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {11176#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:23,680 INFO L273 TraceCheckUtils]: 30: Hoare triple {11176#(<= main_~a~0 6)} assume true; {11176#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:23,680 INFO L273 TraceCheckUtils]: 31: Hoare triple {11176#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11176#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:23,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {11176#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11176#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:23,681 INFO L273 TraceCheckUtils]: 33: Hoare triple {11176#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {11177#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:23,682 INFO L273 TraceCheckUtils]: 34: Hoare triple {11177#(<= main_~a~0 7)} assume true; {11177#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:23,682 INFO L273 TraceCheckUtils]: 35: Hoare triple {11177#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11177#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:23,683 INFO L273 TraceCheckUtils]: 36: Hoare triple {11177#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11177#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:23,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {11177#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {11178#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:23,684 INFO L273 TraceCheckUtils]: 38: Hoare triple {11178#(<= main_~a~0 8)} assume true; {11178#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:23,684 INFO L273 TraceCheckUtils]: 39: Hoare triple {11178#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11178#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:23,685 INFO L273 TraceCheckUtils]: 40: Hoare triple {11178#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11178#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:23,686 INFO L273 TraceCheckUtils]: 41: Hoare triple {11178#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {11179#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:23,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {11179#(<= main_~a~0 9)} assume true; {11179#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:23,687 INFO L273 TraceCheckUtils]: 43: Hoare triple {11179#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11179#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:23,687 INFO L273 TraceCheckUtils]: 44: Hoare triple {11179#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11179#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:23,688 INFO L273 TraceCheckUtils]: 45: Hoare triple {11179#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {11180#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:23,688 INFO L273 TraceCheckUtils]: 46: Hoare triple {11180#(<= main_~a~0 10)} assume true; {11180#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:23,689 INFO L273 TraceCheckUtils]: 47: Hoare triple {11180#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11180#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:23,689 INFO L273 TraceCheckUtils]: 48: Hoare triple {11180#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11180#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:23,690 INFO L273 TraceCheckUtils]: 49: Hoare triple {11180#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {11181#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:23,690 INFO L273 TraceCheckUtils]: 50: Hoare triple {11181#(<= main_~a~0 11)} assume true; {11181#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:23,691 INFO L273 TraceCheckUtils]: 51: Hoare triple {11181#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11181#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:23,691 INFO L273 TraceCheckUtils]: 52: Hoare triple {11181#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11181#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:23,692 INFO L273 TraceCheckUtils]: 53: Hoare triple {11181#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {11182#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:23,692 INFO L273 TraceCheckUtils]: 54: Hoare triple {11182#(<= main_~a~0 12)} assume true; {11182#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:23,693 INFO L273 TraceCheckUtils]: 55: Hoare triple {11182#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11182#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:23,693 INFO L273 TraceCheckUtils]: 56: Hoare triple {11182#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11182#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:23,694 INFO L273 TraceCheckUtils]: 57: Hoare triple {11182#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {11183#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:23,695 INFO L273 TraceCheckUtils]: 58: Hoare triple {11183#(<= main_~a~0 13)} assume true; {11183#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:23,695 INFO L273 TraceCheckUtils]: 59: Hoare triple {11183#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11183#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:23,696 INFO L273 TraceCheckUtils]: 60: Hoare triple {11183#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11183#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:23,696 INFO L273 TraceCheckUtils]: 61: Hoare triple {11183#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {11184#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:23,697 INFO L273 TraceCheckUtils]: 62: Hoare triple {11184#(<= main_~a~0 14)} assume true; {11184#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:23,697 INFO L273 TraceCheckUtils]: 63: Hoare triple {11184#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11184#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:23,698 INFO L273 TraceCheckUtils]: 64: Hoare triple {11184#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11184#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:23,698 INFO L273 TraceCheckUtils]: 65: Hoare triple {11184#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {11185#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:23,699 INFO L273 TraceCheckUtils]: 66: Hoare triple {11185#(<= main_~a~0 15)} assume true; {11185#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:23,699 INFO L273 TraceCheckUtils]: 67: Hoare triple {11185#(<= main_~a~0 15)} assume !(~a~0 < 100000); {11169#false} is VALID [2018-11-18 22:47:23,700 INFO L273 TraceCheckUtils]: 68: Hoare triple {11169#false} ~a~0 := 0; {11169#false} is VALID [2018-11-18 22:47:23,700 INFO L273 TraceCheckUtils]: 69: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,700 INFO L273 TraceCheckUtils]: 70: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,700 INFO L273 TraceCheckUtils]: 71: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,700 INFO L273 TraceCheckUtils]: 72: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,701 INFO L273 TraceCheckUtils]: 73: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,701 INFO L273 TraceCheckUtils]: 74: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,701 INFO L273 TraceCheckUtils]: 75: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,701 INFO L273 TraceCheckUtils]: 76: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,701 INFO L273 TraceCheckUtils]: 77: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,702 INFO L273 TraceCheckUtils]: 78: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,702 INFO L273 TraceCheckUtils]: 79: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,702 INFO L273 TraceCheckUtils]: 80: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,702 INFO L273 TraceCheckUtils]: 81: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,702 INFO L273 TraceCheckUtils]: 82: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,702 INFO L273 TraceCheckUtils]: 83: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,703 INFO L273 TraceCheckUtils]: 84: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,703 INFO L273 TraceCheckUtils]: 85: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,703 INFO L273 TraceCheckUtils]: 86: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,703 INFO L273 TraceCheckUtils]: 87: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,703 INFO L273 TraceCheckUtils]: 88: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,704 INFO L273 TraceCheckUtils]: 89: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,704 INFO L273 TraceCheckUtils]: 90: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,704 INFO L273 TraceCheckUtils]: 91: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,704 INFO L273 TraceCheckUtils]: 92: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,704 INFO L273 TraceCheckUtils]: 93: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,705 INFO L273 TraceCheckUtils]: 94: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,705 INFO L273 TraceCheckUtils]: 95: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,705 INFO L273 TraceCheckUtils]: 96: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,705 INFO L273 TraceCheckUtils]: 97: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,705 INFO L273 TraceCheckUtils]: 98: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,705 INFO L273 TraceCheckUtils]: 99: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,705 INFO L273 TraceCheckUtils]: 100: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,705 INFO L273 TraceCheckUtils]: 101: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,706 INFO L273 TraceCheckUtils]: 102: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,706 INFO L273 TraceCheckUtils]: 103: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,706 INFO L273 TraceCheckUtils]: 104: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,706 INFO L273 TraceCheckUtils]: 105: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,706 INFO L273 TraceCheckUtils]: 106: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,706 INFO L273 TraceCheckUtils]: 107: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,706 INFO L273 TraceCheckUtils]: 108: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,706 INFO L273 TraceCheckUtils]: 109: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,706 INFO L273 TraceCheckUtils]: 110: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,707 INFO L273 TraceCheckUtils]: 111: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,707 INFO L273 TraceCheckUtils]: 112: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,707 INFO L273 TraceCheckUtils]: 113: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,707 INFO L273 TraceCheckUtils]: 114: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,707 INFO L273 TraceCheckUtils]: 115: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,707 INFO L273 TraceCheckUtils]: 116: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,707 INFO L273 TraceCheckUtils]: 117: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,707 INFO L273 TraceCheckUtils]: 118: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,707 INFO L273 TraceCheckUtils]: 119: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,708 INFO L273 TraceCheckUtils]: 120: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,708 INFO L273 TraceCheckUtils]: 121: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,708 INFO L273 TraceCheckUtils]: 122: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,708 INFO L273 TraceCheckUtils]: 123: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,708 INFO L273 TraceCheckUtils]: 124: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,708 INFO L273 TraceCheckUtils]: 125: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,708 INFO L273 TraceCheckUtils]: 126: Hoare triple {11169#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,708 INFO L273 TraceCheckUtils]: 127: Hoare triple {11169#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11169#false} is VALID [2018-11-18 22:47:23,708 INFO L273 TraceCheckUtils]: 128: Hoare triple {11169#false} ~a~0 := 1 + ~a~0; {11169#false} is VALID [2018-11-18 22:47:23,709 INFO L273 TraceCheckUtils]: 129: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,709 INFO L273 TraceCheckUtils]: 130: Hoare triple {11169#false} assume !(~a~0 < 100000); {11169#false} is VALID [2018-11-18 22:47:23,709 INFO L273 TraceCheckUtils]: 131: Hoare triple {11169#false} havoc ~x~0;~x~0 := 0; {11169#false} is VALID [2018-11-18 22:47:23,709 INFO L273 TraceCheckUtils]: 132: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:23,709 INFO L273 TraceCheckUtils]: 133: Hoare triple {11169#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {11169#false} is VALID [2018-11-18 22:47:23,709 INFO L256 TraceCheckUtils]: 134: Hoare triple {11169#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {11169#false} is VALID [2018-11-18 22:47:23,709 INFO L273 TraceCheckUtils]: 135: Hoare triple {11169#false} ~cond := #in~cond; {11169#false} is VALID [2018-11-18 22:47:23,709 INFO L273 TraceCheckUtils]: 136: Hoare triple {11169#false} assume 0 == ~cond; {11169#false} is VALID [2018-11-18 22:47:23,710 INFO L273 TraceCheckUtils]: 137: Hoare triple {11169#false} assume !false; {11169#false} is VALID [2018-11-18 22:47:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-18 22:47:23,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:23,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:23,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:47:26,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-18 22:47:26,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:26,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:26,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {11168#true} call ULTIMATE.init(); {11168#true} is VALID [2018-11-18 22:47:26,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {11168#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11168#true} is VALID [2018-11-18 22:47:26,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,588 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11168#true} {11168#true} #95#return; {11168#true} is VALID [2018-11-18 22:47:26,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {11168#true} call #t~ret8 := main(); {11168#true} is VALID [2018-11-18 22:47:26,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {11168#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {11168#true} is VALID [2018-11-18 22:47:26,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,589 INFO L273 TraceCheckUtils]: 11: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,589 INFO L273 TraceCheckUtils]: 12: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,589 INFO L273 TraceCheckUtils]: 13: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,589 INFO L273 TraceCheckUtils]: 14: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,589 INFO L273 TraceCheckUtils]: 15: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,589 INFO L273 TraceCheckUtils]: 16: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,589 INFO L273 TraceCheckUtils]: 17: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,590 INFO L273 TraceCheckUtils]: 18: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,590 INFO L273 TraceCheckUtils]: 19: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,590 INFO L273 TraceCheckUtils]: 20: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,590 INFO L273 TraceCheckUtils]: 21: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,590 INFO L273 TraceCheckUtils]: 22: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,590 INFO L273 TraceCheckUtils]: 23: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,590 INFO L273 TraceCheckUtils]: 26: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,591 INFO L273 TraceCheckUtils]: 27: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,591 INFO L273 TraceCheckUtils]: 29: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,591 INFO L273 TraceCheckUtils]: 30: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,591 INFO L273 TraceCheckUtils]: 31: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,591 INFO L273 TraceCheckUtils]: 33: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,591 INFO L273 TraceCheckUtils]: 34: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,592 INFO L273 TraceCheckUtils]: 35: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,592 INFO L273 TraceCheckUtils]: 36: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,592 INFO L273 TraceCheckUtils]: 37: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,592 INFO L273 TraceCheckUtils]: 38: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,592 INFO L273 TraceCheckUtils]: 39: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,592 INFO L273 TraceCheckUtils]: 40: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,592 INFO L273 TraceCheckUtils]: 41: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,592 INFO L273 TraceCheckUtils]: 42: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,592 INFO L273 TraceCheckUtils]: 43: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,593 INFO L273 TraceCheckUtils]: 44: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,593 INFO L273 TraceCheckUtils]: 45: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,593 INFO L273 TraceCheckUtils]: 46: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,593 INFO L273 TraceCheckUtils]: 47: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,593 INFO L273 TraceCheckUtils]: 48: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,593 INFO L273 TraceCheckUtils]: 49: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,593 INFO L273 TraceCheckUtils]: 50: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,593 INFO L273 TraceCheckUtils]: 51: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,593 INFO L273 TraceCheckUtils]: 52: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,594 INFO L273 TraceCheckUtils]: 53: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,594 INFO L273 TraceCheckUtils]: 54: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,594 INFO L273 TraceCheckUtils]: 55: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,594 INFO L273 TraceCheckUtils]: 56: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,594 INFO L273 TraceCheckUtils]: 57: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,594 INFO L273 TraceCheckUtils]: 58: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,594 INFO L273 TraceCheckUtils]: 59: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,594 INFO L273 TraceCheckUtils]: 60: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,594 INFO L273 TraceCheckUtils]: 61: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,595 INFO L273 TraceCheckUtils]: 62: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,595 INFO L273 TraceCheckUtils]: 63: Hoare triple {11168#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11168#true} is VALID [2018-11-18 22:47:26,595 INFO L273 TraceCheckUtils]: 64: Hoare triple {11168#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {11168#true} is VALID [2018-11-18 22:47:26,595 INFO L273 TraceCheckUtils]: 65: Hoare triple {11168#true} ~a~0 := 1 + ~a~0; {11168#true} is VALID [2018-11-18 22:47:26,595 INFO L273 TraceCheckUtils]: 66: Hoare triple {11168#true} assume true; {11168#true} is VALID [2018-11-18 22:47:26,595 INFO L273 TraceCheckUtils]: 67: Hoare triple {11168#true} assume !(~a~0 < 100000); {11168#true} is VALID [2018-11-18 22:47:26,595 INFO L273 TraceCheckUtils]: 68: Hoare triple {11168#true} ~a~0 := 0; {11393#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:26,596 INFO L273 TraceCheckUtils]: 69: Hoare triple {11393#(<= main_~a~0 0)} assume true; {11393#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:26,596 INFO L273 TraceCheckUtils]: 70: Hoare triple {11393#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11393#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:26,596 INFO L273 TraceCheckUtils]: 71: Hoare triple {11393#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11393#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:26,597 INFO L273 TraceCheckUtils]: 72: Hoare triple {11393#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {11171#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:26,597 INFO L273 TraceCheckUtils]: 73: Hoare triple {11171#(<= main_~a~0 1)} assume true; {11171#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:26,597 INFO L273 TraceCheckUtils]: 74: Hoare triple {11171#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11171#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:26,598 INFO L273 TraceCheckUtils]: 75: Hoare triple {11171#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11171#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:26,598 INFO L273 TraceCheckUtils]: 76: Hoare triple {11171#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {11172#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:26,599 INFO L273 TraceCheckUtils]: 77: Hoare triple {11172#(<= main_~a~0 2)} assume true; {11172#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:26,599 INFO L273 TraceCheckUtils]: 78: Hoare triple {11172#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11172#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:26,599 INFO L273 TraceCheckUtils]: 79: Hoare triple {11172#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11172#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:26,600 INFO L273 TraceCheckUtils]: 80: Hoare triple {11172#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {11173#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:26,600 INFO L273 TraceCheckUtils]: 81: Hoare triple {11173#(<= main_~a~0 3)} assume true; {11173#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:26,601 INFO L273 TraceCheckUtils]: 82: Hoare triple {11173#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11173#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:26,601 INFO L273 TraceCheckUtils]: 83: Hoare triple {11173#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11173#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:26,602 INFO L273 TraceCheckUtils]: 84: Hoare triple {11173#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {11174#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:26,602 INFO L273 TraceCheckUtils]: 85: Hoare triple {11174#(<= main_~a~0 4)} assume true; {11174#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:26,603 INFO L273 TraceCheckUtils]: 86: Hoare triple {11174#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11174#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:26,603 INFO L273 TraceCheckUtils]: 87: Hoare triple {11174#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11174#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:26,604 INFO L273 TraceCheckUtils]: 88: Hoare triple {11174#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {11175#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:26,605 INFO L273 TraceCheckUtils]: 89: Hoare triple {11175#(<= main_~a~0 5)} assume true; {11175#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:26,605 INFO L273 TraceCheckUtils]: 90: Hoare triple {11175#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11175#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:26,605 INFO L273 TraceCheckUtils]: 91: Hoare triple {11175#(<= main_~a~0 5)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11175#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:26,606 INFO L273 TraceCheckUtils]: 92: Hoare triple {11175#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {11176#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:26,607 INFO L273 TraceCheckUtils]: 93: Hoare triple {11176#(<= main_~a~0 6)} assume true; {11176#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:26,607 INFO L273 TraceCheckUtils]: 94: Hoare triple {11176#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11176#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:26,608 INFO L273 TraceCheckUtils]: 95: Hoare triple {11176#(<= main_~a~0 6)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11176#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:26,608 INFO L273 TraceCheckUtils]: 96: Hoare triple {11176#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {11177#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:26,609 INFO L273 TraceCheckUtils]: 97: Hoare triple {11177#(<= main_~a~0 7)} assume true; {11177#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:26,609 INFO L273 TraceCheckUtils]: 98: Hoare triple {11177#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11177#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:26,610 INFO L273 TraceCheckUtils]: 99: Hoare triple {11177#(<= main_~a~0 7)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11177#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:26,610 INFO L273 TraceCheckUtils]: 100: Hoare triple {11177#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {11178#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:26,611 INFO L273 TraceCheckUtils]: 101: Hoare triple {11178#(<= main_~a~0 8)} assume true; {11178#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:26,612 INFO L273 TraceCheckUtils]: 102: Hoare triple {11178#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11178#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:26,612 INFO L273 TraceCheckUtils]: 103: Hoare triple {11178#(<= main_~a~0 8)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11178#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:26,613 INFO L273 TraceCheckUtils]: 104: Hoare triple {11178#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {11179#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:26,614 INFO L273 TraceCheckUtils]: 105: Hoare triple {11179#(<= main_~a~0 9)} assume true; {11179#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:26,614 INFO L273 TraceCheckUtils]: 106: Hoare triple {11179#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11179#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:26,615 INFO L273 TraceCheckUtils]: 107: Hoare triple {11179#(<= main_~a~0 9)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11179#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:26,615 INFO L273 TraceCheckUtils]: 108: Hoare triple {11179#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {11180#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:26,616 INFO L273 TraceCheckUtils]: 109: Hoare triple {11180#(<= main_~a~0 10)} assume true; {11180#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:26,616 INFO L273 TraceCheckUtils]: 110: Hoare triple {11180#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11180#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:26,617 INFO L273 TraceCheckUtils]: 111: Hoare triple {11180#(<= main_~a~0 10)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11180#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:26,617 INFO L273 TraceCheckUtils]: 112: Hoare triple {11180#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {11181#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:26,618 INFO L273 TraceCheckUtils]: 113: Hoare triple {11181#(<= main_~a~0 11)} assume true; {11181#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:26,618 INFO L273 TraceCheckUtils]: 114: Hoare triple {11181#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11181#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:26,619 INFO L273 TraceCheckUtils]: 115: Hoare triple {11181#(<= main_~a~0 11)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11181#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:26,619 INFO L273 TraceCheckUtils]: 116: Hoare triple {11181#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {11182#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:26,620 INFO L273 TraceCheckUtils]: 117: Hoare triple {11182#(<= main_~a~0 12)} assume true; {11182#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:26,620 INFO L273 TraceCheckUtils]: 118: Hoare triple {11182#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11182#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:26,621 INFO L273 TraceCheckUtils]: 119: Hoare triple {11182#(<= main_~a~0 12)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11182#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:26,622 INFO L273 TraceCheckUtils]: 120: Hoare triple {11182#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {11183#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:26,622 INFO L273 TraceCheckUtils]: 121: Hoare triple {11183#(<= main_~a~0 13)} assume true; {11183#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:26,623 INFO L273 TraceCheckUtils]: 122: Hoare triple {11183#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11183#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:26,623 INFO L273 TraceCheckUtils]: 123: Hoare triple {11183#(<= main_~a~0 13)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11183#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:26,624 INFO L273 TraceCheckUtils]: 124: Hoare triple {11183#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {11184#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:26,624 INFO L273 TraceCheckUtils]: 125: Hoare triple {11184#(<= main_~a~0 14)} assume true; {11184#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:26,625 INFO L273 TraceCheckUtils]: 126: Hoare triple {11184#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {11184#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:26,625 INFO L273 TraceCheckUtils]: 127: Hoare triple {11184#(<= main_~a~0 14)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {11184#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:26,626 INFO L273 TraceCheckUtils]: 128: Hoare triple {11184#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {11185#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:26,626 INFO L273 TraceCheckUtils]: 129: Hoare triple {11185#(<= main_~a~0 15)} assume true; {11185#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:26,627 INFO L273 TraceCheckUtils]: 130: Hoare triple {11185#(<= main_~a~0 15)} assume !(~a~0 < 100000); {11169#false} is VALID [2018-11-18 22:47:26,627 INFO L273 TraceCheckUtils]: 131: Hoare triple {11169#false} havoc ~x~0;~x~0 := 0; {11169#false} is VALID [2018-11-18 22:47:26,627 INFO L273 TraceCheckUtils]: 132: Hoare triple {11169#false} assume true; {11169#false} is VALID [2018-11-18 22:47:26,628 INFO L273 TraceCheckUtils]: 133: Hoare triple {11169#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {11169#false} is VALID [2018-11-18 22:47:26,628 INFO L256 TraceCheckUtils]: 134: Hoare triple {11169#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {11169#false} is VALID [2018-11-18 22:47:26,628 INFO L273 TraceCheckUtils]: 135: Hoare triple {11169#false} ~cond := #in~cond; {11169#false} is VALID [2018-11-18 22:47:26,628 INFO L273 TraceCheckUtils]: 136: Hoare triple {11169#false} assume 0 == ~cond; {11169#false} is VALID [2018-11-18 22:47:26,628 INFO L273 TraceCheckUtils]: 137: Hoare triple {11169#false} assume !false; {11169#false} is VALID [2018-11-18 22:47:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2018-11-18 22:47:26,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:26,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-18 22:47:26,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 138 [2018-11-18 22:47:26,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:26,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-18 22:47:26,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:26,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-18 22:47:26,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-18 22:47:26,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:47:26,793 INFO L87 Difference]: Start difference. First operand 149 states and 183 transitions. Second operand 19 states. [2018-11-18 22:47:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:27,632 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2018-11-18 22:47:27,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-18 22:47:27,632 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 138 [2018-11-18 22:47:27,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:47:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 228 transitions. [2018-11-18 22:47:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 22:47:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 228 transitions. [2018-11-18 22:47:27,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 228 transitions. [2018-11-18 22:47:27,830 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:27,833 INFO L225 Difference]: With dead ends: 242 [2018-11-18 22:47:27,833 INFO L226 Difference]: Without dead ends: 161 [2018-11-18 22:47:27,834 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-18 22:47:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-18 22:47:27,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 157. [2018-11-18 22:47:27,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:27,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 157 states. [2018-11-18 22:47:27,888 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 157 states. [2018-11-18 22:47:27,888 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 157 states. [2018-11-18 22:47:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:27,891 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2018-11-18 22:47:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2018-11-18 22:47:27,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:27,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:27,892 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 161 states. [2018-11-18 22:47:27,892 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 161 states. [2018-11-18 22:47:27,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:27,895 INFO L93 Difference]: Finished difference Result 161 states and 199 transitions. [2018-11-18 22:47:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 199 transitions. [2018-11-18 22:47:27,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:27,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:27,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:27,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 22:47:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 193 transitions. [2018-11-18 22:47:27,899 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 193 transitions. Word has length 138 [2018-11-18 22:47:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:27,899 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 193 transitions. [2018-11-18 22:47:27,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-18 22:47:27,899 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 193 transitions. [2018-11-18 22:47:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-18 22:47:27,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:27,900 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:27,900 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:27,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:27,901 INFO L82 PathProgramCache]: Analyzing trace with hash -27310637, now seen corresponding path program 16 times [2018-11-18 22:47:27,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:27,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:27,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:27,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:28,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {12428#true} call ULTIMATE.init(); {12428#true} is VALID [2018-11-18 22:47:28,258 INFO L273 TraceCheckUtils]: 1: Hoare triple {12428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12428#true} is VALID [2018-11-18 22:47:28,258 INFO L273 TraceCheckUtils]: 2: Hoare triple {12428#true} assume true; {12428#true} is VALID [2018-11-18 22:47:28,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12428#true} {12428#true} #95#return; {12428#true} is VALID [2018-11-18 22:47:28,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {12428#true} call #t~ret8 := main(); {12428#true} is VALID [2018-11-18 22:47:28,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {12428#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {12430#(= main_~a~0 0)} is VALID [2018-11-18 22:47:28,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {12430#(= main_~a~0 0)} assume true; {12430#(= main_~a~0 0)} is VALID [2018-11-18 22:47:28,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {12430#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12430#(= main_~a~0 0)} is VALID [2018-11-18 22:47:28,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {12430#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12430#(= main_~a~0 0)} is VALID [2018-11-18 22:47:28,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {12430#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {12431#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:28,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {12431#(<= main_~a~0 1)} assume true; {12431#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:28,262 INFO L273 TraceCheckUtils]: 11: Hoare triple {12431#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12431#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:28,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {12431#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12431#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:28,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {12431#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {12432#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:28,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {12432#(<= main_~a~0 2)} assume true; {12432#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:28,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {12432#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12432#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:28,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {12432#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12432#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:28,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {12432#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {12433#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:28,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {12433#(<= main_~a~0 3)} assume true; {12433#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:28,265 INFO L273 TraceCheckUtils]: 19: Hoare triple {12433#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12433#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:28,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {12433#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12433#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:28,267 INFO L273 TraceCheckUtils]: 21: Hoare triple {12433#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {12434#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:28,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {12434#(<= main_~a~0 4)} assume true; {12434#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:28,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {12434#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12434#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:28,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {12434#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12434#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:28,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {12434#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {12435#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:28,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {12435#(<= main_~a~0 5)} assume true; {12435#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:28,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {12435#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12435#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:28,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {12435#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12435#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:28,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {12435#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {12436#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:28,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {12436#(<= main_~a~0 6)} assume true; {12436#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:28,272 INFO L273 TraceCheckUtils]: 31: Hoare triple {12436#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12436#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:28,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {12436#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12436#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:28,273 INFO L273 TraceCheckUtils]: 33: Hoare triple {12436#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {12437#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:28,273 INFO L273 TraceCheckUtils]: 34: Hoare triple {12437#(<= main_~a~0 7)} assume true; {12437#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:28,274 INFO L273 TraceCheckUtils]: 35: Hoare triple {12437#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12437#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:28,274 INFO L273 TraceCheckUtils]: 36: Hoare triple {12437#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12437#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:28,275 INFO L273 TraceCheckUtils]: 37: Hoare triple {12437#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {12438#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:28,276 INFO L273 TraceCheckUtils]: 38: Hoare triple {12438#(<= main_~a~0 8)} assume true; {12438#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:28,276 INFO L273 TraceCheckUtils]: 39: Hoare triple {12438#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12438#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:28,277 INFO L273 TraceCheckUtils]: 40: Hoare triple {12438#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12438#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:28,277 INFO L273 TraceCheckUtils]: 41: Hoare triple {12438#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {12439#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:28,278 INFO L273 TraceCheckUtils]: 42: Hoare triple {12439#(<= main_~a~0 9)} assume true; {12439#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:28,278 INFO L273 TraceCheckUtils]: 43: Hoare triple {12439#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12439#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:28,279 INFO L273 TraceCheckUtils]: 44: Hoare triple {12439#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12439#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:28,279 INFO L273 TraceCheckUtils]: 45: Hoare triple {12439#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {12440#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:28,280 INFO L273 TraceCheckUtils]: 46: Hoare triple {12440#(<= main_~a~0 10)} assume true; {12440#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:28,280 INFO L273 TraceCheckUtils]: 47: Hoare triple {12440#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12440#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:28,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {12440#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12440#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:28,281 INFO L273 TraceCheckUtils]: 49: Hoare triple {12440#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {12441#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:28,282 INFO L273 TraceCheckUtils]: 50: Hoare triple {12441#(<= main_~a~0 11)} assume true; {12441#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:28,282 INFO L273 TraceCheckUtils]: 51: Hoare triple {12441#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12441#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:28,283 INFO L273 TraceCheckUtils]: 52: Hoare triple {12441#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12441#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:28,284 INFO L273 TraceCheckUtils]: 53: Hoare triple {12441#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {12442#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:28,284 INFO L273 TraceCheckUtils]: 54: Hoare triple {12442#(<= main_~a~0 12)} assume true; {12442#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:28,285 INFO L273 TraceCheckUtils]: 55: Hoare triple {12442#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12442#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:28,285 INFO L273 TraceCheckUtils]: 56: Hoare triple {12442#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12442#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:28,286 INFO L273 TraceCheckUtils]: 57: Hoare triple {12442#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {12443#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:28,286 INFO L273 TraceCheckUtils]: 58: Hoare triple {12443#(<= main_~a~0 13)} assume true; {12443#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:28,287 INFO L273 TraceCheckUtils]: 59: Hoare triple {12443#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12443#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:28,287 INFO L273 TraceCheckUtils]: 60: Hoare triple {12443#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12443#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:28,288 INFO L273 TraceCheckUtils]: 61: Hoare triple {12443#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {12444#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:28,288 INFO L273 TraceCheckUtils]: 62: Hoare triple {12444#(<= main_~a~0 14)} assume true; {12444#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:28,289 INFO L273 TraceCheckUtils]: 63: Hoare triple {12444#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12444#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:28,289 INFO L273 TraceCheckUtils]: 64: Hoare triple {12444#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12444#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:28,290 INFO L273 TraceCheckUtils]: 65: Hoare triple {12444#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {12445#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:28,290 INFO L273 TraceCheckUtils]: 66: Hoare triple {12445#(<= main_~a~0 15)} assume true; {12445#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:28,291 INFO L273 TraceCheckUtils]: 67: Hoare triple {12445#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12445#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:28,291 INFO L273 TraceCheckUtils]: 68: Hoare triple {12445#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12445#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:28,292 INFO L273 TraceCheckUtils]: 69: Hoare triple {12445#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {12446#(<= main_~a~0 16)} is VALID [2018-11-18 22:47:28,293 INFO L273 TraceCheckUtils]: 70: Hoare triple {12446#(<= main_~a~0 16)} assume true; {12446#(<= main_~a~0 16)} is VALID [2018-11-18 22:47:28,293 INFO L273 TraceCheckUtils]: 71: Hoare triple {12446#(<= main_~a~0 16)} assume !(~a~0 < 100000); {12429#false} is VALID [2018-11-18 22:47:28,293 INFO L273 TraceCheckUtils]: 72: Hoare triple {12429#false} ~a~0 := 0; {12429#false} is VALID [2018-11-18 22:47:28,294 INFO L273 TraceCheckUtils]: 73: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,294 INFO L273 TraceCheckUtils]: 74: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,294 INFO L273 TraceCheckUtils]: 75: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,294 INFO L273 TraceCheckUtils]: 76: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,294 INFO L273 TraceCheckUtils]: 77: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,295 INFO L273 TraceCheckUtils]: 78: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,295 INFO L273 TraceCheckUtils]: 79: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,295 INFO L273 TraceCheckUtils]: 80: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,295 INFO L273 TraceCheckUtils]: 81: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,295 INFO L273 TraceCheckUtils]: 82: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,295 INFO L273 TraceCheckUtils]: 83: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,296 INFO L273 TraceCheckUtils]: 84: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,296 INFO L273 TraceCheckUtils]: 85: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,296 INFO L273 TraceCheckUtils]: 86: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,296 INFO L273 TraceCheckUtils]: 87: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,296 INFO L273 TraceCheckUtils]: 88: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,296 INFO L273 TraceCheckUtils]: 89: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,296 INFO L273 TraceCheckUtils]: 90: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,296 INFO L273 TraceCheckUtils]: 91: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,296 INFO L273 TraceCheckUtils]: 92: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,297 INFO L273 TraceCheckUtils]: 93: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,297 INFO L273 TraceCheckUtils]: 94: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,297 INFO L273 TraceCheckUtils]: 95: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,297 INFO L273 TraceCheckUtils]: 96: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,297 INFO L273 TraceCheckUtils]: 97: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,297 INFO L273 TraceCheckUtils]: 98: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,297 INFO L273 TraceCheckUtils]: 99: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,297 INFO L273 TraceCheckUtils]: 100: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,297 INFO L273 TraceCheckUtils]: 101: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,298 INFO L273 TraceCheckUtils]: 102: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,298 INFO L273 TraceCheckUtils]: 103: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,298 INFO L273 TraceCheckUtils]: 104: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,298 INFO L273 TraceCheckUtils]: 105: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,298 INFO L273 TraceCheckUtils]: 106: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,298 INFO L273 TraceCheckUtils]: 107: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,298 INFO L273 TraceCheckUtils]: 108: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,298 INFO L273 TraceCheckUtils]: 109: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,298 INFO L273 TraceCheckUtils]: 110: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,299 INFO L273 TraceCheckUtils]: 111: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,299 INFO L273 TraceCheckUtils]: 112: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,299 INFO L273 TraceCheckUtils]: 113: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,299 INFO L273 TraceCheckUtils]: 114: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,299 INFO L273 TraceCheckUtils]: 115: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,299 INFO L273 TraceCheckUtils]: 116: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,299 INFO L273 TraceCheckUtils]: 117: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,299 INFO L273 TraceCheckUtils]: 118: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,300 INFO L273 TraceCheckUtils]: 119: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,300 INFO L273 TraceCheckUtils]: 120: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,300 INFO L273 TraceCheckUtils]: 121: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,300 INFO L273 TraceCheckUtils]: 122: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,300 INFO L273 TraceCheckUtils]: 123: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,300 INFO L273 TraceCheckUtils]: 124: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,300 INFO L273 TraceCheckUtils]: 125: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,300 INFO L273 TraceCheckUtils]: 126: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,300 INFO L273 TraceCheckUtils]: 127: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,301 INFO L273 TraceCheckUtils]: 128: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,301 INFO L273 TraceCheckUtils]: 129: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,301 INFO L273 TraceCheckUtils]: 130: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,301 INFO L273 TraceCheckUtils]: 131: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,301 INFO L273 TraceCheckUtils]: 132: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,301 INFO L273 TraceCheckUtils]: 133: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,301 INFO L273 TraceCheckUtils]: 134: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,301 INFO L273 TraceCheckUtils]: 135: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:28,301 INFO L273 TraceCheckUtils]: 136: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:28,302 INFO L273 TraceCheckUtils]: 137: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,302 INFO L273 TraceCheckUtils]: 138: Hoare triple {12429#false} assume !(~a~0 < 100000); {12429#false} is VALID [2018-11-18 22:47:28,302 INFO L273 TraceCheckUtils]: 139: Hoare triple {12429#false} havoc ~x~0;~x~0 := 0; {12429#false} is VALID [2018-11-18 22:47:28,302 INFO L273 TraceCheckUtils]: 140: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:28,302 INFO L273 TraceCheckUtils]: 141: Hoare triple {12429#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {12429#false} is VALID [2018-11-18 22:47:28,302 INFO L256 TraceCheckUtils]: 142: Hoare triple {12429#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {12429#false} is VALID [2018-11-18 22:47:28,302 INFO L273 TraceCheckUtils]: 143: Hoare triple {12429#false} ~cond := #in~cond; {12429#false} is VALID [2018-11-18 22:47:28,302 INFO L273 TraceCheckUtils]: 144: Hoare triple {12429#false} assume 0 == ~cond; {12429#false} is VALID [2018-11-18 22:47:28,302 INFO L273 TraceCheckUtils]: 145: Hoare triple {12429#false} assume !false; {12429#false} is VALID [2018-11-18 22:47:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-18 22:47:28,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:28,313 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:28,322 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:47:28,950 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:47:28,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:47:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:28,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:47:29,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {12428#true} call ULTIMATE.init(); {12428#true} is VALID [2018-11-18 22:47:29,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {12428#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12428#true} is VALID [2018-11-18 22:47:29,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {12428#true} assume true; {12428#true} is VALID [2018-11-18 22:47:29,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12428#true} {12428#true} #95#return; {12428#true} is VALID [2018-11-18 22:47:29,271 INFO L256 TraceCheckUtils]: 4: Hoare triple {12428#true} call #t~ret8 := main(); {12428#true} is VALID [2018-11-18 22:47:29,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {12428#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {12465#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:29,272 INFO L273 TraceCheckUtils]: 6: Hoare triple {12465#(<= main_~a~0 0)} assume true; {12465#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:29,272 INFO L273 TraceCheckUtils]: 7: Hoare triple {12465#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12465#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:29,272 INFO L273 TraceCheckUtils]: 8: Hoare triple {12465#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12465#(<= main_~a~0 0)} is VALID [2018-11-18 22:47:29,273 INFO L273 TraceCheckUtils]: 9: Hoare triple {12465#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {12431#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:29,273 INFO L273 TraceCheckUtils]: 10: Hoare triple {12431#(<= main_~a~0 1)} assume true; {12431#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:29,274 INFO L273 TraceCheckUtils]: 11: Hoare triple {12431#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12431#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:29,274 INFO L273 TraceCheckUtils]: 12: Hoare triple {12431#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12431#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:29,275 INFO L273 TraceCheckUtils]: 13: Hoare triple {12431#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {12432#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:29,276 INFO L273 TraceCheckUtils]: 14: Hoare triple {12432#(<= main_~a~0 2)} assume true; {12432#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:29,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {12432#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12432#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:29,277 INFO L273 TraceCheckUtils]: 16: Hoare triple {12432#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12432#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:29,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {12432#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {12433#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {12433#(<= main_~a~0 3)} assume true; {12433#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:29,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {12433#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12433#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 20: Hoare triple {12433#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12433#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:29,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {12433#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {12434#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:29,280 INFO L273 TraceCheckUtils]: 22: Hoare triple {12434#(<= main_~a~0 4)} assume true; {12434#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:29,280 INFO L273 TraceCheckUtils]: 23: Hoare triple {12434#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12434#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:29,281 INFO L273 TraceCheckUtils]: 24: Hoare triple {12434#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12434#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:29,281 INFO L273 TraceCheckUtils]: 25: Hoare triple {12434#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {12435#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:29,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {12435#(<= main_~a~0 5)} assume true; {12435#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:29,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {12435#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12435#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:29,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {12435#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12435#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:29,284 INFO L273 TraceCheckUtils]: 29: Hoare triple {12435#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {12436#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:29,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {12436#(<= main_~a~0 6)} assume true; {12436#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:29,285 INFO L273 TraceCheckUtils]: 31: Hoare triple {12436#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12436#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:29,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {12436#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12436#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:29,286 INFO L273 TraceCheckUtils]: 33: Hoare triple {12436#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {12437#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:29,286 INFO L273 TraceCheckUtils]: 34: Hoare triple {12437#(<= main_~a~0 7)} assume true; {12437#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:29,287 INFO L273 TraceCheckUtils]: 35: Hoare triple {12437#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12437#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:29,287 INFO L273 TraceCheckUtils]: 36: Hoare triple {12437#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12437#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:29,288 INFO L273 TraceCheckUtils]: 37: Hoare triple {12437#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {12438#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:29,288 INFO L273 TraceCheckUtils]: 38: Hoare triple {12438#(<= main_~a~0 8)} assume true; {12438#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:29,289 INFO L273 TraceCheckUtils]: 39: Hoare triple {12438#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12438#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:29,289 INFO L273 TraceCheckUtils]: 40: Hoare triple {12438#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12438#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:29,290 INFO L273 TraceCheckUtils]: 41: Hoare triple {12438#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {12439#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:29,290 INFO L273 TraceCheckUtils]: 42: Hoare triple {12439#(<= main_~a~0 9)} assume true; {12439#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:29,291 INFO L273 TraceCheckUtils]: 43: Hoare triple {12439#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12439#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:29,291 INFO L273 TraceCheckUtils]: 44: Hoare triple {12439#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12439#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:29,292 INFO L273 TraceCheckUtils]: 45: Hoare triple {12439#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {12440#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:29,293 INFO L273 TraceCheckUtils]: 46: Hoare triple {12440#(<= main_~a~0 10)} assume true; {12440#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:29,293 INFO L273 TraceCheckUtils]: 47: Hoare triple {12440#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12440#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:29,295 INFO L273 TraceCheckUtils]: 48: Hoare triple {12440#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12440#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:29,296 INFO L273 TraceCheckUtils]: 49: Hoare triple {12440#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {12441#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:29,297 INFO L273 TraceCheckUtils]: 50: Hoare triple {12441#(<= main_~a~0 11)} assume true; {12441#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:29,297 INFO L273 TraceCheckUtils]: 51: Hoare triple {12441#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12441#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:29,297 INFO L273 TraceCheckUtils]: 52: Hoare triple {12441#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12441#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:29,298 INFO L273 TraceCheckUtils]: 53: Hoare triple {12441#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {12442#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:29,298 INFO L273 TraceCheckUtils]: 54: Hoare triple {12442#(<= main_~a~0 12)} assume true; {12442#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:29,298 INFO L273 TraceCheckUtils]: 55: Hoare triple {12442#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12442#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:29,299 INFO L273 TraceCheckUtils]: 56: Hoare triple {12442#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12442#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:29,299 INFO L273 TraceCheckUtils]: 57: Hoare triple {12442#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {12443#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:29,300 INFO L273 TraceCheckUtils]: 58: Hoare triple {12443#(<= main_~a~0 13)} assume true; {12443#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:29,300 INFO L273 TraceCheckUtils]: 59: Hoare triple {12443#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12443#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:29,301 INFO L273 TraceCheckUtils]: 60: Hoare triple {12443#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12443#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:29,301 INFO L273 TraceCheckUtils]: 61: Hoare triple {12443#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {12444#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:29,302 INFO L273 TraceCheckUtils]: 62: Hoare triple {12444#(<= main_~a~0 14)} assume true; {12444#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:29,302 INFO L273 TraceCheckUtils]: 63: Hoare triple {12444#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12444#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:29,303 INFO L273 TraceCheckUtils]: 64: Hoare triple {12444#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12444#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:29,303 INFO L273 TraceCheckUtils]: 65: Hoare triple {12444#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {12445#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:29,304 INFO L273 TraceCheckUtils]: 66: Hoare triple {12445#(<= main_~a~0 15)} assume true; {12445#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:29,304 INFO L273 TraceCheckUtils]: 67: Hoare triple {12445#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12445#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:29,305 INFO L273 TraceCheckUtils]: 68: Hoare triple {12445#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {12445#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:29,312 INFO L273 TraceCheckUtils]: 69: Hoare triple {12445#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {12446#(<= main_~a~0 16)} is VALID [2018-11-18 22:47:29,313 INFO L273 TraceCheckUtils]: 70: Hoare triple {12446#(<= main_~a~0 16)} assume true; {12446#(<= main_~a~0 16)} is VALID [2018-11-18 22:47:29,313 INFO L273 TraceCheckUtils]: 71: Hoare triple {12446#(<= main_~a~0 16)} assume !(~a~0 < 100000); {12429#false} is VALID [2018-11-18 22:47:29,313 INFO L273 TraceCheckUtils]: 72: Hoare triple {12429#false} ~a~0 := 0; {12429#false} is VALID [2018-11-18 22:47:29,313 INFO L273 TraceCheckUtils]: 73: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,313 INFO L273 TraceCheckUtils]: 74: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,314 INFO L273 TraceCheckUtils]: 75: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,314 INFO L273 TraceCheckUtils]: 76: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,314 INFO L273 TraceCheckUtils]: 77: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,314 INFO L273 TraceCheckUtils]: 78: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,314 INFO L273 TraceCheckUtils]: 79: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,314 INFO L273 TraceCheckUtils]: 80: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,314 INFO L273 TraceCheckUtils]: 81: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,314 INFO L273 TraceCheckUtils]: 82: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,314 INFO L273 TraceCheckUtils]: 83: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,315 INFO L273 TraceCheckUtils]: 84: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,315 INFO L273 TraceCheckUtils]: 85: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,315 INFO L273 TraceCheckUtils]: 86: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,315 INFO L273 TraceCheckUtils]: 87: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,315 INFO L273 TraceCheckUtils]: 88: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,315 INFO L273 TraceCheckUtils]: 89: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,315 INFO L273 TraceCheckUtils]: 90: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,316 INFO L273 TraceCheckUtils]: 91: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,316 INFO L273 TraceCheckUtils]: 92: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,316 INFO L273 TraceCheckUtils]: 93: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,316 INFO L273 TraceCheckUtils]: 94: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,316 INFO L273 TraceCheckUtils]: 95: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,316 INFO L273 TraceCheckUtils]: 96: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,316 INFO L273 TraceCheckUtils]: 97: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,316 INFO L273 TraceCheckUtils]: 98: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,317 INFO L273 TraceCheckUtils]: 99: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,317 INFO L273 TraceCheckUtils]: 100: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,317 INFO L273 TraceCheckUtils]: 101: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,317 INFO L273 TraceCheckUtils]: 102: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,317 INFO L273 TraceCheckUtils]: 103: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,317 INFO L273 TraceCheckUtils]: 104: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,318 INFO L273 TraceCheckUtils]: 105: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,318 INFO L273 TraceCheckUtils]: 106: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,318 INFO L273 TraceCheckUtils]: 107: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,318 INFO L273 TraceCheckUtils]: 108: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,318 INFO L273 TraceCheckUtils]: 109: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,318 INFO L273 TraceCheckUtils]: 110: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,319 INFO L273 TraceCheckUtils]: 111: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,319 INFO L273 TraceCheckUtils]: 112: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,319 INFO L273 TraceCheckUtils]: 113: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,319 INFO L273 TraceCheckUtils]: 114: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,319 INFO L273 TraceCheckUtils]: 115: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,320 INFO L273 TraceCheckUtils]: 116: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,320 INFO L273 TraceCheckUtils]: 117: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,320 INFO L273 TraceCheckUtils]: 118: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,320 INFO L273 TraceCheckUtils]: 119: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,320 INFO L273 TraceCheckUtils]: 120: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,320 INFO L273 TraceCheckUtils]: 121: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,321 INFO L273 TraceCheckUtils]: 122: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,321 INFO L273 TraceCheckUtils]: 123: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,321 INFO L273 TraceCheckUtils]: 124: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,321 INFO L273 TraceCheckUtils]: 125: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,321 INFO L273 TraceCheckUtils]: 126: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,321 INFO L273 TraceCheckUtils]: 127: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,321 INFO L273 TraceCheckUtils]: 128: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,322 INFO L273 TraceCheckUtils]: 129: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,322 INFO L273 TraceCheckUtils]: 130: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,322 INFO L273 TraceCheckUtils]: 131: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,322 INFO L273 TraceCheckUtils]: 132: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,322 INFO L273 TraceCheckUtils]: 133: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,322 INFO L273 TraceCheckUtils]: 134: Hoare triple {12429#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,323 INFO L273 TraceCheckUtils]: 135: Hoare triple {12429#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {12429#false} is VALID [2018-11-18 22:47:29,323 INFO L273 TraceCheckUtils]: 136: Hoare triple {12429#false} ~a~0 := 1 + ~a~0; {12429#false} is VALID [2018-11-18 22:47:29,323 INFO L273 TraceCheckUtils]: 137: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,323 INFO L273 TraceCheckUtils]: 138: Hoare triple {12429#false} assume !(~a~0 < 100000); {12429#false} is VALID [2018-11-18 22:47:29,323 INFO L273 TraceCheckUtils]: 139: Hoare triple {12429#false} havoc ~x~0;~x~0 := 0; {12429#false} is VALID [2018-11-18 22:47:29,323 INFO L273 TraceCheckUtils]: 140: Hoare triple {12429#false} assume true; {12429#false} is VALID [2018-11-18 22:47:29,324 INFO L273 TraceCheckUtils]: 141: Hoare triple {12429#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {12429#false} is VALID [2018-11-18 22:47:29,324 INFO L256 TraceCheckUtils]: 142: Hoare triple {12429#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {12429#false} is VALID [2018-11-18 22:47:29,324 INFO L273 TraceCheckUtils]: 143: Hoare triple {12429#false} ~cond := #in~cond; {12429#false} is VALID [2018-11-18 22:47:29,324 INFO L273 TraceCheckUtils]: 144: Hoare triple {12429#false} assume 0 == ~cond; {12429#false} is VALID [2018-11-18 22:47:29,324 INFO L273 TraceCheckUtils]: 145: Hoare triple {12429#false} assume !false; {12429#false} is VALID [2018-11-18 22:47:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 512 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-18 22:47:29,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:47:29,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-18 22:47:29,362 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 146 [2018-11-18 22:47:29,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:47:29,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-18 22:47:29,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:29,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 22:47:29,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 22:47:29,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:47:29,452 INFO L87 Difference]: Start difference. First operand 157 states and 193 transitions. Second operand 20 states. [2018-11-18 22:47:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:30,148 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2018-11-18 22:47:30,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 22:47:30,148 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 146 [2018-11-18 22:47:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:47:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:47:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 238 transitions. [2018-11-18 22:47:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-18 22:47:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 238 transitions. [2018-11-18 22:47:30,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 238 transitions. [2018-11-18 22:47:30,723 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:47:30,727 INFO L225 Difference]: With dead ends: 254 [2018-11-18 22:47:30,727 INFO L226 Difference]: Without dead ends: 169 [2018-11-18 22:47:30,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-18 22:47:30,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-18 22:47:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-11-18 22:47:30,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:47:30,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 165 states. [2018-11-18 22:47:30,801 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 165 states. [2018-11-18 22:47:30,802 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 165 states. [2018-11-18 22:47:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:30,804 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2018-11-18 22:47:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 209 transitions. [2018-11-18 22:47:30,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:30,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:30,805 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 169 states. [2018-11-18 22:47:30,805 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 169 states. [2018-11-18 22:47:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:47:30,809 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2018-11-18 22:47:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 209 transitions. [2018-11-18 22:47:30,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:47:30,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:47:30,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:47:30,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:47:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-18 22:47:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 203 transitions. [2018-11-18 22:47:30,813 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 203 transitions. Word has length 146 [2018-11-18 22:47:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:47:30,813 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 203 transitions. [2018-11-18 22:47:30,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 22:47:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 203 transitions. [2018-11-18 22:47:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-18 22:47:30,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:47:30,814 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:47:30,815 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:47:30,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:47:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1405143251, now seen corresponding path program 17 times [2018-11-18 22:47:30,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:47:30,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:47:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:30,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:47:30,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:47:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:47:31,201 INFO L256 TraceCheckUtils]: 0: Hoare triple {13754#true} call ULTIMATE.init(); {13754#true} is VALID [2018-11-18 22:47:31,201 INFO L273 TraceCheckUtils]: 1: Hoare triple {13754#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13754#true} is VALID [2018-11-18 22:47:31,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:47:31,202 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13754#true} {13754#true} #95#return; {13754#true} is VALID [2018-11-18 22:47:31,202 INFO L256 TraceCheckUtils]: 4: Hoare triple {13754#true} call #t~ret8 := main(); {13754#true} is VALID [2018-11-18 22:47:31,202 INFO L273 TraceCheckUtils]: 5: Hoare triple {13754#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {13756#(= main_~a~0 0)} is VALID [2018-11-18 22:47:31,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {13756#(= main_~a~0 0)} assume true; {13756#(= main_~a~0 0)} is VALID [2018-11-18 22:47:31,203 INFO L273 TraceCheckUtils]: 7: Hoare triple {13756#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13756#(= main_~a~0 0)} is VALID [2018-11-18 22:47:31,204 INFO L273 TraceCheckUtils]: 8: Hoare triple {13756#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13756#(= main_~a~0 0)} is VALID [2018-11-18 22:47:31,204 INFO L273 TraceCheckUtils]: 9: Hoare triple {13756#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {13757#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:31,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {13757#(<= main_~a~0 1)} assume true; {13757#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:31,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {13757#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13757#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:31,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {13757#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13757#(<= main_~a~0 1)} is VALID [2018-11-18 22:47:31,206 INFO L273 TraceCheckUtils]: 13: Hoare triple {13757#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {13758#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:31,206 INFO L273 TraceCheckUtils]: 14: Hoare triple {13758#(<= main_~a~0 2)} assume true; {13758#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:31,206 INFO L273 TraceCheckUtils]: 15: Hoare triple {13758#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13758#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:31,207 INFO L273 TraceCheckUtils]: 16: Hoare triple {13758#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13758#(<= main_~a~0 2)} is VALID [2018-11-18 22:47:31,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {13758#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {13759#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:31,208 INFO L273 TraceCheckUtils]: 18: Hoare triple {13759#(<= main_~a~0 3)} assume true; {13759#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:31,208 INFO L273 TraceCheckUtils]: 19: Hoare triple {13759#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13759#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:31,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {13759#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13759#(<= main_~a~0 3)} is VALID [2018-11-18 22:47:31,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {13759#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {13760#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:31,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {13760#(<= main_~a~0 4)} assume true; {13760#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:31,211 INFO L273 TraceCheckUtils]: 23: Hoare triple {13760#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13760#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:31,211 INFO L273 TraceCheckUtils]: 24: Hoare triple {13760#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13760#(<= main_~a~0 4)} is VALID [2018-11-18 22:47:31,212 INFO L273 TraceCheckUtils]: 25: Hoare triple {13760#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {13761#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:31,212 INFO L273 TraceCheckUtils]: 26: Hoare triple {13761#(<= main_~a~0 5)} assume true; {13761#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:31,213 INFO L273 TraceCheckUtils]: 27: Hoare triple {13761#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13761#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:31,213 INFO L273 TraceCheckUtils]: 28: Hoare triple {13761#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13761#(<= main_~a~0 5)} is VALID [2018-11-18 22:47:31,214 INFO L273 TraceCheckUtils]: 29: Hoare triple {13761#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {13762#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:31,214 INFO L273 TraceCheckUtils]: 30: Hoare triple {13762#(<= main_~a~0 6)} assume true; {13762#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:31,215 INFO L273 TraceCheckUtils]: 31: Hoare triple {13762#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13762#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:31,215 INFO L273 TraceCheckUtils]: 32: Hoare triple {13762#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13762#(<= main_~a~0 6)} is VALID [2018-11-18 22:47:31,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {13762#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {13763#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:31,216 INFO L273 TraceCheckUtils]: 34: Hoare triple {13763#(<= main_~a~0 7)} assume true; {13763#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:31,217 INFO L273 TraceCheckUtils]: 35: Hoare triple {13763#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13763#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:31,217 INFO L273 TraceCheckUtils]: 36: Hoare triple {13763#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13763#(<= main_~a~0 7)} is VALID [2018-11-18 22:47:31,218 INFO L273 TraceCheckUtils]: 37: Hoare triple {13763#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {13764#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:31,219 INFO L273 TraceCheckUtils]: 38: Hoare triple {13764#(<= main_~a~0 8)} assume true; {13764#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:31,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {13764#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13764#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:31,220 INFO L273 TraceCheckUtils]: 40: Hoare triple {13764#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13764#(<= main_~a~0 8)} is VALID [2018-11-18 22:47:31,220 INFO L273 TraceCheckUtils]: 41: Hoare triple {13764#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {13765#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:31,221 INFO L273 TraceCheckUtils]: 42: Hoare triple {13765#(<= main_~a~0 9)} assume true; {13765#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:31,221 INFO L273 TraceCheckUtils]: 43: Hoare triple {13765#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13765#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:31,222 INFO L273 TraceCheckUtils]: 44: Hoare triple {13765#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13765#(<= main_~a~0 9)} is VALID [2018-11-18 22:47:31,222 INFO L273 TraceCheckUtils]: 45: Hoare triple {13765#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {13766#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:31,223 INFO L273 TraceCheckUtils]: 46: Hoare triple {13766#(<= main_~a~0 10)} assume true; {13766#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:31,223 INFO L273 TraceCheckUtils]: 47: Hoare triple {13766#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13766#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:31,224 INFO L273 TraceCheckUtils]: 48: Hoare triple {13766#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13766#(<= main_~a~0 10)} is VALID [2018-11-18 22:47:31,224 INFO L273 TraceCheckUtils]: 49: Hoare triple {13766#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {13767#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:31,225 INFO L273 TraceCheckUtils]: 50: Hoare triple {13767#(<= main_~a~0 11)} assume true; {13767#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:31,225 INFO L273 TraceCheckUtils]: 51: Hoare triple {13767#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13767#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:31,226 INFO L273 TraceCheckUtils]: 52: Hoare triple {13767#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13767#(<= main_~a~0 11)} is VALID [2018-11-18 22:47:31,227 INFO L273 TraceCheckUtils]: 53: Hoare triple {13767#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {13768#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:31,227 INFO L273 TraceCheckUtils]: 54: Hoare triple {13768#(<= main_~a~0 12)} assume true; {13768#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:31,228 INFO L273 TraceCheckUtils]: 55: Hoare triple {13768#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13768#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:31,228 INFO L273 TraceCheckUtils]: 56: Hoare triple {13768#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13768#(<= main_~a~0 12)} is VALID [2018-11-18 22:47:31,229 INFO L273 TraceCheckUtils]: 57: Hoare triple {13768#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {13769#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:31,229 INFO L273 TraceCheckUtils]: 58: Hoare triple {13769#(<= main_~a~0 13)} assume true; {13769#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:31,230 INFO L273 TraceCheckUtils]: 59: Hoare triple {13769#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13769#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:31,230 INFO L273 TraceCheckUtils]: 60: Hoare triple {13769#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13769#(<= main_~a~0 13)} is VALID [2018-11-18 22:47:31,231 INFO L273 TraceCheckUtils]: 61: Hoare triple {13769#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {13770#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:31,231 INFO L273 TraceCheckUtils]: 62: Hoare triple {13770#(<= main_~a~0 14)} assume true; {13770#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:31,232 INFO L273 TraceCheckUtils]: 63: Hoare triple {13770#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13770#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:31,232 INFO L273 TraceCheckUtils]: 64: Hoare triple {13770#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13770#(<= main_~a~0 14)} is VALID [2018-11-18 22:47:31,233 INFO L273 TraceCheckUtils]: 65: Hoare triple {13770#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {13771#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:31,233 INFO L273 TraceCheckUtils]: 66: Hoare triple {13771#(<= main_~a~0 15)} assume true; {13771#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:31,234 INFO L273 TraceCheckUtils]: 67: Hoare triple {13771#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13771#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:31,234 INFO L273 TraceCheckUtils]: 68: Hoare triple {13771#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13771#(<= main_~a~0 15)} is VALID [2018-11-18 22:47:31,235 INFO L273 TraceCheckUtils]: 69: Hoare triple {13771#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {13772#(<= main_~a~0 16)} is VALID [2018-11-18 22:47:31,236 INFO L273 TraceCheckUtils]: 70: Hoare triple {13772#(<= main_~a~0 16)} assume true; {13772#(<= main_~a~0 16)} is VALID [2018-11-18 22:47:31,236 INFO L273 TraceCheckUtils]: 71: Hoare triple {13772#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13772#(<= main_~a~0 16)} is VALID [2018-11-18 22:47:31,236 INFO L273 TraceCheckUtils]: 72: Hoare triple {13772#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13772#(<= main_~a~0 16)} is VALID [2018-11-18 22:47:31,237 INFO L273 TraceCheckUtils]: 73: Hoare triple {13772#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {13773#(<= main_~a~0 17)} is VALID [2018-11-18 22:47:31,238 INFO L273 TraceCheckUtils]: 74: Hoare triple {13773#(<= main_~a~0 17)} assume true; {13773#(<= main_~a~0 17)} is VALID [2018-11-18 22:47:31,238 INFO L273 TraceCheckUtils]: 75: Hoare triple {13773#(<= main_~a~0 17)} assume !(~a~0 < 100000); {13755#false} is VALID [2018-11-18 22:47:31,238 INFO L273 TraceCheckUtils]: 76: Hoare triple {13755#false} ~a~0 := 0; {13755#false} is VALID [2018-11-18 22:47:31,239 INFO L273 TraceCheckUtils]: 77: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,239 INFO L273 TraceCheckUtils]: 78: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,239 INFO L273 TraceCheckUtils]: 79: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,239 INFO L273 TraceCheckUtils]: 80: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,239 INFO L273 TraceCheckUtils]: 81: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,240 INFO L273 TraceCheckUtils]: 82: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,240 INFO L273 TraceCheckUtils]: 83: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,240 INFO L273 TraceCheckUtils]: 84: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,240 INFO L273 TraceCheckUtils]: 85: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,240 INFO L273 TraceCheckUtils]: 86: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,241 INFO L273 TraceCheckUtils]: 87: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,241 INFO L273 TraceCheckUtils]: 88: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,241 INFO L273 TraceCheckUtils]: 89: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,241 INFO L273 TraceCheckUtils]: 90: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,241 INFO L273 TraceCheckUtils]: 91: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,241 INFO L273 TraceCheckUtils]: 92: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,241 INFO L273 TraceCheckUtils]: 93: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,242 INFO L273 TraceCheckUtils]: 94: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,242 INFO L273 TraceCheckUtils]: 95: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,242 INFO L273 TraceCheckUtils]: 96: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,242 INFO L273 TraceCheckUtils]: 97: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,242 INFO L273 TraceCheckUtils]: 98: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,242 INFO L273 TraceCheckUtils]: 99: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,242 INFO L273 TraceCheckUtils]: 100: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,242 INFO L273 TraceCheckUtils]: 101: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,242 INFO L273 TraceCheckUtils]: 102: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,243 INFO L273 TraceCheckUtils]: 103: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,243 INFO L273 TraceCheckUtils]: 104: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,243 INFO L273 TraceCheckUtils]: 105: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,243 INFO L273 TraceCheckUtils]: 106: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,243 INFO L273 TraceCheckUtils]: 107: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,243 INFO L273 TraceCheckUtils]: 108: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,243 INFO L273 TraceCheckUtils]: 109: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,243 INFO L273 TraceCheckUtils]: 110: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,243 INFO L273 TraceCheckUtils]: 111: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,244 INFO L273 TraceCheckUtils]: 112: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,244 INFO L273 TraceCheckUtils]: 113: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,244 INFO L273 TraceCheckUtils]: 114: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,244 INFO L273 TraceCheckUtils]: 115: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,244 INFO L273 TraceCheckUtils]: 116: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,244 INFO L273 TraceCheckUtils]: 117: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,244 INFO L273 TraceCheckUtils]: 118: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,244 INFO L273 TraceCheckUtils]: 119: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,244 INFO L273 TraceCheckUtils]: 120: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,245 INFO L273 TraceCheckUtils]: 121: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,245 INFO L273 TraceCheckUtils]: 122: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,245 INFO L273 TraceCheckUtils]: 123: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,245 INFO L273 TraceCheckUtils]: 124: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,245 INFO L273 TraceCheckUtils]: 125: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,245 INFO L273 TraceCheckUtils]: 126: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,245 INFO L273 TraceCheckUtils]: 127: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,245 INFO L273 TraceCheckUtils]: 128: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,245 INFO L273 TraceCheckUtils]: 129: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,246 INFO L273 TraceCheckUtils]: 130: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,246 INFO L273 TraceCheckUtils]: 131: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,246 INFO L273 TraceCheckUtils]: 132: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,246 INFO L273 TraceCheckUtils]: 133: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,246 INFO L273 TraceCheckUtils]: 134: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,246 INFO L273 TraceCheckUtils]: 135: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,246 INFO L273 TraceCheckUtils]: 136: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,246 INFO L273 TraceCheckUtils]: 137: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,246 INFO L273 TraceCheckUtils]: 138: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,247 INFO L273 TraceCheckUtils]: 139: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,247 INFO L273 TraceCheckUtils]: 140: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,247 INFO L273 TraceCheckUtils]: 141: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,247 INFO L273 TraceCheckUtils]: 142: Hoare triple {13755#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,247 INFO L273 TraceCheckUtils]: 143: Hoare triple {13755#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13755#false} is VALID [2018-11-18 22:47:31,247 INFO L273 TraceCheckUtils]: 144: Hoare triple {13755#false} ~a~0 := 1 + ~a~0; {13755#false} is VALID [2018-11-18 22:47:31,247 INFO L273 TraceCheckUtils]: 145: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,247 INFO L273 TraceCheckUtils]: 146: Hoare triple {13755#false} assume !(~a~0 < 100000); {13755#false} is VALID [2018-11-18 22:47:31,247 INFO L273 TraceCheckUtils]: 147: Hoare triple {13755#false} havoc ~x~0;~x~0 := 0; {13755#false} is VALID [2018-11-18 22:47:31,248 INFO L273 TraceCheckUtils]: 148: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:47:31,248 INFO L273 TraceCheckUtils]: 149: Hoare triple {13755#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {13755#false} is VALID [2018-11-18 22:47:31,248 INFO L256 TraceCheckUtils]: 150: Hoare triple {13755#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {13755#false} is VALID [2018-11-18 22:47:31,248 INFO L273 TraceCheckUtils]: 151: Hoare triple {13755#false} ~cond := #in~cond; {13755#false} is VALID [2018-11-18 22:47:31,248 INFO L273 TraceCheckUtils]: 152: Hoare triple {13755#false} assume 0 == ~cond; {13755#false} is VALID [2018-11-18 22:47:31,248 INFO L273 TraceCheckUtils]: 153: Hoare triple {13755#false} assume !false; {13755#false} is VALID [2018-11-18 22:47:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-18 22:47:31,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:47:31,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:47:31,269 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 22:48:18,649 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-18 22:48:18,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:48:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:18,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:48:18,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {13754#true} call ULTIMATE.init(); {13754#true} is VALID [2018-11-18 22:48:18,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {13754#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13754#true} is VALID [2018-11-18 22:48:18,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13754#true} {13754#true} #95#return; {13754#true} is VALID [2018-11-18 22:48:18,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {13754#true} call #t~ret8 := main(); {13754#true} is VALID [2018-11-18 22:48:18,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {13754#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {13754#true} is VALID [2018-11-18 22:48:18,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,949 INFO L273 TraceCheckUtils]: 7: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,950 INFO L273 TraceCheckUtils]: 16: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,950 INFO L273 TraceCheckUtils]: 18: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,951 INFO L273 TraceCheckUtils]: 21: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,951 INFO L273 TraceCheckUtils]: 26: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,951 INFO L273 TraceCheckUtils]: 27: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,951 INFO L273 TraceCheckUtils]: 28: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,951 INFO L273 TraceCheckUtils]: 29: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,952 INFO L273 TraceCheckUtils]: 30: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,952 INFO L273 TraceCheckUtils]: 32: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,952 INFO L273 TraceCheckUtils]: 33: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,952 INFO L273 TraceCheckUtils]: 34: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,952 INFO L273 TraceCheckUtils]: 35: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,952 INFO L273 TraceCheckUtils]: 36: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,953 INFO L273 TraceCheckUtils]: 39: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,953 INFO L273 TraceCheckUtils]: 40: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,953 INFO L273 TraceCheckUtils]: 41: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,953 INFO L273 TraceCheckUtils]: 42: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,953 INFO L273 TraceCheckUtils]: 43: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,953 INFO L273 TraceCheckUtils]: 44: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,953 INFO L273 TraceCheckUtils]: 45: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,953 INFO L273 TraceCheckUtils]: 46: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,953 INFO L273 TraceCheckUtils]: 47: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,954 INFO L273 TraceCheckUtils]: 48: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,954 INFO L273 TraceCheckUtils]: 49: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,954 INFO L273 TraceCheckUtils]: 51: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,954 INFO L273 TraceCheckUtils]: 52: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,954 INFO L273 TraceCheckUtils]: 53: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,954 INFO L273 TraceCheckUtils]: 54: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,954 INFO L273 TraceCheckUtils]: 55: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,954 INFO L273 TraceCheckUtils]: 56: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,955 INFO L273 TraceCheckUtils]: 57: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,955 INFO L273 TraceCheckUtils]: 58: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,955 INFO L273 TraceCheckUtils]: 59: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,955 INFO L273 TraceCheckUtils]: 60: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,955 INFO L273 TraceCheckUtils]: 61: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,955 INFO L273 TraceCheckUtils]: 62: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,955 INFO L273 TraceCheckUtils]: 63: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,955 INFO L273 TraceCheckUtils]: 64: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,955 INFO L273 TraceCheckUtils]: 65: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,956 INFO L273 TraceCheckUtils]: 66: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,956 INFO L273 TraceCheckUtils]: 67: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,956 INFO L273 TraceCheckUtils]: 68: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,956 INFO L273 TraceCheckUtils]: 69: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,956 INFO L273 TraceCheckUtils]: 70: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,956 INFO L273 TraceCheckUtils]: 71: Hoare triple {13754#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13754#true} is VALID [2018-11-18 22:48:18,956 INFO L273 TraceCheckUtils]: 72: Hoare triple {13754#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {13754#true} is VALID [2018-11-18 22:48:18,956 INFO L273 TraceCheckUtils]: 73: Hoare triple {13754#true} ~a~0 := 1 + ~a~0; {13754#true} is VALID [2018-11-18 22:48:18,956 INFO L273 TraceCheckUtils]: 74: Hoare triple {13754#true} assume true; {13754#true} is VALID [2018-11-18 22:48:18,957 INFO L273 TraceCheckUtils]: 75: Hoare triple {13754#true} assume !(~a~0 < 100000); {13754#true} is VALID [2018-11-18 22:48:18,957 INFO L273 TraceCheckUtils]: 76: Hoare triple {13754#true} ~a~0 := 0; {14005#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:18,957 INFO L273 TraceCheckUtils]: 77: Hoare triple {14005#(<= main_~a~0 0)} assume true; {14005#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:18,958 INFO L273 TraceCheckUtils]: 78: Hoare triple {14005#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {14005#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:18,958 INFO L273 TraceCheckUtils]: 79: Hoare triple {14005#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {14005#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:18,958 INFO L273 TraceCheckUtils]: 80: Hoare triple {14005#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {13757#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:18,959 INFO L273 TraceCheckUtils]: 81: Hoare triple {13757#(<= main_~a~0 1)} assume true; {13757#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:18,959 INFO L273 TraceCheckUtils]: 82: Hoare triple {13757#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13757#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:18,959 INFO L273 TraceCheckUtils]: 83: Hoare triple {13757#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13757#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:18,960 INFO L273 TraceCheckUtils]: 84: Hoare triple {13757#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {13758#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:18,960 INFO L273 TraceCheckUtils]: 85: Hoare triple {13758#(<= main_~a~0 2)} assume true; {13758#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:18,960 INFO L273 TraceCheckUtils]: 86: Hoare triple {13758#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13758#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:18,961 INFO L273 TraceCheckUtils]: 87: Hoare triple {13758#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13758#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:18,961 INFO L273 TraceCheckUtils]: 88: Hoare triple {13758#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {13759#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:18,961 INFO L273 TraceCheckUtils]: 89: Hoare triple {13759#(<= main_~a~0 3)} assume true; {13759#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:18,962 INFO L273 TraceCheckUtils]: 90: Hoare triple {13759#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13759#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:18,962 INFO L273 TraceCheckUtils]: 91: Hoare triple {13759#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13759#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:18,963 INFO L273 TraceCheckUtils]: 92: Hoare triple {13759#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {13760#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:18,964 INFO L273 TraceCheckUtils]: 93: Hoare triple {13760#(<= main_~a~0 4)} assume true; {13760#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:18,964 INFO L273 TraceCheckUtils]: 94: Hoare triple {13760#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13760#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:18,965 INFO L273 TraceCheckUtils]: 95: Hoare triple {13760#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13760#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:18,965 INFO L273 TraceCheckUtils]: 96: Hoare triple {13760#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {13761#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:18,966 INFO L273 TraceCheckUtils]: 97: Hoare triple {13761#(<= main_~a~0 5)} assume true; {13761#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:18,966 INFO L273 TraceCheckUtils]: 98: Hoare triple {13761#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13761#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:18,967 INFO L273 TraceCheckUtils]: 99: Hoare triple {13761#(<= main_~a~0 5)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13761#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:18,967 INFO L273 TraceCheckUtils]: 100: Hoare triple {13761#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {13762#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:18,968 INFO L273 TraceCheckUtils]: 101: Hoare triple {13762#(<= main_~a~0 6)} assume true; {13762#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:18,968 INFO L273 TraceCheckUtils]: 102: Hoare triple {13762#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13762#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:18,969 INFO L273 TraceCheckUtils]: 103: Hoare triple {13762#(<= main_~a~0 6)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13762#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:18,969 INFO L273 TraceCheckUtils]: 104: Hoare triple {13762#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {13763#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:18,970 INFO L273 TraceCheckUtils]: 105: Hoare triple {13763#(<= main_~a~0 7)} assume true; {13763#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:18,970 INFO L273 TraceCheckUtils]: 106: Hoare triple {13763#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13763#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:18,971 INFO L273 TraceCheckUtils]: 107: Hoare triple {13763#(<= main_~a~0 7)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13763#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:18,972 INFO L273 TraceCheckUtils]: 108: Hoare triple {13763#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {13764#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:18,972 INFO L273 TraceCheckUtils]: 109: Hoare triple {13764#(<= main_~a~0 8)} assume true; {13764#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:18,973 INFO L273 TraceCheckUtils]: 110: Hoare triple {13764#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13764#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:18,973 INFO L273 TraceCheckUtils]: 111: Hoare triple {13764#(<= main_~a~0 8)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13764#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:18,974 INFO L273 TraceCheckUtils]: 112: Hoare triple {13764#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {13765#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:18,974 INFO L273 TraceCheckUtils]: 113: Hoare triple {13765#(<= main_~a~0 9)} assume true; {13765#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:18,975 INFO L273 TraceCheckUtils]: 114: Hoare triple {13765#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13765#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:18,975 INFO L273 TraceCheckUtils]: 115: Hoare triple {13765#(<= main_~a~0 9)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13765#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:18,976 INFO L273 TraceCheckUtils]: 116: Hoare triple {13765#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {13766#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:18,976 INFO L273 TraceCheckUtils]: 117: Hoare triple {13766#(<= main_~a~0 10)} assume true; {13766#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:18,977 INFO L273 TraceCheckUtils]: 118: Hoare triple {13766#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13766#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:18,977 INFO L273 TraceCheckUtils]: 119: Hoare triple {13766#(<= main_~a~0 10)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13766#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:18,978 INFO L273 TraceCheckUtils]: 120: Hoare triple {13766#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {13767#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:18,978 INFO L273 TraceCheckUtils]: 121: Hoare triple {13767#(<= main_~a~0 11)} assume true; {13767#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:18,979 INFO L273 TraceCheckUtils]: 122: Hoare triple {13767#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13767#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:18,979 INFO L273 TraceCheckUtils]: 123: Hoare triple {13767#(<= main_~a~0 11)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13767#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:18,980 INFO L273 TraceCheckUtils]: 124: Hoare triple {13767#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {13768#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:18,981 INFO L273 TraceCheckUtils]: 125: Hoare triple {13768#(<= main_~a~0 12)} assume true; {13768#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:18,981 INFO L273 TraceCheckUtils]: 126: Hoare triple {13768#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13768#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:18,982 INFO L273 TraceCheckUtils]: 127: Hoare triple {13768#(<= main_~a~0 12)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13768#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:18,982 INFO L273 TraceCheckUtils]: 128: Hoare triple {13768#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {13769#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:18,983 INFO L273 TraceCheckUtils]: 129: Hoare triple {13769#(<= main_~a~0 13)} assume true; {13769#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:18,983 INFO L273 TraceCheckUtils]: 130: Hoare triple {13769#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13769#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:18,984 INFO L273 TraceCheckUtils]: 131: Hoare triple {13769#(<= main_~a~0 13)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13769#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:18,984 INFO L273 TraceCheckUtils]: 132: Hoare triple {13769#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {13770#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:18,985 INFO L273 TraceCheckUtils]: 133: Hoare triple {13770#(<= main_~a~0 14)} assume true; {13770#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:18,985 INFO L273 TraceCheckUtils]: 134: Hoare triple {13770#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13770#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:18,986 INFO L273 TraceCheckUtils]: 135: Hoare triple {13770#(<= main_~a~0 14)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13770#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:18,986 INFO L273 TraceCheckUtils]: 136: Hoare triple {13770#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {13771#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:18,987 INFO L273 TraceCheckUtils]: 137: Hoare triple {13771#(<= main_~a~0 15)} assume true; {13771#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:18,987 INFO L273 TraceCheckUtils]: 138: Hoare triple {13771#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13771#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:18,988 INFO L273 TraceCheckUtils]: 139: Hoare triple {13771#(<= main_~a~0 15)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13771#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:18,989 INFO L273 TraceCheckUtils]: 140: Hoare triple {13771#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {13772#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:18,989 INFO L273 TraceCheckUtils]: 141: Hoare triple {13772#(<= main_~a~0 16)} assume true; {13772#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:18,990 INFO L273 TraceCheckUtils]: 142: Hoare triple {13772#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {13772#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:18,990 INFO L273 TraceCheckUtils]: 143: Hoare triple {13772#(<= main_~a~0 16)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {13772#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:18,991 INFO L273 TraceCheckUtils]: 144: Hoare triple {13772#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {13773#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:18,991 INFO L273 TraceCheckUtils]: 145: Hoare triple {13773#(<= main_~a~0 17)} assume true; {13773#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:18,992 INFO L273 TraceCheckUtils]: 146: Hoare triple {13773#(<= main_~a~0 17)} assume !(~a~0 < 100000); {13755#false} is VALID [2018-11-18 22:48:18,992 INFO L273 TraceCheckUtils]: 147: Hoare triple {13755#false} havoc ~x~0;~x~0 := 0; {13755#false} is VALID [2018-11-18 22:48:18,992 INFO L273 TraceCheckUtils]: 148: Hoare triple {13755#false} assume true; {13755#false} is VALID [2018-11-18 22:48:18,992 INFO L273 TraceCheckUtils]: 149: Hoare triple {13755#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {13755#false} is VALID [2018-11-18 22:48:18,993 INFO L256 TraceCheckUtils]: 150: Hoare triple {13755#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {13755#false} is VALID [2018-11-18 22:48:18,993 INFO L273 TraceCheckUtils]: 151: Hoare triple {13755#false} ~cond := #in~cond; {13755#false} is VALID [2018-11-18 22:48:18,993 INFO L273 TraceCheckUtils]: 152: Hoare triple {13755#false} assume 0 == ~cond; {13755#false} is VALID [2018-11-18 22:48:18,993 INFO L273 TraceCheckUtils]: 153: Hoare triple {13755#false} assume !false; {13755#false} is VALID [2018-11-18 22:48:19,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 578 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2018-11-18 22:48:19,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:48:19,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-18 22:48:19,033 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 154 [2018-11-18 22:48:19,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:48:19,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-18 22:48:19,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:19,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 22:48:19,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 22:48:19,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:48:19,202 INFO L87 Difference]: Start difference. First operand 165 states and 203 transitions. Second operand 21 states. [2018-11-18 22:48:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:20,908 INFO L93 Difference]: Finished difference Result 266 states and 330 transitions. [2018-11-18 22:48:20,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 22:48:20,909 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 154 [2018-11-18 22:48:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:48:20,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:48:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 248 transitions. [2018-11-18 22:48:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 22:48:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 248 transitions. [2018-11-18 22:48:20,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 248 transitions. [2018-11-18 22:48:21,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:21,261 INFO L225 Difference]: With dead ends: 266 [2018-11-18 22:48:21,261 INFO L226 Difference]: Without dead ends: 177 [2018-11-18 22:48:21,261 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-18 22:48:21,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-18 22:48:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2018-11-18 22:48:21,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:48:21,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 173 states. [2018-11-18 22:48:21,296 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 173 states. [2018-11-18 22:48:21,296 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 173 states. [2018-11-18 22:48:21,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:21,300 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2018-11-18 22:48:21,300 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2018-11-18 22:48:21,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:21,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:21,300 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 177 states. [2018-11-18 22:48:21,301 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 177 states. [2018-11-18 22:48:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:21,304 INFO L93 Difference]: Finished difference Result 177 states and 219 transitions. [2018-11-18 22:48:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 219 transitions. [2018-11-18 22:48:21,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:21,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:21,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:48:21,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:48:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 22:48:21,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 213 transitions. [2018-11-18 22:48:21,308 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 213 transitions. Word has length 154 [2018-11-18 22:48:21,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:48:21,308 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 213 transitions. [2018-11-18 22:48:21,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 22:48:21,308 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 213 transitions. [2018-11-18 22:48:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-18 22:48:21,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:48:21,309 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:48:21,310 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:48:21,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:48:21,310 INFO L82 PathProgramCache]: Analyzing trace with hash -276020781, now seen corresponding path program 18 times [2018-11-18 22:48:21,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:48:21,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:48:21,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:21,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:48:21,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:21,679 INFO L256 TraceCheckUtils]: 0: Hoare triple {15146#true} call ULTIMATE.init(); {15146#true} is VALID [2018-11-18 22:48:21,679 INFO L273 TraceCheckUtils]: 1: Hoare triple {15146#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15146#true} is VALID [2018-11-18 22:48:21,679 INFO L273 TraceCheckUtils]: 2: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:21,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15146#true} {15146#true} #95#return; {15146#true} is VALID [2018-11-18 22:48:21,680 INFO L256 TraceCheckUtils]: 4: Hoare triple {15146#true} call #t~ret8 := main(); {15146#true} is VALID [2018-11-18 22:48:21,680 INFO L273 TraceCheckUtils]: 5: Hoare triple {15146#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {15148#(= main_~a~0 0)} is VALID [2018-11-18 22:48:21,681 INFO L273 TraceCheckUtils]: 6: Hoare triple {15148#(= main_~a~0 0)} assume true; {15148#(= main_~a~0 0)} is VALID [2018-11-18 22:48:21,681 INFO L273 TraceCheckUtils]: 7: Hoare triple {15148#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15148#(= main_~a~0 0)} is VALID [2018-11-18 22:48:21,681 INFO L273 TraceCheckUtils]: 8: Hoare triple {15148#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15148#(= main_~a~0 0)} is VALID [2018-11-18 22:48:21,682 INFO L273 TraceCheckUtils]: 9: Hoare triple {15148#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {15149#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:21,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {15149#(<= main_~a~0 1)} assume true; {15149#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:21,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {15149#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15149#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:21,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {15149#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15149#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:21,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {15149#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {15150#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:21,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {15150#(<= main_~a~0 2)} assume true; {15150#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:21,684 INFO L273 TraceCheckUtils]: 15: Hoare triple {15150#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15150#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:21,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {15150#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15150#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:21,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {15150#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {15151#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:21,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {15151#(<= main_~a~0 3)} assume true; {15151#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:21,686 INFO L273 TraceCheckUtils]: 19: Hoare triple {15151#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15151#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:21,686 INFO L273 TraceCheckUtils]: 20: Hoare triple {15151#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15151#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:21,687 INFO L273 TraceCheckUtils]: 21: Hoare triple {15151#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {15152#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:21,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {15152#(<= main_~a~0 4)} assume true; {15152#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:21,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {15152#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15152#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:21,688 INFO L273 TraceCheckUtils]: 24: Hoare triple {15152#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15152#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:21,689 INFO L273 TraceCheckUtils]: 25: Hoare triple {15152#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {15153#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:21,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {15153#(<= main_~a~0 5)} assume true; {15153#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:21,690 INFO L273 TraceCheckUtils]: 27: Hoare triple {15153#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15153#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:21,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {15153#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15153#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:21,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {15153#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {15154#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:21,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {15154#(<= main_~a~0 6)} assume true; {15154#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:21,692 INFO L273 TraceCheckUtils]: 31: Hoare triple {15154#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15154#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:21,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {15154#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15154#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:21,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {15154#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {15155#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:21,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {15155#(<= main_~a~0 7)} assume true; {15155#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:21,694 INFO L273 TraceCheckUtils]: 35: Hoare triple {15155#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15155#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:21,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {15155#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15155#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:21,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {15155#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {15156#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:21,696 INFO L273 TraceCheckUtils]: 38: Hoare triple {15156#(<= main_~a~0 8)} assume true; {15156#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:21,696 INFO L273 TraceCheckUtils]: 39: Hoare triple {15156#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15156#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:21,697 INFO L273 TraceCheckUtils]: 40: Hoare triple {15156#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15156#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:21,697 INFO L273 TraceCheckUtils]: 41: Hoare triple {15156#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {15157#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:21,698 INFO L273 TraceCheckUtils]: 42: Hoare triple {15157#(<= main_~a~0 9)} assume true; {15157#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:21,698 INFO L273 TraceCheckUtils]: 43: Hoare triple {15157#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15157#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:21,699 INFO L273 TraceCheckUtils]: 44: Hoare triple {15157#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15157#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:21,699 INFO L273 TraceCheckUtils]: 45: Hoare triple {15157#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {15158#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:21,700 INFO L273 TraceCheckUtils]: 46: Hoare triple {15158#(<= main_~a~0 10)} assume true; {15158#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:21,700 INFO L273 TraceCheckUtils]: 47: Hoare triple {15158#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15158#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:21,701 INFO L273 TraceCheckUtils]: 48: Hoare triple {15158#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15158#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:21,702 INFO L273 TraceCheckUtils]: 49: Hoare triple {15158#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {15159#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:21,702 INFO L273 TraceCheckUtils]: 50: Hoare triple {15159#(<= main_~a~0 11)} assume true; {15159#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:21,702 INFO L273 TraceCheckUtils]: 51: Hoare triple {15159#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15159#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:21,703 INFO L273 TraceCheckUtils]: 52: Hoare triple {15159#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15159#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:21,704 INFO L273 TraceCheckUtils]: 53: Hoare triple {15159#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {15160#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:21,704 INFO L273 TraceCheckUtils]: 54: Hoare triple {15160#(<= main_~a~0 12)} assume true; {15160#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:21,705 INFO L273 TraceCheckUtils]: 55: Hoare triple {15160#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15160#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:21,705 INFO L273 TraceCheckUtils]: 56: Hoare triple {15160#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15160#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:21,706 INFO L273 TraceCheckUtils]: 57: Hoare triple {15160#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {15161#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:21,706 INFO L273 TraceCheckUtils]: 58: Hoare triple {15161#(<= main_~a~0 13)} assume true; {15161#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:21,707 INFO L273 TraceCheckUtils]: 59: Hoare triple {15161#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15161#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:21,707 INFO L273 TraceCheckUtils]: 60: Hoare triple {15161#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15161#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:21,708 INFO L273 TraceCheckUtils]: 61: Hoare triple {15161#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {15162#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:21,708 INFO L273 TraceCheckUtils]: 62: Hoare triple {15162#(<= main_~a~0 14)} assume true; {15162#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:21,709 INFO L273 TraceCheckUtils]: 63: Hoare triple {15162#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15162#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:21,709 INFO L273 TraceCheckUtils]: 64: Hoare triple {15162#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15162#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:21,710 INFO L273 TraceCheckUtils]: 65: Hoare triple {15162#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {15163#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:21,711 INFO L273 TraceCheckUtils]: 66: Hoare triple {15163#(<= main_~a~0 15)} assume true; {15163#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:21,711 INFO L273 TraceCheckUtils]: 67: Hoare triple {15163#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15163#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:21,711 INFO L273 TraceCheckUtils]: 68: Hoare triple {15163#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15163#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:21,712 INFO L273 TraceCheckUtils]: 69: Hoare triple {15163#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {15164#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:21,713 INFO L273 TraceCheckUtils]: 70: Hoare triple {15164#(<= main_~a~0 16)} assume true; {15164#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:21,713 INFO L273 TraceCheckUtils]: 71: Hoare triple {15164#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15164#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:21,714 INFO L273 TraceCheckUtils]: 72: Hoare triple {15164#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15164#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:21,714 INFO L273 TraceCheckUtils]: 73: Hoare triple {15164#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {15165#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:21,715 INFO L273 TraceCheckUtils]: 74: Hoare triple {15165#(<= main_~a~0 17)} assume true; {15165#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:21,715 INFO L273 TraceCheckUtils]: 75: Hoare triple {15165#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15165#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:21,716 INFO L273 TraceCheckUtils]: 76: Hoare triple {15165#(<= main_~a~0 17)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15165#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:21,716 INFO L273 TraceCheckUtils]: 77: Hoare triple {15165#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {15166#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:21,717 INFO L273 TraceCheckUtils]: 78: Hoare triple {15166#(<= main_~a~0 18)} assume true; {15166#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:21,717 INFO L273 TraceCheckUtils]: 79: Hoare triple {15166#(<= main_~a~0 18)} assume !(~a~0 < 100000); {15147#false} is VALID [2018-11-18 22:48:21,718 INFO L273 TraceCheckUtils]: 80: Hoare triple {15147#false} ~a~0 := 0; {15147#false} is VALID [2018-11-18 22:48:21,718 INFO L273 TraceCheckUtils]: 81: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,718 INFO L273 TraceCheckUtils]: 82: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,718 INFO L273 TraceCheckUtils]: 83: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,718 INFO L273 TraceCheckUtils]: 84: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,719 INFO L273 TraceCheckUtils]: 85: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,719 INFO L273 TraceCheckUtils]: 86: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,719 INFO L273 TraceCheckUtils]: 87: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,719 INFO L273 TraceCheckUtils]: 88: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,719 INFO L273 TraceCheckUtils]: 89: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,720 INFO L273 TraceCheckUtils]: 90: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,720 INFO L273 TraceCheckUtils]: 91: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,720 INFO L273 TraceCheckUtils]: 92: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,720 INFO L273 TraceCheckUtils]: 93: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,720 INFO L273 TraceCheckUtils]: 94: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,720 INFO L273 TraceCheckUtils]: 95: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,721 INFO L273 TraceCheckUtils]: 96: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,721 INFO L273 TraceCheckUtils]: 97: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,721 INFO L273 TraceCheckUtils]: 98: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,721 INFO L273 TraceCheckUtils]: 99: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,721 INFO L273 TraceCheckUtils]: 100: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,722 INFO L273 TraceCheckUtils]: 101: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,722 INFO L273 TraceCheckUtils]: 102: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,722 INFO L273 TraceCheckUtils]: 103: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,722 INFO L273 TraceCheckUtils]: 104: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,722 INFO L273 TraceCheckUtils]: 105: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,722 INFO L273 TraceCheckUtils]: 106: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,722 INFO L273 TraceCheckUtils]: 107: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,722 INFO L273 TraceCheckUtils]: 108: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,723 INFO L273 TraceCheckUtils]: 109: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,723 INFO L273 TraceCheckUtils]: 110: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,723 INFO L273 TraceCheckUtils]: 111: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,723 INFO L273 TraceCheckUtils]: 112: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,723 INFO L273 TraceCheckUtils]: 113: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,723 INFO L273 TraceCheckUtils]: 114: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,724 INFO L273 TraceCheckUtils]: 115: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,724 INFO L273 TraceCheckUtils]: 116: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,724 INFO L273 TraceCheckUtils]: 117: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,724 INFO L273 TraceCheckUtils]: 118: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,724 INFO L273 TraceCheckUtils]: 119: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,724 INFO L273 TraceCheckUtils]: 120: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,724 INFO L273 TraceCheckUtils]: 121: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,725 INFO L273 TraceCheckUtils]: 122: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,725 INFO L273 TraceCheckUtils]: 123: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,725 INFO L273 TraceCheckUtils]: 124: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,725 INFO L273 TraceCheckUtils]: 125: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,725 INFO L273 TraceCheckUtils]: 126: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,725 INFO L273 TraceCheckUtils]: 127: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,725 INFO L273 TraceCheckUtils]: 128: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,725 INFO L273 TraceCheckUtils]: 129: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,725 INFO L273 TraceCheckUtils]: 130: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,726 INFO L273 TraceCheckUtils]: 131: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,726 INFO L273 TraceCheckUtils]: 132: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,726 INFO L273 TraceCheckUtils]: 133: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,726 INFO L273 TraceCheckUtils]: 134: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,726 INFO L273 TraceCheckUtils]: 135: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,726 INFO L273 TraceCheckUtils]: 136: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,726 INFO L273 TraceCheckUtils]: 137: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,726 INFO L273 TraceCheckUtils]: 138: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,726 INFO L273 TraceCheckUtils]: 139: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,727 INFO L273 TraceCheckUtils]: 140: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,727 INFO L273 TraceCheckUtils]: 141: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,727 INFO L273 TraceCheckUtils]: 142: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,727 INFO L273 TraceCheckUtils]: 143: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,727 INFO L273 TraceCheckUtils]: 144: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,727 INFO L273 TraceCheckUtils]: 145: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,727 INFO L273 TraceCheckUtils]: 146: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,727 INFO L273 TraceCheckUtils]: 147: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,727 INFO L273 TraceCheckUtils]: 148: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,728 INFO L273 TraceCheckUtils]: 149: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,728 INFO L273 TraceCheckUtils]: 150: Hoare triple {15147#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,728 INFO L273 TraceCheckUtils]: 151: Hoare triple {15147#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15147#false} is VALID [2018-11-18 22:48:21,728 INFO L273 TraceCheckUtils]: 152: Hoare triple {15147#false} ~a~0 := 1 + ~a~0; {15147#false} is VALID [2018-11-18 22:48:21,728 INFO L273 TraceCheckUtils]: 153: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,728 INFO L273 TraceCheckUtils]: 154: Hoare triple {15147#false} assume !(~a~0 < 100000); {15147#false} is VALID [2018-11-18 22:48:21,728 INFO L273 TraceCheckUtils]: 155: Hoare triple {15147#false} havoc ~x~0;~x~0 := 0; {15147#false} is VALID [2018-11-18 22:48:21,728 INFO L273 TraceCheckUtils]: 156: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:21,728 INFO L273 TraceCheckUtils]: 157: Hoare triple {15147#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {15147#false} is VALID [2018-11-18 22:48:21,729 INFO L256 TraceCheckUtils]: 158: Hoare triple {15147#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {15147#false} is VALID [2018-11-18 22:48:21,729 INFO L273 TraceCheckUtils]: 159: Hoare triple {15147#false} ~cond := #in~cond; {15147#false} is VALID [2018-11-18 22:48:21,729 INFO L273 TraceCheckUtils]: 160: Hoare triple {15147#false} assume 0 == ~cond; {15147#false} is VALID [2018-11-18 22:48:21,729 INFO L273 TraceCheckUtils]: 161: Hoare triple {15147#false} assume !false; {15147#false} is VALID [2018-11-18 22:48:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-18 22:48:21,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:48:21,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:48:21,753 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 22:48:35,492 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-18 22:48:35,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:48:35,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:35,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:48:35,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {15146#true} call ULTIMATE.init(); {15146#true} is VALID [2018-11-18 22:48:35,752 INFO L273 TraceCheckUtils]: 1: Hoare triple {15146#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15146#true} is VALID [2018-11-18 22:48:35,752 INFO L273 TraceCheckUtils]: 2: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,752 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15146#true} {15146#true} #95#return; {15146#true} is VALID [2018-11-18 22:48:35,753 INFO L256 TraceCheckUtils]: 4: Hoare triple {15146#true} call #t~ret8 := main(); {15146#true} is VALID [2018-11-18 22:48:35,753 INFO L273 TraceCheckUtils]: 5: Hoare triple {15146#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {15146#true} is VALID [2018-11-18 22:48:35,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,753 INFO L273 TraceCheckUtils]: 7: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,753 INFO L273 TraceCheckUtils]: 8: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,754 INFO L273 TraceCheckUtils]: 9: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,754 INFO L273 TraceCheckUtils]: 10: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,755 INFO L273 TraceCheckUtils]: 18: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,756 INFO L273 TraceCheckUtils]: 20: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,756 INFO L273 TraceCheckUtils]: 21: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,756 INFO L273 TraceCheckUtils]: 23: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,757 INFO L273 TraceCheckUtils]: 25: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,757 INFO L273 TraceCheckUtils]: 26: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,757 INFO L273 TraceCheckUtils]: 28: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,758 INFO L273 TraceCheckUtils]: 29: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,758 INFO L273 TraceCheckUtils]: 30: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,758 INFO L273 TraceCheckUtils]: 31: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,758 INFO L273 TraceCheckUtils]: 32: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,758 INFO L273 TraceCheckUtils]: 33: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,758 INFO L273 TraceCheckUtils]: 34: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,759 INFO L273 TraceCheckUtils]: 35: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,759 INFO L273 TraceCheckUtils]: 36: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,759 INFO L273 TraceCheckUtils]: 37: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,759 INFO L273 TraceCheckUtils]: 38: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,759 INFO L273 TraceCheckUtils]: 39: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,759 INFO L273 TraceCheckUtils]: 40: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,760 INFO L273 TraceCheckUtils]: 41: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,760 INFO L273 TraceCheckUtils]: 42: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,760 INFO L273 TraceCheckUtils]: 43: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,760 INFO L273 TraceCheckUtils]: 44: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,760 INFO L273 TraceCheckUtils]: 45: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,761 INFO L273 TraceCheckUtils]: 46: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,761 INFO L273 TraceCheckUtils]: 47: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,761 INFO L273 TraceCheckUtils]: 48: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,761 INFO L273 TraceCheckUtils]: 49: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,761 INFO L273 TraceCheckUtils]: 50: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,761 INFO L273 TraceCheckUtils]: 51: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,762 INFO L273 TraceCheckUtils]: 52: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,762 INFO L273 TraceCheckUtils]: 53: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,762 INFO L273 TraceCheckUtils]: 54: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,762 INFO L273 TraceCheckUtils]: 55: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,762 INFO L273 TraceCheckUtils]: 56: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,762 INFO L273 TraceCheckUtils]: 57: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,763 INFO L273 TraceCheckUtils]: 58: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,763 INFO L273 TraceCheckUtils]: 59: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,763 INFO L273 TraceCheckUtils]: 60: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,763 INFO L273 TraceCheckUtils]: 61: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,763 INFO L273 TraceCheckUtils]: 62: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,763 INFO L273 TraceCheckUtils]: 63: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,764 INFO L273 TraceCheckUtils]: 64: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,764 INFO L273 TraceCheckUtils]: 65: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,764 INFO L273 TraceCheckUtils]: 66: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,764 INFO L273 TraceCheckUtils]: 67: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,764 INFO L273 TraceCheckUtils]: 68: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,764 INFO L273 TraceCheckUtils]: 69: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,765 INFO L273 TraceCheckUtils]: 70: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,765 INFO L273 TraceCheckUtils]: 71: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,765 INFO L273 TraceCheckUtils]: 72: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,765 INFO L273 TraceCheckUtils]: 73: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,765 INFO L273 TraceCheckUtils]: 74: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,766 INFO L273 TraceCheckUtils]: 75: Hoare triple {15146#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15146#true} is VALID [2018-11-18 22:48:35,766 INFO L273 TraceCheckUtils]: 76: Hoare triple {15146#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {15146#true} is VALID [2018-11-18 22:48:35,766 INFO L273 TraceCheckUtils]: 77: Hoare triple {15146#true} ~a~0 := 1 + ~a~0; {15146#true} is VALID [2018-11-18 22:48:35,766 INFO L273 TraceCheckUtils]: 78: Hoare triple {15146#true} assume true; {15146#true} is VALID [2018-11-18 22:48:35,766 INFO L273 TraceCheckUtils]: 79: Hoare triple {15146#true} assume !(~a~0 < 100000); {15146#true} is VALID [2018-11-18 22:48:35,781 INFO L273 TraceCheckUtils]: 80: Hoare triple {15146#true} ~a~0 := 0; {15410#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:35,789 INFO L273 TraceCheckUtils]: 81: Hoare triple {15410#(<= main_~a~0 0)} assume true; {15410#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:35,800 INFO L273 TraceCheckUtils]: 82: Hoare triple {15410#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15410#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:35,808 INFO L273 TraceCheckUtils]: 83: Hoare triple {15410#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15410#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:35,823 INFO L273 TraceCheckUtils]: 84: Hoare triple {15410#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {15149#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:35,831 INFO L273 TraceCheckUtils]: 85: Hoare triple {15149#(<= main_~a~0 1)} assume true; {15149#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:35,845 INFO L273 TraceCheckUtils]: 86: Hoare triple {15149#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15149#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:35,853 INFO L273 TraceCheckUtils]: 87: Hoare triple {15149#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15149#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:35,867 INFO L273 TraceCheckUtils]: 88: Hoare triple {15149#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {15150#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:35,875 INFO L273 TraceCheckUtils]: 89: Hoare triple {15150#(<= main_~a~0 2)} assume true; {15150#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:35,895 INFO L273 TraceCheckUtils]: 90: Hoare triple {15150#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15150#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:35,903 INFO L273 TraceCheckUtils]: 91: Hoare triple {15150#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15150#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:35,916 INFO L273 TraceCheckUtils]: 92: Hoare triple {15150#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {15151#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:35,930 INFO L273 TraceCheckUtils]: 93: Hoare triple {15151#(<= main_~a~0 3)} assume true; {15151#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:35,939 INFO L273 TraceCheckUtils]: 94: Hoare triple {15151#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15151#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:35,958 INFO L273 TraceCheckUtils]: 95: Hoare triple {15151#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15151#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:35,967 INFO L273 TraceCheckUtils]: 96: Hoare triple {15151#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {15152#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:35,980 INFO L273 TraceCheckUtils]: 97: Hoare triple {15152#(<= main_~a~0 4)} assume true; {15152#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:35,986 INFO L273 TraceCheckUtils]: 98: Hoare triple {15152#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15152#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:35,989 INFO L273 TraceCheckUtils]: 99: Hoare triple {15152#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15152#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:35,992 INFO L273 TraceCheckUtils]: 100: Hoare triple {15152#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {15153#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:35,992 INFO L273 TraceCheckUtils]: 101: Hoare triple {15153#(<= main_~a~0 5)} assume true; {15153#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:35,994 INFO L273 TraceCheckUtils]: 102: Hoare triple {15153#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15153#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:35,994 INFO L273 TraceCheckUtils]: 103: Hoare triple {15153#(<= main_~a~0 5)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15153#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:35,994 INFO L273 TraceCheckUtils]: 104: Hoare triple {15153#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {15154#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:35,995 INFO L273 TraceCheckUtils]: 105: Hoare triple {15154#(<= main_~a~0 6)} assume true; {15154#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:35,995 INFO L273 TraceCheckUtils]: 106: Hoare triple {15154#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15154#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:35,995 INFO L273 TraceCheckUtils]: 107: Hoare triple {15154#(<= main_~a~0 6)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15154#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:35,996 INFO L273 TraceCheckUtils]: 108: Hoare triple {15154#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {15155#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:35,996 INFO L273 TraceCheckUtils]: 109: Hoare triple {15155#(<= main_~a~0 7)} assume true; {15155#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:35,996 INFO L273 TraceCheckUtils]: 110: Hoare triple {15155#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15155#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:35,997 INFO L273 TraceCheckUtils]: 111: Hoare triple {15155#(<= main_~a~0 7)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15155#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:35,997 INFO L273 TraceCheckUtils]: 112: Hoare triple {15155#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {15156#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:35,997 INFO L273 TraceCheckUtils]: 113: Hoare triple {15156#(<= main_~a~0 8)} assume true; {15156#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:35,998 INFO L273 TraceCheckUtils]: 114: Hoare triple {15156#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15156#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:35,998 INFO L273 TraceCheckUtils]: 115: Hoare triple {15156#(<= main_~a~0 8)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15156#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:35,999 INFO L273 TraceCheckUtils]: 116: Hoare triple {15156#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {15157#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:35,999 INFO L273 TraceCheckUtils]: 117: Hoare triple {15157#(<= main_~a~0 9)} assume true; {15157#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:36,000 INFO L273 TraceCheckUtils]: 118: Hoare triple {15157#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15157#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:36,000 INFO L273 TraceCheckUtils]: 119: Hoare triple {15157#(<= main_~a~0 9)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15157#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:36,001 INFO L273 TraceCheckUtils]: 120: Hoare triple {15157#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {15158#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:36,002 INFO L273 TraceCheckUtils]: 121: Hoare triple {15158#(<= main_~a~0 10)} assume true; {15158#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:36,002 INFO L273 TraceCheckUtils]: 122: Hoare triple {15158#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15158#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:36,003 INFO L273 TraceCheckUtils]: 123: Hoare triple {15158#(<= main_~a~0 10)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15158#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:36,003 INFO L273 TraceCheckUtils]: 124: Hoare triple {15158#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {15159#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:36,004 INFO L273 TraceCheckUtils]: 125: Hoare triple {15159#(<= main_~a~0 11)} assume true; {15159#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:36,004 INFO L273 TraceCheckUtils]: 126: Hoare triple {15159#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15159#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:36,005 INFO L273 TraceCheckUtils]: 127: Hoare triple {15159#(<= main_~a~0 11)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15159#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:36,005 INFO L273 TraceCheckUtils]: 128: Hoare triple {15159#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {15160#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:36,006 INFO L273 TraceCheckUtils]: 129: Hoare triple {15160#(<= main_~a~0 12)} assume true; {15160#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:36,006 INFO L273 TraceCheckUtils]: 130: Hoare triple {15160#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15160#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:36,007 INFO L273 TraceCheckUtils]: 131: Hoare triple {15160#(<= main_~a~0 12)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15160#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:36,008 INFO L273 TraceCheckUtils]: 132: Hoare triple {15160#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {15161#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:36,008 INFO L273 TraceCheckUtils]: 133: Hoare triple {15161#(<= main_~a~0 13)} assume true; {15161#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:36,008 INFO L273 TraceCheckUtils]: 134: Hoare triple {15161#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15161#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:36,009 INFO L273 TraceCheckUtils]: 135: Hoare triple {15161#(<= main_~a~0 13)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15161#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:36,010 INFO L273 TraceCheckUtils]: 136: Hoare triple {15161#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {15162#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:36,010 INFO L273 TraceCheckUtils]: 137: Hoare triple {15162#(<= main_~a~0 14)} assume true; {15162#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:36,011 INFO L273 TraceCheckUtils]: 138: Hoare triple {15162#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15162#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:36,011 INFO L273 TraceCheckUtils]: 139: Hoare triple {15162#(<= main_~a~0 14)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15162#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:36,012 INFO L273 TraceCheckUtils]: 140: Hoare triple {15162#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {15163#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:36,012 INFO L273 TraceCheckUtils]: 141: Hoare triple {15163#(<= main_~a~0 15)} assume true; {15163#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:36,013 INFO L273 TraceCheckUtils]: 142: Hoare triple {15163#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15163#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:36,013 INFO L273 TraceCheckUtils]: 143: Hoare triple {15163#(<= main_~a~0 15)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15163#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:36,014 INFO L273 TraceCheckUtils]: 144: Hoare triple {15163#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {15164#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:36,014 INFO L273 TraceCheckUtils]: 145: Hoare triple {15164#(<= main_~a~0 16)} assume true; {15164#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:36,015 INFO L273 TraceCheckUtils]: 146: Hoare triple {15164#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15164#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:36,015 INFO L273 TraceCheckUtils]: 147: Hoare triple {15164#(<= main_~a~0 16)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15164#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:36,016 INFO L273 TraceCheckUtils]: 148: Hoare triple {15164#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {15165#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:36,016 INFO L273 TraceCheckUtils]: 149: Hoare triple {15165#(<= main_~a~0 17)} assume true; {15165#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:36,017 INFO L273 TraceCheckUtils]: 150: Hoare triple {15165#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {15165#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:36,017 INFO L273 TraceCheckUtils]: 151: Hoare triple {15165#(<= main_~a~0 17)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {15165#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:36,018 INFO L273 TraceCheckUtils]: 152: Hoare triple {15165#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {15166#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:36,019 INFO L273 TraceCheckUtils]: 153: Hoare triple {15166#(<= main_~a~0 18)} assume true; {15166#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:36,019 INFO L273 TraceCheckUtils]: 154: Hoare triple {15166#(<= main_~a~0 18)} assume !(~a~0 < 100000); {15147#false} is VALID [2018-11-18 22:48:36,019 INFO L273 TraceCheckUtils]: 155: Hoare triple {15147#false} havoc ~x~0;~x~0 := 0; {15147#false} is VALID [2018-11-18 22:48:36,020 INFO L273 TraceCheckUtils]: 156: Hoare triple {15147#false} assume true; {15147#false} is VALID [2018-11-18 22:48:36,020 INFO L273 TraceCheckUtils]: 157: Hoare triple {15147#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {15147#false} is VALID [2018-11-18 22:48:36,020 INFO L256 TraceCheckUtils]: 158: Hoare triple {15147#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {15147#false} is VALID [2018-11-18 22:48:36,020 INFO L273 TraceCheckUtils]: 159: Hoare triple {15147#false} ~cond := #in~cond; {15147#false} is VALID [2018-11-18 22:48:36,020 INFO L273 TraceCheckUtils]: 160: Hoare triple {15147#false} assume 0 == ~cond; {15147#false} is VALID [2018-11-18 22:48:36,020 INFO L273 TraceCheckUtils]: 161: Hoare triple {15147#false} assume !false; {15147#false} is VALID [2018-11-18 22:48:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2018-11-18 22:48:36,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:48:36,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-18 22:48:36,059 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 162 [2018-11-18 22:48:36,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:48:36,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-18 22:48:36,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:36,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 22:48:36,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 22:48:36,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:48:36,215 INFO L87 Difference]: Start difference. First operand 173 states and 213 transitions. Second operand 22 states. [2018-11-18 22:48:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:36,975 INFO L93 Difference]: Finished difference Result 278 states and 345 transitions. [2018-11-18 22:48:36,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 22:48:36,975 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 162 [2018-11-18 22:48:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:48:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:48:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 258 transitions. [2018-11-18 22:48:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 22:48:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 258 transitions. [2018-11-18 22:48:36,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 258 transitions. [2018-11-18 22:48:37,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:37,199 INFO L225 Difference]: With dead ends: 278 [2018-11-18 22:48:37,199 INFO L226 Difference]: Without dead ends: 185 [2018-11-18 22:48:37,199 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-18 22:48:37,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-18 22:48:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 181. [2018-11-18 22:48:37,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:48:37,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 181 states. [2018-11-18 22:48:37,233 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 181 states. [2018-11-18 22:48:37,234 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 181 states. [2018-11-18 22:48:37,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:37,237 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2018-11-18 22:48:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 229 transitions. [2018-11-18 22:48:37,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:37,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:37,238 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 185 states. [2018-11-18 22:48:37,238 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 185 states. [2018-11-18 22:48:37,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:37,240 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2018-11-18 22:48:37,240 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 229 transitions. [2018-11-18 22:48:37,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:37,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:37,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:48:37,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:48:37,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 22:48:37,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 223 transitions. [2018-11-18 22:48:37,243 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 223 transitions. Word has length 162 [2018-11-18 22:48:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:48:37,243 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 223 transitions. [2018-11-18 22:48:37,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 22:48:37,244 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 223 transitions. [2018-11-18 22:48:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-18 22:48:37,245 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:48:37,245 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:48:37,245 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:48:37,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:48:37,245 INFO L82 PathProgramCache]: Analyzing trace with hash -134172461, now seen corresponding path program 19 times [2018-11-18 22:48:37,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:48:37,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:48:37,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:37,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:48:37,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:37,767 INFO L256 TraceCheckUtils]: 0: Hoare triple {16604#true} call ULTIMATE.init(); {16604#true} is VALID [2018-11-18 22:48:37,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {16604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16604#true} is VALID [2018-11-18 22:48:37,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {16604#true} assume true; {16604#true} is VALID [2018-11-18 22:48:37,768 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16604#true} {16604#true} #95#return; {16604#true} is VALID [2018-11-18 22:48:37,768 INFO L256 TraceCheckUtils]: 4: Hoare triple {16604#true} call #t~ret8 := main(); {16604#true} is VALID [2018-11-18 22:48:37,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {16604#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {16606#(= main_~a~0 0)} is VALID [2018-11-18 22:48:37,769 INFO L273 TraceCheckUtils]: 6: Hoare triple {16606#(= main_~a~0 0)} assume true; {16606#(= main_~a~0 0)} is VALID [2018-11-18 22:48:37,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {16606#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16606#(= main_~a~0 0)} is VALID [2018-11-18 22:48:37,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {16606#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16606#(= main_~a~0 0)} is VALID [2018-11-18 22:48:37,771 INFO L273 TraceCheckUtils]: 9: Hoare triple {16606#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {16607#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:37,771 INFO L273 TraceCheckUtils]: 10: Hoare triple {16607#(<= main_~a~0 1)} assume true; {16607#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:37,771 INFO L273 TraceCheckUtils]: 11: Hoare triple {16607#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16607#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:37,772 INFO L273 TraceCheckUtils]: 12: Hoare triple {16607#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16607#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:37,772 INFO L273 TraceCheckUtils]: 13: Hoare triple {16607#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {16608#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:37,772 INFO L273 TraceCheckUtils]: 14: Hoare triple {16608#(<= main_~a~0 2)} assume true; {16608#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:37,773 INFO L273 TraceCheckUtils]: 15: Hoare triple {16608#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16608#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:37,773 INFO L273 TraceCheckUtils]: 16: Hoare triple {16608#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16608#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:37,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {16608#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {16609#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:37,774 INFO L273 TraceCheckUtils]: 18: Hoare triple {16609#(<= main_~a~0 3)} assume true; {16609#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:37,774 INFO L273 TraceCheckUtils]: 19: Hoare triple {16609#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16609#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:37,775 INFO L273 TraceCheckUtils]: 20: Hoare triple {16609#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16609#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:37,775 INFO L273 TraceCheckUtils]: 21: Hoare triple {16609#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {16610#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:37,776 INFO L273 TraceCheckUtils]: 22: Hoare triple {16610#(<= main_~a~0 4)} assume true; {16610#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:37,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {16610#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16610#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:37,777 INFO L273 TraceCheckUtils]: 24: Hoare triple {16610#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16610#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:37,777 INFO L273 TraceCheckUtils]: 25: Hoare triple {16610#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {16611#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:37,778 INFO L273 TraceCheckUtils]: 26: Hoare triple {16611#(<= main_~a~0 5)} assume true; {16611#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:37,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {16611#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16611#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:37,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {16611#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16611#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:37,780 INFO L273 TraceCheckUtils]: 29: Hoare triple {16611#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {16612#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:37,780 INFO L273 TraceCheckUtils]: 30: Hoare triple {16612#(<= main_~a~0 6)} assume true; {16612#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:37,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {16612#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16612#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:37,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {16612#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16612#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:37,782 INFO L273 TraceCheckUtils]: 33: Hoare triple {16612#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {16613#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:37,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {16613#(<= main_~a~0 7)} assume true; {16613#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:37,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {16613#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16613#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:37,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {16613#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16613#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:37,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {16613#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {16614#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:37,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {16614#(<= main_~a~0 8)} assume true; {16614#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:37,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {16614#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16614#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:37,785 INFO L273 TraceCheckUtils]: 40: Hoare triple {16614#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16614#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:37,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {16614#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {16615#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:37,807 INFO L273 TraceCheckUtils]: 42: Hoare triple {16615#(<= main_~a~0 9)} assume true; {16615#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:37,819 INFO L273 TraceCheckUtils]: 43: Hoare triple {16615#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16615#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:37,819 INFO L273 TraceCheckUtils]: 44: Hoare triple {16615#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16615#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:37,820 INFO L273 TraceCheckUtils]: 45: Hoare triple {16615#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {16616#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:37,820 INFO L273 TraceCheckUtils]: 46: Hoare triple {16616#(<= main_~a~0 10)} assume true; {16616#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:37,820 INFO L273 TraceCheckUtils]: 47: Hoare triple {16616#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16616#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:37,821 INFO L273 TraceCheckUtils]: 48: Hoare triple {16616#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16616#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:37,821 INFO L273 TraceCheckUtils]: 49: Hoare triple {16616#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {16617#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:37,822 INFO L273 TraceCheckUtils]: 50: Hoare triple {16617#(<= main_~a~0 11)} assume true; {16617#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:37,822 INFO L273 TraceCheckUtils]: 51: Hoare triple {16617#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16617#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:37,822 INFO L273 TraceCheckUtils]: 52: Hoare triple {16617#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16617#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:37,823 INFO L273 TraceCheckUtils]: 53: Hoare triple {16617#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {16618#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:37,823 INFO L273 TraceCheckUtils]: 54: Hoare triple {16618#(<= main_~a~0 12)} assume true; {16618#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:37,823 INFO L273 TraceCheckUtils]: 55: Hoare triple {16618#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16618#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:37,823 INFO L273 TraceCheckUtils]: 56: Hoare triple {16618#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16618#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:37,824 INFO L273 TraceCheckUtils]: 57: Hoare triple {16618#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {16619#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:37,824 INFO L273 TraceCheckUtils]: 58: Hoare triple {16619#(<= main_~a~0 13)} assume true; {16619#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:37,825 INFO L273 TraceCheckUtils]: 59: Hoare triple {16619#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16619#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:37,825 INFO L273 TraceCheckUtils]: 60: Hoare triple {16619#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16619#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:37,826 INFO L273 TraceCheckUtils]: 61: Hoare triple {16619#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {16620#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:37,826 INFO L273 TraceCheckUtils]: 62: Hoare triple {16620#(<= main_~a~0 14)} assume true; {16620#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:37,827 INFO L273 TraceCheckUtils]: 63: Hoare triple {16620#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16620#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:37,827 INFO L273 TraceCheckUtils]: 64: Hoare triple {16620#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16620#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:37,828 INFO L273 TraceCheckUtils]: 65: Hoare triple {16620#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {16621#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:37,829 INFO L273 TraceCheckUtils]: 66: Hoare triple {16621#(<= main_~a~0 15)} assume true; {16621#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:37,829 INFO L273 TraceCheckUtils]: 67: Hoare triple {16621#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16621#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:37,829 INFO L273 TraceCheckUtils]: 68: Hoare triple {16621#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16621#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:37,830 INFO L273 TraceCheckUtils]: 69: Hoare triple {16621#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {16622#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:37,831 INFO L273 TraceCheckUtils]: 70: Hoare triple {16622#(<= main_~a~0 16)} assume true; {16622#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:37,831 INFO L273 TraceCheckUtils]: 71: Hoare triple {16622#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16622#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:37,832 INFO L273 TraceCheckUtils]: 72: Hoare triple {16622#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16622#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:37,832 INFO L273 TraceCheckUtils]: 73: Hoare triple {16622#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {16623#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:37,833 INFO L273 TraceCheckUtils]: 74: Hoare triple {16623#(<= main_~a~0 17)} assume true; {16623#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:37,833 INFO L273 TraceCheckUtils]: 75: Hoare triple {16623#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16623#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:37,834 INFO L273 TraceCheckUtils]: 76: Hoare triple {16623#(<= main_~a~0 17)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16623#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:37,834 INFO L273 TraceCheckUtils]: 77: Hoare triple {16623#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {16624#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:37,835 INFO L273 TraceCheckUtils]: 78: Hoare triple {16624#(<= main_~a~0 18)} assume true; {16624#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:37,838 INFO L273 TraceCheckUtils]: 79: Hoare triple {16624#(<= main_~a~0 18)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16624#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:37,838 INFO L273 TraceCheckUtils]: 80: Hoare triple {16624#(<= main_~a~0 18)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16624#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:37,839 INFO L273 TraceCheckUtils]: 81: Hoare triple {16624#(<= main_~a~0 18)} ~a~0 := 1 + ~a~0; {16625#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:37,839 INFO L273 TraceCheckUtils]: 82: Hoare triple {16625#(<= main_~a~0 19)} assume true; {16625#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:37,840 INFO L273 TraceCheckUtils]: 83: Hoare triple {16625#(<= main_~a~0 19)} assume !(~a~0 < 100000); {16605#false} is VALID [2018-11-18 22:48:37,840 INFO L273 TraceCheckUtils]: 84: Hoare triple {16605#false} ~a~0 := 0; {16605#false} is VALID [2018-11-18 22:48:37,840 INFO L273 TraceCheckUtils]: 85: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,840 INFO L273 TraceCheckUtils]: 86: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,840 INFO L273 TraceCheckUtils]: 87: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,840 INFO L273 TraceCheckUtils]: 88: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,840 INFO L273 TraceCheckUtils]: 89: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,840 INFO L273 TraceCheckUtils]: 90: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,840 INFO L273 TraceCheckUtils]: 91: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,841 INFO L273 TraceCheckUtils]: 92: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,841 INFO L273 TraceCheckUtils]: 93: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,841 INFO L273 TraceCheckUtils]: 94: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,841 INFO L273 TraceCheckUtils]: 95: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,841 INFO L273 TraceCheckUtils]: 96: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,841 INFO L273 TraceCheckUtils]: 97: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,841 INFO L273 TraceCheckUtils]: 98: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,841 INFO L273 TraceCheckUtils]: 99: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,841 INFO L273 TraceCheckUtils]: 100: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,842 INFO L273 TraceCheckUtils]: 101: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,842 INFO L273 TraceCheckUtils]: 102: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,842 INFO L273 TraceCheckUtils]: 103: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,842 INFO L273 TraceCheckUtils]: 104: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,842 INFO L273 TraceCheckUtils]: 105: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,842 INFO L273 TraceCheckUtils]: 106: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,842 INFO L273 TraceCheckUtils]: 107: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,843 INFO L273 TraceCheckUtils]: 108: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,843 INFO L273 TraceCheckUtils]: 109: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,843 INFO L273 TraceCheckUtils]: 110: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,843 INFO L273 TraceCheckUtils]: 111: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,843 INFO L273 TraceCheckUtils]: 112: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,843 INFO L273 TraceCheckUtils]: 113: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,844 INFO L273 TraceCheckUtils]: 114: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,844 INFO L273 TraceCheckUtils]: 115: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,844 INFO L273 TraceCheckUtils]: 116: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,844 INFO L273 TraceCheckUtils]: 117: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,844 INFO L273 TraceCheckUtils]: 118: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,844 INFO L273 TraceCheckUtils]: 119: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,844 INFO L273 TraceCheckUtils]: 120: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,845 INFO L273 TraceCheckUtils]: 121: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,845 INFO L273 TraceCheckUtils]: 122: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,845 INFO L273 TraceCheckUtils]: 123: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,845 INFO L273 TraceCheckUtils]: 124: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,845 INFO L273 TraceCheckUtils]: 125: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,845 INFO L273 TraceCheckUtils]: 126: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,845 INFO L273 TraceCheckUtils]: 127: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,845 INFO L273 TraceCheckUtils]: 128: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,845 INFO L273 TraceCheckUtils]: 129: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,845 INFO L273 TraceCheckUtils]: 130: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,846 INFO L273 TraceCheckUtils]: 131: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,846 INFO L273 TraceCheckUtils]: 132: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,846 INFO L273 TraceCheckUtils]: 133: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,846 INFO L273 TraceCheckUtils]: 134: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,846 INFO L273 TraceCheckUtils]: 135: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,846 INFO L273 TraceCheckUtils]: 136: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,846 INFO L273 TraceCheckUtils]: 137: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,846 INFO L273 TraceCheckUtils]: 138: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,846 INFO L273 TraceCheckUtils]: 139: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,847 INFO L273 TraceCheckUtils]: 140: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,847 INFO L273 TraceCheckUtils]: 141: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,847 INFO L273 TraceCheckUtils]: 142: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,847 INFO L273 TraceCheckUtils]: 143: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,847 INFO L273 TraceCheckUtils]: 144: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,847 INFO L273 TraceCheckUtils]: 145: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,847 INFO L273 TraceCheckUtils]: 146: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,847 INFO L273 TraceCheckUtils]: 147: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,847 INFO L273 TraceCheckUtils]: 148: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,848 INFO L273 TraceCheckUtils]: 149: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,848 INFO L273 TraceCheckUtils]: 150: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,848 INFO L273 TraceCheckUtils]: 151: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,848 INFO L273 TraceCheckUtils]: 152: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,848 INFO L273 TraceCheckUtils]: 153: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,848 INFO L273 TraceCheckUtils]: 154: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,848 INFO L273 TraceCheckUtils]: 155: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,848 INFO L273 TraceCheckUtils]: 156: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,848 INFO L273 TraceCheckUtils]: 157: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,849 INFO L273 TraceCheckUtils]: 158: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,849 INFO L273 TraceCheckUtils]: 159: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:37,849 INFO L273 TraceCheckUtils]: 160: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:37,849 INFO L273 TraceCheckUtils]: 161: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,849 INFO L273 TraceCheckUtils]: 162: Hoare triple {16605#false} assume !(~a~0 < 100000); {16605#false} is VALID [2018-11-18 22:48:37,849 INFO L273 TraceCheckUtils]: 163: Hoare triple {16605#false} havoc ~x~0;~x~0 := 0; {16605#false} is VALID [2018-11-18 22:48:37,849 INFO L273 TraceCheckUtils]: 164: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:37,849 INFO L273 TraceCheckUtils]: 165: Hoare triple {16605#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {16605#false} is VALID [2018-11-18 22:48:37,849 INFO L256 TraceCheckUtils]: 166: Hoare triple {16605#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {16605#false} is VALID [2018-11-18 22:48:37,850 INFO L273 TraceCheckUtils]: 167: Hoare triple {16605#false} ~cond := #in~cond; {16605#false} is VALID [2018-11-18 22:48:37,850 INFO L273 TraceCheckUtils]: 168: Hoare triple {16605#false} assume 0 == ~cond; {16605#false} is VALID [2018-11-18 22:48:37,850 INFO L273 TraceCheckUtils]: 169: Hoare triple {16605#false} assume !false; {16605#false} is VALID [2018-11-18 22:48:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-11-18 22:48:37,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:48:37,864 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-18 22:48:37,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:48:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:37,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:48:38,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {16604#true} call ULTIMATE.init(); {16604#true} is VALID [2018-11-18 22:48:38,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {16604#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16604#true} is VALID [2018-11-18 22:48:38,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {16604#true} assume true; {16604#true} is VALID [2018-11-18 22:48:38,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16604#true} {16604#true} #95#return; {16604#true} is VALID [2018-11-18 22:48:38,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {16604#true} call #t~ret8 := main(); {16604#true} is VALID [2018-11-18 22:48:38,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {16604#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {16644#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:38,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {16644#(<= main_~a~0 0)} assume true; {16644#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:38,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {16644#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16644#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:38,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {16644#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16644#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:38,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {16644#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {16607#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:38,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {16607#(<= main_~a~0 1)} assume true; {16607#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:38,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {16607#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16607#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:38,175 INFO L273 TraceCheckUtils]: 12: Hoare triple {16607#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16607#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:38,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {16607#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {16608#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:38,176 INFO L273 TraceCheckUtils]: 14: Hoare triple {16608#(<= main_~a~0 2)} assume true; {16608#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:38,177 INFO L273 TraceCheckUtils]: 15: Hoare triple {16608#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16608#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:38,177 INFO L273 TraceCheckUtils]: 16: Hoare triple {16608#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16608#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:38,178 INFO L273 TraceCheckUtils]: 17: Hoare triple {16608#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {16609#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:38,178 INFO L273 TraceCheckUtils]: 18: Hoare triple {16609#(<= main_~a~0 3)} assume true; {16609#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:38,179 INFO L273 TraceCheckUtils]: 19: Hoare triple {16609#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16609#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:38,179 INFO L273 TraceCheckUtils]: 20: Hoare triple {16609#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16609#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:38,180 INFO L273 TraceCheckUtils]: 21: Hoare triple {16609#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {16610#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:38,180 INFO L273 TraceCheckUtils]: 22: Hoare triple {16610#(<= main_~a~0 4)} assume true; {16610#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:38,181 INFO L273 TraceCheckUtils]: 23: Hoare triple {16610#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16610#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:38,181 INFO L273 TraceCheckUtils]: 24: Hoare triple {16610#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16610#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:38,182 INFO L273 TraceCheckUtils]: 25: Hoare triple {16610#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {16611#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:38,182 INFO L273 TraceCheckUtils]: 26: Hoare triple {16611#(<= main_~a~0 5)} assume true; {16611#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:38,183 INFO L273 TraceCheckUtils]: 27: Hoare triple {16611#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16611#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:38,183 INFO L273 TraceCheckUtils]: 28: Hoare triple {16611#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16611#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:38,184 INFO L273 TraceCheckUtils]: 29: Hoare triple {16611#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {16612#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:38,185 INFO L273 TraceCheckUtils]: 30: Hoare triple {16612#(<= main_~a~0 6)} assume true; {16612#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:38,185 INFO L273 TraceCheckUtils]: 31: Hoare triple {16612#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16612#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:38,185 INFO L273 TraceCheckUtils]: 32: Hoare triple {16612#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16612#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:38,186 INFO L273 TraceCheckUtils]: 33: Hoare triple {16612#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {16613#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:38,187 INFO L273 TraceCheckUtils]: 34: Hoare triple {16613#(<= main_~a~0 7)} assume true; {16613#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:38,187 INFO L273 TraceCheckUtils]: 35: Hoare triple {16613#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16613#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:38,188 INFO L273 TraceCheckUtils]: 36: Hoare triple {16613#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16613#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:38,188 INFO L273 TraceCheckUtils]: 37: Hoare triple {16613#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {16614#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:38,189 INFO L273 TraceCheckUtils]: 38: Hoare triple {16614#(<= main_~a~0 8)} assume true; {16614#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:38,189 INFO L273 TraceCheckUtils]: 39: Hoare triple {16614#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16614#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:38,190 INFO L273 TraceCheckUtils]: 40: Hoare triple {16614#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16614#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:38,190 INFO L273 TraceCheckUtils]: 41: Hoare triple {16614#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {16615#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:38,191 INFO L273 TraceCheckUtils]: 42: Hoare triple {16615#(<= main_~a~0 9)} assume true; {16615#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:38,191 INFO L273 TraceCheckUtils]: 43: Hoare triple {16615#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16615#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:38,192 INFO L273 TraceCheckUtils]: 44: Hoare triple {16615#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16615#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:38,192 INFO L273 TraceCheckUtils]: 45: Hoare triple {16615#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {16616#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:38,193 INFO L273 TraceCheckUtils]: 46: Hoare triple {16616#(<= main_~a~0 10)} assume true; {16616#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:38,193 INFO L273 TraceCheckUtils]: 47: Hoare triple {16616#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16616#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:38,194 INFO L273 TraceCheckUtils]: 48: Hoare triple {16616#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16616#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:38,195 INFO L273 TraceCheckUtils]: 49: Hoare triple {16616#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {16617#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:38,195 INFO L273 TraceCheckUtils]: 50: Hoare triple {16617#(<= main_~a~0 11)} assume true; {16617#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:38,195 INFO L273 TraceCheckUtils]: 51: Hoare triple {16617#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16617#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:38,196 INFO L273 TraceCheckUtils]: 52: Hoare triple {16617#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16617#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:38,197 INFO L273 TraceCheckUtils]: 53: Hoare triple {16617#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {16618#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:38,197 INFO L273 TraceCheckUtils]: 54: Hoare triple {16618#(<= main_~a~0 12)} assume true; {16618#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:38,198 INFO L273 TraceCheckUtils]: 55: Hoare triple {16618#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16618#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:38,198 INFO L273 TraceCheckUtils]: 56: Hoare triple {16618#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16618#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:38,199 INFO L273 TraceCheckUtils]: 57: Hoare triple {16618#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {16619#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:38,199 INFO L273 TraceCheckUtils]: 58: Hoare triple {16619#(<= main_~a~0 13)} assume true; {16619#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:38,200 INFO L273 TraceCheckUtils]: 59: Hoare triple {16619#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16619#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:38,200 INFO L273 TraceCheckUtils]: 60: Hoare triple {16619#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16619#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:38,201 INFO L273 TraceCheckUtils]: 61: Hoare triple {16619#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {16620#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:38,201 INFO L273 TraceCheckUtils]: 62: Hoare triple {16620#(<= main_~a~0 14)} assume true; {16620#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:38,202 INFO L273 TraceCheckUtils]: 63: Hoare triple {16620#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16620#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:38,202 INFO L273 TraceCheckUtils]: 64: Hoare triple {16620#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16620#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:38,203 INFO L273 TraceCheckUtils]: 65: Hoare triple {16620#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {16621#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:38,203 INFO L273 TraceCheckUtils]: 66: Hoare triple {16621#(<= main_~a~0 15)} assume true; {16621#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:38,204 INFO L273 TraceCheckUtils]: 67: Hoare triple {16621#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16621#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:38,204 INFO L273 TraceCheckUtils]: 68: Hoare triple {16621#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16621#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:38,205 INFO L273 TraceCheckUtils]: 69: Hoare triple {16621#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {16622#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:38,206 INFO L273 TraceCheckUtils]: 70: Hoare triple {16622#(<= main_~a~0 16)} assume true; {16622#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:38,206 INFO L273 TraceCheckUtils]: 71: Hoare triple {16622#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16622#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:38,206 INFO L273 TraceCheckUtils]: 72: Hoare triple {16622#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16622#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:38,207 INFO L273 TraceCheckUtils]: 73: Hoare triple {16622#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {16623#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:38,208 INFO L273 TraceCheckUtils]: 74: Hoare triple {16623#(<= main_~a~0 17)} assume true; {16623#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:38,208 INFO L273 TraceCheckUtils]: 75: Hoare triple {16623#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16623#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:38,209 INFO L273 TraceCheckUtils]: 76: Hoare triple {16623#(<= main_~a~0 17)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16623#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:38,209 INFO L273 TraceCheckUtils]: 77: Hoare triple {16623#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {16624#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:38,210 INFO L273 TraceCheckUtils]: 78: Hoare triple {16624#(<= main_~a~0 18)} assume true; {16624#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:38,210 INFO L273 TraceCheckUtils]: 79: Hoare triple {16624#(<= main_~a~0 18)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16624#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:38,211 INFO L273 TraceCheckUtils]: 80: Hoare triple {16624#(<= main_~a~0 18)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {16624#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:38,211 INFO L273 TraceCheckUtils]: 81: Hoare triple {16624#(<= main_~a~0 18)} ~a~0 := 1 + ~a~0; {16625#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:38,212 INFO L273 TraceCheckUtils]: 82: Hoare triple {16625#(<= main_~a~0 19)} assume true; {16625#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:38,212 INFO L273 TraceCheckUtils]: 83: Hoare triple {16625#(<= main_~a~0 19)} assume !(~a~0 < 100000); {16605#false} is VALID [2018-11-18 22:48:38,213 INFO L273 TraceCheckUtils]: 84: Hoare triple {16605#false} ~a~0 := 0; {16605#false} is VALID [2018-11-18 22:48:38,213 INFO L273 TraceCheckUtils]: 85: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,213 INFO L273 TraceCheckUtils]: 86: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,213 INFO L273 TraceCheckUtils]: 87: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,213 INFO L273 TraceCheckUtils]: 88: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,214 INFO L273 TraceCheckUtils]: 89: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,214 INFO L273 TraceCheckUtils]: 90: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,214 INFO L273 TraceCheckUtils]: 91: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,214 INFO L273 TraceCheckUtils]: 92: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,214 INFO L273 TraceCheckUtils]: 93: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,214 INFO L273 TraceCheckUtils]: 94: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,215 INFO L273 TraceCheckUtils]: 95: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,215 INFO L273 TraceCheckUtils]: 96: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,215 INFO L273 TraceCheckUtils]: 97: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,215 INFO L273 TraceCheckUtils]: 98: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,215 INFO L273 TraceCheckUtils]: 99: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,216 INFO L273 TraceCheckUtils]: 100: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,216 INFO L273 TraceCheckUtils]: 101: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,216 INFO L273 TraceCheckUtils]: 102: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,216 INFO L273 TraceCheckUtils]: 103: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,216 INFO L273 TraceCheckUtils]: 104: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,216 INFO L273 TraceCheckUtils]: 105: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,217 INFO L273 TraceCheckUtils]: 106: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,217 INFO L273 TraceCheckUtils]: 107: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,217 INFO L273 TraceCheckUtils]: 108: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,217 INFO L273 TraceCheckUtils]: 109: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,217 INFO L273 TraceCheckUtils]: 110: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,217 INFO L273 TraceCheckUtils]: 111: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,217 INFO L273 TraceCheckUtils]: 112: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,217 INFO L273 TraceCheckUtils]: 113: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,217 INFO L273 TraceCheckUtils]: 114: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,218 INFO L273 TraceCheckUtils]: 115: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,218 INFO L273 TraceCheckUtils]: 116: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,218 INFO L273 TraceCheckUtils]: 117: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,218 INFO L273 TraceCheckUtils]: 118: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,218 INFO L273 TraceCheckUtils]: 119: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,218 INFO L273 TraceCheckUtils]: 120: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,218 INFO L273 TraceCheckUtils]: 121: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,218 INFO L273 TraceCheckUtils]: 122: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,218 INFO L273 TraceCheckUtils]: 123: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,219 INFO L273 TraceCheckUtils]: 124: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,219 INFO L273 TraceCheckUtils]: 125: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,219 INFO L273 TraceCheckUtils]: 126: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,219 INFO L273 TraceCheckUtils]: 127: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,219 INFO L273 TraceCheckUtils]: 128: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,219 INFO L273 TraceCheckUtils]: 129: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,219 INFO L273 TraceCheckUtils]: 130: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,219 INFO L273 TraceCheckUtils]: 131: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,219 INFO L273 TraceCheckUtils]: 132: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,219 INFO L273 TraceCheckUtils]: 133: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,220 INFO L273 TraceCheckUtils]: 134: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,220 INFO L273 TraceCheckUtils]: 135: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,220 INFO L273 TraceCheckUtils]: 136: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,220 INFO L273 TraceCheckUtils]: 137: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,220 INFO L273 TraceCheckUtils]: 138: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,220 INFO L273 TraceCheckUtils]: 139: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,220 INFO L273 TraceCheckUtils]: 140: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,221 INFO L273 TraceCheckUtils]: 141: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,221 INFO L273 TraceCheckUtils]: 142: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,221 INFO L273 TraceCheckUtils]: 143: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,221 INFO L273 TraceCheckUtils]: 144: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,221 INFO L273 TraceCheckUtils]: 145: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,221 INFO L273 TraceCheckUtils]: 146: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,221 INFO L273 TraceCheckUtils]: 147: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,222 INFO L273 TraceCheckUtils]: 148: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,222 INFO L273 TraceCheckUtils]: 149: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,222 INFO L273 TraceCheckUtils]: 150: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,222 INFO L273 TraceCheckUtils]: 151: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,222 INFO L273 TraceCheckUtils]: 152: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,222 INFO L273 TraceCheckUtils]: 153: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,222 INFO L273 TraceCheckUtils]: 154: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,223 INFO L273 TraceCheckUtils]: 155: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,223 INFO L273 TraceCheckUtils]: 156: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,223 INFO L273 TraceCheckUtils]: 157: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,223 INFO L273 TraceCheckUtils]: 158: Hoare triple {16605#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,223 INFO L273 TraceCheckUtils]: 159: Hoare triple {16605#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {16605#false} is VALID [2018-11-18 22:48:38,223 INFO L273 TraceCheckUtils]: 160: Hoare triple {16605#false} ~a~0 := 1 + ~a~0; {16605#false} is VALID [2018-11-18 22:48:38,223 INFO L273 TraceCheckUtils]: 161: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,223 INFO L273 TraceCheckUtils]: 162: Hoare triple {16605#false} assume !(~a~0 < 100000); {16605#false} is VALID [2018-11-18 22:48:38,223 INFO L273 TraceCheckUtils]: 163: Hoare triple {16605#false} havoc ~x~0;~x~0 := 0; {16605#false} is VALID [2018-11-18 22:48:38,224 INFO L273 TraceCheckUtils]: 164: Hoare triple {16605#false} assume true; {16605#false} is VALID [2018-11-18 22:48:38,224 INFO L273 TraceCheckUtils]: 165: Hoare triple {16605#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {16605#false} is VALID [2018-11-18 22:48:38,224 INFO L256 TraceCheckUtils]: 166: Hoare triple {16605#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {16605#false} is VALID [2018-11-18 22:48:38,224 INFO L273 TraceCheckUtils]: 167: Hoare triple {16605#false} ~cond := #in~cond; {16605#false} is VALID [2018-11-18 22:48:38,224 INFO L273 TraceCheckUtils]: 168: Hoare triple {16605#false} assume 0 == ~cond; {16605#false} is VALID [2018-11-18 22:48:38,224 INFO L273 TraceCheckUtils]: 169: Hoare triple {16605#false} assume !false; {16605#false} is VALID [2018-11-18 22:48:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 722 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2018-11-18 22:48:38,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:48:38,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-18 22:48:38,258 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 170 [2018-11-18 22:48:38,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:48:38,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-18 22:48:38,353 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:38,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-18 22:48:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-18 22:48:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:48:38,354 INFO L87 Difference]: Start difference. First operand 181 states and 223 transitions. Second operand 23 states. [2018-11-18 22:48:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:39,384 INFO L93 Difference]: Finished difference Result 290 states and 360 transitions. [2018-11-18 22:48:39,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-18 22:48:39,384 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 170 [2018-11-18 22:48:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:48:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:48:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 268 transitions. [2018-11-18 22:48:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-18 22:48:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 268 transitions. [2018-11-18 22:48:39,387 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 268 transitions. [2018-11-18 22:48:39,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:39,621 INFO L225 Difference]: With dead ends: 290 [2018-11-18 22:48:39,621 INFO L226 Difference]: Without dead ends: 193 [2018-11-18 22:48:39,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-18 22:48:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-18 22:48:39,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 189. [2018-11-18 22:48:39,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:48:39,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand 189 states. [2018-11-18 22:48:39,689 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 189 states. [2018-11-18 22:48:39,689 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 189 states. [2018-11-18 22:48:39,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:39,693 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2018-11-18 22:48:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 239 transitions. [2018-11-18 22:48:39,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:39,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:39,694 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 193 states. [2018-11-18 22:48:39,695 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 193 states. [2018-11-18 22:48:39,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:39,698 INFO L93 Difference]: Finished difference Result 193 states and 239 transitions. [2018-11-18 22:48:39,698 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 239 transitions. [2018-11-18 22:48:39,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:39,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:39,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:48:39,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:48:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-18 22:48:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 233 transitions. [2018-11-18 22:48:39,702 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 233 transitions. Word has length 170 [2018-11-18 22:48:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:48:39,703 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 233 transitions. [2018-11-18 22:48:39,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-18 22:48:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 233 transitions. [2018-11-18 22:48:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-18 22:48:39,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:48:39,704 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:48:39,705 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:48:39,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:48:39,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1847781933, now seen corresponding path program 20 times [2018-11-18 22:48:39,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:48:39,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:48:39,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:39,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 22:48:39,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:40,173 INFO L256 TraceCheckUtils]: 0: Hoare triple {18128#true} call ULTIMATE.init(); {18128#true} is VALID [2018-11-18 22:48:40,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {18128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18128#true} is VALID [2018-11-18 22:48:40,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {18128#true} assume true; {18128#true} is VALID [2018-11-18 22:48:40,174 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18128#true} {18128#true} #95#return; {18128#true} is VALID [2018-11-18 22:48:40,174 INFO L256 TraceCheckUtils]: 4: Hoare triple {18128#true} call #t~ret8 := main(); {18128#true} is VALID [2018-11-18 22:48:40,175 INFO L273 TraceCheckUtils]: 5: Hoare triple {18128#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {18130#(= main_~a~0 0)} is VALID [2018-11-18 22:48:40,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {18130#(= main_~a~0 0)} assume true; {18130#(= main_~a~0 0)} is VALID [2018-11-18 22:48:40,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {18130#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18130#(= main_~a~0 0)} is VALID [2018-11-18 22:48:40,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {18130#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18130#(= main_~a~0 0)} is VALID [2018-11-18 22:48:40,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {18130#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {18131#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:40,177 INFO L273 TraceCheckUtils]: 10: Hoare triple {18131#(<= main_~a~0 1)} assume true; {18131#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:40,177 INFO L273 TraceCheckUtils]: 11: Hoare triple {18131#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18131#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:40,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {18131#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18131#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:40,178 INFO L273 TraceCheckUtils]: 13: Hoare triple {18131#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {18132#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:40,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {18132#(<= main_~a~0 2)} assume true; {18132#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:40,179 INFO L273 TraceCheckUtils]: 15: Hoare triple {18132#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18132#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:40,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {18132#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18132#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:40,179 INFO L273 TraceCheckUtils]: 17: Hoare triple {18132#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {18133#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:40,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {18133#(<= main_~a~0 3)} assume true; {18133#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:40,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {18133#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18133#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:40,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {18133#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18133#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:40,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {18133#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {18134#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:40,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {18134#(<= main_~a~0 4)} assume true; {18134#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:40,182 INFO L273 TraceCheckUtils]: 23: Hoare triple {18134#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18134#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:40,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {18134#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18134#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:40,183 INFO L273 TraceCheckUtils]: 25: Hoare triple {18134#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {18135#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:40,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {18135#(<= main_~a~0 5)} assume true; {18135#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:40,184 INFO L273 TraceCheckUtils]: 27: Hoare triple {18135#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18135#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:40,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {18135#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18135#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:40,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {18135#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {18136#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:40,186 INFO L273 TraceCheckUtils]: 30: Hoare triple {18136#(<= main_~a~0 6)} assume true; {18136#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:40,186 INFO L273 TraceCheckUtils]: 31: Hoare triple {18136#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18136#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:40,187 INFO L273 TraceCheckUtils]: 32: Hoare triple {18136#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18136#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:40,188 INFO L273 TraceCheckUtils]: 33: Hoare triple {18136#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {18137#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:40,188 INFO L273 TraceCheckUtils]: 34: Hoare triple {18137#(<= main_~a~0 7)} assume true; {18137#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:40,188 INFO L273 TraceCheckUtils]: 35: Hoare triple {18137#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18137#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:40,189 INFO L273 TraceCheckUtils]: 36: Hoare triple {18137#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18137#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:40,190 INFO L273 TraceCheckUtils]: 37: Hoare triple {18137#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {18138#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:40,190 INFO L273 TraceCheckUtils]: 38: Hoare triple {18138#(<= main_~a~0 8)} assume true; {18138#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:40,191 INFO L273 TraceCheckUtils]: 39: Hoare triple {18138#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18138#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:40,191 INFO L273 TraceCheckUtils]: 40: Hoare triple {18138#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18138#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:40,192 INFO L273 TraceCheckUtils]: 41: Hoare triple {18138#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {18139#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:40,192 INFO L273 TraceCheckUtils]: 42: Hoare triple {18139#(<= main_~a~0 9)} assume true; {18139#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:40,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {18139#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18139#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:40,194 INFO L273 TraceCheckUtils]: 44: Hoare triple {18139#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18139#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:40,195 INFO L273 TraceCheckUtils]: 45: Hoare triple {18139#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {18140#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:40,195 INFO L273 TraceCheckUtils]: 46: Hoare triple {18140#(<= main_~a~0 10)} assume true; {18140#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:40,196 INFO L273 TraceCheckUtils]: 47: Hoare triple {18140#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18140#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:40,196 INFO L273 TraceCheckUtils]: 48: Hoare triple {18140#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18140#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:40,197 INFO L273 TraceCheckUtils]: 49: Hoare triple {18140#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {18141#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:40,197 INFO L273 TraceCheckUtils]: 50: Hoare triple {18141#(<= main_~a~0 11)} assume true; {18141#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:40,198 INFO L273 TraceCheckUtils]: 51: Hoare triple {18141#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18141#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:40,198 INFO L273 TraceCheckUtils]: 52: Hoare triple {18141#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18141#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:40,199 INFO L273 TraceCheckUtils]: 53: Hoare triple {18141#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {18142#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:40,199 INFO L273 TraceCheckUtils]: 54: Hoare triple {18142#(<= main_~a~0 12)} assume true; {18142#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:40,200 INFO L273 TraceCheckUtils]: 55: Hoare triple {18142#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18142#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:40,200 INFO L273 TraceCheckUtils]: 56: Hoare triple {18142#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18142#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:40,201 INFO L273 TraceCheckUtils]: 57: Hoare triple {18142#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {18143#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:40,201 INFO L273 TraceCheckUtils]: 58: Hoare triple {18143#(<= main_~a~0 13)} assume true; {18143#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:40,202 INFO L273 TraceCheckUtils]: 59: Hoare triple {18143#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18143#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:40,202 INFO L273 TraceCheckUtils]: 60: Hoare triple {18143#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18143#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:40,203 INFO L273 TraceCheckUtils]: 61: Hoare triple {18143#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {18144#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:40,203 INFO L273 TraceCheckUtils]: 62: Hoare triple {18144#(<= main_~a~0 14)} assume true; {18144#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:40,204 INFO L273 TraceCheckUtils]: 63: Hoare triple {18144#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18144#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:40,204 INFO L273 TraceCheckUtils]: 64: Hoare triple {18144#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18144#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:40,205 INFO L273 TraceCheckUtils]: 65: Hoare triple {18144#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {18145#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:40,206 INFO L273 TraceCheckUtils]: 66: Hoare triple {18145#(<= main_~a~0 15)} assume true; {18145#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:40,206 INFO L273 TraceCheckUtils]: 67: Hoare triple {18145#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18145#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:40,206 INFO L273 TraceCheckUtils]: 68: Hoare triple {18145#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18145#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:40,207 INFO L273 TraceCheckUtils]: 69: Hoare triple {18145#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {18146#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:40,208 INFO L273 TraceCheckUtils]: 70: Hoare triple {18146#(<= main_~a~0 16)} assume true; {18146#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:40,208 INFO L273 TraceCheckUtils]: 71: Hoare triple {18146#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18146#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:40,209 INFO L273 TraceCheckUtils]: 72: Hoare triple {18146#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18146#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:40,209 INFO L273 TraceCheckUtils]: 73: Hoare triple {18146#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {18147#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:40,213 INFO L273 TraceCheckUtils]: 74: Hoare triple {18147#(<= main_~a~0 17)} assume true; {18147#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:40,213 INFO L273 TraceCheckUtils]: 75: Hoare triple {18147#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18147#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:40,213 INFO L273 TraceCheckUtils]: 76: Hoare triple {18147#(<= main_~a~0 17)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18147#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:40,214 INFO L273 TraceCheckUtils]: 77: Hoare triple {18147#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {18148#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:40,214 INFO L273 TraceCheckUtils]: 78: Hoare triple {18148#(<= main_~a~0 18)} assume true; {18148#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:40,215 INFO L273 TraceCheckUtils]: 79: Hoare triple {18148#(<= main_~a~0 18)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18148#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:40,215 INFO L273 TraceCheckUtils]: 80: Hoare triple {18148#(<= main_~a~0 18)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18148#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:40,215 INFO L273 TraceCheckUtils]: 81: Hoare triple {18148#(<= main_~a~0 18)} ~a~0 := 1 + ~a~0; {18149#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:40,216 INFO L273 TraceCheckUtils]: 82: Hoare triple {18149#(<= main_~a~0 19)} assume true; {18149#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:40,216 INFO L273 TraceCheckUtils]: 83: Hoare triple {18149#(<= main_~a~0 19)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18149#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:40,216 INFO L273 TraceCheckUtils]: 84: Hoare triple {18149#(<= main_~a~0 19)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18149#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:40,217 INFO L273 TraceCheckUtils]: 85: Hoare triple {18149#(<= main_~a~0 19)} ~a~0 := 1 + ~a~0; {18150#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:40,217 INFO L273 TraceCheckUtils]: 86: Hoare triple {18150#(<= main_~a~0 20)} assume true; {18150#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:40,217 INFO L273 TraceCheckUtils]: 87: Hoare triple {18150#(<= main_~a~0 20)} assume !(~a~0 < 100000); {18129#false} is VALID [2018-11-18 22:48:40,217 INFO L273 TraceCheckUtils]: 88: Hoare triple {18129#false} ~a~0 := 0; {18129#false} is VALID [2018-11-18 22:48:40,218 INFO L273 TraceCheckUtils]: 89: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,218 INFO L273 TraceCheckUtils]: 90: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,218 INFO L273 TraceCheckUtils]: 91: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,218 INFO L273 TraceCheckUtils]: 92: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,218 INFO L273 TraceCheckUtils]: 93: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,219 INFO L273 TraceCheckUtils]: 94: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,219 INFO L273 TraceCheckUtils]: 95: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,219 INFO L273 TraceCheckUtils]: 96: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,219 INFO L273 TraceCheckUtils]: 97: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,220 INFO L273 TraceCheckUtils]: 98: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,220 INFO L273 TraceCheckUtils]: 99: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,220 INFO L273 TraceCheckUtils]: 100: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,220 INFO L273 TraceCheckUtils]: 101: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,220 INFO L273 TraceCheckUtils]: 102: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,220 INFO L273 TraceCheckUtils]: 103: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,220 INFO L273 TraceCheckUtils]: 104: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,221 INFO L273 TraceCheckUtils]: 105: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,221 INFO L273 TraceCheckUtils]: 106: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,221 INFO L273 TraceCheckUtils]: 107: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,221 INFO L273 TraceCheckUtils]: 108: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,221 INFO L273 TraceCheckUtils]: 109: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,221 INFO L273 TraceCheckUtils]: 110: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,222 INFO L273 TraceCheckUtils]: 111: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,222 INFO L273 TraceCheckUtils]: 112: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,222 INFO L273 TraceCheckUtils]: 113: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,222 INFO L273 TraceCheckUtils]: 114: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,222 INFO L273 TraceCheckUtils]: 115: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,222 INFO L273 TraceCheckUtils]: 116: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,223 INFO L273 TraceCheckUtils]: 117: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,223 INFO L273 TraceCheckUtils]: 118: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,223 INFO L273 TraceCheckUtils]: 119: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,223 INFO L273 TraceCheckUtils]: 120: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,223 INFO L273 TraceCheckUtils]: 121: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,223 INFO L273 TraceCheckUtils]: 122: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,223 INFO L273 TraceCheckUtils]: 123: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,224 INFO L273 TraceCheckUtils]: 124: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,224 INFO L273 TraceCheckUtils]: 125: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,224 INFO L273 TraceCheckUtils]: 126: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,224 INFO L273 TraceCheckUtils]: 127: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,224 INFO L273 TraceCheckUtils]: 128: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,224 INFO L273 TraceCheckUtils]: 129: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,225 INFO L273 TraceCheckUtils]: 130: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,225 INFO L273 TraceCheckUtils]: 131: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,225 INFO L273 TraceCheckUtils]: 132: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,225 INFO L273 TraceCheckUtils]: 133: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,225 INFO L273 TraceCheckUtils]: 134: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,225 INFO L273 TraceCheckUtils]: 135: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,225 INFO L273 TraceCheckUtils]: 136: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,226 INFO L273 TraceCheckUtils]: 137: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,226 INFO L273 TraceCheckUtils]: 138: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,226 INFO L273 TraceCheckUtils]: 139: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,226 INFO L273 TraceCheckUtils]: 140: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,226 INFO L273 TraceCheckUtils]: 141: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,226 INFO L273 TraceCheckUtils]: 142: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,226 INFO L273 TraceCheckUtils]: 143: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,227 INFO L273 TraceCheckUtils]: 144: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,227 INFO L273 TraceCheckUtils]: 145: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,227 INFO L273 TraceCheckUtils]: 146: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,227 INFO L273 TraceCheckUtils]: 147: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,227 INFO L273 TraceCheckUtils]: 148: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,227 INFO L273 TraceCheckUtils]: 149: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,227 INFO L273 TraceCheckUtils]: 150: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,228 INFO L273 TraceCheckUtils]: 151: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,228 INFO L273 TraceCheckUtils]: 152: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,228 INFO L273 TraceCheckUtils]: 153: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,228 INFO L273 TraceCheckUtils]: 154: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,228 INFO L273 TraceCheckUtils]: 155: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,228 INFO L273 TraceCheckUtils]: 156: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,229 INFO L273 TraceCheckUtils]: 157: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,229 INFO L273 TraceCheckUtils]: 158: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,229 INFO L273 TraceCheckUtils]: 159: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,229 INFO L273 TraceCheckUtils]: 160: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,229 INFO L273 TraceCheckUtils]: 161: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,229 INFO L273 TraceCheckUtils]: 162: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,229 INFO L273 TraceCheckUtils]: 163: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,230 INFO L273 TraceCheckUtils]: 164: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,230 INFO L273 TraceCheckUtils]: 165: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,230 INFO L273 TraceCheckUtils]: 166: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,230 INFO L273 TraceCheckUtils]: 167: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,230 INFO L273 TraceCheckUtils]: 168: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,230 INFO L273 TraceCheckUtils]: 169: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,230 INFO L273 TraceCheckUtils]: 170: Hoare triple {18129#false} assume !(~a~0 < 100000); {18129#false} is VALID [2018-11-18 22:48:40,231 INFO L273 TraceCheckUtils]: 171: Hoare triple {18129#false} havoc ~x~0;~x~0 := 0; {18129#false} is VALID [2018-11-18 22:48:40,231 INFO L273 TraceCheckUtils]: 172: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,231 INFO L273 TraceCheckUtils]: 173: Hoare triple {18129#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,231 INFO L256 TraceCheckUtils]: 174: Hoare triple {18129#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {18129#false} is VALID [2018-11-18 22:48:40,231 INFO L273 TraceCheckUtils]: 175: Hoare triple {18129#false} ~cond := #in~cond; {18129#false} is VALID [2018-11-18 22:48:40,231 INFO L273 TraceCheckUtils]: 176: Hoare triple {18129#false} assume 0 == ~cond; {18129#false} is VALID [2018-11-18 22:48:40,231 INFO L273 TraceCheckUtils]: 177: Hoare triple {18129#false} assume !false; {18129#false} is VALID [2018-11-18 22:48:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-11-18 22:48:40,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:48:40,253 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:48:40,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 22:48:40,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 22:48:40,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:48:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:40,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:48:40,594 INFO L256 TraceCheckUtils]: 0: Hoare triple {18128#true} call ULTIMATE.init(); {18128#true} is VALID [2018-11-18 22:48:40,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {18128#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18128#true} is VALID [2018-11-18 22:48:40,595 INFO L273 TraceCheckUtils]: 2: Hoare triple {18128#true} assume true; {18128#true} is VALID [2018-11-18 22:48:40,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18128#true} {18128#true} #95#return; {18128#true} is VALID [2018-11-18 22:48:40,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {18128#true} call #t~ret8 := main(); {18128#true} is VALID [2018-11-18 22:48:40,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {18128#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {18169#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:40,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {18169#(<= main_~a~0 0)} assume true; {18169#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:40,597 INFO L273 TraceCheckUtils]: 7: Hoare triple {18169#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18169#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:40,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {18169#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18169#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:40,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {18169#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {18131#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:40,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {18131#(<= main_~a~0 1)} assume true; {18131#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:40,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {18131#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18131#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:40,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {18131#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18131#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:40,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {18131#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {18132#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:40,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {18132#(<= main_~a~0 2)} assume true; {18132#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:40,601 INFO L273 TraceCheckUtils]: 15: Hoare triple {18132#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18132#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:40,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {18132#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18132#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:40,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {18132#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {18133#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:40,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {18133#(<= main_~a~0 3)} assume true; {18133#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:40,604 INFO L273 TraceCheckUtils]: 19: Hoare triple {18133#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18133#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:40,604 INFO L273 TraceCheckUtils]: 20: Hoare triple {18133#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18133#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:40,605 INFO L273 TraceCheckUtils]: 21: Hoare triple {18133#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {18134#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:40,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {18134#(<= main_~a~0 4)} assume true; {18134#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:40,606 INFO L273 TraceCheckUtils]: 23: Hoare triple {18134#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18134#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:40,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {18134#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18134#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:40,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {18134#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {18135#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:40,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {18135#(<= main_~a~0 5)} assume true; {18135#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:40,608 INFO L273 TraceCheckUtils]: 27: Hoare triple {18135#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18135#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:40,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {18135#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18135#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:40,609 INFO L273 TraceCheckUtils]: 29: Hoare triple {18135#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {18136#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:40,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {18136#(<= main_~a~0 6)} assume true; {18136#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:40,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {18136#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18136#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:40,610 INFO L273 TraceCheckUtils]: 32: Hoare triple {18136#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18136#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:40,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {18136#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {18137#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:40,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {18137#(<= main_~a~0 7)} assume true; {18137#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:40,612 INFO L273 TraceCheckUtils]: 35: Hoare triple {18137#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18137#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:40,632 INFO L273 TraceCheckUtils]: 36: Hoare triple {18137#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18137#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:40,640 INFO L273 TraceCheckUtils]: 37: Hoare triple {18137#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {18138#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:40,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {18138#(<= main_~a~0 8)} assume true; {18138#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:40,653 INFO L273 TraceCheckUtils]: 39: Hoare triple {18138#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18138#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:40,669 INFO L273 TraceCheckUtils]: 40: Hoare triple {18138#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18138#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:40,677 INFO L273 TraceCheckUtils]: 41: Hoare triple {18138#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {18139#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:40,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {18139#(<= main_~a~0 9)} assume true; {18139#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:40,690 INFO L273 TraceCheckUtils]: 43: Hoare triple {18139#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18139#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:40,690 INFO L273 TraceCheckUtils]: 44: Hoare triple {18139#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18139#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:40,692 INFO L273 TraceCheckUtils]: 45: Hoare triple {18139#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {18140#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:40,692 INFO L273 TraceCheckUtils]: 46: Hoare triple {18140#(<= main_~a~0 10)} assume true; {18140#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:40,694 INFO L273 TraceCheckUtils]: 47: Hoare triple {18140#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18140#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:40,694 INFO L273 TraceCheckUtils]: 48: Hoare triple {18140#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18140#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:40,696 INFO L273 TraceCheckUtils]: 49: Hoare triple {18140#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {18141#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:40,696 INFO L273 TraceCheckUtils]: 50: Hoare triple {18141#(<= main_~a~0 11)} assume true; {18141#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:40,696 INFO L273 TraceCheckUtils]: 51: Hoare triple {18141#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18141#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:40,697 INFO L273 TraceCheckUtils]: 52: Hoare triple {18141#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18141#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:40,697 INFO L273 TraceCheckUtils]: 53: Hoare triple {18141#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {18142#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:40,697 INFO L273 TraceCheckUtils]: 54: Hoare triple {18142#(<= main_~a~0 12)} assume true; {18142#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:40,698 INFO L273 TraceCheckUtils]: 55: Hoare triple {18142#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18142#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:40,698 INFO L273 TraceCheckUtils]: 56: Hoare triple {18142#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18142#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:40,698 INFO L273 TraceCheckUtils]: 57: Hoare triple {18142#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {18143#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:40,699 INFO L273 TraceCheckUtils]: 58: Hoare triple {18143#(<= main_~a~0 13)} assume true; {18143#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:40,699 INFO L273 TraceCheckUtils]: 59: Hoare triple {18143#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18143#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:40,700 INFO L273 TraceCheckUtils]: 60: Hoare triple {18143#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18143#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:40,700 INFO L273 TraceCheckUtils]: 61: Hoare triple {18143#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {18144#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:40,701 INFO L273 TraceCheckUtils]: 62: Hoare triple {18144#(<= main_~a~0 14)} assume true; {18144#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:40,701 INFO L273 TraceCheckUtils]: 63: Hoare triple {18144#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18144#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:40,702 INFO L273 TraceCheckUtils]: 64: Hoare triple {18144#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18144#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:40,702 INFO L273 TraceCheckUtils]: 65: Hoare triple {18144#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {18145#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:40,703 INFO L273 TraceCheckUtils]: 66: Hoare triple {18145#(<= main_~a~0 15)} assume true; {18145#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:40,703 INFO L273 TraceCheckUtils]: 67: Hoare triple {18145#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18145#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:40,704 INFO L273 TraceCheckUtils]: 68: Hoare triple {18145#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18145#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:40,704 INFO L273 TraceCheckUtils]: 69: Hoare triple {18145#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {18146#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:40,705 INFO L273 TraceCheckUtils]: 70: Hoare triple {18146#(<= main_~a~0 16)} assume true; {18146#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:40,705 INFO L273 TraceCheckUtils]: 71: Hoare triple {18146#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18146#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:40,706 INFO L273 TraceCheckUtils]: 72: Hoare triple {18146#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18146#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:40,707 INFO L273 TraceCheckUtils]: 73: Hoare triple {18146#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {18147#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:40,707 INFO L273 TraceCheckUtils]: 74: Hoare triple {18147#(<= main_~a~0 17)} assume true; {18147#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:40,707 INFO L273 TraceCheckUtils]: 75: Hoare triple {18147#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18147#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:40,708 INFO L273 TraceCheckUtils]: 76: Hoare triple {18147#(<= main_~a~0 17)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18147#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:40,709 INFO L273 TraceCheckUtils]: 77: Hoare triple {18147#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {18148#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:40,709 INFO L273 TraceCheckUtils]: 78: Hoare triple {18148#(<= main_~a~0 18)} assume true; {18148#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:40,710 INFO L273 TraceCheckUtils]: 79: Hoare triple {18148#(<= main_~a~0 18)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18148#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:40,710 INFO L273 TraceCheckUtils]: 80: Hoare triple {18148#(<= main_~a~0 18)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18148#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:40,711 INFO L273 TraceCheckUtils]: 81: Hoare triple {18148#(<= main_~a~0 18)} ~a~0 := 1 + ~a~0; {18149#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:40,711 INFO L273 TraceCheckUtils]: 82: Hoare triple {18149#(<= main_~a~0 19)} assume true; {18149#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:40,712 INFO L273 TraceCheckUtils]: 83: Hoare triple {18149#(<= main_~a~0 19)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18149#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:40,712 INFO L273 TraceCheckUtils]: 84: Hoare triple {18149#(<= main_~a~0 19)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {18149#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:40,713 INFO L273 TraceCheckUtils]: 85: Hoare triple {18149#(<= main_~a~0 19)} ~a~0 := 1 + ~a~0; {18150#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:40,713 INFO L273 TraceCheckUtils]: 86: Hoare triple {18150#(<= main_~a~0 20)} assume true; {18150#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:40,714 INFO L273 TraceCheckUtils]: 87: Hoare triple {18150#(<= main_~a~0 20)} assume !(~a~0 < 100000); {18129#false} is VALID [2018-11-18 22:48:40,714 INFO L273 TraceCheckUtils]: 88: Hoare triple {18129#false} ~a~0 := 0; {18129#false} is VALID [2018-11-18 22:48:40,714 INFO L273 TraceCheckUtils]: 89: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,714 INFO L273 TraceCheckUtils]: 90: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,715 INFO L273 TraceCheckUtils]: 91: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,715 INFO L273 TraceCheckUtils]: 92: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,715 INFO L273 TraceCheckUtils]: 93: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,715 INFO L273 TraceCheckUtils]: 94: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,715 INFO L273 TraceCheckUtils]: 95: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,715 INFO L273 TraceCheckUtils]: 96: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,716 INFO L273 TraceCheckUtils]: 97: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,716 INFO L273 TraceCheckUtils]: 98: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,716 INFO L273 TraceCheckUtils]: 99: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,716 INFO L273 TraceCheckUtils]: 100: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,716 INFO L273 TraceCheckUtils]: 101: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,716 INFO L273 TraceCheckUtils]: 102: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,717 INFO L273 TraceCheckUtils]: 103: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,717 INFO L273 TraceCheckUtils]: 104: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,717 INFO L273 TraceCheckUtils]: 105: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,717 INFO L273 TraceCheckUtils]: 106: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,717 INFO L273 TraceCheckUtils]: 107: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,717 INFO L273 TraceCheckUtils]: 108: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,717 INFO L273 TraceCheckUtils]: 109: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,718 INFO L273 TraceCheckUtils]: 110: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,718 INFO L273 TraceCheckUtils]: 111: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,718 INFO L273 TraceCheckUtils]: 112: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,718 INFO L273 TraceCheckUtils]: 113: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,718 INFO L273 TraceCheckUtils]: 114: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,718 INFO L273 TraceCheckUtils]: 115: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,718 INFO L273 TraceCheckUtils]: 116: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,718 INFO L273 TraceCheckUtils]: 117: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,718 INFO L273 TraceCheckUtils]: 118: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,719 INFO L273 TraceCheckUtils]: 119: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,719 INFO L273 TraceCheckUtils]: 120: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,719 INFO L273 TraceCheckUtils]: 121: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,719 INFO L273 TraceCheckUtils]: 122: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,719 INFO L273 TraceCheckUtils]: 123: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,719 INFO L273 TraceCheckUtils]: 124: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,719 INFO L273 TraceCheckUtils]: 125: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,719 INFO L273 TraceCheckUtils]: 126: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,719 INFO L273 TraceCheckUtils]: 127: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,719 INFO L273 TraceCheckUtils]: 128: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,720 INFO L273 TraceCheckUtils]: 129: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,720 INFO L273 TraceCheckUtils]: 130: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,720 INFO L273 TraceCheckUtils]: 131: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,720 INFO L273 TraceCheckUtils]: 132: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,720 INFO L273 TraceCheckUtils]: 133: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,720 INFO L273 TraceCheckUtils]: 134: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,720 INFO L273 TraceCheckUtils]: 135: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,720 INFO L273 TraceCheckUtils]: 136: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,720 INFO L273 TraceCheckUtils]: 137: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,720 INFO L273 TraceCheckUtils]: 138: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,721 INFO L273 TraceCheckUtils]: 139: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,721 INFO L273 TraceCheckUtils]: 140: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,721 INFO L273 TraceCheckUtils]: 141: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,721 INFO L273 TraceCheckUtils]: 142: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,721 INFO L273 TraceCheckUtils]: 143: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,721 INFO L273 TraceCheckUtils]: 144: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,721 INFO L273 TraceCheckUtils]: 145: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,721 INFO L273 TraceCheckUtils]: 146: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,721 INFO L273 TraceCheckUtils]: 147: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,722 INFO L273 TraceCheckUtils]: 148: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,722 INFO L273 TraceCheckUtils]: 149: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,722 INFO L273 TraceCheckUtils]: 150: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,722 INFO L273 TraceCheckUtils]: 151: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,722 INFO L273 TraceCheckUtils]: 152: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,722 INFO L273 TraceCheckUtils]: 153: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,722 INFO L273 TraceCheckUtils]: 154: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,722 INFO L273 TraceCheckUtils]: 155: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,722 INFO L273 TraceCheckUtils]: 156: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,722 INFO L273 TraceCheckUtils]: 157: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,723 INFO L273 TraceCheckUtils]: 158: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,723 INFO L273 TraceCheckUtils]: 159: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,723 INFO L273 TraceCheckUtils]: 160: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,723 INFO L273 TraceCheckUtils]: 161: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,723 INFO L273 TraceCheckUtils]: 162: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,723 INFO L273 TraceCheckUtils]: 163: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,723 INFO L273 TraceCheckUtils]: 164: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,723 INFO L273 TraceCheckUtils]: 165: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,724 INFO L273 TraceCheckUtils]: 166: Hoare triple {18129#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,724 INFO L273 TraceCheckUtils]: 167: Hoare triple {18129#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {18129#false} is VALID [2018-11-18 22:48:40,724 INFO L273 TraceCheckUtils]: 168: Hoare triple {18129#false} ~a~0 := 1 + ~a~0; {18129#false} is VALID [2018-11-18 22:48:40,724 INFO L273 TraceCheckUtils]: 169: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,724 INFO L273 TraceCheckUtils]: 170: Hoare triple {18129#false} assume !(~a~0 < 100000); {18129#false} is VALID [2018-11-18 22:48:40,724 INFO L273 TraceCheckUtils]: 171: Hoare triple {18129#false} havoc ~x~0;~x~0 := 0; {18129#false} is VALID [2018-11-18 22:48:40,724 INFO L273 TraceCheckUtils]: 172: Hoare triple {18129#false} assume true; {18129#false} is VALID [2018-11-18 22:48:40,725 INFO L273 TraceCheckUtils]: 173: Hoare triple {18129#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {18129#false} is VALID [2018-11-18 22:48:40,725 INFO L256 TraceCheckUtils]: 174: Hoare triple {18129#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {18129#false} is VALID [2018-11-18 22:48:40,725 INFO L273 TraceCheckUtils]: 175: Hoare triple {18129#false} ~cond := #in~cond; {18129#false} is VALID [2018-11-18 22:48:40,725 INFO L273 TraceCheckUtils]: 176: Hoare triple {18129#false} assume 0 == ~cond; {18129#false} is VALID [2018-11-18 22:48:40,725 INFO L273 TraceCheckUtils]: 177: Hoare triple {18129#false} assume !false; {18129#false} is VALID [2018-11-18 22:48:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 800 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-11-18 22:48:40,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:48:40,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-18 22:48:40,761 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 178 [2018-11-18 22:48:40,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:48:40,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 22:48:40,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:40,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 22:48:40,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 22:48:40,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:48:40,882 INFO L87 Difference]: Start difference. First operand 189 states and 233 transitions. Second operand 24 states. [2018-11-18 22:48:41,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:41,822 INFO L93 Difference]: Finished difference Result 302 states and 375 transitions. [2018-11-18 22:48:41,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-18 22:48:41,822 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 178 [2018-11-18 22:48:41,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:48:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:48:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 278 transitions. [2018-11-18 22:48:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 22:48:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 278 transitions. [2018-11-18 22:48:41,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 278 transitions. [2018-11-18 22:48:42,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:42,080 INFO L225 Difference]: With dead ends: 302 [2018-11-18 22:48:42,080 INFO L226 Difference]: Without dead ends: 201 [2018-11-18 22:48:42,081 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-18 22:48:42,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-18 22:48:42,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2018-11-18 22:48:42,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:48:42,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand 197 states. [2018-11-18 22:48:42,175 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 197 states. [2018-11-18 22:48:42,175 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 197 states. [2018-11-18 22:48:42,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:42,180 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2018-11-18 22:48:42,180 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 249 transitions. [2018-11-18 22:48:42,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:42,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:42,181 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 201 states. [2018-11-18 22:48:42,181 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 201 states. [2018-11-18 22:48:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:42,185 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2018-11-18 22:48:42,185 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 249 transitions. [2018-11-18 22:48:42,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:42,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:42,186 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:48:42,186 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:48:42,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-18 22:48:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 243 transitions. [2018-11-18 22:48:42,190 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 243 transitions. Word has length 178 [2018-11-18 22:48:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:48:42,190 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 243 transitions. [2018-11-18 22:48:42,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 22:48:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 243 transitions. [2018-11-18 22:48:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-18 22:48:42,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:48:42,191 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:48:42,192 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:48:42,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:48:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1604292397, now seen corresponding path program 21 times [2018-11-18 22:48:42,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:48:42,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:48:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:42,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:48:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:42,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:42,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {19718#true} call ULTIMATE.init(); {19718#true} is VALID [2018-11-18 22:48:42,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {19718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19718#true} is VALID [2018-11-18 22:48:42,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:42,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19718#true} {19718#true} #95#return; {19718#true} is VALID [2018-11-18 22:48:42,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {19718#true} call #t~ret8 := main(); {19718#true} is VALID [2018-11-18 22:48:42,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {19718#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {19720#(= main_~a~0 0)} is VALID [2018-11-18 22:48:42,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {19720#(= main_~a~0 0)} assume true; {19720#(= main_~a~0 0)} is VALID [2018-11-18 22:48:42,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {19720#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19720#(= main_~a~0 0)} is VALID [2018-11-18 22:48:42,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {19720#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19720#(= main_~a~0 0)} is VALID [2018-11-18 22:48:42,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {19720#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {19721#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:42,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {19721#(<= main_~a~0 1)} assume true; {19721#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:42,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {19721#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19721#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:42,594 INFO L273 TraceCheckUtils]: 12: Hoare triple {19721#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19721#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:42,594 INFO L273 TraceCheckUtils]: 13: Hoare triple {19721#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {19722#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:42,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {19722#(<= main_~a~0 2)} assume true; {19722#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:42,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {19722#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19722#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:42,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {19722#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19722#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:42,596 INFO L273 TraceCheckUtils]: 17: Hoare triple {19722#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {19723#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:42,597 INFO L273 TraceCheckUtils]: 18: Hoare triple {19723#(<= main_~a~0 3)} assume true; {19723#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:42,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {19723#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19723#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:42,598 INFO L273 TraceCheckUtils]: 20: Hoare triple {19723#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19723#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:42,599 INFO L273 TraceCheckUtils]: 21: Hoare triple {19723#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {19724#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:42,599 INFO L273 TraceCheckUtils]: 22: Hoare triple {19724#(<= main_~a~0 4)} assume true; {19724#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:42,599 INFO L273 TraceCheckUtils]: 23: Hoare triple {19724#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19724#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:42,600 INFO L273 TraceCheckUtils]: 24: Hoare triple {19724#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19724#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:42,601 INFO L273 TraceCheckUtils]: 25: Hoare triple {19724#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {19725#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:42,601 INFO L273 TraceCheckUtils]: 26: Hoare triple {19725#(<= main_~a~0 5)} assume true; {19725#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:42,602 INFO L273 TraceCheckUtils]: 27: Hoare triple {19725#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19725#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:42,602 INFO L273 TraceCheckUtils]: 28: Hoare triple {19725#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19725#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:42,603 INFO L273 TraceCheckUtils]: 29: Hoare triple {19725#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {19726#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:42,603 INFO L273 TraceCheckUtils]: 30: Hoare triple {19726#(<= main_~a~0 6)} assume true; {19726#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:42,604 INFO L273 TraceCheckUtils]: 31: Hoare triple {19726#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19726#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:42,604 INFO L273 TraceCheckUtils]: 32: Hoare triple {19726#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19726#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:42,605 INFO L273 TraceCheckUtils]: 33: Hoare triple {19726#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {19727#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:42,605 INFO L273 TraceCheckUtils]: 34: Hoare triple {19727#(<= main_~a~0 7)} assume true; {19727#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:42,606 INFO L273 TraceCheckUtils]: 35: Hoare triple {19727#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19727#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:42,606 INFO L273 TraceCheckUtils]: 36: Hoare triple {19727#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19727#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:42,607 INFO L273 TraceCheckUtils]: 37: Hoare triple {19727#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {19728#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:42,607 INFO L273 TraceCheckUtils]: 38: Hoare triple {19728#(<= main_~a~0 8)} assume true; {19728#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:42,608 INFO L273 TraceCheckUtils]: 39: Hoare triple {19728#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19728#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:42,608 INFO L273 TraceCheckUtils]: 40: Hoare triple {19728#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19728#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:42,609 INFO L273 TraceCheckUtils]: 41: Hoare triple {19728#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {19729#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:42,609 INFO L273 TraceCheckUtils]: 42: Hoare triple {19729#(<= main_~a~0 9)} assume true; {19729#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:42,610 INFO L273 TraceCheckUtils]: 43: Hoare triple {19729#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19729#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:42,610 INFO L273 TraceCheckUtils]: 44: Hoare triple {19729#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19729#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:42,611 INFO L273 TraceCheckUtils]: 45: Hoare triple {19729#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {19730#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:42,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {19730#(<= main_~a~0 10)} assume true; {19730#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:42,612 INFO L273 TraceCheckUtils]: 47: Hoare triple {19730#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19730#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:42,612 INFO L273 TraceCheckUtils]: 48: Hoare triple {19730#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19730#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:42,613 INFO L273 TraceCheckUtils]: 49: Hoare triple {19730#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {19731#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:42,613 INFO L273 TraceCheckUtils]: 50: Hoare triple {19731#(<= main_~a~0 11)} assume true; {19731#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:42,614 INFO L273 TraceCheckUtils]: 51: Hoare triple {19731#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19731#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:42,614 INFO L273 TraceCheckUtils]: 52: Hoare triple {19731#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19731#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:42,615 INFO L273 TraceCheckUtils]: 53: Hoare triple {19731#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {19732#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:42,616 INFO L273 TraceCheckUtils]: 54: Hoare triple {19732#(<= main_~a~0 12)} assume true; {19732#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:42,616 INFO L273 TraceCheckUtils]: 55: Hoare triple {19732#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19732#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:42,616 INFO L273 TraceCheckUtils]: 56: Hoare triple {19732#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19732#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:42,617 INFO L273 TraceCheckUtils]: 57: Hoare triple {19732#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {19733#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:42,618 INFO L273 TraceCheckUtils]: 58: Hoare triple {19733#(<= main_~a~0 13)} assume true; {19733#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:42,618 INFO L273 TraceCheckUtils]: 59: Hoare triple {19733#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19733#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:42,619 INFO L273 TraceCheckUtils]: 60: Hoare triple {19733#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19733#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:42,619 INFO L273 TraceCheckUtils]: 61: Hoare triple {19733#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {19734#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:42,620 INFO L273 TraceCheckUtils]: 62: Hoare triple {19734#(<= main_~a~0 14)} assume true; {19734#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:42,620 INFO L273 TraceCheckUtils]: 63: Hoare triple {19734#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19734#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:42,621 INFO L273 TraceCheckUtils]: 64: Hoare triple {19734#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19734#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:42,621 INFO L273 TraceCheckUtils]: 65: Hoare triple {19734#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {19735#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:42,622 INFO L273 TraceCheckUtils]: 66: Hoare triple {19735#(<= main_~a~0 15)} assume true; {19735#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:42,622 INFO L273 TraceCheckUtils]: 67: Hoare triple {19735#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19735#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:42,623 INFO L273 TraceCheckUtils]: 68: Hoare triple {19735#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19735#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:42,623 INFO L273 TraceCheckUtils]: 69: Hoare triple {19735#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {19736#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:42,624 INFO L273 TraceCheckUtils]: 70: Hoare triple {19736#(<= main_~a~0 16)} assume true; {19736#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:42,624 INFO L273 TraceCheckUtils]: 71: Hoare triple {19736#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19736#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:42,625 INFO L273 TraceCheckUtils]: 72: Hoare triple {19736#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19736#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:42,625 INFO L273 TraceCheckUtils]: 73: Hoare triple {19736#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {19737#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:42,626 INFO L273 TraceCheckUtils]: 74: Hoare triple {19737#(<= main_~a~0 17)} assume true; {19737#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:42,626 INFO L273 TraceCheckUtils]: 75: Hoare triple {19737#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19737#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:42,627 INFO L273 TraceCheckUtils]: 76: Hoare triple {19737#(<= main_~a~0 17)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19737#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:42,627 INFO L273 TraceCheckUtils]: 77: Hoare triple {19737#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {19738#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:42,628 INFO L273 TraceCheckUtils]: 78: Hoare triple {19738#(<= main_~a~0 18)} assume true; {19738#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:42,628 INFO L273 TraceCheckUtils]: 79: Hoare triple {19738#(<= main_~a~0 18)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19738#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:42,629 INFO L273 TraceCheckUtils]: 80: Hoare triple {19738#(<= main_~a~0 18)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19738#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:42,630 INFO L273 TraceCheckUtils]: 81: Hoare triple {19738#(<= main_~a~0 18)} ~a~0 := 1 + ~a~0; {19739#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:42,630 INFO L273 TraceCheckUtils]: 82: Hoare triple {19739#(<= main_~a~0 19)} assume true; {19739#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:42,630 INFO L273 TraceCheckUtils]: 83: Hoare triple {19739#(<= main_~a~0 19)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19739#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:42,631 INFO L273 TraceCheckUtils]: 84: Hoare triple {19739#(<= main_~a~0 19)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19739#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:42,632 INFO L273 TraceCheckUtils]: 85: Hoare triple {19739#(<= main_~a~0 19)} ~a~0 := 1 + ~a~0; {19740#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:42,632 INFO L273 TraceCheckUtils]: 86: Hoare triple {19740#(<= main_~a~0 20)} assume true; {19740#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:42,633 INFO L273 TraceCheckUtils]: 87: Hoare triple {19740#(<= main_~a~0 20)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19740#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:42,633 INFO L273 TraceCheckUtils]: 88: Hoare triple {19740#(<= main_~a~0 20)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19740#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:42,634 INFO L273 TraceCheckUtils]: 89: Hoare triple {19740#(<= main_~a~0 20)} ~a~0 := 1 + ~a~0; {19741#(<= main_~a~0 21)} is VALID [2018-11-18 22:48:42,634 INFO L273 TraceCheckUtils]: 90: Hoare triple {19741#(<= main_~a~0 21)} assume true; {19741#(<= main_~a~0 21)} is VALID [2018-11-18 22:48:42,635 INFO L273 TraceCheckUtils]: 91: Hoare triple {19741#(<= main_~a~0 21)} assume !(~a~0 < 100000); {19719#false} is VALID [2018-11-18 22:48:42,635 INFO L273 TraceCheckUtils]: 92: Hoare triple {19719#false} ~a~0 := 0; {19719#false} is VALID [2018-11-18 22:48:42,635 INFO L273 TraceCheckUtils]: 93: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,635 INFO L273 TraceCheckUtils]: 94: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,635 INFO L273 TraceCheckUtils]: 95: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,636 INFO L273 TraceCheckUtils]: 96: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,636 INFO L273 TraceCheckUtils]: 97: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,636 INFO L273 TraceCheckUtils]: 98: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,636 INFO L273 TraceCheckUtils]: 99: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,636 INFO L273 TraceCheckUtils]: 100: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,637 INFO L273 TraceCheckUtils]: 101: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,637 INFO L273 TraceCheckUtils]: 102: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,637 INFO L273 TraceCheckUtils]: 103: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,637 INFO L273 TraceCheckUtils]: 104: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,637 INFO L273 TraceCheckUtils]: 105: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,637 INFO L273 TraceCheckUtils]: 106: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,638 INFO L273 TraceCheckUtils]: 107: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,638 INFO L273 TraceCheckUtils]: 108: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,638 INFO L273 TraceCheckUtils]: 109: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,638 INFO L273 TraceCheckUtils]: 110: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,638 INFO L273 TraceCheckUtils]: 111: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,638 INFO L273 TraceCheckUtils]: 112: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,639 INFO L273 TraceCheckUtils]: 113: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,639 INFO L273 TraceCheckUtils]: 114: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,639 INFO L273 TraceCheckUtils]: 115: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,639 INFO L273 TraceCheckUtils]: 116: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,639 INFO L273 TraceCheckUtils]: 117: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,639 INFO L273 TraceCheckUtils]: 118: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,640 INFO L273 TraceCheckUtils]: 119: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,640 INFO L273 TraceCheckUtils]: 120: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,640 INFO L273 TraceCheckUtils]: 121: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,640 INFO L273 TraceCheckUtils]: 122: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,640 INFO L273 TraceCheckUtils]: 123: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,640 INFO L273 TraceCheckUtils]: 124: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,640 INFO L273 TraceCheckUtils]: 125: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,640 INFO L273 TraceCheckUtils]: 126: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,641 INFO L273 TraceCheckUtils]: 127: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,641 INFO L273 TraceCheckUtils]: 128: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,641 INFO L273 TraceCheckUtils]: 129: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,641 INFO L273 TraceCheckUtils]: 130: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,641 INFO L273 TraceCheckUtils]: 131: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,641 INFO L273 TraceCheckUtils]: 132: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,641 INFO L273 TraceCheckUtils]: 133: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,641 INFO L273 TraceCheckUtils]: 134: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,641 INFO L273 TraceCheckUtils]: 135: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,641 INFO L273 TraceCheckUtils]: 136: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,642 INFO L273 TraceCheckUtils]: 137: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,642 INFO L273 TraceCheckUtils]: 138: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,642 INFO L273 TraceCheckUtils]: 139: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,642 INFO L273 TraceCheckUtils]: 140: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,642 INFO L273 TraceCheckUtils]: 141: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,642 INFO L273 TraceCheckUtils]: 142: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,642 INFO L273 TraceCheckUtils]: 143: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,642 INFO L273 TraceCheckUtils]: 144: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,642 INFO L273 TraceCheckUtils]: 145: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,643 INFO L273 TraceCheckUtils]: 146: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,643 INFO L273 TraceCheckUtils]: 147: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,643 INFO L273 TraceCheckUtils]: 148: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,643 INFO L273 TraceCheckUtils]: 149: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,643 INFO L273 TraceCheckUtils]: 150: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,643 INFO L273 TraceCheckUtils]: 151: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,643 INFO L273 TraceCheckUtils]: 152: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,643 INFO L273 TraceCheckUtils]: 153: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,643 INFO L273 TraceCheckUtils]: 154: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,643 INFO L273 TraceCheckUtils]: 155: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,644 INFO L273 TraceCheckUtils]: 156: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,644 INFO L273 TraceCheckUtils]: 157: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,644 INFO L273 TraceCheckUtils]: 158: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,644 INFO L273 TraceCheckUtils]: 159: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,644 INFO L273 TraceCheckUtils]: 160: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,644 INFO L273 TraceCheckUtils]: 161: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,644 INFO L273 TraceCheckUtils]: 162: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,644 INFO L273 TraceCheckUtils]: 163: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,644 INFO L273 TraceCheckUtils]: 164: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,644 INFO L273 TraceCheckUtils]: 165: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,645 INFO L273 TraceCheckUtils]: 166: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,645 INFO L273 TraceCheckUtils]: 167: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,645 INFO L273 TraceCheckUtils]: 168: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,645 INFO L273 TraceCheckUtils]: 169: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,645 INFO L273 TraceCheckUtils]: 170: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,645 INFO L273 TraceCheckUtils]: 171: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,645 INFO L273 TraceCheckUtils]: 172: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,645 INFO L273 TraceCheckUtils]: 173: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,645 INFO L273 TraceCheckUtils]: 174: Hoare triple {19719#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,646 INFO L273 TraceCheckUtils]: 175: Hoare triple {19719#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19719#false} is VALID [2018-11-18 22:48:42,646 INFO L273 TraceCheckUtils]: 176: Hoare triple {19719#false} ~a~0 := 1 + ~a~0; {19719#false} is VALID [2018-11-18 22:48:42,646 INFO L273 TraceCheckUtils]: 177: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,646 INFO L273 TraceCheckUtils]: 178: Hoare triple {19719#false} assume !(~a~0 < 100000); {19719#false} is VALID [2018-11-18 22:48:42,646 INFO L273 TraceCheckUtils]: 179: Hoare triple {19719#false} havoc ~x~0;~x~0 := 0; {19719#false} is VALID [2018-11-18 22:48:42,646 INFO L273 TraceCheckUtils]: 180: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:42,646 INFO L273 TraceCheckUtils]: 181: Hoare triple {19719#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {19719#false} is VALID [2018-11-18 22:48:42,646 INFO L256 TraceCheckUtils]: 182: Hoare triple {19719#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {19719#false} is VALID [2018-11-18 22:48:42,646 INFO L273 TraceCheckUtils]: 183: Hoare triple {19719#false} ~cond := #in~cond; {19719#false} is VALID [2018-11-18 22:48:42,646 INFO L273 TraceCheckUtils]: 184: Hoare triple {19719#false} assume 0 == ~cond; {19719#false} is VALID [2018-11-18 22:48:42,647 INFO L273 TraceCheckUtils]: 185: Hoare triple {19719#false} assume !false; {19719#false} is VALID [2018-11-18 22:48:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-11-18 22:48:42,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:48:42,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:48:42,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 22:48:46,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-18 22:48:46,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:48:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:47,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:48:48,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {19718#true} call ULTIMATE.init(); {19718#true} is VALID [2018-11-18 22:48:48,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {19718#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {19718#true} is VALID [2018-11-18 22:48:48,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {19718#true} {19718#true} #95#return; {19718#true} is VALID [2018-11-18 22:48:48,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {19718#true} call #t~ret8 := main(); {19718#true} is VALID [2018-11-18 22:48:48,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {19718#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {19718#true} is VALID [2018-11-18 22:48:48,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,405 INFO L273 TraceCheckUtils]: 9: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,406 INFO L273 TraceCheckUtils]: 12: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,406 INFO L273 TraceCheckUtils]: 16: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,407 INFO L273 TraceCheckUtils]: 20: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,407 INFO L273 TraceCheckUtils]: 21: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,407 INFO L273 TraceCheckUtils]: 22: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,407 INFO L273 TraceCheckUtils]: 25: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,407 INFO L273 TraceCheckUtils]: 26: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,407 INFO L273 TraceCheckUtils]: 27: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,407 INFO L273 TraceCheckUtils]: 28: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,408 INFO L273 TraceCheckUtils]: 30: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,408 INFO L273 TraceCheckUtils]: 34: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,408 INFO L273 TraceCheckUtils]: 35: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,408 INFO L273 TraceCheckUtils]: 37: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,408 INFO L273 TraceCheckUtils]: 38: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,409 INFO L273 TraceCheckUtils]: 39: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,409 INFO L273 TraceCheckUtils]: 40: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,409 INFO L273 TraceCheckUtils]: 44: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,409 INFO L273 TraceCheckUtils]: 45: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,409 INFO L273 TraceCheckUtils]: 46: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,409 INFO L273 TraceCheckUtils]: 47: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,409 INFO L273 TraceCheckUtils]: 48: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,410 INFO L273 TraceCheckUtils]: 49: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,410 INFO L273 TraceCheckUtils]: 50: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,410 INFO L273 TraceCheckUtils]: 51: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,410 INFO L273 TraceCheckUtils]: 52: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,410 INFO L273 TraceCheckUtils]: 53: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,410 INFO L273 TraceCheckUtils]: 54: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,410 INFO L273 TraceCheckUtils]: 55: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,410 INFO L273 TraceCheckUtils]: 56: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,410 INFO L273 TraceCheckUtils]: 57: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,411 INFO L273 TraceCheckUtils]: 58: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,411 INFO L273 TraceCheckUtils]: 59: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,411 INFO L273 TraceCheckUtils]: 60: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,411 INFO L273 TraceCheckUtils]: 61: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,411 INFO L273 TraceCheckUtils]: 62: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,411 INFO L273 TraceCheckUtils]: 63: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,411 INFO L273 TraceCheckUtils]: 64: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,411 INFO L273 TraceCheckUtils]: 65: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,411 INFO L273 TraceCheckUtils]: 66: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,411 INFO L273 TraceCheckUtils]: 67: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,412 INFO L273 TraceCheckUtils]: 68: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,412 INFO L273 TraceCheckUtils]: 69: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,412 INFO L273 TraceCheckUtils]: 70: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,412 INFO L273 TraceCheckUtils]: 71: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,412 INFO L273 TraceCheckUtils]: 72: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,412 INFO L273 TraceCheckUtils]: 73: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,412 INFO L273 TraceCheckUtils]: 74: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,412 INFO L273 TraceCheckUtils]: 75: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,412 INFO L273 TraceCheckUtils]: 76: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,412 INFO L273 TraceCheckUtils]: 77: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,413 INFO L273 TraceCheckUtils]: 78: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,413 INFO L273 TraceCheckUtils]: 79: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,413 INFO L273 TraceCheckUtils]: 80: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,413 INFO L273 TraceCheckUtils]: 81: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,413 INFO L273 TraceCheckUtils]: 82: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,413 INFO L273 TraceCheckUtils]: 83: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,413 INFO L273 TraceCheckUtils]: 84: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,413 INFO L273 TraceCheckUtils]: 85: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,413 INFO L273 TraceCheckUtils]: 86: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,414 INFO L273 TraceCheckUtils]: 87: Hoare triple {19718#true} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19718#true} is VALID [2018-11-18 22:48:48,414 INFO L273 TraceCheckUtils]: 88: Hoare triple {19718#true} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {19718#true} is VALID [2018-11-18 22:48:48,414 INFO L273 TraceCheckUtils]: 89: Hoare triple {19718#true} ~a~0 := 1 + ~a~0; {19718#true} is VALID [2018-11-18 22:48:48,414 INFO L273 TraceCheckUtils]: 90: Hoare triple {19718#true} assume true; {19718#true} is VALID [2018-11-18 22:48:48,414 INFO L273 TraceCheckUtils]: 91: Hoare triple {19718#true} assume !(~a~0 < 100000); {19718#true} is VALID [2018-11-18 22:48:48,414 INFO L273 TraceCheckUtils]: 92: Hoare triple {19718#true} ~a~0 := 0; {20021#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:48,415 INFO L273 TraceCheckUtils]: 93: Hoare triple {20021#(<= main_~a~0 0)} assume true; {20021#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:48,415 INFO L273 TraceCheckUtils]: 94: Hoare triple {20021#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {20021#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:48,415 INFO L273 TraceCheckUtils]: 95: Hoare triple {20021#(<= main_~a~0 0)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {20021#(<= main_~a~0 0)} is VALID [2018-11-18 22:48:48,416 INFO L273 TraceCheckUtils]: 96: Hoare triple {20021#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {19721#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:48,416 INFO L273 TraceCheckUtils]: 97: Hoare triple {19721#(<= main_~a~0 1)} assume true; {19721#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:48,416 INFO L273 TraceCheckUtils]: 98: Hoare triple {19721#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19721#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:48,417 INFO L273 TraceCheckUtils]: 99: Hoare triple {19721#(<= main_~a~0 1)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19721#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:48,417 INFO L273 TraceCheckUtils]: 100: Hoare triple {19721#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {19722#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:48,417 INFO L273 TraceCheckUtils]: 101: Hoare triple {19722#(<= main_~a~0 2)} assume true; {19722#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:48,418 INFO L273 TraceCheckUtils]: 102: Hoare triple {19722#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19722#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:48,418 INFO L273 TraceCheckUtils]: 103: Hoare triple {19722#(<= main_~a~0 2)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19722#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:48,419 INFO L273 TraceCheckUtils]: 104: Hoare triple {19722#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {19723#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:48,420 INFO L273 TraceCheckUtils]: 105: Hoare triple {19723#(<= main_~a~0 3)} assume true; {19723#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:48,420 INFO L273 TraceCheckUtils]: 106: Hoare triple {19723#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19723#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:48,420 INFO L273 TraceCheckUtils]: 107: Hoare triple {19723#(<= main_~a~0 3)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19723#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:48,421 INFO L273 TraceCheckUtils]: 108: Hoare triple {19723#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {19724#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:48,422 INFO L273 TraceCheckUtils]: 109: Hoare triple {19724#(<= main_~a~0 4)} assume true; {19724#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:48,422 INFO L273 TraceCheckUtils]: 110: Hoare triple {19724#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19724#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:48,423 INFO L273 TraceCheckUtils]: 111: Hoare triple {19724#(<= main_~a~0 4)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19724#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:48,423 INFO L273 TraceCheckUtils]: 112: Hoare triple {19724#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {19725#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:48,424 INFO L273 TraceCheckUtils]: 113: Hoare triple {19725#(<= main_~a~0 5)} assume true; {19725#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:48,424 INFO L273 TraceCheckUtils]: 114: Hoare triple {19725#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19725#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:48,425 INFO L273 TraceCheckUtils]: 115: Hoare triple {19725#(<= main_~a~0 5)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19725#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:48,425 INFO L273 TraceCheckUtils]: 116: Hoare triple {19725#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {19726#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:48,426 INFO L273 TraceCheckUtils]: 117: Hoare triple {19726#(<= main_~a~0 6)} assume true; {19726#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:48,426 INFO L273 TraceCheckUtils]: 118: Hoare triple {19726#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19726#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:48,427 INFO L273 TraceCheckUtils]: 119: Hoare triple {19726#(<= main_~a~0 6)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19726#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:48,427 INFO L273 TraceCheckUtils]: 120: Hoare triple {19726#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {19727#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:48,428 INFO L273 TraceCheckUtils]: 121: Hoare triple {19727#(<= main_~a~0 7)} assume true; {19727#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:48,428 INFO L273 TraceCheckUtils]: 122: Hoare triple {19727#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19727#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:48,429 INFO L273 TraceCheckUtils]: 123: Hoare triple {19727#(<= main_~a~0 7)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19727#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:48,429 INFO L273 TraceCheckUtils]: 124: Hoare triple {19727#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {19728#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:48,430 INFO L273 TraceCheckUtils]: 125: Hoare triple {19728#(<= main_~a~0 8)} assume true; {19728#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:48,430 INFO L273 TraceCheckUtils]: 126: Hoare triple {19728#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19728#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:48,431 INFO L273 TraceCheckUtils]: 127: Hoare triple {19728#(<= main_~a~0 8)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19728#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:48,431 INFO L273 TraceCheckUtils]: 128: Hoare triple {19728#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {19729#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:48,432 INFO L273 TraceCheckUtils]: 129: Hoare triple {19729#(<= main_~a~0 9)} assume true; {19729#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:48,432 INFO L273 TraceCheckUtils]: 130: Hoare triple {19729#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19729#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:48,433 INFO L273 TraceCheckUtils]: 131: Hoare triple {19729#(<= main_~a~0 9)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19729#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:48,434 INFO L273 TraceCheckUtils]: 132: Hoare triple {19729#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {19730#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:48,434 INFO L273 TraceCheckUtils]: 133: Hoare triple {19730#(<= main_~a~0 10)} assume true; {19730#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:48,434 INFO L273 TraceCheckUtils]: 134: Hoare triple {19730#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19730#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:48,435 INFO L273 TraceCheckUtils]: 135: Hoare triple {19730#(<= main_~a~0 10)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19730#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:48,436 INFO L273 TraceCheckUtils]: 136: Hoare triple {19730#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {19731#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:48,436 INFO L273 TraceCheckUtils]: 137: Hoare triple {19731#(<= main_~a~0 11)} assume true; {19731#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:48,437 INFO L273 TraceCheckUtils]: 138: Hoare triple {19731#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19731#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:48,437 INFO L273 TraceCheckUtils]: 139: Hoare triple {19731#(<= main_~a~0 11)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19731#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:48,438 INFO L273 TraceCheckUtils]: 140: Hoare triple {19731#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {19732#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:48,438 INFO L273 TraceCheckUtils]: 141: Hoare triple {19732#(<= main_~a~0 12)} assume true; {19732#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:48,439 INFO L273 TraceCheckUtils]: 142: Hoare triple {19732#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19732#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:48,439 INFO L273 TraceCheckUtils]: 143: Hoare triple {19732#(<= main_~a~0 12)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19732#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:48,440 INFO L273 TraceCheckUtils]: 144: Hoare triple {19732#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {19733#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:48,440 INFO L273 TraceCheckUtils]: 145: Hoare triple {19733#(<= main_~a~0 13)} assume true; {19733#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:48,441 INFO L273 TraceCheckUtils]: 146: Hoare triple {19733#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19733#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:48,441 INFO L273 TraceCheckUtils]: 147: Hoare triple {19733#(<= main_~a~0 13)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19733#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:48,442 INFO L273 TraceCheckUtils]: 148: Hoare triple {19733#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {19734#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:48,442 INFO L273 TraceCheckUtils]: 149: Hoare triple {19734#(<= main_~a~0 14)} assume true; {19734#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:48,443 INFO L273 TraceCheckUtils]: 150: Hoare triple {19734#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19734#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:48,443 INFO L273 TraceCheckUtils]: 151: Hoare triple {19734#(<= main_~a~0 14)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19734#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:48,444 INFO L273 TraceCheckUtils]: 152: Hoare triple {19734#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {19735#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:48,444 INFO L273 TraceCheckUtils]: 153: Hoare triple {19735#(<= main_~a~0 15)} assume true; {19735#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:48,445 INFO L273 TraceCheckUtils]: 154: Hoare triple {19735#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19735#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:48,445 INFO L273 TraceCheckUtils]: 155: Hoare triple {19735#(<= main_~a~0 15)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19735#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:48,446 INFO L273 TraceCheckUtils]: 156: Hoare triple {19735#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {19736#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:48,446 INFO L273 TraceCheckUtils]: 157: Hoare triple {19736#(<= main_~a~0 16)} assume true; {19736#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:48,447 INFO L273 TraceCheckUtils]: 158: Hoare triple {19736#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19736#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:48,447 INFO L273 TraceCheckUtils]: 159: Hoare triple {19736#(<= main_~a~0 16)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19736#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:48,448 INFO L273 TraceCheckUtils]: 160: Hoare triple {19736#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {19737#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:48,448 INFO L273 TraceCheckUtils]: 161: Hoare triple {19737#(<= main_~a~0 17)} assume true; {19737#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:48,449 INFO L273 TraceCheckUtils]: 162: Hoare triple {19737#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19737#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:48,449 INFO L273 TraceCheckUtils]: 163: Hoare triple {19737#(<= main_~a~0 17)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19737#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:48,450 INFO L273 TraceCheckUtils]: 164: Hoare triple {19737#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {19738#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:48,451 INFO L273 TraceCheckUtils]: 165: Hoare triple {19738#(<= main_~a~0 18)} assume true; {19738#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:48,451 INFO L273 TraceCheckUtils]: 166: Hoare triple {19738#(<= main_~a~0 18)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19738#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:48,451 INFO L273 TraceCheckUtils]: 167: Hoare triple {19738#(<= main_~a~0 18)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19738#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:48,452 INFO L273 TraceCheckUtils]: 168: Hoare triple {19738#(<= main_~a~0 18)} ~a~0 := 1 + ~a~0; {19739#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:48,453 INFO L273 TraceCheckUtils]: 169: Hoare triple {19739#(<= main_~a~0 19)} assume true; {19739#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:48,453 INFO L273 TraceCheckUtils]: 170: Hoare triple {19739#(<= main_~a~0 19)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19739#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:48,454 INFO L273 TraceCheckUtils]: 171: Hoare triple {19739#(<= main_~a~0 19)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19739#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:48,454 INFO L273 TraceCheckUtils]: 172: Hoare triple {19739#(<= main_~a~0 19)} ~a~0 := 1 + ~a~0; {19740#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:48,455 INFO L273 TraceCheckUtils]: 173: Hoare triple {19740#(<= main_~a~0 20)} assume true; {19740#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:48,455 INFO L273 TraceCheckUtils]: 174: Hoare triple {19740#(<= main_~a~0 20)} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {19740#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:48,456 INFO L273 TraceCheckUtils]: 175: Hoare triple {19740#(<= main_~a~0 20)} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {19740#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:48,456 INFO L273 TraceCheckUtils]: 176: Hoare triple {19740#(<= main_~a~0 20)} ~a~0 := 1 + ~a~0; {19741#(<= main_~a~0 21)} is VALID [2018-11-18 22:48:48,457 INFO L273 TraceCheckUtils]: 177: Hoare triple {19741#(<= main_~a~0 21)} assume true; {19741#(<= main_~a~0 21)} is VALID [2018-11-18 22:48:48,457 INFO L273 TraceCheckUtils]: 178: Hoare triple {19741#(<= main_~a~0 21)} assume !(~a~0 < 100000); {19719#false} is VALID [2018-11-18 22:48:48,458 INFO L273 TraceCheckUtils]: 179: Hoare triple {19719#false} havoc ~x~0;~x~0 := 0; {19719#false} is VALID [2018-11-18 22:48:48,458 INFO L273 TraceCheckUtils]: 180: Hoare triple {19719#false} assume true; {19719#false} is VALID [2018-11-18 22:48:48,458 INFO L273 TraceCheckUtils]: 181: Hoare triple {19719#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {19719#false} is VALID [2018-11-18 22:48:48,458 INFO L256 TraceCheckUtils]: 182: Hoare triple {19719#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {19719#false} is VALID [2018-11-18 22:48:48,458 INFO L273 TraceCheckUtils]: 183: Hoare triple {19719#false} ~cond := #in~cond; {19719#false} is VALID [2018-11-18 22:48:48,458 INFO L273 TraceCheckUtils]: 184: Hoare triple {19719#false} assume 0 == ~cond; {19719#false} is VALID [2018-11-18 22:48:48,459 INFO L273 TraceCheckUtils]: 185: Hoare triple {19719#false} assume !false; {19719#false} is VALID [2018-11-18 22:48:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 882 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2018-11-18 22:48:48,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:48:48,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-18 22:48:48,499 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 186 [2018-11-18 22:48:48,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:48:48,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-18 22:48:48,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:48,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-18 22:48:48,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-18 22:48:48,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:48:48,676 INFO L87 Difference]: Start difference. First operand 197 states and 243 transitions. Second operand 25 states. [2018-11-18 22:48:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:49,679 INFO L93 Difference]: Finished difference Result 314 states and 390 transitions. [2018-11-18 22:48:49,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 22:48:49,680 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 186 [2018-11-18 22:48:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:48:49,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:48:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 288 transitions. [2018-11-18 22:48:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 22:48:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 288 transitions. [2018-11-18 22:48:49,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 288 transitions. [2018-11-18 22:48:49,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:48:49,991 INFO L225 Difference]: With dead ends: 314 [2018-11-18 22:48:49,991 INFO L226 Difference]: Without dead ends: 209 [2018-11-18 22:48:49,991 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-18 22:48:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-18 22:48:50,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2018-11-18 22:48:50,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:48:50,355 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 205 states. [2018-11-18 22:48:50,356 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 205 states. [2018-11-18 22:48:50,356 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 205 states. [2018-11-18 22:48:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:50,359 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2018-11-18 22:48:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 259 transitions. [2018-11-18 22:48:50,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:50,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:50,359 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 209 states. [2018-11-18 22:48:50,360 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 209 states. [2018-11-18 22:48:50,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:48:50,363 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2018-11-18 22:48:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 259 transitions. [2018-11-18 22:48:50,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:48:50,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:48:50,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:48:50,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:48:50,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-18 22:48:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 253 transitions. [2018-11-18 22:48:50,368 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 253 transitions. Word has length 186 [2018-11-18 22:48:50,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:48:50,368 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 253 transitions. [2018-11-18 22:48:50,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-18 22:48:50,368 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 253 transitions. [2018-11-18 22:48:50,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-18 22:48:50,369 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:48:50,370 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:48:50,370 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:48:50,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:48:50,370 INFO L82 PathProgramCache]: Analyzing trace with hash -2058763821, now seen corresponding path program 22 times [2018-11-18 22:48:50,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:48:50,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:48:50,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:50,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:48:50,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:48:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:48:51,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {21374#true} call ULTIMATE.init(); {21374#true} is VALID [2018-11-18 22:48:51,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {21374#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21374#true} is VALID [2018-11-18 22:48:51,125 INFO L273 TraceCheckUtils]: 2: Hoare triple {21374#true} assume true; {21374#true} is VALID [2018-11-18 22:48:51,125 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21374#true} {21374#true} #95#return; {21374#true} is VALID [2018-11-18 22:48:51,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {21374#true} call #t~ret8 := main(); {21374#true} is VALID [2018-11-18 22:48:51,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {21374#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {21376#(= main_~a~0 0)} is VALID [2018-11-18 22:48:51,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {21376#(= main_~a~0 0)} assume true; {21376#(= main_~a~0 0)} is VALID [2018-11-18 22:48:51,126 INFO L273 TraceCheckUtils]: 7: Hoare triple {21376#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21376#(= main_~a~0 0)} is VALID [2018-11-18 22:48:51,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {21376#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21376#(= main_~a~0 0)} is VALID [2018-11-18 22:48:51,127 INFO L273 TraceCheckUtils]: 9: Hoare triple {21376#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {21377#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:51,127 INFO L273 TraceCheckUtils]: 10: Hoare triple {21377#(<= main_~a~0 1)} assume true; {21377#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:51,127 INFO L273 TraceCheckUtils]: 11: Hoare triple {21377#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21377#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:51,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {21377#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21377#(<= main_~a~0 1)} is VALID [2018-11-18 22:48:51,128 INFO L273 TraceCheckUtils]: 13: Hoare triple {21377#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {21378#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:51,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {21378#(<= main_~a~0 2)} assume true; {21378#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:51,129 INFO L273 TraceCheckUtils]: 15: Hoare triple {21378#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21378#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:51,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {21378#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21378#(<= main_~a~0 2)} is VALID [2018-11-18 22:48:51,130 INFO L273 TraceCheckUtils]: 17: Hoare triple {21378#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {21379#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:51,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {21379#(<= main_~a~0 3)} assume true; {21379#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:51,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {21379#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21379#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:51,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {21379#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21379#(<= main_~a~0 3)} is VALID [2018-11-18 22:48:51,132 INFO L273 TraceCheckUtils]: 21: Hoare triple {21379#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {21380#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:51,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {21380#(<= main_~a~0 4)} assume true; {21380#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:51,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {21380#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21380#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:51,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {21380#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21380#(<= main_~a~0 4)} is VALID [2018-11-18 22:48:51,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {21380#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {21381#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:51,135 INFO L273 TraceCheckUtils]: 26: Hoare triple {21381#(<= main_~a~0 5)} assume true; {21381#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:51,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {21381#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21381#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:51,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {21381#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21381#(<= main_~a~0 5)} is VALID [2018-11-18 22:48:51,137 INFO L273 TraceCheckUtils]: 29: Hoare triple {21381#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {21382#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:51,137 INFO L273 TraceCheckUtils]: 30: Hoare triple {21382#(<= main_~a~0 6)} assume true; {21382#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:51,138 INFO L273 TraceCheckUtils]: 31: Hoare triple {21382#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21382#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:51,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {21382#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21382#(<= main_~a~0 6)} is VALID [2018-11-18 22:48:51,139 INFO L273 TraceCheckUtils]: 33: Hoare triple {21382#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {21383#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:51,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {21383#(<= main_~a~0 7)} assume true; {21383#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:51,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {21383#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21383#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:51,140 INFO L273 TraceCheckUtils]: 36: Hoare triple {21383#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21383#(<= main_~a~0 7)} is VALID [2018-11-18 22:48:51,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {21383#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {21384#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:51,141 INFO L273 TraceCheckUtils]: 38: Hoare triple {21384#(<= main_~a~0 8)} assume true; {21384#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:51,142 INFO L273 TraceCheckUtils]: 39: Hoare triple {21384#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21384#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:51,142 INFO L273 TraceCheckUtils]: 40: Hoare triple {21384#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21384#(<= main_~a~0 8)} is VALID [2018-11-18 22:48:51,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {21384#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {21385#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:51,143 INFO L273 TraceCheckUtils]: 42: Hoare triple {21385#(<= main_~a~0 9)} assume true; {21385#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:51,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {21385#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21385#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:51,144 INFO L273 TraceCheckUtils]: 44: Hoare triple {21385#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21385#(<= main_~a~0 9)} is VALID [2018-11-18 22:48:51,145 INFO L273 TraceCheckUtils]: 45: Hoare triple {21385#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {21386#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:51,145 INFO L273 TraceCheckUtils]: 46: Hoare triple {21386#(<= main_~a~0 10)} assume true; {21386#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:51,146 INFO L273 TraceCheckUtils]: 47: Hoare triple {21386#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21386#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:51,146 INFO L273 TraceCheckUtils]: 48: Hoare triple {21386#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21386#(<= main_~a~0 10)} is VALID [2018-11-18 22:48:51,147 INFO L273 TraceCheckUtils]: 49: Hoare triple {21386#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {21387#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:51,147 INFO L273 TraceCheckUtils]: 50: Hoare triple {21387#(<= main_~a~0 11)} assume true; {21387#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:51,148 INFO L273 TraceCheckUtils]: 51: Hoare triple {21387#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21387#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:51,148 INFO L273 TraceCheckUtils]: 52: Hoare triple {21387#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21387#(<= main_~a~0 11)} is VALID [2018-11-18 22:48:51,149 INFO L273 TraceCheckUtils]: 53: Hoare triple {21387#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {21388#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:51,149 INFO L273 TraceCheckUtils]: 54: Hoare triple {21388#(<= main_~a~0 12)} assume true; {21388#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:51,150 INFO L273 TraceCheckUtils]: 55: Hoare triple {21388#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21388#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:51,150 INFO L273 TraceCheckUtils]: 56: Hoare triple {21388#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21388#(<= main_~a~0 12)} is VALID [2018-11-18 22:48:51,151 INFO L273 TraceCheckUtils]: 57: Hoare triple {21388#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {21389#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:51,151 INFO L273 TraceCheckUtils]: 58: Hoare triple {21389#(<= main_~a~0 13)} assume true; {21389#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:51,152 INFO L273 TraceCheckUtils]: 59: Hoare triple {21389#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21389#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:51,152 INFO L273 TraceCheckUtils]: 60: Hoare triple {21389#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21389#(<= main_~a~0 13)} is VALID [2018-11-18 22:48:51,153 INFO L273 TraceCheckUtils]: 61: Hoare triple {21389#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {21390#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:51,154 INFO L273 TraceCheckUtils]: 62: Hoare triple {21390#(<= main_~a~0 14)} assume true; {21390#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:51,154 INFO L273 TraceCheckUtils]: 63: Hoare triple {21390#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21390#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:51,154 INFO L273 TraceCheckUtils]: 64: Hoare triple {21390#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21390#(<= main_~a~0 14)} is VALID [2018-11-18 22:48:51,155 INFO L273 TraceCheckUtils]: 65: Hoare triple {21390#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {21391#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:51,156 INFO L273 TraceCheckUtils]: 66: Hoare triple {21391#(<= main_~a~0 15)} assume true; {21391#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:51,156 INFO L273 TraceCheckUtils]: 67: Hoare triple {21391#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21391#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:51,156 INFO L273 TraceCheckUtils]: 68: Hoare triple {21391#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21391#(<= main_~a~0 15)} is VALID [2018-11-18 22:48:51,157 INFO L273 TraceCheckUtils]: 69: Hoare triple {21391#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {21392#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:51,158 INFO L273 TraceCheckUtils]: 70: Hoare triple {21392#(<= main_~a~0 16)} assume true; {21392#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:51,158 INFO L273 TraceCheckUtils]: 71: Hoare triple {21392#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21392#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:51,159 INFO L273 TraceCheckUtils]: 72: Hoare triple {21392#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21392#(<= main_~a~0 16)} is VALID [2018-11-18 22:48:51,159 INFO L273 TraceCheckUtils]: 73: Hoare triple {21392#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {21393#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:51,160 INFO L273 TraceCheckUtils]: 74: Hoare triple {21393#(<= main_~a~0 17)} assume true; {21393#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:51,160 INFO L273 TraceCheckUtils]: 75: Hoare triple {21393#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21393#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:51,161 INFO L273 TraceCheckUtils]: 76: Hoare triple {21393#(<= main_~a~0 17)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21393#(<= main_~a~0 17)} is VALID [2018-11-18 22:48:51,161 INFO L273 TraceCheckUtils]: 77: Hoare triple {21393#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {21394#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:51,162 INFO L273 TraceCheckUtils]: 78: Hoare triple {21394#(<= main_~a~0 18)} assume true; {21394#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:51,162 INFO L273 TraceCheckUtils]: 79: Hoare triple {21394#(<= main_~a~0 18)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21394#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:51,163 INFO L273 TraceCheckUtils]: 80: Hoare triple {21394#(<= main_~a~0 18)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21394#(<= main_~a~0 18)} is VALID [2018-11-18 22:48:51,163 INFO L273 TraceCheckUtils]: 81: Hoare triple {21394#(<= main_~a~0 18)} ~a~0 := 1 + ~a~0; {21395#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:51,164 INFO L273 TraceCheckUtils]: 82: Hoare triple {21395#(<= main_~a~0 19)} assume true; {21395#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:51,164 INFO L273 TraceCheckUtils]: 83: Hoare triple {21395#(<= main_~a~0 19)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21395#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:51,165 INFO L273 TraceCheckUtils]: 84: Hoare triple {21395#(<= main_~a~0 19)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21395#(<= main_~a~0 19)} is VALID [2018-11-18 22:48:51,165 INFO L273 TraceCheckUtils]: 85: Hoare triple {21395#(<= main_~a~0 19)} ~a~0 := 1 + ~a~0; {21396#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:51,166 INFO L273 TraceCheckUtils]: 86: Hoare triple {21396#(<= main_~a~0 20)} assume true; {21396#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:51,166 INFO L273 TraceCheckUtils]: 87: Hoare triple {21396#(<= main_~a~0 20)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21396#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:51,167 INFO L273 TraceCheckUtils]: 88: Hoare triple {21396#(<= main_~a~0 20)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21396#(<= main_~a~0 20)} is VALID [2018-11-18 22:48:51,167 INFO L273 TraceCheckUtils]: 89: Hoare triple {21396#(<= main_~a~0 20)} ~a~0 := 1 + ~a~0; {21397#(<= main_~a~0 21)} is VALID [2018-11-18 22:48:51,168 INFO L273 TraceCheckUtils]: 90: Hoare triple {21397#(<= main_~a~0 21)} assume true; {21397#(<= main_~a~0 21)} is VALID [2018-11-18 22:48:51,168 INFO L273 TraceCheckUtils]: 91: Hoare triple {21397#(<= main_~a~0 21)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21397#(<= main_~a~0 21)} is VALID [2018-11-18 22:48:51,169 INFO L273 TraceCheckUtils]: 92: Hoare triple {21397#(<= main_~a~0 21)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21397#(<= main_~a~0 21)} is VALID [2018-11-18 22:48:51,170 INFO L273 TraceCheckUtils]: 93: Hoare triple {21397#(<= main_~a~0 21)} ~a~0 := 1 + ~a~0; {21398#(<= main_~a~0 22)} is VALID [2018-11-18 22:48:51,170 INFO L273 TraceCheckUtils]: 94: Hoare triple {21398#(<= main_~a~0 22)} assume true; {21398#(<= main_~a~0 22)} is VALID [2018-11-18 22:48:51,171 INFO L273 TraceCheckUtils]: 95: Hoare triple {21398#(<= main_~a~0 22)} assume !(~a~0 < 100000); {21375#false} is VALID [2018-11-18 22:48:51,171 INFO L273 TraceCheckUtils]: 96: Hoare triple {21375#false} ~a~0 := 0; {21375#false} is VALID [2018-11-18 22:48:51,171 INFO L273 TraceCheckUtils]: 97: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,171 INFO L273 TraceCheckUtils]: 98: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,171 INFO L273 TraceCheckUtils]: 99: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,171 INFO L273 TraceCheckUtils]: 100: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,172 INFO L273 TraceCheckUtils]: 101: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,172 INFO L273 TraceCheckUtils]: 102: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,172 INFO L273 TraceCheckUtils]: 103: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,172 INFO L273 TraceCheckUtils]: 104: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,172 INFO L273 TraceCheckUtils]: 105: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,172 INFO L273 TraceCheckUtils]: 106: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,173 INFO L273 TraceCheckUtils]: 107: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,173 INFO L273 TraceCheckUtils]: 108: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,173 INFO L273 TraceCheckUtils]: 109: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,173 INFO L273 TraceCheckUtils]: 110: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,173 INFO L273 TraceCheckUtils]: 111: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,173 INFO L273 TraceCheckUtils]: 112: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,173 INFO L273 TraceCheckUtils]: 113: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,174 INFO L273 TraceCheckUtils]: 114: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,174 INFO L273 TraceCheckUtils]: 115: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,174 INFO L273 TraceCheckUtils]: 116: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,174 INFO L273 TraceCheckUtils]: 117: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,174 INFO L273 TraceCheckUtils]: 118: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,174 INFO L273 TraceCheckUtils]: 119: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,174 INFO L273 TraceCheckUtils]: 120: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,174 INFO L273 TraceCheckUtils]: 121: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,174 INFO L273 TraceCheckUtils]: 122: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,174 INFO L273 TraceCheckUtils]: 123: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,175 INFO L273 TraceCheckUtils]: 124: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,175 INFO L273 TraceCheckUtils]: 125: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,175 INFO L273 TraceCheckUtils]: 126: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,175 INFO L273 TraceCheckUtils]: 127: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,175 INFO L273 TraceCheckUtils]: 128: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,175 INFO L273 TraceCheckUtils]: 129: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,175 INFO L273 TraceCheckUtils]: 130: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,175 INFO L273 TraceCheckUtils]: 131: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,175 INFO L273 TraceCheckUtils]: 132: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,176 INFO L273 TraceCheckUtils]: 133: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,176 INFO L273 TraceCheckUtils]: 134: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,176 INFO L273 TraceCheckUtils]: 135: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,176 INFO L273 TraceCheckUtils]: 136: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,176 INFO L273 TraceCheckUtils]: 137: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,176 INFO L273 TraceCheckUtils]: 138: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,176 INFO L273 TraceCheckUtils]: 139: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,176 INFO L273 TraceCheckUtils]: 140: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,176 INFO L273 TraceCheckUtils]: 141: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,176 INFO L273 TraceCheckUtils]: 142: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,177 INFO L273 TraceCheckUtils]: 143: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,177 INFO L273 TraceCheckUtils]: 144: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,177 INFO L273 TraceCheckUtils]: 145: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,177 INFO L273 TraceCheckUtils]: 146: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,177 INFO L273 TraceCheckUtils]: 147: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,177 INFO L273 TraceCheckUtils]: 148: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,177 INFO L273 TraceCheckUtils]: 149: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,177 INFO L273 TraceCheckUtils]: 150: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,177 INFO L273 TraceCheckUtils]: 151: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,177 INFO L273 TraceCheckUtils]: 152: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,178 INFO L273 TraceCheckUtils]: 153: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,178 INFO L273 TraceCheckUtils]: 154: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,178 INFO L273 TraceCheckUtils]: 155: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,178 INFO L273 TraceCheckUtils]: 156: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,178 INFO L273 TraceCheckUtils]: 157: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,178 INFO L273 TraceCheckUtils]: 158: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,178 INFO L273 TraceCheckUtils]: 159: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,178 INFO L273 TraceCheckUtils]: 160: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,178 INFO L273 TraceCheckUtils]: 161: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,179 INFO L273 TraceCheckUtils]: 162: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,179 INFO L273 TraceCheckUtils]: 163: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,179 INFO L273 TraceCheckUtils]: 164: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,179 INFO L273 TraceCheckUtils]: 165: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,179 INFO L273 TraceCheckUtils]: 166: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,179 INFO L273 TraceCheckUtils]: 167: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,179 INFO L273 TraceCheckUtils]: 168: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,179 INFO L273 TraceCheckUtils]: 169: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,179 INFO L273 TraceCheckUtils]: 170: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,179 INFO L273 TraceCheckUtils]: 171: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,180 INFO L273 TraceCheckUtils]: 172: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,180 INFO L273 TraceCheckUtils]: 173: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,180 INFO L273 TraceCheckUtils]: 174: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,180 INFO L273 TraceCheckUtils]: 175: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,180 INFO L273 TraceCheckUtils]: 176: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,180 INFO L273 TraceCheckUtils]: 177: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,180 INFO L273 TraceCheckUtils]: 178: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,180 INFO L273 TraceCheckUtils]: 179: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,180 INFO L273 TraceCheckUtils]: 180: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,180 INFO L273 TraceCheckUtils]: 181: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,181 INFO L273 TraceCheckUtils]: 182: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,181 INFO L273 TraceCheckUtils]: 183: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:48:51,181 INFO L273 TraceCheckUtils]: 184: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:48:51,181 INFO L273 TraceCheckUtils]: 185: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,181 INFO L273 TraceCheckUtils]: 186: Hoare triple {21375#false} assume !(~a~0 < 100000); {21375#false} is VALID [2018-11-18 22:48:51,181 INFO L273 TraceCheckUtils]: 187: Hoare triple {21375#false} havoc ~x~0;~x~0 := 0; {21375#false} is VALID [2018-11-18 22:48:51,181 INFO L273 TraceCheckUtils]: 188: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:48:51,181 INFO L273 TraceCheckUtils]: 189: Hoare triple {21375#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {21375#false} is VALID [2018-11-18 22:48:51,181 INFO L256 TraceCheckUtils]: 190: Hoare triple {21375#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {21375#false} is VALID [2018-11-18 22:48:51,182 INFO L273 TraceCheckUtils]: 191: Hoare triple {21375#false} ~cond := #in~cond; {21375#false} is VALID [2018-11-18 22:48:51,182 INFO L273 TraceCheckUtils]: 192: Hoare triple {21375#false} assume 0 == ~cond; {21375#false} is VALID [2018-11-18 22:48:51,182 INFO L273 TraceCheckUtils]: 193: Hoare triple {21375#false} assume !false; {21375#false} is VALID [2018-11-18 22:48:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-11-18 22:48:51,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:48:51,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:48:51,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 22:49:03,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 22:49:03,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 22:49:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:49:03,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 22:49:03,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {21374#true} call ULTIMATE.init(); {21374#true} is VALID [2018-11-18 22:49:03,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {21374#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21374#true} is VALID [2018-11-18 22:49:03,673 INFO L273 TraceCheckUtils]: 2: Hoare triple {21374#true} assume true; {21374#true} is VALID [2018-11-18 22:49:03,673 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21374#true} {21374#true} #95#return; {21374#true} is VALID [2018-11-18 22:49:03,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {21374#true} call #t~ret8 := main(); {21374#true} is VALID [2018-11-18 22:49:03,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {21374#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {21417#(<= main_~a~0 0)} is VALID [2018-11-18 22:49:03,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {21417#(<= main_~a~0 0)} assume true; {21417#(<= main_~a~0 0)} is VALID [2018-11-18 22:49:03,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {21417#(<= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21417#(<= main_~a~0 0)} is VALID [2018-11-18 22:49:03,676 INFO L273 TraceCheckUtils]: 8: Hoare triple {21417#(<= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21417#(<= main_~a~0 0)} is VALID [2018-11-18 22:49:03,676 INFO L273 TraceCheckUtils]: 9: Hoare triple {21417#(<= main_~a~0 0)} ~a~0 := 1 + ~a~0; {21377#(<= main_~a~0 1)} is VALID [2018-11-18 22:49:03,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {21377#(<= main_~a~0 1)} assume true; {21377#(<= main_~a~0 1)} is VALID [2018-11-18 22:49:03,677 INFO L273 TraceCheckUtils]: 11: Hoare triple {21377#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21377#(<= main_~a~0 1)} is VALID [2018-11-18 22:49:03,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {21377#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21377#(<= main_~a~0 1)} is VALID [2018-11-18 22:49:03,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {21377#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {21378#(<= main_~a~0 2)} is VALID [2018-11-18 22:49:03,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {21378#(<= main_~a~0 2)} assume true; {21378#(<= main_~a~0 2)} is VALID [2018-11-18 22:49:03,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {21378#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21378#(<= main_~a~0 2)} is VALID [2018-11-18 22:49:03,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {21378#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21378#(<= main_~a~0 2)} is VALID [2018-11-18 22:49:03,680 INFO L273 TraceCheckUtils]: 17: Hoare triple {21378#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {21379#(<= main_~a~0 3)} is VALID [2018-11-18 22:49:03,680 INFO L273 TraceCheckUtils]: 18: Hoare triple {21379#(<= main_~a~0 3)} assume true; {21379#(<= main_~a~0 3)} is VALID [2018-11-18 22:49:03,681 INFO L273 TraceCheckUtils]: 19: Hoare triple {21379#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21379#(<= main_~a~0 3)} is VALID [2018-11-18 22:49:03,681 INFO L273 TraceCheckUtils]: 20: Hoare triple {21379#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21379#(<= main_~a~0 3)} is VALID [2018-11-18 22:49:03,682 INFO L273 TraceCheckUtils]: 21: Hoare triple {21379#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {21380#(<= main_~a~0 4)} is VALID [2018-11-18 22:49:03,682 INFO L273 TraceCheckUtils]: 22: Hoare triple {21380#(<= main_~a~0 4)} assume true; {21380#(<= main_~a~0 4)} is VALID [2018-11-18 22:49:03,683 INFO L273 TraceCheckUtils]: 23: Hoare triple {21380#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21380#(<= main_~a~0 4)} is VALID [2018-11-18 22:49:03,683 INFO L273 TraceCheckUtils]: 24: Hoare triple {21380#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21380#(<= main_~a~0 4)} is VALID [2018-11-18 22:49:03,684 INFO L273 TraceCheckUtils]: 25: Hoare triple {21380#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {21381#(<= main_~a~0 5)} is VALID [2018-11-18 22:49:03,685 INFO L273 TraceCheckUtils]: 26: Hoare triple {21381#(<= main_~a~0 5)} assume true; {21381#(<= main_~a~0 5)} is VALID [2018-11-18 22:49:03,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {21381#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21381#(<= main_~a~0 5)} is VALID [2018-11-18 22:49:03,685 INFO L273 TraceCheckUtils]: 28: Hoare triple {21381#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21381#(<= main_~a~0 5)} is VALID [2018-11-18 22:49:03,686 INFO L273 TraceCheckUtils]: 29: Hoare triple {21381#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {21382#(<= main_~a~0 6)} is VALID [2018-11-18 22:49:03,687 INFO L273 TraceCheckUtils]: 30: Hoare triple {21382#(<= main_~a~0 6)} assume true; {21382#(<= main_~a~0 6)} is VALID [2018-11-18 22:49:03,687 INFO L273 TraceCheckUtils]: 31: Hoare triple {21382#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21382#(<= main_~a~0 6)} is VALID [2018-11-18 22:49:03,688 INFO L273 TraceCheckUtils]: 32: Hoare triple {21382#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21382#(<= main_~a~0 6)} is VALID [2018-11-18 22:49:03,688 INFO L273 TraceCheckUtils]: 33: Hoare triple {21382#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {21383#(<= main_~a~0 7)} is VALID [2018-11-18 22:49:03,689 INFO L273 TraceCheckUtils]: 34: Hoare triple {21383#(<= main_~a~0 7)} assume true; {21383#(<= main_~a~0 7)} is VALID [2018-11-18 22:49:03,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {21383#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21383#(<= main_~a~0 7)} is VALID [2018-11-18 22:49:03,690 INFO L273 TraceCheckUtils]: 36: Hoare triple {21383#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21383#(<= main_~a~0 7)} is VALID [2018-11-18 22:49:03,690 INFO L273 TraceCheckUtils]: 37: Hoare triple {21383#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {21384#(<= main_~a~0 8)} is VALID [2018-11-18 22:49:03,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {21384#(<= main_~a~0 8)} assume true; {21384#(<= main_~a~0 8)} is VALID [2018-11-18 22:49:03,691 INFO L273 TraceCheckUtils]: 39: Hoare triple {21384#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21384#(<= main_~a~0 8)} is VALID [2018-11-18 22:49:03,692 INFO L273 TraceCheckUtils]: 40: Hoare triple {21384#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21384#(<= main_~a~0 8)} is VALID [2018-11-18 22:49:03,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {21384#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {21385#(<= main_~a~0 9)} is VALID [2018-11-18 22:49:03,693 INFO L273 TraceCheckUtils]: 42: Hoare triple {21385#(<= main_~a~0 9)} assume true; {21385#(<= main_~a~0 9)} is VALID [2018-11-18 22:49:03,693 INFO L273 TraceCheckUtils]: 43: Hoare triple {21385#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21385#(<= main_~a~0 9)} is VALID [2018-11-18 22:49:03,694 INFO L273 TraceCheckUtils]: 44: Hoare triple {21385#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21385#(<= main_~a~0 9)} is VALID [2018-11-18 22:49:03,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {21385#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {21386#(<= main_~a~0 10)} is VALID [2018-11-18 22:49:03,695 INFO L273 TraceCheckUtils]: 46: Hoare triple {21386#(<= main_~a~0 10)} assume true; {21386#(<= main_~a~0 10)} is VALID [2018-11-18 22:49:03,696 INFO L273 TraceCheckUtils]: 47: Hoare triple {21386#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21386#(<= main_~a~0 10)} is VALID [2018-11-18 22:49:03,696 INFO L273 TraceCheckUtils]: 48: Hoare triple {21386#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21386#(<= main_~a~0 10)} is VALID [2018-11-18 22:49:03,697 INFO L273 TraceCheckUtils]: 49: Hoare triple {21386#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {21387#(<= main_~a~0 11)} is VALID [2018-11-18 22:49:03,697 INFO L273 TraceCheckUtils]: 50: Hoare triple {21387#(<= main_~a~0 11)} assume true; {21387#(<= main_~a~0 11)} is VALID [2018-11-18 22:49:03,698 INFO L273 TraceCheckUtils]: 51: Hoare triple {21387#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21387#(<= main_~a~0 11)} is VALID [2018-11-18 22:49:03,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {21387#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21387#(<= main_~a~0 11)} is VALID [2018-11-18 22:49:03,699 INFO L273 TraceCheckUtils]: 53: Hoare triple {21387#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {21388#(<= main_~a~0 12)} is VALID [2018-11-18 22:49:03,700 INFO L273 TraceCheckUtils]: 54: Hoare triple {21388#(<= main_~a~0 12)} assume true; {21388#(<= main_~a~0 12)} is VALID [2018-11-18 22:49:03,700 INFO L273 TraceCheckUtils]: 55: Hoare triple {21388#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21388#(<= main_~a~0 12)} is VALID [2018-11-18 22:49:03,700 INFO L273 TraceCheckUtils]: 56: Hoare triple {21388#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21388#(<= main_~a~0 12)} is VALID [2018-11-18 22:49:03,701 INFO L273 TraceCheckUtils]: 57: Hoare triple {21388#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {21389#(<= main_~a~0 13)} is VALID [2018-11-18 22:49:03,702 INFO L273 TraceCheckUtils]: 58: Hoare triple {21389#(<= main_~a~0 13)} assume true; {21389#(<= main_~a~0 13)} is VALID [2018-11-18 22:49:03,702 INFO L273 TraceCheckUtils]: 59: Hoare triple {21389#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21389#(<= main_~a~0 13)} is VALID [2018-11-18 22:49:03,703 INFO L273 TraceCheckUtils]: 60: Hoare triple {21389#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21389#(<= main_~a~0 13)} is VALID [2018-11-18 22:49:03,703 INFO L273 TraceCheckUtils]: 61: Hoare triple {21389#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {21390#(<= main_~a~0 14)} is VALID [2018-11-18 22:49:03,704 INFO L273 TraceCheckUtils]: 62: Hoare triple {21390#(<= main_~a~0 14)} assume true; {21390#(<= main_~a~0 14)} is VALID [2018-11-18 22:49:03,704 INFO L273 TraceCheckUtils]: 63: Hoare triple {21390#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21390#(<= main_~a~0 14)} is VALID [2018-11-18 22:49:03,705 INFO L273 TraceCheckUtils]: 64: Hoare triple {21390#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21390#(<= main_~a~0 14)} is VALID [2018-11-18 22:49:03,705 INFO L273 TraceCheckUtils]: 65: Hoare triple {21390#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {21391#(<= main_~a~0 15)} is VALID [2018-11-18 22:49:03,706 INFO L273 TraceCheckUtils]: 66: Hoare triple {21391#(<= main_~a~0 15)} assume true; {21391#(<= main_~a~0 15)} is VALID [2018-11-18 22:49:03,706 INFO L273 TraceCheckUtils]: 67: Hoare triple {21391#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21391#(<= main_~a~0 15)} is VALID [2018-11-18 22:49:03,707 INFO L273 TraceCheckUtils]: 68: Hoare triple {21391#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21391#(<= main_~a~0 15)} is VALID [2018-11-18 22:49:03,707 INFO L273 TraceCheckUtils]: 69: Hoare triple {21391#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {21392#(<= main_~a~0 16)} is VALID [2018-11-18 22:49:03,708 INFO L273 TraceCheckUtils]: 70: Hoare triple {21392#(<= main_~a~0 16)} assume true; {21392#(<= main_~a~0 16)} is VALID [2018-11-18 22:49:03,708 INFO L273 TraceCheckUtils]: 71: Hoare triple {21392#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21392#(<= main_~a~0 16)} is VALID [2018-11-18 22:49:03,709 INFO L273 TraceCheckUtils]: 72: Hoare triple {21392#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21392#(<= main_~a~0 16)} is VALID [2018-11-18 22:49:03,709 INFO L273 TraceCheckUtils]: 73: Hoare triple {21392#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {21393#(<= main_~a~0 17)} is VALID [2018-11-18 22:49:03,710 INFO L273 TraceCheckUtils]: 74: Hoare triple {21393#(<= main_~a~0 17)} assume true; {21393#(<= main_~a~0 17)} is VALID [2018-11-18 22:49:03,710 INFO L273 TraceCheckUtils]: 75: Hoare triple {21393#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21393#(<= main_~a~0 17)} is VALID [2018-11-18 22:49:03,711 INFO L273 TraceCheckUtils]: 76: Hoare triple {21393#(<= main_~a~0 17)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21393#(<= main_~a~0 17)} is VALID [2018-11-18 22:49:03,712 INFO L273 TraceCheckUtils]: 77: Hoare triple {21393#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {21394#(<= main_~a~0 18)} is VALID [2018-11-18 22:49:03,712 INFO L273 TraceCheckUtils]: 78: Hoare triple {21394#(<= main_~a~0 18)} assume true; {21394#(<= main_~a~0 18)} is VALID [2018-11-18 22:49:03,712 INFO L273 TraceCheckUtils]: 79: Hoare triple {21394#(<= main_~a~0 18)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21394#(<= main_~a~0 18)} is VALID [2018-11-18 22:49:03,713 INFO L273 TraceCheckUtils]: 80: Hoare triple {21394#(<= main_~a~0 18)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21394#(<= main_~a~0 18)} is VALID [2018-11-18 22:49:03,714 INFO L273 TraceCheckUtils]: 81: Hoare triple {21394#(<= main_~a~0 18)} ~a~0 := 1 + ~a~0; {21395#(<= main_~a~0 19)} is VALID [2018-11-18 22:49:03,714 INFO L273 TraceCheckUtils]: 82: Hoare triple {21395#(<= main_~a~0 19)} assume true; {21395#(<= main_~a~0 19)} is VALID [2018-11-18 22:49:03,715 INFO L273 TraceCheckUtils]: 83: Hoare triple {21395#(<= main_~a~0 19)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21395#(<= main_~a~0 19)} is VALID [2018-11-18 22:49:03,715 INFO L273 TraceCheckUtils]: 84: Hoare triple {21395#(<= main_~a~0 19)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21395#(<= main_~a~0 19)} is VALID [2018-11-18 22:49:03,716 INFO L273 TraceCheckUtils]: 85: Hoare triple {21395#(<= main_~a~0 19)} ~a~0 := 1 + ~a~0; {21396#(<= main_~a~0 20)} is VALID [2018-11-18 22:49:03,716 INFO L273 TraceCheckUtils]: 86: Hoare triple {21396#(<= main_~a~0 20)} assume true; {21396#(<= main_~a~0 20)} is VALID [2018-11-18 22:49:03,717 INFO L273 TraceCheckUtils]: 87: Hoare triple {21396#(<= main_~a~0 20)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21396#(<= main_~a~0 20)} is VALID [2018-11-18 22:49:03,717 INFO L273 TraceCheckUtils]: 88: Hoare triple {21396#(<= main_~a~0 20)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21396#(<= main_~a~0 20)} is VALID [2018-11-18 22:49:03,718 INFO L273 TraceCheckUtils]: 89: Hoare triple {21396#(<= main_~a~0 20)} ~a~0 := 1 + ~a~0; {21397#(<= main_~a~0 21)} is VALID [2018-11-18 22:49:03,718 INFO L273 TraceCheckUtils]: 90: Hoare triple {21397#(<= main_~a~0 21)} assume true; {21397#(<= main_~a~0 21)} is VALID [2018-11-18 22:49:03,719 INFO L273 TraceCheckUtils]: 91: Hoare triple {21397#(<= main_~a~0 21)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21397#(<= main_~a~0 21)} is VALID [2018-11-18 22:49:03,719 INFO L273 TraceCheckUtils]: 92: Hoare triple {21397#(<= main_~a~0 21)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {21397#(<= main_~a~0 21)} is VALID [2018-11-18 22:49:03,720 INFO L273 TraceCheckUtils]: 93: Hoare triple {21397#(<= main_~a~0 21)} ~a~0 := 1 + ~a~0; {21398#(<= main_~a~0 22)} is VALID [2018-11-18 22:49:03,720 INFO L273 TraceCheckUtils]: 94: Hoare triple {21398#(<= main_~a~0 22)} assume true; {21398#(<= main_~a~0 22)} is VALID [2018-11-18 22:49:03,721 INFO L273 TraceCheckUtils]: 95: Hoare triple {21398#(<= main_~a~0 22)} assume !(~a~0 < 100000); {21375#false} is VALID [2018-11-18 22:49:03,721 INFO L273 TraceCheckUtils]: 96: Hoare triple {21375#false} ~a~0 := 0; {21375#false} is VALID [2018-11-18 22:49:03,721 INFO L273 TraceCheckUtils]: 97: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,721 INFO L273 TraceCheckUtils]: 98: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,722 INFO L273 TraceCheckUtils]: 99: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,722 INFO L273 TraceCheckUtils]: 100: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,722 INFO L273 TraceCheckUtils]: 101: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,722 INFO L273 TraceCheckUtils]: 102: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,722 INFO L273 TraceCheckUtils]: 103: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,722 INFO L273 TraceCheckUtils]: 104: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,723 INFO L273 TraceCheckUtils]: 105: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,723 INFO L273 TraceCheckUtils]: 106: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,723 INFO L273 TraceCheckUtils]: 107: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,723 INFO L273 TraceCheckUtils]: 108: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,723 INFO L273 TraceCheckUtils]: 109: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,723 INFO L273 TraceCheckUtils]: 110: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,724 INFO L273 TraceCheckUtils]: 111: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,724 INFO L273 TraceCheckUtils]: 112: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,724 INFO L273 TraceCheckUtils]: 113: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,724 INFO L273 TraceCheckUtils]: 114: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,724 INFO L273 TraceCheckUtils]: 115: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,724 INFO L273 TraceCheckUtils]: 116: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,724 INFO L273 TraceCheckUtils]: 117: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,724 INFO L273 TraceCheckUtils]: 118: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,725 INFO L273 TraceCheckUtils]: 119: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,725 INFO L273 TraceCheckUtils]: 120: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,725 INFO L273 TraceCheckUtils]: 121: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,725 INFO L273 TraceCheckUtils]: 122: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,725 INFO L273 TraceCheckUtils]: 123: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,725 INFO L273 TraceCheckUtils]: 124: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,725 INFO L273 TraceCheckUtils]: 125: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,725 INFO L273 TraceCheckUtils]: 126: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,725 INFO L273 TraceCheckUtils]: 127: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,726 INFO L273 TraceCheckUtils]: 128: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,726 INFO L273 TraceCheckUtils]: 129: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,726 INFO L273 TraceCheckUtils]: 130: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,726 INFO L273 TraceCheckUtils]: 131: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,726 INFO L273 TraceCheckUtils]: 132: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,726 INFO L273 TraceCheckUtils]: 133: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,726 INFO L273 TraceCheckUtils]: 134: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,726 INFO L273 TraceCheckUtils]: 135: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,726 INFO L273 TraceCheckUtils]: 136: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,727 INFO L273 TraceCheckUtils]: 137: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,727 INFO L273 TraceCheckUtils]: 138: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,727 INFO L273 TraceCheckUtils]: 139: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,727 INFO L273 TraceCheckUtils]: 140: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,727 INFO L273 TraceCheckUtils]: 141: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,727 INFO L273 TraceCheckUtils]: 142: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,727 INFO L273 TraceCheckUtils]: 143: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,727 INFO L273 TraceCheckUtils]: 144: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,727 INFO L273 TraceCheckUtils]: 145: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,727 INFO L273 TraceCheckUtils]: 146: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,728 INFO L273 TraceCheckUtils]: 147: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,728 INFO L273 TraceCheckUtils]: 148: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,728 INFO L273 TraceCheckUtils]: 149: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,728 INFO L273 TraceCheckUtils]: 150: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,728 INFO L273 TraceCheckUtils]: 151: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,728 INFO L273 TraceCheckUtils]: 152: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,728 INFO L273 TraceCheckUtils]: 153: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,728 INFO L273 TraceCheckUtils]: 154: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,728 INFO L273 TraceCheckUtils]: 155: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,728 INFO L273 TraceCheckUtils]: 156: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,729 INFO L273 TraceCheckUtils]: 157: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,729 INFO L273 TraceCheckUtils]: 158: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,729 INFO L273 TraceCheckUtils]: 159: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,729 INFO L273 TraceCheckUtils]: 160: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,729 INFO L273 TraceCheckUtils]: 161: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,729 INFO L273 TraceCheckUtils]: 162: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,729 INFO L273 TraceCheckUtils]: 163: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,729 INFO L273 TraceCheckUtils]: 164: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,729 INFO L273 TraceCheckUtils]: 165: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,730 INFO L273 TraceCheckUtils]: 166: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,730 INFO L273 TraceCheckUtils]: 167: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,730 INFO L273 TraceCheckUtils]: 168: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,730 INFO L273 TraceCheckUtils]: 169: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,730 INFO L273 TraceCheckUtils]: 170: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,730 INFO L273 TraceCheckUtils]: 171: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,730 INFO L273 TraceCheckUtils]: 172: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,730 INFO L273 TraceCheckUtils]: 173: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,731 INFO L273 TraceCheckUtils]: 174: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,731 INFO L273 TraceCheckUtils]: 175: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,731 INFO L273 TraceCheckUtils]: 176: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,731 INFO L273 TraceCheckUtils]: 177: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,731 INFO L273 TraceCheckUtils]: 178: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,731 INFO L273 TraceCheckUtils]: 179: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,731 INFO L273 TraceCheckUtils]: 180: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,732 INFO L273 TraceCheckUtils]: 181: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,732 INFO L273 TraceCheckUtils]: 182: Hoare triple {21375#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,732 INFO L273 TraceCheckUtils]: 183: Hoare triple {21375#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {21375#false} is VALID [2018-11-18 22:49:03,732 INFO L273 TraceCheckUtils]: 184: Hoare triple {21375#false} ~a~0 := 1 + ~a~0; {21375#false} is VALID [2018-11-18 22:49:03,732 INFO L273 TraceCheckUtils]: 185: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,732 INFO L273 TraceCheckUtils]: 186: Hoare triple {21375#false} assume !(~a~0 < 100000); {21375#false} is VALID [2018-11-18 22:49:03,732 INFO L273 TraceCheckUtils]: 187: Hoare triple {21375#false} havoc ~x~0;~x~0 := 0; {21375#false} is VALID [2018-11-18 22:49:03,732 INFO L273 TraceCheckUtils]: 188: Hoare triple {21375#false} assume true; {21375#false} is VALID [2018-11-18 22:49:03,732 INFO L273 TraceCheckUtils]: 189: Hoare triple {21375#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {21375#false} is VALID [2018-11-18 22:49:03,733 INFO L256 TraceCheckUtils]: 190: Hoare triple {21375#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {21375#false} is VALID [2018-11-18 22:49:03,733 INFO L273 TraceCheckUtils]: 191: Hoare triple {21375#false} ~cond := #in~cond; {21375#false} is VALID [2018-11-18 22:49:03,733 INFO L273 TraceCheckUtils]: 192: Hoare triple {21375#false} assume 0 == ~cond; {21375#false} is VALID [2018-11-18 22:49:03,733 INFO L273 TraceCheckUtils]: 193: Hoare triple {21375#false} assume !false; {21375#false} is VALID [2018-11-18 22:49:03,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-11-18 22:49:03,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 22:49:03,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-18 22:49:03,776 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 194 [2018-11-18 22:49:03,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 22:49:03,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-18 22:49:03,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:49:03,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 22:49:03,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 22:49:03,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:49:03,881 INFO L87 Difference]: Start difference. First operand 205 states and 253 transitions. Second operand 26 states. [2018-11-18 22:49:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:49:04,908 INFO L93 Difference]: Finished difference Result 326 states and 405 transitions. [2018-11-18 22:49:04,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 22:49:04,908 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 194 [2018-11-18 22:49:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 22:49:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:49:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 298 transitions. [2018-11-18 22:49:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 22:49:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 298 transitions. [2018-11-18 22:49:04,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 298 transitions. [2018-11-18 22:49:05,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 22:49:05,171 INFO L225 Difference]: With dead ends: 326 [2018-11-18 22:49:05,171 INFO L226 Difference]: Without dead ends: 217 [2018-11-18 22:49:05,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-18 22:49:05,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-18 22:49:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2018-11-18 22:49:05,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 22:49:05,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand 213 states. [2018-11-18 22:49:05,214 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 213 states. [2018-11-18 22:49:05,214 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 213 states. [2018-11-18 22:49:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:49:05,219 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2018-11-18 22:49:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 269 transitions. [2018-11-18 22:49:05,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:49:05,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:49:05,220 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 217 states. [2018-11-18 22:49:05,220 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 217 states. [2018-11-18 22:49:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 22:49:05,224 INFO L93 Difference]: Finished difference Result 217 states and 269 transitions. [2018-11-18 22:49:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 269 transitions. [2018-11-18 22:49:05,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 22:49:05,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 22:49:05,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 22:49:05,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 22:49:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-11-18 22:49:05,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 263 transitions. [2018-11-18 22:49:05,229 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 263 transitions. Word has length 194 [2018-11-18 22:49:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 22:49:05,230 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 263 transitions. [2018-11-18 22:49:05,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 22:49:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 263 transitions. [2018-11-18 22:49:05,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-18 22:49:05,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 22:49:05,231 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 22:49:05,231 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 22:49:05,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 22:49:05,232 INFO L82 PathProgramCache]: Analyzing trace with hash -522712877, now seen corresponding path program 23 times [2018-11-18 22:49:05,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 22:49:05,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 22:49:05,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:49:05,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 22:49:05,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 22:49:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 22:49:05,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {23096#true} call ULTIMATE.init(); {23096#true} is VALID [2018-11-18 22:49:05,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {23096#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23096#true} is VALID [2018-11-18 22:49:05,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {23096#true} assume true; {23096#true} is VALID [2018-11-18 22:49:05,720 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23096#true} {23096#true} #95#return; {23096#true} is VALID [2018-11-18 22:49:05,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {23096#true} call #t~ret8 := main(); {23096#true} is VALID [2018-11-18 22:49:05,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {23096#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000);~a~0 := 0;~b~0 := 0;~c~0 := 0;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000); {23098#(= main_~a~0 0)} is VALID [2018-11-18 22:49:05,721 INFO L273 TraceCheckUtils]: 6: Hoare triple {23098#(= main_~a~0 0)} assume true; {23098#(= main_~a~0 0)} is VALID [2018-11-18 22:49:05,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {23098#(= main_~a~0 0)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23098#(= main_~a~0 0)} is VALID [2018-11-18 22:49:05,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {23098#(= main_~a~0 0)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23098#(= main_~a~0 0)} is VALID [2018-11-18 22:49:05,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {23098#(= main_~a~0 0)} ~a~0 := 1 + ~a~0; {23099#(<= main_~a~0 1)} is VALID [2018-11-18 22:49:05,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {23099#(<= main_~a~0 1)} assume true; {23099#(<= main_~a~0 1)} is VALID [2018-11-18 22:49:05,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {23099#(<= main_~a~0 1)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23099#(<= main_~a~0 1)} is VALID [2018-11-18 22:49:05,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {23099#(<= main_~a~0 1)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23099#(<= main_~a~0 1)} is VALID [2018-11-18 22:49:05,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {23099#(<= main_~a~0 1)} ~a~0 := 1 + ~a~0; {23100#(<= main_~a~0 2)} is VALID [2018-11-18 22:49:05,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {23100#(<= main_~a~0 2)} assume true; {23100#(<= main_~a~0 2)} is VALID [2018-11-18 22:49:05,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {23100#(<= main_~a~0 2)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23100#(<= main_~a~0 2)} is VALID [2018-11-18 22:49:05,725 INFO L273 TraceCheckUtils]: 16: Hoare triple {23100#(<= main_~a~0 2)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23100#(<= main_~a~0 2)} is VALID [2018-11-18 22:49:05,726 INFO L273 TraceCheckUtils]: 17: Hoare triple {23100#(<= main_~a~0 2)} ~a~0 := 1 + ~a~0; {23101#(<= main_~a~0 3)} is VALID [2018-11-18 22:49:05,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {23101#(<= main_~a~0 3)} assume true; {23101#(<= main_~a~0 3)} is VALID [2018-11-18 22:49:05,727 INFO L273 TraceCheckUtils]: 19: Hoare triple {23101#(<= main_~a~0 3)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23101#(<= main_~a~0 3)} is VALID [2018-11-18 22:49:05,727 INFO L273 TraceCheckUtils]: 20: Hoare triple {23101#(<= main_~a~0 3)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23101#(<= main_~a~0 3)} is VALID [2018-11-18 22:49:05,728 INFO L273 TraceCheckUtils]: 21: Hoare triple {23101#(<= main_~a~0 3)} ~a~0 := 1 + ~a~0; {23102#(<= main_~a~0 4)} is VALID [2018-11-18 22:49:05,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {23102#(<= main_~a~0 4)} assume true; {23102#(<= main_~a~0 4)} is VALID [2018-11-18 22:49:05,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {23102#(<= main_~a~0 4)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23102#(<= main_~a~0 4)} is VALID [2018-11-18 22:49:05,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {23102#(<= main_~a~0 4)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23102#(<= main_~a~0 4)} is VALID [2018-11-18 22:49:05,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {23102#(<= main_~a~0 4)} ~a~0 := 1 + ~a~0; {23103#(<= main_~a~0 5)} is VALID [2018-11-18 22:49:05,731 INFO L273 TraceCheckUtils]: 26: Hoare triple {23103#(<= main_~a~0 5)} assume true; {23103#(<= main_~a~0 5)} is VALID [2018-11-18 22:49:05,731 INFO L273 TraceCheckUtils]: 27: Hoare triple {23103#(<= main_~a~0 5)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23103#(<= main_~a~0 5)} is VALID [2018-11-18 22:49:05,731 INFO L273 TraceCheckUtils]: 28: Hoare triple {23103#(<= main_~a~0 5)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23103#(<= main_~a~0 5)} is VALID [2018-11-18 22:49:05,732 INFO L273 TraceCheckUtils]: 29: Hoare triple {23103#(<= main_~a~0 5)} ~a~0 := 1 + ~a~0; {23104#(<= main_~a~0 6)} is VALID [2018-11-18 22:49:05,733 INFO L273 TraceCheckUtils]: 30: Hoare triple {23104#(<= main_~a~0 6)} assume true; {23104#(<= main_~a~0 6)} is VALID [2018-11-18 22:49:05,733 INFO L273 TraceCheckUtils]: 31: Hoare triple {23104#(<= main_~a~0 6)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23104#(<= main_~a~0 6)} is VALID [2018-11-18 22:49:05,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {23104#(<= main_~a~0 6)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23104#(<= main_~a~0 6)} is VALID [2018-11-18 22:49:05,734 INFO L273 TraceCheckUtils]: 33: Hoare triple {23104#(<= main_~a~0 6)} ~a~0 := 1 + ~a~0; {23105#(<= main_~a~0 7)} is VALID [2018-11-18 22:49:05,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {23105#(<= main_~a~0 7)} assume true; {23105#(<= main_~a~0 7)} is VALID [2018-11-18 22:49:05,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {23105#(<= main_~a~0 7)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23105#(<= main_~a~0 7)} is VALID [2018-11-18 22:49:05,736 INFO L273 TraceCheckUtils]: 36: Hoare triple {23105#(<= main_~a~0 7)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23105#(<= main_~a~0 7)} is VALID [2018-11-18 22:49:05,736 INFO L273 TraceCheckUtils]: 37: Hoare triple {23105#(<= main_~a~0 7)} ~a~0 := 1 + ~a~0; {23106#(<= main_~a~0 8)} is VALID [2018-11-18 22:49:05,737 INFO L273 TraceCheckUtils]: 38: Hoare triple {23106#(<= main_~a~0 8)} assume true; {23106#(<= main_~a~0 8)} is VALID [2018-11-18 22:49:05,737 INFO L273 TraceCheckUtils]: 39: Hoare triple {23106#(<= main_~a~0 8)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23106#(<= main_~a~0 8)} is VALID [2018-11-18 22:49:05,738 INFO L273 TraceCheckUtils]: 40: Hoare triple {23106#(<= main_~a~0 8)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23106#(<= main_~a~0 8)} is VALID [2018-11-18 22:49:05,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {23106#(<= main_~a~0 8)} ~a~0 := 1 + ~a~0; {23107#(<= main_~a~0 9)} is VALID [2018-11-18 22:49:05,739 INFO L273 TraceCheckUtils]: 42: Hoare triple {23107#(<= main_~a~0 9)} assume true; {23107#(<= main_~a~0 9)} is VALID [2018-11-18 22:49:05,739 INFO L273 TraceCheckUtils]: 43: Hoare triple {23107#(<= main_~a~0 9)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23107#(<= main_~a~0 9)} is VALID [2018-11-18 22:49:05,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {23107#(<= main_~a~0 9)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23107#(<= main_~a~0 9)} is VALID [2018-11-18 22:49:05,740 INFO L273 TraceCheckUtils]: 45: Hoare triple {23107#(<= main_~a~0 9)} ~a~0 := 1 + ~a~0; {23108#(<= main_~a~0 10)} is VALID [2018-11-18 22:49:05,741 INFO L273 TraceCheckUtils]: 46: Hoare triple {23108#(<= main_~a~0 10)} assume true; {23108#(<= main_~a~0 10)} is VALID [2018-11-18 22:49:05,741 INFO L273 TraceCheckUtils]: 47: Hoare triple {23108#(<= main_~a~0 10)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23108#(<= main_~a~0 10)} is VALID [2018-11-18 22:49:05,742 INFO L273 TraceCheckUtils]: 48: Hoare triple {23108#(<= main_~a~0 10)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23108#(<= main_~a~0 10)} is VALID [2018-11-18 22:49:05,742 INFO L273 TraceCheckUtils]: 49: Hoare triple {23108#(<= main_~a~0 10)} ~a~0 := 1 + ~a~0; {23109#(<= main_~a~0 11)} is VALID [2018-11-18 22:49:05,743 INFO L273 TraceCheckUtils]: 50: Hoare triple {23109#(<= main_~a~0 11)} assume true; {23109#(<= main_~a~0 11)} is VALID [2018-11-18 22:49:05,743 INFO L273 TraceCheckUtils]: 51: Hoare triple {23109#(<= main_~a~0 11)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23109#(<= main_~a~0 11)} is VALID [2018-11-18 22:49:05,744 INFO L273 TraceCheckUtils]: 52: Hoare triple {23109#(<= main_~a~0 11)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23109#(<= main_~a~0 11)} is VALID [2018-11-18 22:49:05,745 INFO L273 TraceCheckUtils]: 53: Hoare triple {23109#(<= main_~a~0 11)} ~a~0 := 1 + ~a~0; {23110#(<= main_~a~0 12)} is VALID [2018-11-18 22:49:05,745 INFO L273 TraceCheckUtils]: 54: Hoare triple {23110#(<= main_~a~0 12)} assume true; {23110#(<= main_~a~0 12)} is VALID [2018-11-18 22:49:05,745 INFO L273 TraceCheckUtils]: 55: Hoare triple {23110#(<= main_~a~0 12)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23110#(<= main_~a~0 12)} is VALID [2018-11-18 22:49:05,746 INFO L273 TraceCheckUtils]: 56: Hoare triple {23110#(<= main_~a~0 12)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23110#(<= main_~a~0 12)} is VALID [2018-11-18 22:49:05,747 INFO L273 TraceCheckUtils]: 57: Hoare triple {23110#(<= main_~a~0 12)} ~a~0 := 1 + ~a~0; {23111#(<= main_~a~0 13)} is VALID [2018-11-18 22:49:05,747 INFO L273 TraceCheckUtils]: 58: Hoare triple {23111#(<= main_~a~0 13)} assume true; {23111#(<= main_~a~0 13)} is VALID [2018-11-18 22:49:05,748 INFO L273 TraceCheckUtils]: 59: Hoare triple {23111#(<= main_~a~0 13)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23111#(<= main_~a~0 13)} is VALID [2018-11-18 22:49:05,748 INFO L273 TraceCheckUtils]: 60: Hoare triple {23111#(<= main_~a~0 13)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23111#(<= main_~a~0 13)} is VALID [2018-11-18 22:49:05,749 INFO L273 TraceCheckUtils]: 61: Hoare triple {23111#(<= main_~a~0 13)} ~a~0 := 1 + ~a~0; {23112#(<= main_~a~0 14)} is VALID [2018-11-18 22:49:05,749 INFO L273 TraceCheckUtils]: 62: Hoare triple {23112#(<= main_~a~0 14)} assume true; {23112#(<= main_~a~0 14)} is VALID [2018-11-18 22:49:05,750 INFO L273 TraceCheckUtils]: 63: Hoare triple {23112#(<= main_~a~0 14)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23112#(<= main_~a~0 14)} is VALID [2018-11-18 22:49:05,750 INFO L273 TraceCheckUtils]: 64: Hoare triple {23112#(<= main_~a~0 14)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23112#(<= main_~a~0 14)} is VALID [2018-11-18 22:49:05,751 INFO L273 TraceCheckUtils]: 65: Hoare triple {23112#(<= main_~a~0 14)} ~a~0 := 1 + ~a~0; {23113#(<= main_~a~0 15)} is VALID [2018-11-18 22:49:05,751 INFO L273 TraceCheckUtils]: 66: Hoare triple {23113#(<= main_~a~0 15)} assume true; {23113#(<= main_~a~0 15)} is VALID [2018-11-18 22:49:05,752 INFO L273 TraceCheckUtils]: 67: Hoare triple {23113#(<= main_~a~0 15)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23113#(<= main_~a~0 15)} is VALID [2018-11-18 22:49:05,752 INFO L273 TraceCheckUtils]: 68: Hoare triple {23113#(<= main_~a~0 15)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23113#(<= main_~a~0 15)} is VALID [2018-11-18 22:49:05,753 INFO L273 TraceCheckUtils]: 69: Hoare triple {23113#(<= main_~a~0 15)} ~a~0 := 1 + ~a~0; {23114#(<= main_~a~0 16)} is VALID [2018-11-18 22:49:05,753 INFO L273 TraceCheckUtils]: 70: Hoare triple {23114#(<= main_~a~0 16)} assume true; {23114#(<= main_~a~0 16)} is VALID [2018-11-18 22:49:05,754 INFO L273 TraceCheckUtils]: 71: Hoare triple {23114#(<= main_~a~0 16)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23114#(<= main_~a~0 16)} is VALID [2018-11-18 22:49:05,754 INFO L273 TraceCheckUtils]: 72: Hoare triple {23114#(<= main_~a~0 16)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23114#(<= main_~a~0 16)} is VALID [2018-11-18 22:49:05,755 INFO L273 TraceCheckUtils]: 73: Hoare triple {23114#(<= main_~a~0 16)} ~a~0 := 1 + ~a~0; {23115#(<= main_~a~0 17)} is VALID [2018-11-18 22:49:05,755 INFO L273 TraceCheckUtils]: 74: Hoare triple {23115#(<= main_~a~0 17)} assume true; {23115#(<= main_~a~0 17)} is VALID [2018-11-18 22:49:05,756 INFO L273 TraceCheckUtils]: 75: Hoare triple {23115#(<= main_~a~0 17)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23115#(<= main_~a~0 17)} is VALID [2018-11-18 22:49:05,756 INFO L273 TraceCheckUtils]: 76: Hoare triple {23115#(<= main_~a~0 17)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23115#(<= main_~a~0 17)} is VALID [2018-11-18 22:49:05,757 INFO L273 TraceCheckUtils]: 77: Hoare triple {23115#(<= main_~a~0 17)} ~a~0 := 1 + ~a~0; {23116#(<= main_~a~0 18)} is VALID [2018-11-18 22:49:05,757 INFO L273 TraceCheckUtils]: 78: Hoare triple {23116#(<= main_~a~0 18)} assume true; {23116#(<= main_~a~0 18)} is VALID [2018-11-18 22:49:05,758 INFO L273 TraceCheckUtils]: 79: Hoare triple {23116#(<= main_~a~0 18)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23116#(<= main_~a~0 18)} is VALID [2018-11-18 22:49:05,758 INFO L273 TraceCheckUtils]: 80: Hoare triple {23116#(<= main_~a~0 18)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23116#(<= main_~a~0 18)} is VALID [2018-11-18 22:49:05,759 INFO L273 TraceCheckUtils]: 81: Hoare triple {23116#(<= main_~a~0 18)} ~a~0 := 1 + ~a~0; {23117#(<= main_~a~0 19)} is VALID [2018-11-18 22:49:05,759 INFO L273 TraceCheckUtils]: 82: Hoare triple {23117#(<= main_~a~0 19)} assume true; {23117#(<= main_~a~0 19)} is VALID [2018-11-18 22:49:05,760 INFO L273 TraceCheckUtils]: 83: Hoare triple {23117#(<= main_~a~0 19)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23117#(<= main_~a~0 19)} is VALID [2018-11-18 22:49:05,760 INFO L273 TraceCheckUtils]: 84: Hoare triple {23117#(<= main_~a~0 19)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23117#(<= main_~a~0 19)} is VALID [2018-11-18 22:49:05,761 INFO L273 TraceCheckUtils]: 85: Hoare triple {23117#(<= main_~a~0 19)} ~a~0 := 1 + ~a~0; {23118#(<= main_~a~0 20)} is VALID [2018-11-18 22:49:05,761 INFO L273 TraceCheckUtils]: 86: Hoare triple {23118#(<= main_~a~0 20)} assume true; {23118#(<= main_~a~0 20)} is VALID [2018-11-18 22:49:05,762 INFO L273 TraceCheckUtils]: 87: Hoare triple {23118#(<= main_~a~0 20)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23118#(<= main_~a~0 20)} is VALID [2018-11-18 22:49:05,762 INFO L273 TraceCheckUtils]: 88: Hoare triple {23118#(<= main_~a~0 20)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23118#(<= main_~a~0 20)} is VALID [2018-11-18 22:49:05,763 INFO L273 TraceCheckUtils]: 89: Hoare triple {23118#(<= main_~a~0 20)} ~a~0 := 1 + ~a~0; {23119#(<= main_~a~0 21)} is VALID [2018-11-18 22:49:05,764 INFO L273 TraceCheckUtils]: 90: Hoare triple {23119#(<= main_~a~0 21)} assume true; {23119#(<= main_~a~0 21)} is VALID [2018-11-18 22:49:05,764 INFO L273 TraceCheckUtils]: 91: Hoare triple {23119#(<= main_~a~0 21)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23119#(<= main_~a~0 21)} is VALID [2018-11-18 22:49:05,764 INFO L273 TraceCheckUtils]: 92: Hoare triple {23119#(<= main_~a~0 21)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23119#(<= main_~a~0 21)} is VALID [2018-11-18 22:49:05,765 INFO L273 TraceCheckUtils]: 93: Hoare triple {23119#(<= main_~a~0 21)} ~a~0 := 1 + ~a~0; {23120#(<= main_~a~0 22)} is VALID [2018-11-18 22:49:05,766 INFO L273 TraceCheckUtils]: 94: Hoare triple {23120#(<= main_~a~0 22)} assume true; {23120#(<= main_~a~0 22)} is VALID [2018-11-18 22:49:05,766 INFO L273 TraceCheckUtils]: 95: Hoare triple {23120#(<= main_~a~0 22)} assume !!(~a~0 < 100000);call #t~mem0 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23120#(<= main_~a~0 22)} is VALID [2018-11-18 22:49:05,767 INFO L273 TraceCheckUtils]: 96: Hoare triple {23120#(<= main_~a~0 22)} assume #t~mem0 >= 0;havoc #t~mem0;call #t~mem1 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem1, ~#bb~0.base, ~#bb~0.offset + 4 * ~b~0, 4);havoc #t~mem1;~b~0 := 1 + ~b~0; {23120#(<= main_~a~0 22)} is VALID [2018-11-18 22:49:05,767 INFO L273 TraceCheckUtils]: 97: Hoare triple {23120#(<= main_~a~0 22)} ~a~0 := 1 + ~a~0; {23121#(<= main_~a~0 23)} is VALID [2018-11-18 22:49:05,768 INFO L273 TraceCheckUtils]: 98: Hoare triple {23121#(<= main_~a~0 23)} assume true; {23121#(<= main_~a~0 23)} is VALID [2018-11-18 22:49:05,768 INFO L273 TraceCheckUtils]: 99: Hoare triple {23121#(<= main_~a~0 23)} assume !(~a~0 < 100000); {23097#false} is VALID [2018-11-18 22:49:05,769 INFO L273 TraceCheckUtils]: 100: Hoare triple {23097#false} ~a~0 := 0; {23097#false} is VALID [2018-11-18 22:49:05,769 INFO L273 TraceCheckUtils]: 101: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,769 INFO L273 TraceCheckUtils]: 102: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,769 INFO L273 TraceCheckUtils]: 103: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,769 INFO L273 TraceCheckUtils]: 104: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,769 INFO L273 TraceCheckUtils]: 105: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,770 INFO L273 TraceCheckUtils]: 106: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,770 INFO L273 TraceCheckUtils]: 107: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,770 INFO L273 TraceCheckUtils]: 108: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,770 INFO L273 TraceCheckUtils]: 109: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,770 INFO L273 TraceCheckUtils]: 110: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,770 INFO L273 TraceCheckUtils]: 111: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,771 INFO L273 TraceCheckUtils]: 112: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,771 INFO L273 TraceCheckUtils]: 113: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,771 INFO L273 TraceCheckUtils]: 114: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,771 INFO L273 TraceCheckUtils]: 115: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,771 INFO L273 TraceCheckUtils]: 116: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,771 INFO L273 TraceCheckUtils]: 117: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,772 INFO L273 TraceCheckUtils]: 118: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,772 INFO L273 TraceCheckUtils]: 119: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,772 INFO L273 TraceCheckUtils]: 120: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,772 INFO L273 TraceCheckUtils]: 121: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,772 INFO L273 TraceCheckUtils]: 122: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,772 INFO L273 TraceCheckUtils]: 123: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,772 INFO L273 TraceCheckUtils]: 124: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,772 INFO L273 TraceCheckUtils]: 125: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,772 INFO L273 TraceCheckUtils]: 126: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,773 INFO L273 TraceCheckUtils]: 127: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,773 INFO L273 TraceCheckUtils]: 128: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,773 INFO L273 TraceCheckUtils]: 129: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,773 INFO L273 TraceCheckUtils]: 130: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,773 INFO L273 TraceCheckUtils]: 131: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,773 INFO L273 TraceCheckUtils]: 132: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,773 INFO L273 TraceCheckUtils]: 133: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,773 INFO L273 TraceCheckUtils]: 134: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,773 INFO L273 TraceCheckUtils]: 135: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,774 INFO L273 TraceCheckUtils]: 136: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,774 INFO L273 TraceCheckUtils]: 137: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,774 INFO L273 TraceCheckUtils]: 138: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,774 INFO L273 TraceCheckUtils]: 139: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,774 INFO L273 TraceCheckUtils]: 140: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,774 INFO L273 TraceCheckUtils]: 141: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,774 INFO L273 TraceCheckUtils]: 142: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,774 INFO L273 TraceCheckUtils]: 143: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,774 INFO L273 TraceCheckUtils]: 144: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,774 INFO L273 TraceCheckUtils]: 145: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,775 INFO L273 TraceCheckUtils]: 146: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,775 INFO L273 TraceCheckUtils]: 147: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,775 INFO L273 TraceCheckUtils]: 148: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,775 INFO L273 TraceCheckUtils]: 149: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,775 INFO L273 TraceCheckUtils]: 150: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,775 INFO L273 TraceCheckUtils]: 151: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,775 INFO L273 TraceCheckUtils]: 152: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,775 INFO L273 TraceCheckUtils]: 153: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,776 INFO L273 TraceCheckUtils]: 154: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,776 INFO L273 TraceCheckUtils]: 155: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,776 INFO L273 TraceCheckUtils]: 156: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,776 INFO L273 TraceCheckUtils]: 157: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,776 INFO L273 TraceCheckUtils]: 158: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,776 INFO L273 TraceCheckUtils]: 159: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,776 INFO L273 TraceCheckUtils]: 160: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,776 INFO L273 TraceCheckUtils]: 161: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,776 INFO L273 TraceCheckUtils]: 162: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,776 INFO L273 TraceCheckUtils]: 163: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,777 INFO L273 TraceCheckUtils]: 164: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,777 INFO L273 TraceCheckUtils]: 165: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,777 INFO L273 TraceCheckUtils]: 166: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,777 INFO L273 TraceCheckUtils]: 167: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,777 INFO L273 TraceCheckUtils]: 168: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,777 INFO L273 TraceCheckUtils]: 169: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,777 INFO L273 TraceCheckUtils]: 170: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,777 INFO L273 TraceCheckUtils]: 171: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,777 INFO L273 TraceCheckUtils]: 172: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,778 INFO L273 TraceCheckUtils]: 173: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,778 INFO L273 TraceCheckUtils]: 174: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,778 INFO L273 TraceCheckUtils]: 175: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,778 INFO L273 TraceCheckUtils]: 176: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,778 INFO L273 TraceCheckUtils]: 177: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,778 INFO L273 TraceCheckUtils]: 178: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,778 INFO L273 TraceCheckUtils]: 179: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,778 INFO L273 TraceCheckUtils]: 180: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,778 INFO L273 TraceCheckUtils]: 181: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,778 INFO L273 TraceCheckUtils]: 182: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,779 INFO L273 TraceCheckUtils]: 183: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,779 INFO L273 TraceCheckUtils]: 184: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,779 INFO L273 TraceCheckUtils]: 185: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,779 INFO L273 TraceCheckUtils]: 186: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,779 INFO L273 TraceCheckUtils]: 187: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,779 INFO L273 TraceCheckUtils]: 188: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,779 INFO L273 TraceCheckUtils]: 189: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,779 INFO L273 TraceCheckUtils]: 190: Hoare triple {23097#false} assume !!(~a~0 < 100000);call #t~mem2 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,779 INFO L273 TraceCheckUtils]: 191: Hoare triple {23097#false} assume #t~mem2 >= 0;havoc #t~mem2;call #t~mem3 := read~int(~#aa~0.base, ~#aa~0.offset + 4 * ~a~0, 4);call write~int(#t~mem3, ~#cc~0.base, ~#cc~0.offset + 4 * ~c~0, 4);havoc #t~mem3;~c~0 := 1 + ~c~0; {23097#false} is VALID [2018-11-18 22:49:05,779 INFO L273 TraceCheckUtils]: 192: Hoare triple {23097#false} ~a~0 := 1 + ~a~0; {23097#false} is VALID [2018-11-18 22:49:05,780 INFO L273 TraceCheckUtils]: 193: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,780 INFO L273 TraceCheckUtils]: 194: Hoare triple {23097#false} assume !(~a~0 < 100000); {23097#false} is VALID [2018-11-18 22:49:05,780 INFO L273 TraceCheckUtils]: 195: Hoare triple {23097#false} havoc ~x~0;~x~0 := 0; {23097#false} is VALID [2018-11-18 22:49:05,780 INFO L273 TraceCheckUtils]: 196: Hoare triple {23097#false} assume true; {23097#false} is VALID [2018-11-18 22:49:05,780 INFO L273 TraceCheckUtils]: 197: Hoare triple {23097#false} assume !!(~x~0 < ~b~0);call #t~mem5 := read~int(~#bb~0.base, ~#bb~0.offset + 4 * ~x~0, 4); {23097#false} is VALID [2018-11-18 22:49:05,780 INFO L256 TraceCheckUtils]: 198: Hoare triple {23097#false} call __VERIFIER_assert((if #t~mem5 >= 0 then 1 else 0)); {23097#false} is VALID [2018-11-18 22:49:05,780 INFO L273 TraceCheckUtils]: 199: Hoare triple {23097#false} ~cond := #in~cond; {23097#false} is VALID [2018-11-18 22:49:05,780 INFO L273 TraceCheckUtils]: 200: Hoare triple {23097#false} assume 0 == ~cond; {23097#false} is VALID [2018-11-18 22:49:05,780 INFO L273 TraceCheckUtils]: 201: Hoare triple {23097#false} assume !false; {23097#false} is VALID [2018-11-18 22:49:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 1058 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2018-11-18 22:49:05,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 22:49:05,801 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 22:49:05,810 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1