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_copyInitSum2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:51:58,426 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:51:58,428 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:51:58,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:51:58,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:51:58,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:51:58,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:51:58,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:51:58,447 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:51:58,448 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:51:58,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:51:58,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:51:58,450 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:51:58,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:51:58,457 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:51:58,461 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:51:58,462 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:51:58,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:51:58,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:51:58,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:51:58,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:51:58,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:51:58,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:51:58,477 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:51:58,477 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:51:58,478 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:51:58,479 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:51:58,480 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:51:58,481 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:51:58,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:51:58,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:51:58,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:51:58,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:51:58,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:51:58,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:51:58,485 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:51:58,485 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-14 16:51:58,502 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:51:58,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:51:58,503 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:51:58,504 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:51:58,504 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:51:58,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:51:58,505 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:51:58,505 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:51:58,505 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:51:58,505 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 16:51:58,506 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:51:58,506 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:51:58,506 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:51:58,506 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:51:58,506 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:51:58,507 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:51:58,507 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:51:58,507 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:51:58,507 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:51:58,507 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:51:58,508 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:51:58,508 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:51:58,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:51:58,508 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:51:58,508 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:51:58,509 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:51:58,509 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 16:51:58,509 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:51:58,509 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 16:51:58,509 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:51:58,554 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:51:58,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:51:58,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:51:58,572 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:51:58,573 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:51:58,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum2_false-unreach-call_ground.i [2018-11-14 16:51:58,643 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484024927/584c1a75ba234215b43e0b7c17cf9339/FLAGb136a7b45 [2018-11-14 16:51:59,063 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:51:59,064 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum2_false-unreach-call_ground.i [2018-11-14 16:51:59,070 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484024927/584c1a75ba234215b43e0b7c17cf9339/FLAGb136a7b45 [2018-11-14 16:51:59,083 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/484024927/584c1a75ba234215b43e0b7c17cf9339 [2018-11-14 16:51:59,093 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:51:59,094 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:51:59,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:51:59,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:51:59,099 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:51:59,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:51:59" (1/1) ... [2018-11-14 16:51:59,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aead24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59, skipping insertion in model container [2018-11-14 16:51:59,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:51:59" (1/1) ... [2018-11-14 16:51:59,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:51:59,134 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:51:59,346 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:51:59,352 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:51:59,390 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:51:59,423 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:51:59,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59 WrapperNode [2018-11-14 16:51:59,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:51:59,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:51:59,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:51:59,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:51:59,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59" (1/1) ... [2018-11-14 16:51:59,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59" (1/1) ... [2018-11-14 16:51:59,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59" (1/1) ... [2018-11-14 16:51:59,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59" (1/1) ... [2018-11-14 16:51:59,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59" (1/1) ... [2018-11-14 16:51:59,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59" (1/1) ... [2018-11-14 16:51:59,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59" (1/1) ... [2018-11-14 16:51:59,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:51:59,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:51:59,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:51:59,473 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:51:59,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59" (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-14 16:51:59,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:51:59,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:51:59,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:51:59,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:51:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:51:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:51:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:51:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:51:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 16:51:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 16:51:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:51:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:51:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:51:59,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 16:52:00,230 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:52:00,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:00 BoogieIcfgContainer [2018-11-14 16:52:00,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:52:00,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:52:00,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:52:00,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:52:00,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:51:59" (1/3) ... [2018-11-14 16:52:00,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3a9dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:52:00, skipping insertion in model container [2018-11-14 16:52:00,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:51:59" (2/3) ... [2018-11-14 16:52:00,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3a9dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:52:00, skipping insertion in model container [2018-11-14 16:52:00,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:52:00" (3/3) ... [2018-11-14 16:52:00,241 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum2_false-unreach-call_ground.i [2018-11-14 16:52:00,252 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:52:00,262 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:52:00,281 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:52:00,316 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:52:00,317 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:52:00,317 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:52:00,317 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:52:00,317 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:52:00,317 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:52:00,318 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:52:00,318 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:52:00,318 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:52:00,338 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 16:52:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:52:00,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:00,346 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-14 16:52:00,349 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:00,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:00,355 INFO L82 PathProgramCache]: Analyzing trace with hash -422982541, now seen corresponding path program 1 times [2018-11-14 16:52:00,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:00,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:00,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:00,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:00,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:00,524 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 16:52:00,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36#true} is VALID [2018-11-14 16:52:00,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 16:52:00,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #80#return; {36#true} is VALID [2018-11-14 16:52:00,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret6 := main(); {36#true} is VALID [2018-11-14 16:52:00,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {36#true} is VALID [2018-11-14 16:52:00,546 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 16:52:00,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-14 16:52:00,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 16:52:00,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} ~i~0 := 0; {37#false} is VALID [2018-11-14 16:52:00,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-14 16:52:00,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} havoc ~x~0;~x~0 := 0; {37#false} is VALID [2018-11-14 16:52:00,549 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 16:52:00,549 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {37#false} is VALID [2018-11-14 16:52:00,550 INFO L256 TraceCheckUtils]: 14: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {37#false} is VALID [2018-11-14 16:52:00,550 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-14 16:52:00,551 INFO L273 TraceCheckUtils]: 16: Hoare triple {37#false} assume ~cond == 0; {37#false} is VALID [2018-11-14 16:52:00,551 INFO L273 TraceCheckUtils]: 17: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 16:52:00,555 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-14 16:52:00,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:52:00,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:52:00,564 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 16:52:00,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:00,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:52:00,708 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-14 16:52:00,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:52:00,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:52:00,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:52:00,720 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 16:52:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:01,036 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2018-11-14 16:52:01,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:52:01,036 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 16:52:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:52:01,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 16:52:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:52:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 73 transitions. [2018-11-14 16:52:01,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 73 transitions. [2018-11-14 16:52:01,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:01,315 INFO L225 Difference]: With dead ends: 58 [2018-11-14 16:52:01,316 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 16:52:01,320 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-14 16:52:01,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 16:52:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 16:52:01,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:01,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 16:52:01,368 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:52:01,368 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:52:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:01,373 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-14 16:52:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 16:52:01,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:01,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:01,374 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:52:01,375 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:52:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:01,379 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-14 16:52:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 16:52:01,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:01,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:01,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:01,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:52:01,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-14 16:52:01,386 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 18 [2018-11-14 16:52:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:01,387 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-14 16:52:01,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:52:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-14 16:52:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:52:01,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:01,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:01,389 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:01,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1279953697, now seen corresponding path program 1 times [2018-11-14 16:52:01,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:01,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:01,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:01,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:01,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:01,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2018-11-14 16:52:01,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {207#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {207#true} is VALID [2018-11-14 16:52:01,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {207#true} assume true; {207#true} is VALID [2018-11-14 16:52:01,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {207#true} {207#true} #80#return; {207#true} is VALID [2018-11-14 16:52:01,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {207#true} call #t~ret6 := main(); {207#true} is VALID [2018-11-14 16:52:01,493 INFO L273 TraceCheckUtils]: 5: Hoare triple {207#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {209#(= main_~i~0 0)} is VALID [2018-11-14 16:52:01,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {209#(= main_~i~0 0)} assume true; {209#(= main_~i~0 0)} is VALID [2018-11-14 16:52:01,497 INFO L273 TraceCheckUtils]: 7: Hoare triple {209#(= main_~i~0 0)} assume !(~i~0 < 100000); {208#false} is VALID [2018-11-14 16:52:01,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {208#false} ~i~0 := 0; {208#false} is VALID [2018-11-14 16:52:01,498 INFO L273 TraceCheckUtils]: 9: Hoare triple {208#false} assume true; {208#false} is VALID [2018-11-14 16:52:01,498 INFO L273 TraceCheckUtils]: 10: Hoare triple {208#false} assume !(~i~0 < 100000); {208#false} is VALID [2018-11-14 16:52:01,498 INFO L273 TraceCheckUtils]: 11: Hoare triple {208#false} ~i~0 := 0; {208#false} is VALID [2018-11-14 16:52:01,499 INFO L273 TraceCheckUtils]: 12: Hoare triple {208#false} assume true; {208#false} is VALID [2018-11-14 16:52:01,499 INFO L273 TraceCheckUtils]: 13: Hoare triple {208#false} assume !(~i~0 < 100000); {208#false} is VALID [2018-11-14 16:52:01,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {208#false} havoc ~x~0;~x~0 := 0; {208#false} is VALID [2018-11-14 16:52:01,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {208#false} assume true; {208#false} is VALID [2018-11-14 16:52:01,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {208#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {208#false} is VALID [2018-11-14 16:52:01,500 INFO L256 TraceCheckUtils]: 17: Hoare triple {208#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {208#false} is VALID [2018-11-14 16:52:01,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2018-11-14 16:52:01,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {208#false} assume ~cond == 0; {208#false} is VALID [2018-11-14 16:52:01,501 INFO L273 TraceCheckUtils]: 20: Hoare triple {208#false} assume !false; {208#false} is VALID [2018-11-14 16:52:01,504 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-14 16:52:01,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:52:01,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:52:01,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:52:01,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:01,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:52:01,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:01,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:52:01,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:52:01,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:52:01,578 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 3 states. [2018-11-14 16:52:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:02,117 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-14 16:52:02,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:52:02,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-14 16:52:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:52:02,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-14 16:52:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:52:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-14 16:52:02,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-14 16:52:02,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:02,324 INFO L225 Difference]: With dead ends: 56 [2018-11-14 16:52:02,324 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 16:52:02,326 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-14 16:52:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 16:52:02,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-11-14 16:52:02,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:02,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 34 states. [2018-11-14 16:52:02,350 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 34 states. [2018-11-14 16:52:02,351 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 34 states. [2018-11-14 16:52:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:02,354 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-14 16:52:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-14 16:52:02,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:02,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:02,355 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 36 states. [2018-11-14 16:52:02,355 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 36 states. [2018-11-14 16:52:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:02,359 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-11-14 16:52:02,359 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2018-11-14 16:52:02,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:02,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:02,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:02,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 16:52:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-14 16:52:02,363 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 21 [2018-11-14 16:52:02,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:02,364 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-14 16:52:02,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:52:02,364 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-14 16:52:02,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:52:02,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:02,365 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:02,366 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:02,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:02,366 INFO L82 PathProgramCache]: Analyzing trace with hash 417422168, now seen corresponding path program 1 times [2018-11-14 16:52:02,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:02,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:02,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:02,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:02,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2018-11-14 16:52:02,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {405#true} is VALID [2018-11-14 16:52:02,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {405#true} assume true; {405#true} is VALID [2018-11-14 16:52:02,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} #80#return; {405#true} is VALID [2018-11-14 16:52:02,513 INFO L256 TraceCheckUtils]: 4: Hoare triple {405#true} call #t~ret6 := main(); {405#true} is VALID [2018-11-14 16:52:02,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {407#(= main_~i~0 0)} is VALID [2018-11-14 16:52:02,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {407#(= main_~i~0 0)} assume true; {407#(= main_~i~0 0)} is VALID [2018-11-14 16:52:02,516 INFO L273 TraceCheckUtils]: 7: Hoare triple {407#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {408#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:02,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#(<= main_~i~0 1)} assume true; {408#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:02,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#(<= main_~i~0 1)} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-14 16:52:02,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {406#false} ~i~0 := 0; {406#false} is VALID [2018-11-14 16:52:02,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 16:52:02,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {406#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {406#false} is VALID [2018-11-14 16:52:02,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {406#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {406#false} is VALID [2018-11-14 16:52:02,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 16:52:02,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {406#false} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-14 16:52:02,520 INFO L273 TraceCheckUtils]: 16: Hoare triple {406#false} ~i~0 := 0; {406#false} is VALID [2018-11-14 16:52:02,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 16:52:02,521 INFO L273 TraceCheckUtils]: 18: Hoare triple {406#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {406#false} is VALID [2018-11-14 16:52:02,521 INFO L273 TraceCheckUtils]: 19: Hoare triple {406#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {406#false} is VALID [2018-11-14 16:52:02,522 INFO L273 TraceCheckUtils]: 20: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 16:52:02,522 INFO L273 TraceCheckUtils]: 21: Hoare triple {406#false} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-14 16:52:02,522 INFO L273 TraceCheckUtils]: 22: Hoare triple {406#false} havoc ~x~0;~x~0 := 0; {406#false} is VALID [2018-11-14 16:52:02,523 INFO L273 TraceCheckUtils]: 23: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 16:52:02,523 INFO L273 TraceCheckUtils]: 24: Hoare triple {406#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {406#false} is VALID [2018-11-14 16:52:02,523 INFO L256 TraceCheckUtils]: 25: Hoare triple {406#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {406#false} is VALID [2018-11-14 16:52:02,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {406#false} ~cond := #in~cond; {406#false} is VALID [2018-11-14 16:52:02,524 INFO L273 TraceCheckUtils]: 27: Hoare triple {406#false} assume ~cond == 0; {406#false} is VALID [2018-11-14 16:52:02,524 INFO L273 TraceCheckUtils]: 28: Hoare triple {406#false} assume !false; {406#false} is VALID [2018-11-14 16:52:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:52:02,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:02,527 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-14 16:52:02,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:02,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:02,954 INFO L256 TraceCheckUtils]: 0: Hoare triple {405#true} call ULTIMATE.init(); {405#true} is VALID [2018-11-14 16:52:02,955 INFO L273 TraceCheckUtils]: 1: Hoare triple {405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {405#true} is VALID [2018-11-14 16:52:02,955 INFO L273 TraceCheckUtils]: 2: Hoare triple {405#true} assume true; {405#true} is VALID [2018-11-14 16:52:02,955 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {405#true} {405#true} #80#return; {405#true} is VALID [2018-11-14 16:52:02,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {405#true} call #t~ret6 := main(); {405#true} is VALID [2018-11-14 16:52:02,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {427#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:02,959 INFO L273 TraceCheckUtils]: 6: Hoare triple {427#(<= main_~i~0 0)} assume true; {427#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:02,960 INFO L273 TraceCheckUtils]: 7: Hoare triple {427#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {408#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:02,961 INFO L273 TraceCheckUtils]: 8: Hoare triple {408#(<= main_~i~0 1)} assume true; {408#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:02,961 INFO L273 TraceCheckUtils]: 9: Hoare triple {408#(<= main_~i~0 1)} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-14 16:52:02,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {406#false} ~i~0 := 0; {406#false} is VALID [2018-11-14 16:52:02,962 INFO L273 TraceCheckUtils]: 11: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 16:52:02,962 INFO L273 TraceCheckUtils]: 12: Hoare triple {406#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {406#false} is VALID [2018-11-14 16:52:02,962 INFO L273 TraceCheckUtils]: 13: Hoare triple {406#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {406#false} is VALID [2018-11-14 16:52:02,963 INFO L273 TraceCheckUtils]: 14: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 16:52:02,963 INFO L273 TraceCheckUtils]: 15: Hoare triple {406#false} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-14 16:52:02,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {406#false} ~i~0 := 0; {406#false} is VALID [2018-11-14 16:52:02,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 16:52:02,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {406#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {406#false} is VALID [2018-11-14 16:52:02,965 INFO L273 TraceCheckUtils]: 19: Hoare triple {406#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {406#false} is VALID [2018-11-14 16:52:02,965 INFO L273 TraceCheckUtils]: 20: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 16:52:02,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {406#false} assume !(~i~0 < 100000); {406#false} is VALID [2018-11-14 16:52:02,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {406#false} havoc ~x~0;~x~0 := 0; {406#false} is VALID [2018-11-14 16:52:02,966 INFO L273 TraceCheckUtils]: 23: Hoare triple {406#false} assume true; {406#false} is VALID [2018-11-14 16:52:02,967 INFO L273 TraceCheckUtils]: 24: Hoare triple {406#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {406#false} is VALID [2018-11-14 16:52:02,967 INFO L256 TraceCheckUtils]: 25: Hoare triple {406#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {406#false} is VALID [2018-11-14 16:52:02,967 INFO L273 TraceCheckUtils]: 26: Hoare triple {406#false} ~cond := #in~cond; {406#false} is VALID [2018-11-14 16:52:02,968 INFO L273 TraceCheckUtils]: 27: Hoare triple {406#false} assume ~cond == 0; {406#false} is VALID [2018-11-14 16:52:02,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {406#false} assume !false; {406#false} is VALID [2018-11-14 16:52:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:52:02,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:02,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 16:52:02,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-14 16:52:02,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:02,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:52:03,085 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-14 16:52:03,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:52:03,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:52:03,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:52:03,086 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 5 states. [2018-11-14 16:52:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:03,575 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2018-11-14 16:52:03,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:52:03,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-14 16:52:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:03,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:52:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-14 16:52:03,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:52:03,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-14 16:52:03,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2018-11-14 16:52:03,752 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:03,754 INFO L225 Difference]: With dead ends: 68 [2018-11-14 16:52:03,754 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:52:03,755 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-14 16:52:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:52:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-11-14 16:52:03,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:03,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 42 states. [2018-11-14 16:52:03,783 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 42 states. [2018-11-14 16:52:03,783 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 42 states. [2018-11-14 16:52:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:03,791 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-14 16:52:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-14 16:52:03,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:03,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:03,792 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 44 states. [2018-11-14 16:52:03,792 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 44 states. [2018-11-14 16:52:03,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:03,795 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-14 16:52:03,795 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-11-14 16:52:03,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:03,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:03,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:03,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:03,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 16:52:03,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-14 16:52:03,800 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 29 [2018-11-14 16:52:03,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:03,800 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-14 16:52:03,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:52:03,800 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-14 16:52:03,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 16:52:03,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:03,802 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:03,802 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:03,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:03,803 INFO L82 PathProgramCache]: Analyzing trace with hash 65711093, now seen corresponding path program 2 times [2018-11-14 16:52:03,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:03,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:03,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:03,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:03,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:03,936 INFO L256 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID [2018-11-14 16:52:03,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {733#true} is VALID [2018-11-14 16:52:03,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2018-11-14 16:52:03,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #80#return; {733#true} is VALID [2018-11-14 16:52:03,937 INFO L256 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret6 := main(); {733#true} is VALID [2018-11-14 16:52:03,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {735#(= main_~i~0 0)} is VALID [2018-11-14 16:52:03,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {735#(= main_~i~0 0)} assume true; {735#(= main_~i~0 0)} is VALID [2018-11-14 16:52:03,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {735#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {736#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:03,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {736#(<= main_~i~0 1)} assume true; {736#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:03,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {736#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {737#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:03,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {737#(<= main_~i~0 2)} assume true; {737#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:03,948 INFO L273 TraceCheckUtils]: 11: Hoare triple {737#(<= main_~i~0 2)} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-14 16:52:03,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {734#false} ~i~0 := 0; {734#false} is VALID [2018-11-14 16:52:03,948 INFO L273 TraceCheckUtils]: 13: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:03,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {734#false} is VALID [2018-11-14 16:52:03,949 INFO L273 TraceCheckUtils]: 15: Hoare triple {734#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {734#false} is VALID [2018-11-14 16:52:03,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:03,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {734#false} is VALID [2018-11-14 16:52:03,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {734#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {734#false} is VALID [2018-11-14 16:52:03,950 INFO L273 TraceCheckUtils]: 19: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:03,950 INFO L273 TraceCheckUtils]: 20: Hoare triple {734#false} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-14 16:52:03,950 INFO L273 TraceCheckUtils]: 21: Hoare triple {734#false} ~i~0 := 0; {734#false} is VALID [2018-11-14 16:52:03,951 INFO L273 TraceCheckUtils]: 22: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:03,951 INFO L273 TraceCheckUtils]: 23: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {734#false} is VALID [2018-11-14 16:52:03,951 INFO L273 TraceCheckUtils]: 24: Hoare triple {734#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {734#false} is VALID [2018-11-14 16:52:03,951 INFO L273 TraceCheckUtils]: 25: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:03,952 INFO L273 TraceCheckUtils]: 26: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {734#false} is VALID [2018-11-14 16:52:03,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {734#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {734#false} is VALID [2018-11-14 16:52:03,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:03,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {734#false} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-14 16:52:03,953 INFO L273 TraceCheckUtils]: 30: Hoare triple {734#false} havoc ~x~0;~x~0 := 0; {734#false} is VALID [2018-11-14 16:52:03,953 INFO L273 TraceCheckUtils]: 31: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:03,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {734#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {734#false} is VALID [2018-11-14 16:52:03,954 INFO L256 TraceCheckUtils]: 33: Hoare triple {734#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {734#false} is VALID [2018-11-14 16:52:03,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2018-11-14 16:52:03,954 INFO L273 TraceCheckUtils]: 35: Hoare triple {734#false} assume ~cond == 0; {734#false} is VALID [2018-11-14 16:52:03,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {734#false} assume !false; {734#false} is VALID [2018-11-14 16:52:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 16:52:03,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:03,958 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-14 16:52:03,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:52:03,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:52:04,000 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:04,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:04,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID [2018-11-14 16:52:04,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {733#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {733#true} is VALID [2018-11-14 16:52:04,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2018-11-14 16:52:04,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #80#return; {733#true} is VALID [2018-11-14 16:52:04,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret6 := main(); {733#true} is VALID [2018-11-14 16:52:04,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {733#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {756#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:04,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {756#(<= main_~i~0 0)} assume true; {756#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:04,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {756#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {736#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:04,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {736#(<= main_~i~0 1)} assume true; {736#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:04,158 INFO L273 TraceCheckUtils]: 9: Hoare triple {736#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {737#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:04,159 INFO L273 TraceCheckUtils]: 10: Hoare triple {737#(<= main_~i~0 2)} assume true; {737#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:04,160 INFO L273 TraceCheckUtils]: 11: Hoare triple {737#(<= main_~i~0 2)} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-14 16:52:04,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {734#false} ~i~0 := 0; {734#false} is VALID [2018-11-14 16:52:04,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:04,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {734#false} is VALID [2018-11-14 16:52:04,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {734#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {734#false} is VALID [2018-11-14 16:52:04,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:04,163 INFO L273 TraceCheckUtils]: 17: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {734#false} is VALID [2018-11-14 16:52:04,163 INFO L273 TraceCheckUtils]: 18: Hoare triple {734#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {734#false} is VALID [2018-11-14 16:52:04,163 INFO L273 TraceCheckUtils]: 19: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:04,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {734#false} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-14 16:52:04,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {734#false} ~i~0 := 0; {734#false} is VALID [2018-11-14 16:52:04,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:04,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {734#false} is VALID [2018-11-14 16:52:04,165 INFO L273 TraceCheckUtils]: 24: Hoare triple {734#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {734#false} is VALID [2018-11-14 16:52:04,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:04,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {734#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {734#false} is VALID [2018-11-14 16:52:04,166 INFO L273 TraceCheckUtils]: 27: Hoare triple {734#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {734#false} is VALID [2018-11-14 16:52:04,166 INFO L273 TraceCheckUtils]: 28: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:04,166 INFO L273 TraceCheckUtils]: 29: Hoare triple {734#false} assume !(~i~0 < 100000); {734#false} is VALID [2018-11-14 16:52:04,167 INFO L273 TraceCheckUtils]: 30: Hoare triple {734#false} havoc ~x~0;~x~0 := 0; {734#false} is VALID [2018-11-14 16:52:04,167 INFO L273 TraceCheckUtils]: 31: Hoare triple {734#false} assume true; {734#false} is VALID [2018-11-14 16:52:04,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {734#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {734#false} is VALID [2018-11-14 16:52:04,167 INFO L256 TraceCheckUtils]: 33: Hoare triple {734#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {734#false} is VALID [2018-11-14 16:52:04,168 INFO L273 TraceCheckUtils]: 34: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID [2018-11-14 16:52:04,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {734#false} assume ~cond == 0; {734#false} is VALID [2018-11-14 16:52:04,168 INFO L273 TraceCheckUtils]: 36: Hoare triple {734#false} assume !false; {734#false} is VALID [2018-11-14 16:52:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 16:52:04,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:04,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 16:52:04,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-14 16:52:04,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:04,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:52:04,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:04,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:52:04,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:52:04,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:52:04,237 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2018-11-14 16:52:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:04,497 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2018-11-14 16:52:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:52:04,498 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-11-14 16:52:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:04,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:52:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-14 16:52:04,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:52:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-14 16:52:04,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2018-11-14 16:52:04,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:04,620 INFO L225 Difference]: With dead ends: 82 [2018-11-14 16:52:04,621 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 16:52:04,621 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 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-14 16:52:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 16:52:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-14 16:52:04,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:04,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 50 states. [2018-11-14 16:52:04,667 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 50 states. [2018-11-14 16:52:04,667 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 50 states. [2018-11-14 16:52:04,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:04,670 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-14 16:52:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-14 16:52:04,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:04,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:04,671 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 52 states. [2018-11-14 16:52:04,671 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 52 states. [2018-11-14 16:52:04,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:04,674 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-14 16:52:04,674 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-14 16:52:04,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:04,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:04,675 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:04,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 16:52:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-11-14 16:52:04,678 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 37 [2018-11-14 16:52:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:04,678 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-11-14 16:52:04,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:52:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-11-14 16:52:04,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 16:52:04,680 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:04,680 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:04,681 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:04,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:04,681 INFO L82 PathProgramCache]: Analyzing trace with hash 645050220, now seen corresponding path program 3 times [2018-11-14 16:52:04,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:04,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:04,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:04,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:04,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:04,808 INFO L256 TraceCheckUtils]: 0: Hoare triple {1132#true} call ULTIMATE.init(); {1132#true} is VALID [2018-11-14 16:52:04,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {1132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1132#true} is VALID [2018-11-14 16:52:04,810 INFO L273 TraceCheckUtils]: 2: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-14 16:52:04,810 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1132#true} {1132#true} #80#return; {1132#true} is VALID [2018-11-14 16:52:04,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {1132#true} call #t~ret6 := main(); {1132#true} is VALID [2018-11-14 16:52:04,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {1132#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1134#(= main_~i~0 0)} is VALID [2018-11-14 16:52:04,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {1134#(= main_~i~0 0)} assume true; {1134#(= main_~i~0 0)} is VALID [2018-11-14 16:52:04,812 INFO L273 TraceCheckUtils]: 7: Hoare triple {1134#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1135#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:04,818 INFO L273 TraceCheckUtils]: 8: Hoare triple {1135#(<= main_~i~0 1)} assume true; {1135#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:04,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {1135#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1136#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:04,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {1136#(<= main_~i~0 2)} assume true; {1136#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:04,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {1136#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1137#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:04,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {1137#(<= main_~i~0 3)} assume true; {1137#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:04,828 INFO L273 TraceCheckUtils]: 13: Hoare triple {1137#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1133#false} is VALID [2018-11-14 16:52:04,828 INFO L273 TraceCheckUtils]: 14: Hoare triple {1133#false} ~i~0 := 0; {1133#false} is VALID [2018-11-14 16:52:04,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:04,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1133#false} is VALID [2018-11-14 16:52:04,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {1133#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1133#false} is VALID [2018-11-14 16:52:04,829 INFO L273 TraceCheckUtils]: 18: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:04,829 INFO L273 TraceCheckUtils]: 19: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1133#false} is VALID [2018-11-14 16:52:04,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {1133#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1133#false} is VALID [2018-11-14 16:52:04,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:04,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1133#false} is VALID [2018-11-14 16:52:04,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {1133#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1133#false} is VALID [2018-11-14 16:52:04,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:04,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {1133#false} assume !(~i~0 < 100000); {1133#false} is VALID [2018-11-14 16:52:04,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {1133#false} ~i~0 := 0; {1133#false} is VALID [2018-11-14 16:52:04,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:04,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1133#false} is VALID [2018-11-14 16:52:04,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {1133#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1133#false} is VALID [2018-11-14 16:52:04,832 INFO L273 TraceCheckUtils]: 30: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:04,832 INFO L273 TraceCheckUtils]: 31: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1133#false} is VALID [2018-11-14 16:52:04,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {1133#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1133#false} is VALID [2018-11-14 16:52:04,833 INFO L273 TraceCheckUtils]: 33: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:04,833 INFO L273 TraceCheckUtils]: 34: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1133#false} is VALID [2018-11-14 16:52:04,834 INFO L273 TraceCheckUtils]: 35: Hoare triple {1133#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1133#false} is VALID [2018-11-14 16:52:04,834 INFO L273 TraceCheckUtils]: 36: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:04,834 INFO L273 TraceCheckUtils]: 37: Hoare triple {1133#false} assume !(~i~0 < 100000); {1133#false} is VALID [2018-11-14 16:52:04,834 INFO L273 TraceCheckUtils]: 38: Hoare triple {1133#false} havoc ~x~0;~x~0 := 0; {1133#false} is VALID [2018-11-14 16:52:04,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:04,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {1133#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {1133#false} is VALID [2018-11-14 16:52:04,835 INFO L256 TraceCheckUtils]: 41: Hoare triple {1133#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1133#false} is VALID [2018-11-14 16:52:04,836 INFO L273 TraceCheckUtils]: 42: Hoare triple {1133#false} ~cond := #in~cond; {1133#false} is VALID [2018-11-14 16:52:04,836 INFO L273 TraceCheckUtils]: 43: Hoare triple {1133#false} assume ~cond == 0; {1133#false} is VALID [2018-11-14 16:52:04,836 INFO L273 TraceCheckUtils]: 44: Hoare triple {1133#false} assume !false; {1133#false} is VALID [2018-11-14 16:52:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-14 16:52:04,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:04,840 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-14 16:52:04,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:52:04,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 16:52:04,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:04,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:05,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {1132#true} call ULTIMATE.init(); {1132#true} is VALID [2018-11-14 16:52:05,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {1132#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1132#true} is VALID [2018-11-14 16:52:05,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-14 16:52:05,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1132#true} {1132#true} #80#return; {1132#true} is VALID [2018-11-14 16:52:05,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {1132#true} call #t~ret6 := main(); {1132#true} is VALID [2018-11-14 16:52:05,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {1132#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1132#true} is VALID [2018-11-14 16:52:05,074 INFO L273 TraceCheckUtils]: 6: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-14 16:52:05,074 INFO L273 TraceCheckUtils]: 7: Hoare triple {1132#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1132#true} is VALID [2018-11-14 16:52:05,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-14 16:52:05,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {1132#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1132#true} is VALID [2018-11-14 16:52:05,075 INFO L273 TraceCheckUtils]: 10: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-14 16:52:05,076 INFO L273 TraceCheckUtils]: 11: Hoare triple {1132#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1132#true} is VALID [2018-11-14 16:52:05,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {1132#true} assume true; {1132#true} is VALID [2018-11-14 16:52:05,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {1132#true} assume !(~i~0 < 100000); {1132#true} is VALID [2018-11-14 16:52:05,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {1132#true} ~i~0 := 0; {1183#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:05,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {1183#(<= main_~i~0 0)} assume true; {1183#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:05,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {1183#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1183#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:05,081 INFO L273 TraceCheckUtils]: 17: Hoare triple {1183#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1135#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:05,082 INFO L273 TraceCheckUtils]: 18: Hoare triple {1135#(<= main_~i~0 1)} assume true; {1135#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:05,083 INFO L273 TraceCheckUtils]: 19: Hoare triple {1135#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1135#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:05,083 INFO L273 TraceCheckUtils]: 20: Hoare triple {1135#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1136#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:05,084 INFO L273 TraceCheckUtils]: 21: Hoare triple {1136#(<= main_~i~0 2)} assume true; {1136#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:05,084 INFO L273 TraceCheckUtils]: 22: Hoare triple {1136#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1136#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:05,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {1136#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1137#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:05,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {1137#(<= main_~i~0 3)} assume true; {1137#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:05,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {1137#(<= main_~i~0 3)} assume !(~i~0 < 100000); {1133#false} is VALID [2018-11-14 16:52:05,090 INFO L273 TraceCheckUtils]: 26: Hoare triple {1133#false} ~i~0 := 0; {1133#false} is VALID [2018-11-14 16:52:05,090 INFO L273 TraceCheckUtils]: 27: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:05,091 INFO L273 TraceCheckUtils]: 28: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1133#false} is VALID [2018-11-14 16:52:05,091 INFO L273 TraceCheckUtils]: 29: Hoare triple {1133#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1133#false} is VALID [2018-11-14 16:52:05,091 INFO L273 TraceCheckUtils]: 30: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:05,091 INFO L273 TraceCheckUtils]: 31: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1133#false} is VALID [2018-11-14 16:52:05,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {1133#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1133#false} is VALID [2018-11-14 16:52:05,092 INFO L273 TraceCheckUtils]: 33: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:05,092 INFO L273 TraceCheckUtils]: 34: Hoare triple {1133#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1133#false} is VALID [2018-11-14 16:52:05,092 INFO L273 TraceCheckUtils]: 35: Hoare triple {1133#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1133#false} is VALID [2018-11-14 16:52:05,092 INFO L273 TraceCheckUtils]: 36: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:05,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {1133#false} assume !(~i~0 < 100000); {1133#false} is VALID [2018-11-14 16:52:05,093 INFO L273 TraceCheckUtils]: 38: Hoare triple {1133#false} havoc ~x~0;~x~0 := 0; {1133#false} is VALID [2018-11-14 16:52:05,093 INFO L273 TraceCheckUtils]: 39: Hoare triple {1133#false} assume true; {1133#false} is VALID [2018-11-14 16:52:05,093 INFO L273 TraceCheckUtils]: 40: Hoare triple {1133#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {1133#false} is VALID [2018-11-14 16:52:05,094 INFO L256 TraceCheckUtils]: 41: Hoare triple {1133#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1133#false} is VALID [2018-11-14 16:52:05,094 INFO L273 TraceCheckUtils]: 42: Hoare triple {1133#false} ~cond := #in~cond; {1133#false} is VALID [2018-11-14 16:52:05,094 INFO L273 TraceCheckUtils]: 43: Hoare triple {1133#false} assume ~cond == 0; {1133#false} is VALID [2018-11-14 16:52:05,094 INFO L273 TraceCheckUtils]: 44: Hoare triple {1133#false} assume !false; {1133#false} is VALID [2018-11-14 16:52:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-14 16:52:05,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:05,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 16:52:05,129 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-14 16:52:05,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:05,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:52:05,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:05,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:52:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:52:05,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:52:05,223 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 7 states. [2018-11-14 16:52:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:05,441 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2018-11-14 16:52:05,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:52:05,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-14 16:52:05,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:52:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2018-11-14 16:52:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:52:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2018-11-14 16:52:05,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2018-11-14 16:52:05,559 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-14 16:52:05,562 INFO L225 Difference]: With dead ends: 96 [2018-11-14 16:52:05,562 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 16:52:05,563 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 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-14 16:52:05,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 16:52:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-11-14 16:52:05,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:05,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 58 states. [2018-11-14 16:52:05,628 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 58 states. [2018-11-14 16:52:05,628 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 58 states. [2018-11-14 16:52:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:05,631 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-14 16:52:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-14 16:52:05,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:05,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:05,632 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 60 states. [2018-11-14 16:52:05,633 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 60 states. [2018-11-14 16:52:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:05,635 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-11-14 16:52:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-11-14 16:52:05,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:05,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:05,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:05,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:05,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 16:52:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-11-14 16:52:05,639 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 45 [2018-11-14 16:52:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:05,640 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-11-14 16:52:05,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:52:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-11-14 16:52:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 16:52:05,641 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:05,642 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:05,642 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:05,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1058860745, now seen corresponding path program 4 times [2018-11-14 16:52:05,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:05,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:05,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:05,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:05,821 INFO L256 TraceCheckUtils]: 0: Hoare triple {1602#true} call ULTIMATE.init(); {1602#true} is VALID [2018-11-14 16:52:05,822 INFO L273 TraceCheckUtils]: 1: Hoare triple {1602#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1602#true} is VALID [2018-11-14 16:52:05,822 INFO L273 TraceCheckUtils]: 2: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-14 16:52:05,822 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1602#true} {1602#true} #80#return; {1602#true} is VALID [2018-11-14 16:52:05,823 INFO L256 TraceCheckUtils]: 4: Hoare triple {1602#true} call #t~ret6 := main(); {1602#true} is VALID [2018-11-14 16:52:05,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {1602#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1604#(= main_~i~0 0)} is VALID [2018-11-14 16:52:05,824 INFO L273 TraceCheckUtils]: 6: Hoare triple {1604#(= main_~i~0 0)} assume true; {1604#(= main_~i~0 0)} is VALID [2018-11-14 16:52:05,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {1604#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1605#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:05,826 INFO L273 TraceCheckUtils]: 8: Hoare triple {1605#(<= main_~i~0 1)} assume true; {1605#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:05,826 INFO L273 TraceCheckUtils]: 9: Hoare triple {1605#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1606#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:05,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {1606#(<= main_~i~0 2)} assume true; {1606#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:05,843 INFO L273 TraceCheckUtils]: 11: Hoare triple {1606#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1607#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:05,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {1607#(<= main_~i~0 3)} assume true; {1607#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:05,844 INFO L273 TraceCheckUtils]: 13: Hoare triple {1607#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1608#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:05,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {1608#(<= main_~i~0 4)} assume true; {1608#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:05,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {1608#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1603#false} is VALID [2018-11-14 16:52:05,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {1603#false} ~i~0 := 0; {1603#false} is VALID [2018-11-14 16:52:05,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1603#false} is VALID [2018-11-14 16:52:05,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {1603#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1603#false} is VALID [2018-11-14 16:52:05,847 INFO L273 TraceCheckUtils]: 20: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1603#false} is VALID [2018-11-14 16:52:05,848 INFO L273 TraceCheckUtils]: 22: Hoare triple {1603#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1603#false} is VALID [2018-11-14 16:52:05,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,848 INFO L273 TraceCheckUtils]: 24: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1603#false} is VALID [2018-11-14 16:52:05,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {1603#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1603#false} is VALID [2018-11-14 16:52:05,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,849 INFO L273 TraceCheckUtils]: 27: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1603#false} is VALID [2018-11-14 16:52:05,849 INFO L273 TraceCheckUtils]: 28: Hoare triple {1603#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1603#false} is VALID [2018-11-14 16:52:05,849 INFO L273 TraceCheckUtils]: 29: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,849 INFO L273 TraceCheckUtils]: 30: Hoare triple {1603#false} assume !(~i~0 < 100000); {1603#false} is VALID [2018-11-14 16:52:05,850 INFO L273 TraceCheckUtils]: 31: Hoare triple {1603#false} ~i~0 := 0; {1603#false} is VALID [2018-11-14 16:52:05,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,850 INFO L273 TraceCheckUtils]: 33: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1603#false} is VALID [2018-11-14 16:52:05,850 INFO L273 TraceCheckUtils]: 34: Hoare triple {1603#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1603#false} is VALID [2018-11-14 16:52:05,851 INFO L273 TraceCheckUtils]: 35: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,851 INFO L273 TraceCheckUtils]: 36: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1603#false} is VALID [2018-11-14 16:52:05,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {1603#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1603#false} is VALID [2018-11-14 16:52:05,851 INFO L273 TraceCheckUtils]: 38: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1603#false} is VALID [2018-11-14 16:52:05,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {1603#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1603#false} is VALID [2018-11-14 16:52:05,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,852 INFO L273 TraceCheckUtils]: 42: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1603#false} is VALID [2018-11-14 16:52:05,852 INFO L273 TraceCheckUtils]: 43: Hoare triple {1603#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1603#false} is VALID [2018-11-14 16:52:05,853 INFO L273 TraceCheckUtils]: 44: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,853 INFO L273 TraceCheckUtils]: 45: Hoare triple {1603#false} assume !(~i~0 < 100000); {1603#false} is VALID [2018-11-14 16:52:05,853 INFO L273 TraceCheckUtils]: 46: Hoare triple {1603#false} havoc ~x~0;~x~0 := 0; {1603#false} is VALID [2018-11-14 16:52:05,853 INFO L273 TraceCheckUtils]: 47: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:05,853 INFO L273 TraceCheckUtils]: 48: Hoare triple {1603#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {1603#false} is VALID [2018-11-14 16:52:05,854 INFO L256 TraceCheckUtils]: 49: Hoare triple {1603#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1603#false} is VALID [2018-11-14 16:52:05,854 INFO L273 TraceCheckUtils]: 50: Hoare triple {1603#false} ~cond := #in~cond; {1603#false} is VALID [2018-11-14 16:52:05,855 INFO L273 TraceCheckUtils]: 51: Hoare triple {1603#false} assume ~cond == 0; {1603#false} is VALID [2018-11-14 16:52:05,855 INFO L273 TraceCheckUtils]: 52: Hoare triple {1603#false} assume !false; {1603#false} is VALID [2018-11-14 16:52:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-14 16:52:05,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:05,858 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-14 16:52:05,866 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:52:05,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:52:05,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:05,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:06,065 INFO L256 TraceCheckUtils]: 0: Hoare triple {1602#true} call ULTIMATE.init(); {1602#true} is VALID [2018-11-14 16:52:06,065 INFO L273 TraceCheckUtils]: 1: Hoare triple {1602#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1602#true} is VALID [2018-11-14 16:52:06,066 INFO L273 TraceCheckUtils]: 2: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-14 16:52:06,066 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1602#true} {1602#true} #80#return; {1602#true} is VALID [2018-11-14 16:52:06,066 INFO L256 TraceCheckUtils]: 4: Hoare triple {1602#true} call #t~ret6 := main(); {1602#true} is VALID [2018-11-14 16:52:06,067 INFO L273 TraceCheckUtils]: 5: Hoare triple {1602#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1602#true} is VALID [2018-11-14 16:52:06,067 INFO L273 TraceCheckUtils]: 6: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-14 16:52:06,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {1602#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1602#true} is VALID [2018-11-14 16:52:06,067 INFO L273 TraceCheckUtils]: 8: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-14 16:52:06,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {1602#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1602#true} is VALID [2018-11-14 16:52:06,068 INFO L273 TraceCheckUtils]: 10: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-14 16:52:06,068 INFO L273 TraceCheckUtils]: 11: Hoare triple {1602#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1602#true} is VALID [2018-11-14 16:52:06,068 INFO L273 TraceCheckUtils]: 12: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-14 16:52:06,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {1602#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1602#true} is VALID [2018-11-14 16:52:06,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {1602#true} assume true; {1602#true} is VALID [2018-11-14 16:52:06,069 INFO L273 TraceCheckUtils]: 15: Hoare triple {1602#true} assume !(~i~0 < 100000); {1602#true} is VALID [2018-11-14 16:52:06,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {1602#true} ~i~0 := 0; {1660#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:06,070 INFO L273 TraceCheckUtils]: 17: Hoare triple {1660#(<= main_~i~0 0)} assume true; {1660#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:06,070 INFO L273 TraceCheckUtils]: 18: Hoare triple {1660#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1660#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:06,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {1660#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1605#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:06,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {1605#(<= main_~i~0 1)} assume true; {1605#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:06,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {1605#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1605#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:06,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {1605#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1606#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:06,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {1606#(<= main_~i~0 2)} assume true; {1606#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:06,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {1606#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1606#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:06,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {1606#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1607#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:06,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {1607#(<= main_~i~0 3)} assume true; {1607#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:06,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {1607#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {1607#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:06,077 INFO L273 TraceCheckUtils]: 28: Hoare triple {1607#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1608#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:06,078 INFO L273 TraceCheckUtils]: 29: Hoare triple {1608#(<= main_~i~0 4)} assume true; {1608#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:06,079 INFO L273 TraceCheckUtils]: 30: Hoare triple {1608#(<= main_~i~0 4)} assume !(~i~0 < 100000); {1603#false} is VALID [2018-11-14 16:52:06,079 INFO L273 TraceCheckUtils]: 31: Hoare triple {1603#false} ~i~0 := 0; {1603#false} is VALID [2018-11-14 16:52:06,080 INFO L273 TraceCheckUtils]: 32: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:06,080 INFO L273 TraceCheckUtils]: 33: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1603#false} is VALID [2018-11-14 16:52:06,080 INFO L273 TraceCheckUtils]: 34: Hoare triple {1603#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1603#false} is VALID [2018-11-14 16:52:06,081 INFO L273 TraceCheckUtils]: 35: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:06,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1603#false} is VALID [2018-11-14 16:52:06,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {1603#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1603#false} is VALID [2018-11-14 16:52:06,082 INFO L273 TraceCheckUtils]: 38: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:06,082 INFO L273 TraceCheckUtils]: 39: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1603#false} is VALID [2018-11-14 16:52:06,082 INFO L273 TraceCheckUtils]: 40: Hoare triple {1603#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1603#false} is VALID [2018-11-14 16:52:06,082 INFO L273 TraceCheckUtils]: 41: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:06,082 INFO L273 TraceCheckUtils]: 42: Hoare triple {1603#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {1603#false} is VALID [2018-11-14 16:52:06,083 INFO L273 TraceCheckUtils]: 43: Hoare triple {1603#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1603#false} is VALID [2018-11-14 16:52:06,083 INFO L273 TraceCheckUtils]: 44: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:06,083 INFO L273 TraceCheckUtils]: 45: Hoare triple {1603#false} assume !(~i~0 < 100000); {1603#false} is VALID [2018-11-14 16:52:06,083 INFO L273 TraceCheckUtils]: 46: Hoare triple {1603#false} havoc ~x~0;~x~0 := 0; {1603#false} is VALID [2018-11-14 16:52:06,084 INFO L273 TraceCheckUtils]: 47: Hoare triple {1603#false} assume true; {1603#false} is VALID [2018-11-14 16:52:06,084 INFO L273 TraceCheckUtils]: 48: Hoare triple {1603#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {1603#false} is VALID [2018-11-14 16:52:06,084 INFO L256 TraceCheckUtils]: 49: Hoare triple {1603#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {1603#false} is VALID [2018-11-14 16:52:06,084 INFO L273 TraceCheckUtils]: 50: Hoare triple {1603#false} ~cond := #in~cond; {1603#false} is VALID [2018-11-14 16:52:06,085 INFO L273 TraceCheckUtils]: 51: Hoare triple {1603#false} assume ~cond == 0; {1603#false} is VALID [2018-11-14 16:52:06,085 INFO L273 TraceCheckUtils]: 52: Hoare triple {1603#false} assume !false; {1603#false} is VALID [2018-11-14 16:52:06,089 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-14 16:52:06,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:06,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 16:52:06,109 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-14 16:52:06,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:06,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:52:06,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:06,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:52:06,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:52:06,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:52:06,201 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 8 states. [2018-11-14 16:52:06,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:06,675 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-11-14 16:52:06,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:52:06,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-11-14 16:52:06,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:52:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2018-11-14 16:52:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:52:06,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 96 transitions. [2018-11-14 16:52:06,682 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 96 transitions. [2018-11-14 16:52:06,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:06,880 INFO L225 Difference]: With dead ends: 110 [2018-11-14 16:52:06,880 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 16:52:06,881 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 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-14 16:52:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 16:52:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-14 16:52:06,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:06,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2018-11-14 16:52:06,920 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2018-11-14 16:52:06,920 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2018-11-14 16:52:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:06,924 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-14 16:52:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 16:52:06,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:06,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:06,925 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2018-11-14 16:52:06,925 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2018-11-14 16:52:06,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:06,928 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-11-14 16:52:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2018-11-14 16:52:06,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:06,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:06,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:06,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 16:52:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-11-14 16:52:06,932 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 53 [2018-11-14 16:52:06,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:06,932 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-11-14 16:52:06,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:52:06,932 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-11-14 16:52:06,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 16:52:06,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:06,934 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:06,934 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:06,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:06,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1111296640, now seen corresponding path program 5 times [2018-11-14 16:52:06,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:06,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:06,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:06,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:07,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {2143#true} call ULTIMATE.init(); {2143#true} is VALID [2018-11-14 16:52:07,112 INFO L273 TraceCheckUtils]: 1: Hoare triple {2143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2143#true} is VALID [2018-11-14 16:52:07,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-14 16:52:07,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2143#true} {2143#true} #80#return; {2143#true} is VALID [2018-11-14 16:52:07,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {2143#true} call #t~ret6 := main(); {2143#true} is VALID [2018-11-14 16:52:07,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {2143#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2145#(= main_~i~0 0)} is VALID [2018-11-14 16:52:07,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {2145#(= main_~i~0 0)} assume true; {2145#(= main_~i~0 0)} is VALID [2018-11-14 16:52:07,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {2145#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2146#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:07,118 INFO L273 TraceCheckUtils]: 8: Hoare triple {2146#(<= main_~i~0 1)} assume true; {2146#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:07,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {2146#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2147#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:07,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {2147#(<= main_~i~0 2)} assume true; {2147#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:07,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {2147#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2148#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:07,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {2148#(<= main_~i~0 3)} assume true; {2148#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:07,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {2148#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2149#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:07,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {2149#(<= main_~i~0 4)} assume true; {2149#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:07,127 INFO L273 TraceCheckUtils]: 15: Hoare triple {2149#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2150#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:07,131 INFO L273 TraceCheckUtils]: 16: Hoare triple {2150#(<= main_~i~0 5)} assume true; {2150#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:07,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {2150#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2144#false} is VALID [2018-11-14 16:52:07,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {2144#false} ~i~0 := 0; {2144#false} is VALID [2018-11-14 16:52:07,134 INFO L273 TraceCheckUtils]: 19: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,135 INFO L273 TraceCheckUtils]: 20: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2144#false} is VALID [2018-11-14 16:52:07,135 INFO L273 TraceCheckUtils]: 21: Hoare triple {2144#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2144#false} is VALID [2018-11-14 16:52:07,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2144#false} is VALID [2018-11-14 16:52:07,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {2144#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2144#false} is VALID [2018-11-14 16:52:07,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2144#false} is VALID [2018-11-14 16:52:07,136 INFO L273 TraceCheckUtils]: 27: Hoare triple {2144#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2144#false} is VALID [2018-11-14 16:52:07,137 INFO L273 TraceCheckUtils]: 28: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,137 INFO L273 TraceCheckUtils]: 29: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2144#false} is VALID [2018-11-14 16:52:07,137 INFO L273 TraceCheckUtils]: 30: Hoare triple {2144#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2144#false} is VALID [2018-11-14 16:52:07,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2144#false} is VALID [2018-11-14 16:52:07,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {2144#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2144#false} is VALID [2018-11-14 16:52:07,138 INFO L273 TraceCheckUtils]: 34: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,138 INFO L273 TraceCheckUtils]: 35: Hoare triple {2144#false} assume !(~i~0 < 100000); {2144#false} is VALID [2018-11-14 16:52:07,138 INFO L273 TraceCheckUtils]: 36: Hoare triple {2144#false} ~i~0 := 0; {2144#false} is VALID [2018-11-14 16:52:07,139 INFO L273 TraceCheckUtils]: 37: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,139 INFO L273 TraceCheckUtils]: 38: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2144#false} is VALID [2018-11-14 16:52:07,139 INFO L273 TraceCheckUtils]: 39: Hoare triple {2144#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2144#false} is VALID [2018-11-14 16:52:07,139 INFO L273 TraceCheckUtils]: 40: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,140 INFO L273 TraceCheckUtils]: 41: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2144#false} is VALID [2018-11-14 16:52:07,140 INFO L273 TraceCheckUtils]: 42: Hoare triple {2144#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2144#false} is VALID [2018-11-14 16:52:07,140 INFO L273 TraceCheckUtils]: 43: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2144#false} is VALID [2018-11-14 16:52:07,141 INFO L273 TraceCheckUtils]: 45: Hoare triple {2144#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2144#false} is VALID [2018-11-14 16:52:07,141 INFO L273 TraceCheckUtils]: 46: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,141 INFO L273 TraceCheckUtils]: 47: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2144#false} is VALID [2018-11-14 16:52:07,141 INFO L273 TraceCheckUtils]: 48: Hoare triple {2144#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2144#false} is VALID [2018-11-14 16:52:07,142 INFO L273 TraceCheckUtils]: 49: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,142 INFO L273 TraceCheckUtils]: 50: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2144#false} is VALID [2018-11-14 16:52:07,142 INFO L273 TraceCheckUtils]: 51: Hoare triple {2144#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2144#false} is VALID [2018-11-14 16:52:07,142 INFO L273 TraceCheckUtils]: 52: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,142 INFO L273 TraceCheckUtils]: 53: Hoare triple {2144#false} assume !(~i~0 < 100000); {2144#false} is VALID [2018-11-14 16:52:07,143 INFO L273 TraceCheckUtils]: 54: Hoare triple {2144#false} havoc ~x~0;~x~0 := 0; {2144#false} is VALID [2018-11-14 16:52:07,143 INFO L273 TraceCheckUtils]: 55: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:07,143 INFO L273 TraceCheckUtils]: 56: Hoare triple {2144#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {2144#false} is VALID [2018-11-14 16:52:07,143 INFO L256 TraceCheckUtils]: 57: Hoare triple {2144#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2144#false} is VALID [2018-11-14 16:52:07,143 INFO L273 TraceCheckUtils]: 58: Hoare triple {2144#false} ~cond := #in~cond; {2144#false} is VALID [2018-11-14 16:52:07,144 INFO L273 TraceCheckUtils]: 59: Hoare triple {2144#false} assume ~cond == 0; {2144#false} is VALID [2018-11-14 16:52:07,144 INFO L273 TraceCheckUtils]: 60: Hoare triple {2144#false} assume !false; {2144#false} is VALID [2018-11-14 16:52:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-14 16:52:07,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:07,148 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-14 16:52:07,158 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:52:07,887 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 16:52:07,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:07,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:08,266 INFO L256 TraceCheckUtils]: 0: Hoare triple {2143#true} call ULTIMATE.init(); {2143#true} is VALID [2018-11-14 16:52:08,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {2143#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2143#true} is VALID [2018-11-14 16:52:08,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-14 16:52:08,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2143#true} {2143#true} #80#return; {2143#true} is VALID [2018-11-14 16:52:08,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {2143#true} call #t~ret6 := main(); {2143#true} is VALID [2018-11-14 16:52:08,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {2143#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2143#true} is VALID [2018-11-14 16:52:08,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-14 16:52:08,267 INFO L273 TraceCheckUtils]: 7: Hoare triple {2143#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2143#true} is VALID [2018-11-14 16:52:08,267 INFO L273 TraceCheckUtils]: 8: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-14 16:52:08,268 INFO L273 TraceCheckUtils]: 9: Hoare triple {2143#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2143#true} is VALID [2018-11-14 16:52:08,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-14 16:52:08,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {2143#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2143#true} is VALID [2018-11-14 16:52:08,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-14 16:52:08,269 INFO L273 TraceCheckUtils]: 13: Hoare triple {2143#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2143#true} is VALID [2018-11-14 16:52:08,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-14 16:52:08,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {2143#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2143#true} is VALID [2018-11-14 16:52:08,269 INFO L273 TraceCheckUtils]: 16: Hoare triple {2143#true} assume true; {2143#true} is VALID [2018-11-14 16:52:08,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {2143#true} assume !(~i~0 < 100000); {2143#true} is VALID [2018-11-14 16:52:08,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {2143#true} ~i~0 := 0; {2208#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:08,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {2208#(<= main_~i~0 0)} assume true; {2208#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:08,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {2208#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2208#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:08,276 INFO L273 TraceCheckUtils]: 21: Hoare triple {2208#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2146#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:08,276 INFO L273 TraceCheckUtils]: 22: Hoare triple {2146#(<= main_~i~0 1)} assume true; {2146#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:08,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {2146#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2146#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:08,278 INFO L273 TraceCheckUtils]: 24: Hoare triple {2146#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2147#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:08,280 INFO L273 TraceCheckUtils]: 25: Hoare triple {2147#(<= main_~i~0 2)} assume true; {2147#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:08,280 INFO L273 TraceCheckUtils]: 26: Hoare triple {2147#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2147#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:08,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {2147#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2148#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:08,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {2148#(<= main_~i~0 3)} assume true; {2148#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:08,286 INFO L273 TraceCheckUtils]: 29: Hoare triple {2148#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2148#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:08,286 INFO L273 TraceCheckUtils]: 30: Hoare triple {2148#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2149#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:08,288 INFO L273 TraceCheckUtils]: 31: Hoare triple {2149#(<= main_~i~0 4)} assume true; {2149#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:08,288 INFO L273 TraceCheckUtils]: 32: Hoare triple {2149#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2149#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:08,291 INFO L273 TraceCheckUtils]: 33: Hoare triple {2149#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2150#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:08,291 INFO L273 TraceCheckUtils]: 34: Hoare triple {2150#(<= main_~i~0 5)} assume true; {2150#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:08,293 INFO L273 TraceCheckUtils]: 35: Hoare triple {2150#(<= main_~i~0 5)} assume !(~i~0 < 100000); {2144#false} is VALID [2018-11-14 16:52:08,293 INFO L273 TraceCheckUtils]: 36: Hoare triple {2144#false} ~i~0 := 0; {2144#false} is VALID [2018-11-14 16:52:08,293 INFO L273 TraceCheckUtils]: 37: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:08,293 INFO L273 TraceCheckUtils]: 38: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2144#false} is VALID [2018-11-14 16:52:08,293 INFO L273 TraceCheckUtils]: 39: Hoare triple {2144#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2144#false} is VALID [2018-11-14 16:52:08,294 INFO L273 TraceCheckUtils]: 40: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:08,294 INFO L273 TraceCheckUtils]: 41: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2144#false} is VALID [2018-11-14 16:52:08,294 INFO L273 TraceCheckUtils]: 42: Hoare triple {2144#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2144#false} is VALID [2018-11-14 16:52:08,294 INFO L273 TraceCheckUtils]: 43: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:08,294 INFO L273 TraceCheckUtils]: 44: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2144#false} is VALID [2018-11-14 16:52:08,294 INFO L273 TraceCheckUtils]: 45: Hoare triple {2144#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2144#false} is VALID [2018-11-14 16:52:08,294 INFO L273 TraceCheckUtils]: 46: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:08,295 INFO L273 TraceCheckUtils]: 47: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2144#false} is VALID [2018-11-14 16:52:08,295 INFO L273 TraceCheckUtils]: 48: Hoare triple {2144#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2144#false} is VALID [2018-11-14 16:52:08,295 INFO L273 TraceCheckUtils]: 49: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:08,295 INFO L273 TraceCheckUtils]: 50: Hoare triple {2144#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2144#false} is VALID [2018-11-14 16:52:08,295 INFO L273 TraceCheckUtils]: 51: Hoare triple {2144#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2144#false} is VALID [2018-11-14 16:52:08,295 INFO L273 TraceCheckUtils]: 52: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:08,296 INFO L273 TraceCheckUtils]: 53: Hoare triple {2144#false} assume !(~i~0 < 100000); {2144#false} is VALID [2018-11-14 16:52:08,296 INFO L273 TraceCheckUtils]: 54: Hoare triple {2144#false} havoc ~x~0;~x~0 := 0; {2144#false} is VALID [2018-11-14 16:52:08,296 INFO L273 TraceCheckUtils]: 55: Hoare triple {2144#false} assume true; {2144#false} is VALID [2018-11-14 16:52:08,296 INFO L273 TraceCheckUtils]: 56: Hoare triple {2144#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {2144#false} is VALID [2018-11-14 16:52:08,296 INFO L256 TraceCheckUtils]: 57: Hoare triple {2144#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2144#false} is VALID [2018-11-14 16:52:08,297 INFO L273 TraceCheckUtils]: 58: Hoare triple {2144#false} ~cond := #in~cond; {2144#false} is VALID [2018-11-14 16:52:08,297 INFO L273 TraceCheckUtils]: 59: Hoare triple {2144#false} assume ~cond == 0; {2144#false} is VALID [2018-11-14 16:52:08,297 INFO L273 TraceCheckUtils]: 60: Hoare triple {2144#false} assume !false; {2144#false} is VALID [2018-11-14 16:52:08,302 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-14 16:52:08,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:08,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 16:52:08,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-14 16:52:08,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:08,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 16:52:08,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:08,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 16:52:08,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 16:52:08,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 16:52:08,513 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 9 states. [2018-11-14 16:52:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:09,050 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-11-14 16:52:09,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:52:09,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-14 16:52:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:52:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-14 16:52:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 16:52:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 104 transitions. [2018-11-14 16:52:09,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 104 transitions. [2018-11-14 16:52:09,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:09,318 INFO L225 Difference]: With dead ends: 124 [2018-11-14 16:52:09,318 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 16:52:09,321 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 61 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-14 16:52:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 16:52:09,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-14 16:52:09,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:09,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 74 states. [2018-11-14 16:52:09,344 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 74 states. [2018-11-14 16:52:09,344 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 74 states. [2018-11-14 16:52:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:09,346 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-14 16:52:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-14 16:52:09,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:09,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:09,347 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 76 states. [2018-11-14 16:52:09,347 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 76 states. [2018-11-14 16:52:09,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:09,349 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-11-14 16:52:09,349 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-14 16:52:09,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:09,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:09,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:09,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:09,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 16:52:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-14 16:52:09,351 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 61 [2018-11-14 16:52:09,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:09,352 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-14 16:52:09,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 16:52:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 16:52:09,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 16:52:09,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:09,353 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:09,353 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:09,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:09,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1657777251, now seen corresponding path program 6 times [2018-11-14 16:52:09,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:09,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:09,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:09,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:09,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {2755#true} call ULTIMATE.init(); {2755#true} is VALID [2018-11-14 16:52:09,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {2755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2755#true} is VALID [2018-11-14 16:52:09,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-14 16:52:09,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2755#true} {2755#true} #80#return; {2755#true} is VALID [2018-11-14 16:52:09,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {2755#true} call #t~ret6 := main(); {2755#true} is VALID [2018-11-14 16:52:09,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {2755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2757#(= main_~i~0 0)} is VALID [2018-11-14 16:52:09,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {2757#(= main_~i~0 0)} assume true; {2757#(= main_~i~0 0)} is VALID [2018-11-14 16:52:09,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {2757#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2758#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:09,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {2758#(<= main_~i~0 1)} assume true; {2758#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:09,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {2758#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2759#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:09,789 INFO L273 TraceCheckUtils]: 10: Hoare triple {2759#(<= main_~i~0 2)} assume true; {2759#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:09,789 INFO L273 TraceCheckUtils]: 11: Hoare triple {2759#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2760#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:09,790 INFO L273 TraceCheckUtils]: 12: Hoare triple {2760#(<= main_~i~0 3)} assume true; {2760#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:09,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {2760#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2761#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:09,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {2761#(<= main_~i~0 4)} assume true; {2761#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:09,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {2761#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2762#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:09,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {2762#(<= main_~i~0 5)} assume true; {2762#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:09,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {2762#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2763#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:09,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {2763#(<= main_~i~0 6)} assume true; {2763#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:09,799 INFO L273 TraceCheckUtils]: 19: Hoare triple {2763#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2756#false} is VALID [2018-11-14 16:52:09,799 INFO L273 TraceCheckUtils]: 20: Hoare triple {2756#false} ~i~0 := 0; {2756#false} is VALID [2018-11-14 16:52:09,799 INFO L273 TraceCheckUtils]: 21: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2756#false} is VALID [2018-11-14 16:52:09,800 INFO L273 TraceCheckUtils]: 23: Hoare triple {2756#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2756#false} is VALID [2018-11-14 16:52:09,800 INFO L273 TraceCheckUtils]: 24: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,800 INFO L273 TraceCheckUtils]: 25: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2756#false} is VALID [2018-11-14 16:52:09,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {2756#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2756#false} is VALID [2018-11-14 16:52:09,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2756#false} is VALID [2018-11-14 16:52:09,801 INFO L273 TraceCheckUtils]: 29: Hoare triple {2756#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2756#false} is VALID [2018-11-14 16:52:09,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,801 INFO L273 TraceCheckUtils]: 31: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2756#false} is VALID [2018-11-14 16:52:09,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {2756#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2756#false} is VALID [2018-11-14 16:52:09,802 INFO L273 TraceCheckUtils]: 33: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2756#false} is VALID [2018-11-14 16:52:09,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {2756#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2756#false} is VALID [2018-11-14 16:52:09,802 INFO L273 TraceCheckUtils]: 36: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,802 INFO L273 TraceCheckUtils]: 37: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2756#false} is VALID [2018-11-14 16:52:09,803 INFO L273 TraceCheckUtils]: 38: Hoare triple {2756#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2756#false} is VALID [2018-11-14 16:52:09,803 INFO L273 TraceCheckUtils]: 39: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,803 INFO L273 TraceCheckUtils]: 40: Hoare triple {2756#false} assume !(~i~0 < 100000); {2756#false} is VALID [2018-11-14 16:52:09,803 INFO L273 TraceCheckUtils]: 41: Hoare triple {2756#false} ~i~0 := 0; {2756#false} is VALID [2018-11-14 16:52:09,803 INFO L273 TraceCheckUtils]: 42: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,804 INFO L273 TraceCheckUtils]: 43: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:09,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:09,804 INFO L273 TraceCheckUtils]: 45: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,804 INFO L273 TraceCheckUtils]: 46: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:09,804 INFO L273 TraceCheckUtils]: 47: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:09,804 INFO L273 TraceCheckUtils]: 48: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,805 INFO L273 TraceCheckUtils]: 49: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:09,805 INFO L273 TraceCheckUtils]: 50: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:09,805 INFO L273 TraceCheckUtils]: 51: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,805 INFO L273 TraceCheckUtils]: 52: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:09,805 INFO L273 TraceCheckUtils]: 53: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:09,806 INFO L273 TraceCheckUtils]: 54: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,806 INFO L273 TraceCheckUtils]: 55: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:09,806 INFO L273 TraceCheckUtils]: 56: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:09,806 INFO L273 TraceCheckUtils]: 57: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,806 INFO L273 TraceCheckUtils]: 58: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:09,806 INFO L273 TraceCheckUtils]: 59: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:09,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,807 INFO L273 TraceCheckUtils]: 61: Hoare triple {2756#false} assume !(~i~0 < 100000); {2756#false} is VALID [2018-11-14 16:52:09,807 INFO L273 TraceCheckUtils]: 62: Hoare triple {2756#false} havoc ~x~0;~x~0 := 0; {2756#false} is VALID [2018-11-14 16:52:09,807 INFO L273 TraceCheckUtils]: 63: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:09,807 INFO L273 TraceCheckUtils]: 64: Hoare triple {2756#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {2756#false} is VALID [2018-11-14 16:52:09,807 INFO L256 TraceCheckUtils]: 65: Hoare triple {2756#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2756#false} is VALID [2018-11-14 16:52:09,808 INFO L273 TraceCheckUtils]: 66: Hoare triple {2756#false} ~cond := #in~cond; {2756#false} is VALID [2018-11-14 16:52:09,808 INFO L273 TraceCheckUtils]: 67: Hoare triple {2756#false} assume ~cond == 0; {2756#false} is VALID [2018-11-14 16:52:09,808 INFO L273 TraceCheckUtils]: 68: Hoare triple {2756#false} assume !false; {2756#false} is VALID [2018-11-14 16:52:09,811 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-14 16:52:09,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:09,811 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-14 16:52:09,823 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 16:52:10,044 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 16:52:10,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:10,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:10,225 INFO L256 TraceCheckUtils]: 0: Hoare triple {2755#true} call ULTIMATE.init(); {2755#true} is VALID [2018-11-14 16:52:10,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {2755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2755#true} is VALID [2018-11-14 16:52:10,226 INFO L273 TraceCheckUtils]: 2: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-14 16:52:10,226 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2755#true} {2755#true} #80#return; {2755#true} is VALID [2018-11-14 16:52:10,226 INFO L256 TraceCheckUtils]: 4: Hoare triple {2755#true} call #t~ret6 := main(); {2755#true} is VALID [2018-11-14 16:52:10,227 INFO L273 TraceCheckUtils]: 5: Hoare triple {2755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2755#true} is VALID [2018-11-14 16:52:10,227 INFO L273 TraceCheckUtils]: 6: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-14 16:52:10,227 INFO L273 TraceCheckUtils]: 7: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2755#true} is VALID [2018-11-14 16:52:10,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-14 16:52:10,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2755#true} is VALID [2018-11-14 16:52:10,228 INFO L273 TraceCheckUtils]: 10: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-14 16:52:10,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2755#true} is VALID [2018-11-14 16:52:10,228 INFO L273 TraceCheckUtils]: 12: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-14 16:52:10,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2755#true} is VALID [2018-11-14 16:52:10,229 INFO L273 TraceCheckUtils]: 14: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-14 16:52:10,229 INFO L273 TraceCheckUtils]: 15: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2755#true} is VALID [2018-11-14 16:52:10,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-14 16:52:10,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {2755#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2755#true} is VALID [2018-11-14 16:52:10,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {2755#true} assume true; {2755#true} is VALID [2018-11-14 16:52:10,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {2755#true} assume !(~i~0 < 100000); {2755#true} is VALID [2018-11-14 16:52:10,230 INFO L273 TraceCheckUtils]: 20: Hoare triple {2755#true} ~i~0 := 0; {2827#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:10,230 INFO L273 TraceCheckUtils]: 21: Hoare triple {2827#(<= main_~i~0 0)} assume true; {2827#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:10,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {2827#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2827#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:10,231 INFO L273 TraceCheckUtils]: 23: Hoare triple {2827#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2758#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:10,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {2758#(<= main_~i~0 1)} assume true; {2758#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:10,232 INFO L273 TraceCheckUtils]: 25: Hoare triple {2758#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2758#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:10,232 INFO L273 TraceCheckUtils]: 26: Hoare triple {2758#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2759#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:10,232 INFO L273 TraceCheckUtils]: 27: Hoare triple {2759#(<= main_~i~0 2)} assume true; {2759#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:10,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {2759#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2759#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:10,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {2759#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2760#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:10,234 INFO L273 TraceCheckUtils]: 30: Hoare triple {2760#(<= main_~i~0 3)} assume true; {2760#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:10,234 INFO L273 TraceCheckUtils]: 31: Hoare triple {2760#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2760#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:10,235 INFO L273 TraceCheckUtils]: 32: Hoare triple {2760#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2761#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:10,235 INFO L273 TraceCheckUtils]: 33: Hoare triple {2761#(<= main_~i~0 4)} assume true; {2761#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:10,236 INFO L273 TraceCheckUtils]: 34: Hoare triple {2761#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2761#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:10,237 INFO L273 TraceCheckUtils]: 35: Hoare triple {2761#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2762#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:10,237 INFO L273 TraceCheckUtils]: 36: Hoare triple {2762#(<= main_~i~0 5)} assume true; {2762#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:10,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {2762#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {2762#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:10,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {2762#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2763#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:10,239 INFO L273 TraceCheckUtils]: 39: Hoare triple {2763#(<= main_~i~0 6)} assume true; {2763#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:10,240 INFO L273 TraceCheckUtils]: 40: Hoare triple {2763#(<= main_~i~0 6)} assume !(~i~0 < 100000); {2756#false} is VALID [2018-11-14 16:52:10,240 INFO L273 TraceCheckUtils]: 41: Hoare triple {2756#false} ~i~0 := 0; {2756#false} is VALID [2018-11-14 16:52:10,240 INFO L273 TraceCheckUtils]: 42: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:10,240 INFO L273 TraceCheckUtils]: 43: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:10,241 INFO L273 TraceCheckUtils]: 44: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:10,241 INFO L273 TraceCheckUtils]: 45: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:10,241 INFO L273 TraceCheckUtils]: 46: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:10,241 INFO L273 TraceCheckUtils]: 47: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:10,241 INFO L273 TraceCheckUtils]: 48: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:10,242 INFO L273 TraceCheckUtils]: 49: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:10,242 INFO L273 TraceCheckUtils]: 50: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:10,242 INFO L273 TraceCheckUtils]: 51: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:10,242 INFO L273 TraceCheckUtils]: 52: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:10,242 INFO L273 TraceCheckUtils]: 53: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:10,242 INFO L273 TraceCheckUtils]: 54: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:10,242 INFO L273 TraceCheckUtils]: 55: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:10,243 INFO L273 TraceCheckUtils]: 56: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:10,243 INFO L273 TraceCheckUtils]: 57: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:10,243 INFO L273 TraceCheckUtils]: 58: Hoare triple {2756#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {2756#false} is VALID [2018-11-14 16:52:10,243 INFO L273 TraceCheckUtils]: 59: Hoare triple {2756#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2756#false} is VALID [2018-11-14 16:52:10,243 INFO L273 TraceCheckUtils]: 60: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:10,243 INFO L273 TraceCheckUtils]: 61: Hoare triple {2756#false} assume !(~i~0 < 100000); {2756#false} is VALID [2018-11-14 16:52:10,243 INFO L273 TraceCheckUtils]: 62: Hoare triple {2756#false} havoc ~x~0;~x~0 := 0; {2756#false} is VALID [2018-11-14 16:52:10,243 INFO L273 TraceCheckUtils]: 63: Hoare triple {2756#false} assume true; {2756#false} is VALID [2018-11-14 16:52:10,244 INFO L273 TraceCheckUtils]: 64: Hoare triple {2756#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {2756#false} is VALID [2018-11-14 16:52:10,244 INFO L256 TraceCheckUtils]: 65: Hoare triple {2756#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {2756#false} is VALID [2018-11-14 16:52:10,244 INFO L273 TraceCheckUtils]: 66: Hoare triple {2756#false} ~cond := #in~cond; {2756#false} is VALID [2018-11-14 16:52:10,244 INFO L273 TraceCheckUtils]: 67: Hoare triple {2756#false} assume ~cond == 0; {2756#false} is VALID [2018-11-14 16:52:10,244 INFO L273 TraceCheckUtils]: 68: Hoare triple {2756#false} assume !false; {2756#false} is VALID [2018-11-14 16:52:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2018-11-14 16:52:10,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:10,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 16:52:10,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2018-11-14 16:52:10,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:10,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:52:10,325 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-14 16:52:10,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:52:10,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:52:10,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:52:10,327 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 10 states. [2018-11-14 16:52:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:10,729 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2018-11-14 16:52:10,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:52:10,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2018-11-14 16:52:10,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:52:10,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2018-11-14 16:52:10,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:52:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2018-11-14 16:52:10,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2018-11-14 16:52:10,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:10,908 INFO L225 Difference]: With dead ends: 138 [2018-11-14 16:52:10,908 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 16:52:10,909 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:52:10,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 16:52:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-14 16:52:10,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:10,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 82 states. [2018-11-14 16:52:10,944 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 82 states. [2018-11-14 16:52:10,944 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 82 states. [2018-11-14 16:52:10,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:10,947 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-14 16:52:10,948 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-14 16:52:10,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:10,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:10,948 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 84 states. [2018-11-14 16:52:10,948 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 84 states. [2018-11-14 16:52:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:10,951 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-11-14 16:52:10,951 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2018-11-14 16:52:10,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:10,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:10,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:10,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 16:52:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2018-11-14 16:52:10,954 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 69 [2018-11-14 16:52:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:10,954 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2018-11-14 16:52:10,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:52:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2018-11-14 16:52:10,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-14 16:52:10,955 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:10,955 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:10,956 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:10,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:10,956 INFO L82 PathProgramCache]: Analyzing trace with hash 82128276, now seen corresponding path program 7 times [2018-11-14 16:52:10,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:10,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:10,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:10,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:10,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:11,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {3438#true} call ULTIMATE.init(); {3438#true} is VALID [2018-11-14 16:52:11,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {3438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3438#true} is VALID [2018-11-14 16:52:11,209 INFO L273 TraceCheckUtils]: 2: Hoare triple {3438#true} assume true; {3438#true} is VALID [2018-11-14 16:52:11,209 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3438#true} {3438#true} #80#return; {3438#true} is VALID [2018-11-14 16:52:11,209 INFO L256 TraceCheckUtils]: 4: Hoare triple {3438#true} call #t~ret6 := main(); {3438#true} is VALID [2018-11-14 16:52:11,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {3438#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3440#(= main_~i~0 0)} is VALID [2018-11-14 16:52:11,245 INFO L273 TraceCheckUtils]: 6: Hoare triple {3440#(= main_~i~0 0)} assume true; {3440#(= main_~i~0 0)} is VALID [2018-11-14 16:52:11,253 INFO L273 TraceCheckUtils]: 7: Hoare triple {3440#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3441#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:11,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {3441#(<= main_~i~0 1)} assume true; {3441#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:11,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {3441#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3442#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:11,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {3442#(<= main_~i~0 2)} assume true; {3442#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:11,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {3442#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3443#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:11,255 INFO L273 TraceCheckUtils]: 12: Hoare triple {3443#(<= main_~i~0 3)} assume true; {3443#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:11,256 INFO L273 TraceCheckUtils]: 13: Hoare triple {3443#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3444#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:11,256 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#(<= main_~i~0 4)} assume true; {3444#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:11,257 INFO L273 TraceCheckUtils]: 15: Hoare triple {3444#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3445#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:11,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {3445#(<= main_~i~0 5)} assume true; {3445#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:11,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {3445#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3446#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:11,258 INFO L273 TraceCheckUtils]: 18: Hoare triple {3446#(<= main_~i~0 6)} assume true; {3446#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:11,259 INFO L273 TraceCheckUtils]: 19: Hoare triple {3446#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3447#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:11,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {3447#(<= main_~i~0 7)} assume true; {3447#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:11,260 INFO L273 TraceCheckUtils]: 21: Hoare triple {3447#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-14 16:52:11,260 INFO L273 TraceCheckUtils]: 22: Hoare triple {3439#false} ~i~0 := 0; {3439#false} is VALID [2018-11-14 16:52:11,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,261 INFO L273 TraceCheckUtils]: 24: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,261 INFO L273 TraceCheckUtils]: 25: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,261 INFO L273 TraceCheckUtils]: 26: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,261 INFO L273 TraceCheckUtils]: 27: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,262 INFO L273 TraceCheckUtils]: 29: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,262 INFO L273 TraceCheckUtils]: 30: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,263 INFO L273 TraceCheckUtils]: 34: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,263 INFO L273 TraceCheckUtils]: 35: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,263 INFO L273 TraceCheckUtils]: 36: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,263 INFO L273 TraceCheckUtils]: 37: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,263 INFO L273 TraceCheckUtils]: 38: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,263 INFO L273 TraceCheckUtils]: 39: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,264 INFO L273 TraceCheckUtils]: 40: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,264 INFO L273 TraceCheckUtils]: 41: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,264 INFO L273 TraceCheckUtils]: 42: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,264 INFO L273 TraceCheckUtils]: 43: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,264 INFO L273 TraceCheckUtils]: 44: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,264 INFO L273 TraceCheckUtils]: 45: Hoare triple {3439#false} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-14 16:52:11,264 INFO L273 TraceCheckUtils]: 46: Hoare triple {3439#false} ~i~0 := 0; {3439#false} is VALID [2018-11-14 16:52:11,264 INFO L273 TraceCheckUtils]: 47: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,265 INFO L273 TraceCheckUtils]: 48: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,265 INFO L273 TraceCheckUtils]: 49: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,265 INFO L273 TraceCheckUtils]: 50: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,265 INFO L273 TraceCheckUtils]: 51: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,265 INFO L273 TraceCheckUtils]: 52: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,265 INFO L273 TraceCheckUtils]: 53: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,266 INFO L273 TraceCheckUtils]: 54: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,266 INFO L273 TraceCheckUtils]: 55: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,266 INFO L273 TraceCheckUtils]: 56: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,266 INFO L273 TraceCheckUtils]: 57: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,266 INFO L273 TraceCheckUtils]: 58: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,267 INFO L273 TraceCheckUtils]: 59: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,267 INFO L273 TraceCheckUtils]: 60: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,267 INFO L273 TraceCheckUtils]: 61: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,267 INFO L273 TraceCheckUtils]: 62: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,267 INFO L273 TraceCheckUtils]: 63: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,268 INFO L273 TraceCheckUtils]: 64: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,268 INFO L273 TraceCheckUtils]: 65: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,268 INFO L273 TraceCheckUtils]: 66: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,268 INFO L273 TraceCheckUtils]: 67: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,268 INFO L273 TraceCheckUtils]: 68: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,268 INFO L273 TraceCheckUtils]: 69: Hoare triple {3439#false} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-14 16:52:11,269 INFO L273 TraceCheckUtils]: 70: Hoare triple {3439#false} havoc ~x~0;~x~0 := 0; {3439#false} is VALID [2018-11-14 16:52:11,269 INFO L273 TraceCheckUtils]: 71: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,269 INFO L273 TraceCheckUtils]: 72: Hoare triple {3439#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {3439#false} is VALID [2018-11-14 16:52:11,269 INFO L256 TraceCheckUtils]: 73: Hoare triple {3439#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {3439#false} is VALID [2018-11-14 16:52:11,269 INFO L273 TraceCheckUtils]: 74: Hoare triple {3439#false} ~cond := #in~cond; {3439#false} is VALID [2018-11-14 16:52:11,269 INFO L273 TraceCheckUtils]: 75: Hoare triple {3439#false} assume ~cond == 0; {3439#false} is VALID [2018-11-14 16:52:11,271 INFO L273 TraceCheckUtils]: 76: Hoare triple {3439#false} assume !false; {3439#false} is VALID [2018-11-14 16:52:11,274 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-14 16:52:11,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:11,275 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-14 16:52:11,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:11,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:11,594 INFO L256 TraceCheckUtils]: 0: Hoare triple {3438#true} call ULTIMATE.init(); {3438#true} is VALID [2018-11-14 16:52:11,594 INFO L273 TraceCheckUtils]: 1: Hoare triple {3438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3438#true} is VALID [2018-11-14 16:52:11,594 INFO L273 TraceCheckUtils]: 2: Hoare triple {3438#true} assume true; {3438#true} is VALID [2018-11-14 16:52:11,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3438#true} {3438#true} #80#return; {3438#true} is VALID [2018-11-14 16:52:11,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {3438#true} call #t~ret6 := main(); {3438#true} is VALID [2018-11-14 16:52:11,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {3438#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3466#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:11,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {3466#(<= main_~i~0 0)} assume true; {3466#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:11,597 INFO L273 TraceCheckUtils]: 7: Hoare triple {3466#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3441#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:11,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {3441#(<= main_~i~0 1)} assume true; {3441#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:11,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {3441#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3442#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:11,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {3442#(<= main_~i~0 2)} assume true; {3442#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:11,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {3442#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3443#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:11,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {3443#(<= main_~i~0 3)} assume true; {3443#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:11,601 INFO L273 TraceCheckUtils]: 13: Hoare triple {3443#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3444#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:11,601 INFO L273 TraceCheckUtils]: 14: Hoare triple {3444#(<= main_~i~0 4)} assume true; {3444#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:11,602 INFO L273 TraceCheckUtils]: 15: Hoare triple {3444#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3445#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:11,603 INFO L273 TraceCheckUtils]: 16: Hoare triple {3445#(<= main_~i~0 5)} assume true; {3445#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:11,604 INFO L273 TraceCheckUtils]: 17: Hoare triple {3445#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3446#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:11,604 INFO L273 TraceCheckUtils]: 18: Hoare triple {3446#(<= main_~i~0 6)} assume true; {3446#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:11,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {3446#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3447#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:11,606 INFO L273 TraceCheckUtils]: 20: Hoare triple {3447#(<= main_~i~0 7)} assume true; {3447#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:11,606 INFO L273 TraceCheckUtils]: 21: Hoare triple {3447#(<= main_~i~0 7)} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-14 16:52:11,607 INFO L273 TraceCheckUtils]: 22: Hoare triple {3439#false} ~i~0 := 0; {3439#false} is VALID [2018-11-14 16:52:11,607 INFO L273 TraceCheckUtils]: 23: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,607 INFO L273 TraceCheckUtils]: 24: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,607 INFO L273 TraceCheckUtils]: 26: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,608 INFO L273 TraceCheckUtils]: 27: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,609 INFO L273 TraceCheckUtils]: 31: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,609 INFO L273 TraceCheckUtils]: 32: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,609 INFO L273 TraceCheckUtils]: 33: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,609 INFO L273 TraceCheckUtils]: 34: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,609 INFO L273 TraceCheckUtils]: 35: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,610 INFO L273 TraceCheckUtils]: 36: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,610 INFO L273 TraceCheckUtils]: 37: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,610 INFO L273 TraceCheckUtils]: 38: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,610 INFO L273 TraceCheckUtils]: 39: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,610 INFO L273 TraceCheckUtils]: 40: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,610 INFO L273 TraceCheckUtils]: 41: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,610 INFO L273 TraceCheckUtils]: 42: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {3439#false} is VALID [2018-11-14 16:52:11,610 INFO L273 TraceCheckUtils]: 43: Hoare triple {3439#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3439#false} is VALID [2018-11-14 16:52:11,610 INFO L273 TraceCheckUtils]: 44: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,611 INFO L273 TraceCheckUtils]: 45: Hoare triple {3439#false} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-14 16:52:11,611 INFO L273 TraceCheckUtils]: 46: Hoare triple {3439#false} ~i~0 := 0; {3439#false} is VALID [2018-11-14 16:52:11,611 INFO L273 TraceCheckUtils]: 47: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,611 INFO L273 TraceCheckUtils]: 48: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,611 INFO L273 TraceCheckUtils]: 49: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,611 INFO L273 TraceCheckUtils]: 50: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,611 INFO L273 TraceCheckUtils]: 51: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,611 INFO L273 TraceCheckUtils]: 52: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,612 INFO L273 TraceCheckUtils]: 53: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,612 INFO L273 TraceCheckUtils]: 54: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,612 INFO L273 TraceCheckUtils]: 55: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,612 INFO L273 TraceCheckUtils]: 58: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,612 INFO L273 TraceCheckUtils]: 59: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,612 INFO L273 TraceCheckUtils]: 60: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,613 INFO L273 TraceCheckUtils]: 61: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,613 INFO L273 TraceCheckUtils]: 62: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,613 INFO L273 TraceCheckUtils]: 63: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,613 INFO L273 TraceCheckUtils]: 64: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,613 INFO L273 TraceCheckUtils]: 65: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,613 INFO L273 TraceCheckUtils]: 66: Hoare triple {3439#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {3439#false} is VALID [2018-11-14 16:52:11,613 INFO L273 TraceCheckUtils]: 67: Hoare triple {3439#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3439#false} is VALID [2018-11-14 16:52:11,613 INFO L273 TraceCheckUtils]: 68: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,614 INFO L273 TraceCheckUtils]: 69: Hoare triple {3439#false} assume !(~i~0 < 100000); {3439#false} is VALID [2018-11-14 16:52:11,614 INFO L273 TraceCheckUtils]: 70: Hoare triple {3439#false} havoc ~x~0;~x~0 := 0; {3439#false} is VALID [2018-11-14 16:52:11,614 INFO L273 TraceCheckUtils]: 71: Hoare triple {3439#false} assume true; {3439#false} is VALID [2018-11-14 16:52:11,614 INFO L273 TraceCheckUtils]: 72: Hoare triple {3439#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {3439#false} is VALID [2018-11-14 16:52:11,614 INFO L256 TraceCheckUtils]: 73: Hoare triple {3439#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {3439#false} is VALID [2018-11-14 16:52:11,614 INFO L273 TraceCheckUtils]: 74: Hoare triple {3439#false} ~cond := #in~cond; {3439#false} is VALID [2018-11-14 16:52:11,614 INFO L273 TraceCheckUtils]: 75: Hoare triple {3439#false} assume ~cond == 0; {3439#false} is VALID [2018-11-14 16:52:11,615 INFO L273 TraceCheckUtils]: 76: Hoare triple {3439#false} assume !false; {3439#false} is VALID [2018-11-14 16:52:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-11-14 16:52:11,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:11,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 16:52:11,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-14 16:52:11,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:11,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:52:11,728 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-14 16:52:11,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:52:11,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:52:11,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:52:11,729 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand 11 states. [2018-11-14 16:52:12,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:12,103 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2018-11-14 16:52:12,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 16:52:12,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-11-14 16:52:12,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:52:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2018-11-14 16:52:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:52:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 120 transitions. [2018-11-14 16:52:12,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 120 transitions. [2018-11-14 16:52:12,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:12,229 INFO L225 Difference]: With dead ends: 152 [2018-11-14 16:52:12,230 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 16:52:12,231 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:52:12,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 16:52:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-11-14 16:52:12,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:12,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 90 states. [2018-11-14 16:52:12,271 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 90 states. [2018-11-14 16:52:12,271 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 90 states. [2018-11-14 16:52:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:12,275 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-14 16:52:12,275 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-14 16:52:12,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:12,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:12,276 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 92 states. [2018-11-14 16:52:12,276 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 92 states. [2018-11-14 16:52:12,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:12,279 INFO L93 Difference]: Finished difference Result 92 states and 95 transitions. [2018-11-14 16:52:12,279 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 95 transitions. [2018-11-14 16:52:12,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:12,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:12,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:12,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 16:52:12,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2018-11-14 16:52:12,282 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 77 [2018-11-14 16:52:12,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:12,283 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2018-11-14 16:52:12,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:52:12,283 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2018-11-14 16:52:12,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 16:52:12,284 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:12,284 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:12,284 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:12,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:12,285 INFO L82 PathProgramCache]: Analyzing trace with hash 494131825, now seen corresponding path program 8 times [2018-11-14 16:52:12,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:12,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:12,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:12,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:52:12,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:12,502 INFO L256 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2018-11-14 16:52:12,503 INFO L273 TraceCheckUtils]: 1: Hoare triple {4192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4192#true} is VALID [2018-11-14 16:52:12,503 INFO L273 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2018-11-14 16:52:12,503 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #80#return; {4192#true} is VALID [2018-11-14 16:52:12,503 INFO L256 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret6 := main(); {4192#true} is VALID [2018-11-14 16:52:12,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {4192#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4194#(= main_~i~0 0)} is VALID [2018-11-14 16:52:12,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {4194#(= main_~i~0 0)} assume true; {4194#(= main_~i~0 0)} is VALID [2018-11-14 16:52:12,540 INFO L273 TraceCheckUtils]: 7: Hoare triple {4194#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4195#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:12,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {4195#(<= main_~i~0 1)} assume true; {4195#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:12,541 INFO L273 TraceCheckUtils]: 9: Hoare triple {4195#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4196#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:12,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {4196#(<= main_~i~0 2)} assume true; {4196#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:12,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {4196#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4197#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:12,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {4197#(<= main_~i~0 3)} assume true; {4197#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:12,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {4197#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4198#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:12,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {4198#(<= main_~i~0 4)} assume true; {4198#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:12,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {4198#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4199#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:12,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {4199#(<= main_~i~0 5)} assume true; {4199#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:12,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {4199#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4200#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:12,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {4200#(<= main_~i~0 6)} assume true; {4200#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:12,546 INFO L273 TraceCheckUtils]: 19: Hoare triple {4200#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4201#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:12,547 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~i~0 7)} assume true; {4201#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:12,548 INFO L273 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4202#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:12,548 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~i~0 8)} assume true; {4202#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:12,549 INFO L273 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-14 16:52:12,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {4193#false} ~i~0 := 0; {4193#false} is VALID [2018-11-14 16:52:12,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,550 INFO L273 TraceCheckUtils]: 27: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,550 INFO L273 TraceCheckUtils]: 28: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,550 INFO L273 TraceCheckUtils]: 30: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,551 INFO L273 TraceCheckUtils]: 33: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,551 INFO L273 TraceCheckUtils]: 34: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,551 INFO L273 TraceCheckUtils]: 35: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,552 INFO L273 TraceCheckUtils]: 36: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,552 INFO L273 TraceCheckUtils]: 37: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,552 INFO L273 TraceCheckUtils]: 38: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,552 INFO L273 TraceCheckUtils]: 39: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,552 INFO L273 TraceCheckUtils]: 40: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,553 INFO L273 TraceCheckUtils]: 41: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,553 INFO L273 TraceCheckUtils]: 42: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,553 INFO L273 TraceCheckUtils]: 43: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,553 INFO L273 TraceCheckUtils]: 44: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,553 INFO L273 TraceCheckUtils]: 45: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,553 INFO L273 TraceCheckUtils]: 46: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,554 INFO L273 TraceCheckUtils]: 47: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,554 INFO L273 TraceCheckUtils]: 48: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,554 INFO L273 TraceCheckUtils]: 49: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,554 INFO L273 TraceCheckUtils]: 50: Hoare triple {4193#false} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-14 16:52:12,554 INFO L273 TraceCheckUtils]: 51: Hoare triple {4193#false} ~i~0 := 0; {4193#false} is VALID [2018-11-14 16:52:12,554 INFO L273 TraceCheckUtils]: 52: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,554 INFO L273 TraceCheckUtils]: 53: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,554 INFO L273 TraceCheckUtils]: 54: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,555 INFO L273 TraceCheckUtils]: 55: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,555 INFO L273 TraceCheckUtils]: 56: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,555 INFO L273 TraceCheckUtils]: 57: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,555 INFO L273 TraceCheckUtils]: 58: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,555 INFO L273 TraceCheckUtils]: 59: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,555 INFO L273 TraceCheckUtils]: 60: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,555 INFO L273 TraceCheckUtils]: 61: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,555 INFO L273 TraceCheckUtils]: 62: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,556 INFO L273 TraceCheckUtils]: 63: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,556 INFO L273 TraceCheckUtils]: 64: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,556 INFO L273 TraceCheckUtils]: 65: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,556 INFO L273 TraceCheckUtils]: 66: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,556 INFO L273 TraceCheckUtils]: 67: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,556 INFO L273 TraceCheckUtils]: 68: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,556 INFO L273 TraceCheckUtils]: 69: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,556 INFO L273 TraceCheckUtils]: 70: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,556 INFO L273 TraceCheckUtils]: 71: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,557 INFO L273 TraceCheckUtils]: 72: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,557 INFO L273 TraceCheckUtils]: 73: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,557 INFO L273 TraceCheckUtils]: 74: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,557 INFO L273 TraceCheckUtils]: 75: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,557 INFO L273 TraceCheckUtils]: 76: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,557 INFO L273 TraceCheckUtils]: 77: Hoare triple {4193#false} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-14 16:52:12,557 INFO L273 TraceCheckUtils]: 78: Hoare triple {4193#false} havoc ~x~0;~x~0 := 0; {4193#false} is VALID [2018-11-14 16:52:12,557 INFO L273 TraceCheckUtils]: 79: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,558 INFO L273 TraceCheckUtils]: 80: Hoare triple {4193#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {4193#false} is VALID [2018-11-14 16:52:12,558 INFO L256 TraceCheckUtils]: 81: Hoare triple {4193#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {4193#false} is VALID [2018-11-14 16:52:12,558 INFO L273 TraceCheckUtils]: 82: Hoare triple {4193#false} ~cond := #in~cond; {4193#false} is VALID [2018-11-14 16:52:12,558 INFO L273 TraceCheckUtils]: 83: Hoare triple {4193#false} assume ~cond == 0; {4193#false} is VALID [2018-11-14 16:52:12,558 INFO L273 TraceCheckUtils]: 84: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2018-11-14 16:52:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-14 16:52:12,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:12,562 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-14 16:52:12,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:52:12,603 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:52:12,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:12,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:12,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {4192#true} call ULTIMATE.init(); {4192#true} is VALID [2018-11-14 16:52:12,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {4192#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4192#true} is VALID [2018-11-14 16:52:12,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {4192#true} assume true; {4192#true} is VALID [2018-11-14 16:52:12,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4192#true} {4192#true} #80#return; {4192#true} is VALID [2018-11-14 16:52:12,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {4192#true} call #t~ret6 := main(); {4192#true} is VALID [2018-11-14 16:52:12,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {4192#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4221#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:12,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {4221#(<= main_~i~0 0)} assume true; {4221#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:12,799 INFO L273 TraceCheckUtils]: 7: Hoare triple {4221#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4195#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:12,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {4195#(<= main_~i~0 1)} assume true; {4195#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:12,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {4195#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4196#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:12,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {4196#(<= main_~i~0 2)} assume true; {4196#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:12,811 INFO L273 TraceCheckUtils]: 11: Hoare triple {4196#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4197#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:12,811 INFO L273 TraceCheckUtils]: 12: Hoare triple {4197#(<= main_~i~0 3)} assume true; {4197#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:12,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {4197#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4198#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:12,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {4198#(<= main_~i~0 4)} assume true; {4198#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:12,814 INFO L273 TraceCheckUtils]: 15: Hoare triple {4198#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4199#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:12,814 INFO L273 TraceCheckUtils]: 16: Hoare triple {4199#(<= main_~i~0 5)} assume true; {4199#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:12,815 INFO L273 TraceCheckUtils]: 17: Hoare triple {4199#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4200#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:12,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {4200#(<= main_~i~0 6)} assume true; {4200#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:12,817 INFO L273 TraceCheckUtils]: 19: Hoare triple {4200#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4201#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:12,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {4201#(<= main_~i~0 7)} assume true; {4201#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:12,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {4201#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4202#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:12,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {4202#(<= main_~i~0 8)} assume true; {4202#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:12,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {4202#(<= main_~i~0 8)} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-14 16:52:12,820 INFO L273 TraceCheckUtils]: 24: Hoare triple {4193#false} ~i~0 := 0; {4193#false} is VALID [2018-11-14 16:52:12,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,821 INFO L273 TraceCheckUtils]: 28: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,821 INFO L273 TraceCheckUtils]: 29: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,822 INFO L273 TraceCheckUtils]: 30: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,822 INFO L273 TraceCheckUtils]: 31: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,822 INFO L273 TraceCheckUtils]: 32: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,822 INFO L273 TraceCheckUtils]: 33: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,823 INFO L273 TraceCheckUtils]: 34: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,823 INFO L273 TraceCheckUtils]: 35: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,823 INFO L273 TraceCheckUtils]: 36: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,823 INFO L273 TraceCheckUtils]: 37: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,824 INFO L273 TraceCheckUtils]: 38: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,824 INFO L273 TraceCheckUtils]: 39: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,824 INFO L273 TraceCheckUtils]: 40: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,824 INFO L273 TraceCheckUtils]: 41: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,825 INFO L273 TraceCheckUtils]: 42: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,825 INFO L273 TraceCheckUtils]: 43: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,825 INFO L273 TraceCheckUtils]: 44: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,825 INFO L273 TraceCheckUtils]: 45: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,825 INFO L273 TraceCheckUtils]: 46: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,825 INFO L273 TraceCheckUtils]: 47: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {4193#false} is VALID [2018-11-14 16:52:12,826 INFO L273 TraceCheckUtils]: 48: Hoare triple {4193#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {4193#false} is VALID [2018-11-14 16:52:12,826 INFO L273 TraceCheckUtils]: 49: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,826 INFO L273 TraceCheckUtils]: 50: Hoare triple {4193#false} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-14 16:52:12,826 INFO L273 TraceCheckUtils]: 51: Hoare triple {4193#false} ~i~0 := 0; {4193#false} is VALID [2018-11-14 16:52:12,826 INFO L273 TraceCheckUtils]: 52: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,826 INFO L273 TraceCheckUtils]: 53: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,827 INFO L273 TraceCheckUtils]: 54: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,827 INFO L273 TraceCheckUtils]: 55: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,827 INFO L273 TraceCheckUtils]: 56: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,827 INFO L273 TraceCheckUtils]: 57: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,827 INFO L273 TraceCheckUtils]: 58: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,827 INFO L273 TraceCheckUtils]: 59: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,827 INFO L273 TraceCheckUtils]: 60: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,828 INFO L273 TraceCheckUtils]: 61: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,828 INFO L273 TraceCheckUtils]: 62: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,828 INFO L273 TraceCheckUtils]: 63: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,828 INFO L273 TraceCheckUtils]: 64: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,828 INFO L273 TraceCheckUtils]: 65: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,828 INFO L273 TraceCheckUtils]: 66: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,829 INFO L273 TraceCheckUtils]: 67: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,829 INFO L273 TraceCheckUtils]: 68: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,829 INFO L273 TraceCheckUtils]: 69: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,829 INFO L273 TraceCheckUtils]: 70: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,829 INFO L273 TraceCheckUtils]: 71: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,829 INFO L273 TraceCheckUtils]: 72: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,829 INFO L273 TraceCheckUtils]: 73: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,830 INFO L273 TraceCheckUtils]: 74: Hoare triple {4193#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {4193#false} is VALID [2018-11-14 16:52:12,830 INFO L273 TraceCheckUtils]: 75: Hoare triple {4193#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4193#false} is VALID [2018-11-14 16:52:12,830 INFO L273 TraceCheckUtils]: 76: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,830 INFO L273 TraceCheckUtils]: 77: Hoare triple {4193#false} assume !(~i~0 < 100000); {4193#false} is VALID [2018-11-14 16:52:12,830 INFO L273 TraceCheckUtils]: 78: Hoare triple {4193#false} havoc ~x~0;~x~0 := 0; {4193#false} is VALID [2018-11-14 16:52:12,830 INFO L273 TraceCheckUtils]: 79: Hoare triple {4193#false} assume true; {4193#false} is VALID [2018-11-14 16:52:12,830 INFO L273 TraceCheckUtils]: 80: Hoare triple {4193#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {4193#false} is VALID [2018-11-14 16:52:12,831 INFO L256 TraceCheckUtils]: 81: Hoare triple {4193#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {4193#false} is VALID [2018-11-14 16:52:12,831 INFO L273 TraceCheckUtils]: 82: Hoare triple {4193#false} ~cond := #in~cond; {4193#false} is VALID [2018-11-14 16:52:12,831 INFO L273 TraceCheckUtils]: 83: Hoare triple {4193#false} assume ~cond == 0; {4193#false} is VALID [2018-11-14 16:52:12,831 INFO L273 TraceCheckUtils]: 84: Hoare triple {4193#false} assume !false; {4193#false} is VALID [2018-11-14 16:52:12,835 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-14 16:52:12,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:12,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 16:52:12,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-11-14 16:52:12,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:12,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:52:12,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:12,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:52:12,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:52:12,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:52:12,899 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand 12 states. [2018-11-14 16:52:13,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:13,472 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-11-14 16:52:13,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 16:52:13,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-11-14 16:52:13,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:52:13,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2018-11-14 16:52:13,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:52:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2018-11-14 16:52:13,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 128 transitions. [2018-11-14 16:52:13,623 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-14 16:52:13,626 INFO L225 Difference]: With dead ends: 166 [2018-11-14 16:52:13,627 INFO L226 Difference]: Without dead ends: 100 [2018-11-14 16:52:13,628 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 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-14 16:52:13,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-14 16:52:14,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-11-14 16:52:14,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:14,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand 98 states. [2018-11-14 16:52:14,148 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 98 states. [2018-11-14 16:52:14,148 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 98 states. [2018-11-14 16:52:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:14,151 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-11-14 16:52:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-11-14 16:52:14,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:14,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:14,152 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 100 states. [2018-11-14 16:52:14,152 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 100 states. [2018-11-14 16:52:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:14,155 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-11-14 16:52:14,155 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2018-11-14 16:52:14,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:14,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:14,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:14,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 16:52:14,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2018-11-14 16:52:14,158 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 85 [2018-11-14 16:52:14,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:14,159 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2018-11-14 16:52:14,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:52:14,159 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2018-11-14 16:52:14,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-14 16:52:14,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:14,160 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:14,160 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:14,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:14,161 INFO L82 PathProgramCache]: Analyzing trace with hash -286500952, now seen corresponding path program 9 times [2018-11-14 16:52:14,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:14,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:14,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:14,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:14,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:14,796 INFO L256 TraceCheckUtils]: 0: Hoare triple {5017#true} call ULTIMATE.init(); {5017#true} is VALID [2018-11-14 16:52:14,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {5017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5017#true} is VALID [2018-11-14 16:52:14,797 INFO L273 TraceCheckUtils]: 2: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:14,797 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5017#true} {5017#true} #80#return; {5017#true} is VALID [2018-11-14 16:52:14,798 INFO L256 TraceCheckUtils]: 4: Hoare triple {5017#true} call #t~ret6 := main(); {5017#true} is VALID [2018-11-14 16:52:14,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {5017#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5019#(= main_~i~0 0)} is VALID [2018-11-14 16:52:14,799 INFO L273 TraceCheckUtils]: 6: Hoare triple {5019#(= main_~i~0 0)} assume true; {5019#(= main_~i~0 0)} is VALID [2018-11-14 16:52:14,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {5019#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5020#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:14,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {5020#(<= main_~i~0 1)} assume true; {5020#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:14,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {5020#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5021#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:14,801 INFO L273 TraceCheckUtils]: 10: Hoare triple {5021#(<= main_~i~0 2)} assume true; {5021#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:14,802 INFO L273 TraceCheckUtils]: 11: Hoare triple {5021#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5022#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:14,802 INFO L273 TraceCheckUtils]: 12: Hoare triple {5022#(<= main_~i~0 3)} assume true; {5022#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:14,803 INFO L273 TraceCheckUtils]: 13: Hoare triple {5022#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5023#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:14,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {5023#(<= main_~i~0 4)} assume true; {5023#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:14,805 INFO L273 TraceCheckUtils]: 15: Hoare triple {5023#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5024#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:14,805 INFO L273 TraceCheckUtils]: 16: Hoare triple {5024#(<= main_~i~0 5)} assume true; {5024#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:14,807 INFO L273 TraceCheckUtils]: 17: Hoare triple {5024#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5025#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:14,807 INFO L273 TraceCheckUtils]: 18: Hoare triple {5025#(<= main_~i~0 6)} assume true; {5025#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:14,808 INFO L273 TraceCheckUtils]: 19: Hoare triple {5025#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5026#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:14,809 INFO L273 TraceCheckUtils]: 20: Hoare triple {5026#(<= main_~i~0 7)} assume true; {5026#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:14,810 INFO L273 TraceCheckUtils]: 21: Hoare triple {5026#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5027#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:14,810 INFO L273 TraceCheckUtils]: 22: Hoare triple {5027#(<= main_~i~0 8)} assume true; {5027#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:14,811 INFO L273 TraceCheckUtils]: 23: Hoare triple {5027#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5028#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:14,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {5028#(<= main_~i~0 9)} assume true; {5028#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:14,813 INFO L273 TraceCheckUtils]: 25: Hoare triple {5028#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5018#false} is VALID [2018-11-14 16:52:14,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {5018#false} ~i~0 := 0; {5018#false} is VALID [2018-11-14 16:52:14,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5018#false} is VALID [2018-11-14 16:52:14,813 INFO L273 TraceCheckUtils]: 29: Hoare triple {5018#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5018#false} is VALID [2018-11-14 16:52:14,814 INFO L273 TraceCheckUtils]: 30: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,814 INFO L273 TraceCheckUtils]: 31: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5018#false} is VALID [2018-11-14 16:52:14,814 INFO L273 TraceCheckUtils]: 32: Hoare triple {5018#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5018#false} is VALID [2018-11-14 16:52:14,814 INFO L273 TraceCheckUtils]: 33: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,814 INFO L273 TraceCheckUtils]: 34: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5018#false} is VALID [2018-11-14 16:52:14,814 INFO L273 TraceCheckUtils]: 35: Hoare triple {5018#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5018#false} is VALID [2018-11-14 16:52:14,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,815 INFO L273 TraceCheckUtils]: 37: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5018#false} is VALID [2018-11-14 16:52:14,815 INFO L273 TraceCheckUtils]: 38: Hoare triple {5018#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5018#false} is VALID [2018-11-14 16:52:14,815 INFO L273 TraceCheckUtils]: 39: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,815 INFO L273 TraceCheckUtils]: 40: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5018#false} is VALID [2018-11-14 16:52:14,816 INFO L273 TraceCheckUtils]: 41: Hoare triple {5018#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5018#false} is VALID [2018-11-14 16:52:14,816 INFO L273 TraceCheckUtils]: 42: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,816 INFO L273 TraceCheckUtils]: 43: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5018#false} is VALID [2018-11-14 16:52:14,816 INFO L273 TraceCheckUtils]: 44: Hoare triple {5018#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5018#false} is VALID [2018-11-14 16:52:14,816 INFO L273 TraceCheckUtils]: 45: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,817 INFO L273 TraceCheckUtils]: 46: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5018#false} is VALID [2018-11-14 16:52:14,817 INFO L273 TraceCheckUtils]: 47: Hoare triple {5018#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5018#false} is VALID [2018-11-14 16:52:14,817 INFO L273 TraceCheckUtils]: 48: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,817 INFO L273 TraceCheckUtils]: 49: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5018#false} is VALID [2018-11-14 16:52:14,817 INFO L273 TraceCheckUtils]: 50: Hoare triple {5018#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5018#false} is VALID [2018-11-14 16:52:14,818 INFO L273 TraceCheckUtils]: 51: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,818 INFO L273 TraceCheckUtils]: 52: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5018#false} is VALID [2018-11-14 16:52:14,818 INFO L273 TraceCheckUtils]: 53: Hoare triple {5018#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5018#false} is VALID [2018-11-14 16:52:14,818 INFO L273 TraceCheckUtils]: 54: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,818 INFO L273 TraceCheckUtils]: 55: Hoare triple {5018#false} assume !(~i~0 < 100000); {5018#false} is VALID [2018-11-14 16:52:14,818 INFO L273 TraceCheckUtils]: 56: Hoare triple {5018#false} ~i~0 := 0; {5018#false} is VALID [2018-11-14 16:52:14,818 INFO L273 TraceCheckUtils]: 57: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,818 INFO L273 TraceCheckUtils]: 58: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5018#false} is VALID [2018-11-14 16:52:14,819 INFO L273 TraceCheckUtils]: 59: Hoare triple {5018#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5018#false} is VALID [2018-11-14 16:52:14,819 INFO L273 TraceCheckUtils]: 60: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,819 INFO L273 TraceCheckUtils]: 61: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5018#false} is VALID [2018-11-14 16:52:14,819 INFO L273 TraceCheckUtils]: 62: Hoare triple {5018#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5018#false} is VALID [2018-11-14 16:52:14,819 INFO L273 TraceCheckUtils]: 63: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,819 INFO L273 TraceCheckUtils]: 64: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5018#false} is VALID [2018-11-14 16:52:14,819 INFO L273 TraceCheckUtils]: 65: Hoare triple {5018#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5018#false} is VALID [2018-11-14 16:52:14,819 INFO L273 TraceCheckUtils]: 66: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,819 INFO L273 TraceCheckUtils]: 67: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5018#false} is VALID [2018-11-14 16:52:14,820 INFO L273 TraceCheckUtils]: 68: Hoare triple {5018#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5018#false} is VALID [2018-11-14 16:52:14,820 INFO L273 TraceCheckUtils]: 69: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,820 INFO L273 TraceCheckUtils]: 70: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5018#false} is VALID [2018-11-14 16:52:14,820 INFO L273 TraceCheckUtils]: 71: Hoare triple {5018#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5018#false} is VALID [2018-11-14 16:52:14,820 INFO L273 TraceCheckUtils]: 72: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,820 INFO L273 TraceCheckUtils]: 73: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5018#false} is VALID [2018-11-14 16:52:14,820 INFO L273 TraceCheckUtils]: 74: Hoare triple {5018#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5018#false} is VALID [2018-11-14 16:52:14,820 INFO L273 TraceCheckUtils]: 75: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,821 INFO L273 TraceCheckUtils]: 76: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5018#false} is VALID [2018-11-14 16:52:14,821 INFO L273 TraceCheckUtils]: 77: Hoare triple {5018#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5018#false} is VALID [2018-11-14 16:52:14,821 INFO L273 TraceCheckUtils]: 78: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,821 INFO L273 TraceCheckUtils]: 79: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5018#false} is VALID [2018-11-14 16:52:14,821 INFO L273 TraceCheckUtils]: 80: Hoare triple {5018#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5018#false} is VALID [2018-11-14 16:52:14,821 INFO L273 TraceCheckUtils]: 81: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,821 INFO L273 TraceCheckUtils]: 82: Hoare triple {5018#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5018#false} is VALID [2018-11-14 16:52:14,821 INFO L273 TraceCheckUtils]: 83: Hoare triple {5018#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5018#false} is VALID [2018-11-14 16:52:14,821 INFO L273 TraceCheckUtils]: 84: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,822 INFO L273 TraceCheckUtils]: 85: Hoare triple {5018#false} assume !(~i~0 < 100000); {5018#false} is VALID [2018-11-14 16:52:14,822 INFO L273 TraceCheckUtils]: 86: Hoare triple {5018#false} havoc ~x~0;~x~0 := 0; {5018#false} is VALID [2018-11-14 16:52:14,822 INFO L273 TraceCheckUtils]: 87: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:14,822 INFO L273 TraceCheckUtils]: 88: Hoare triple {5018#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {5018#false} is VALID [2018-11-14 16:52:14,822 INFO L256 TraceCheckUtils]: 89: Hoare triple {5018#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5018#false} is VALID [2018-11-14 16:52:14,822 INFO L273 TraceCheckUtils]: 90: Hoare triple {5018#false} ~cond := #in~cond; {5018#false} is VALID [2018-11-14 16:52:14,822 INFO L273 TraceCheckUtils]: 91: Hoare triple {5018#false} assume ~cond == 0; {5018#false} is VALID [2018-11-14 16:52:14,822 INFO L273 TraceCheckUtils]: 92: Hoare triple {5018#false} assume !false; {5018#false} is VALID [2018-11-14 16:52:14,828 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-11-14 16:52:14,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:14,828 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-14 16:52:14,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 16:52:16,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 16:52:16,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:16,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:17,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {5017#true} call ULTIMATE.init(); {5017#true} is VALID [2018-11-14 16:52:17,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {5017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5017#true} is VALID [2018-11-14 16:52:17,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5017#true} {5017#true} #80#return; {5017#true} is VALID [2018-11-14 16:52:17,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {5017#true} call #t~ret6 := main(); {5017#true} is VALID [2018-11-14 16:52:17,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {5017#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5017#true} is VALID [2018-11-14 16:52:17,030 INFO L273 TraceCheckUtils]: 6: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,030 INFO L273 TraceCheckUtils]: 7: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5017#true} is VALID [2018-11-14 16:52:17,030 INFO L273 TraceCheckUtils]: 8: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5017#true} is VALID [2018-11-14 16:52:17,031 INFO L273 TraceCheckUtils]: 10: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,031 INFO L273 TraceCheckUtils]: 11: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5017#true} is VALID [2018-11-14 16:52:17,031 INFO L273 TraceCheckUtils]: 12: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,032 INFO L273 TraceCheckUtils]: 13: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5017#true} is VALID [2018-11-14 16:52:17,032 INFO L273 TraceCheckUtils]: 14: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5017#true} is VALID [2018-11-14 16:52:17,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,033 INFO L273 TraceCheckUtils]: 17: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5017#true} is VALID [2018-11-14 16:52:17,033 INFO L273 TraceCheckUtils]: 18: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,033 INFO L273 TraceCheckUtils]: 19: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5017#true} is VALID [2018-11-14 16:52:17,033 INFO L273 TraceCheckUtils]: 20: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,033 INFO L273 TraceCheckUtils]: 21: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5017#true} is VALID [2018-11-14 16:52:17,033 INFO L273 TraceCheckUtils]: 22: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,034 INFO L273 TraceCheckUtils]: 23: Hoare triple {5017#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5101#(<= main_~i~0 100000)} is VALID [2018-11-14 16:52:17,035 INFO L273 TraceCheckUtils]: 24: Hoare triple {5101#(<= main_~i~0 100000)} assume true; {5101#(<= main_~i~0 100000)} is VALID [2018-11-14 16:52:17,035 INFO L273 TraceCheckUtils]: 25: Hoare triple {5101#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5017#true} is VALID [2018-11-14 16:52:17,035 INFO L273 TraceCheckUtils]: 26: Hoare triple {5017#true} ~i~0 := 0; {5017#true} is VALID [2018-11-14 16:52:17,035 INFO L273 TraceCheckUtils]: 27: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,035 INFO L273 TraceCheckUtils]: 28: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5017#true} is VALID [2018-11-14 16:52:17,035 INFO L273 TraceCheckUtils]: 29: Hoare triple {5017#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5017#true} is VALID [2018-11-14 16:52:17,036 INFO L273 TraceCheckUtils]: 30: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,036 INFO L273 TraceCheckUtils]: 31: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5017#true} is VALID [2018-11-14 16:52:17,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {5017#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5017#true} is VALID [2018-11-14 16:52:17,036 INFO L273 TraceCheckUtils]: 33: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,036 INFO L273 TraceCheckUtils]: 34: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5017#true} is VALID [2018-11-14 16:52:17,036 INFO L273 TraceCheckUtils]: 35: Hoare triple {5017#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5017#true} is VALID [2018-11-14 16:52:17,037 INFO L273 TraceCheckUtils]: 36: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,037 INFO L273 TraceCheckUtils]: 37: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5017#true} is VALID [2018-11-14 16:52:17,037 INFO L273 TraceCheckUtils]: 38: Hoare triple {5017#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5017#true} is VALID [2018-11-14 16:52:17,037 INFO L273 TraceCheckUtils]: 39: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,037 INFO L273 TraceCheckUtils]: 40: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5017#true} is VALID [2018-11-14 16:52:17,037 INFO L273 TraceCheckUtils]: 41: Hoare triple {5017#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5017#true} is VALID [2018-11-14 16:52:17,038 INFO L273 TraceCheckUtils]: 42: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,038 INFO L273 TraceCheckUtils]: 43: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5017#true} is VALID [2018-11-14 16:52:17,038 INFO L273 TraceCheckUtils]: 44: Hoare triple {5017#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5017#true} is VALID [2018-11-14 16:52:17,038 INFO L273 TraceCheckUtils]: 45: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,038 INFO L273 TraceCheckUtils]: 46: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5017#true} is VALID [2018-11-14 16:52:17,038 INFO L273 TraceCheckUtils]: 47: Hoare triple {5017#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5017#true} is VALID [2018-11-14 16:52:17,039 INFO L273 TraceCheckUtils]: 48: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,039 INFO L273 TraceCheckUtils]: 49: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5017#true} is VALID [2018-11-14 16:52:17,039 INFO L273 TraceCheckUtils]: 50: Hoare triple {5017#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5017#true} is VALID [2018-11-14 16:52:17,039 INFO L273 TraceCheckUtils]: 51: Hoare triple {5017#true} assume true; {5017#true} is VALID [2018-11-14 16:52:17,041 INFO L273 TraceCheckUtils]: 52: Hoare triple {5017#true} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5189#(< main_~i~0 100000)} is VALID [2018-11-14 16:52:17,042 INFO L273 TraceCheckUtils]: 53: Hoare triple {5189#(< main_~i~0 100000)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5101#(<= main_~i~0 100000)} is VALID [2018-11-14 16:52:17,042 INFO L273 TraceCheckUtils]: 54: Hoare triple {5101#(<= main_~i~0 100000)} assume true; {5101#(<= main_~i~0 100000)} is VALID [2018-11-14 16:52:17,042 INFO L273 TraceCheckUtils]: 55: Hoare triple {5101#(<= main_~i~0 100000)} assume !(~i~0 < 100000); {5017#true} is VALID [2018-11-14 16:52:17,043 INFO L273 TraceCheckUtils]: 56: Hoare triple {5017#true} ~i~0 := 0; {5202#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:17,043 INFO L273 TraceCheckUtils]: 57: Hoare triple {5202#(<= main_~i~0 0)} assume true; {5202#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:17,044 INFO L273 TraceCheckUtils]: 58: Hoare triple {5202#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5202#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:17,044 INFO L273 TraceCheckUtils]: 59: Hoare triple {5202#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5020#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:17,044 INFO L273 TraceCheckUtils]: 60: Hoare triple {5020#(<= main_~i~0 1)} assume true; {5020#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:17,045 INFO L273 TraceCheckUtils]: 61: Hoare triple {5020#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5020#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:17,046 INFO L273 TraceCheckUtils]: 62: Hoare triple {5020#(<= main_~i~0 1)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5021#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:17,047 INFO L273 TraceCheckUtils]: 63: Hoare triple {5021#(<= main_~i~0 2)} assume true; {5021#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:17,047 INFO L273 TraceCheckUtils]: 64: Hoare triple {5021#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5021#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:17,048 INFO L273 TraceCheckUtils]: 65: Hoare triple {5021#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5022#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:17,049 INFO L273 TraceCheckUtils]: 66: Hoare triple {5022#(<= main_~i~0 3)} assume true; {5022#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:17,049 INFO L273 TraceCheckUtils]: 67: Hoare triple {5022#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5022#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:17,052 INFO L273 TraceCheckUtils]: 68: Hoare triple {5022#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5023#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:17,052 INFO L273 TraceCheckUtils]: 69: Hoare triple {5023#(<= main_~i~0 4)} assume true; {5023#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:17,053 INFO L273 TraceCheckUtils]: 70: Hoare triple {5023#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5023#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:17,053 INFO L273 TraceCheckUtils]: 71: Hoare triple {5023#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5024#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:17,054 INFO L273 TraceCheckUtils]: 72: Hoare triple {5024#(<= main_~i~0 5)} assume true; {5024#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:17,054 INFO L273 TraceCheckUtils]: 73: Hoare triple {5024#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5024#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:17,055 INFO L273 TraceCheckUtils]: 74: Hoare triple {5024#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5025#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:17,055 INFO L273 TraceCheckUtils]: 75: Hoare triple {5025#(<= main_~i~0 6)} assume true; {5025#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:17,055 INFO L273 TraceCheckUtils]: 76: Hoare triple {5025#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5025#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:17,056 INFO L273 TraceCheckUtils]: 77: Hoare triple {5025#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5026#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:17,057 INFO L273 TraceCheckUtils]: 78: Hoare triple {5026#(<= main_~i~0 7)} assume true; {5026#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:17,057 INFO L273 TraceCheckUtils]: 79: Hoare triple {5026#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5026#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:17,058 INFO L273 TraceCheckUtils]: 80: Hoare triple {5026#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5027#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:17,059 INFO L273 TraceCheckUtils]: 81: Hoare triple {5027#(<= main_~i~0 8)} assume true; {5027#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:17,059 INFO L273 TraceCheckUtils]: 82: Hoare triple {5027#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5027#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:17,060 INFO L273 TraceCheckUtils]: 83: Hoare triple {5027#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5028#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:17,061 INFO L273 TraceCheckUtils]: 84: Hoare triple {5028#(<= main_~i~0 9)} assume true; {5028#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:17,062 INFO L273 TraceCheckUtils]: 85: Hoare triple {5028#(<= main_~i~0 9)} assume !(~i~0 < 100000); {5018#false} is VALID [2018-11-14 16:52:17,062 INFO L273 TraceCheckUtils]: 86: Hoare triple {5018#false} havoc ~x~0;~x~0 := 0; {5018#false} is VALID [2018-11-14 16:52:17,062 INFO L273 TraceCheckUtils]: 87: Hoare triple {5018#false} assume true; {5018#false} is VALID [2018-11-14 16:52:17,063 INFO L273 TraceCheckUtils]: 88: Hoare triple {5018#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {5018#false} is VALID [2018-11-14 16:52:17,063 INFO L256 TraceCheckUtils]: 89: Hoare triple {5018#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5018#false} is VALID [2018-11-14 16:52:17,063 INFO L273 TraceCheckUtils]: 90: Hoare triple {5018#false} ~cond := #in~cond; {5018#false} is VALID [2018-11-14 16:52:17,063 INFO L273 TraceCheckUtils]: 91: Hoare triple {5018#false} assume ~cond == 0; {5018#false} is VALID [2018-11-14 16:52:17,064 INFO L273 TraceCheckUtils]: 92: Hoare triple {5018#false} assume !false; {5018#false} is VALID [2018-11-14 16:52:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 44 proven. 126 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2018-11-14 16:52:17,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:17,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 15 [2018-11-14 16:52:17,095 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-11-14 16:52:17,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:17,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:52:17,182 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-14 16:52:17,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:52:17,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:52:17,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:52:17,183 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 15 states. [2018-11-14 16:52:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:17,933 INFO L93 Difference]: Finished difference Result 186 states and 197 transitions. [2018-11-14 16:52:17,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:52:17,933 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 93 [2018-11-14 16:52:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:52:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 145 transitions. [2018-11-14 16:52:17,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:52:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 145 transitions. [2018-11-14 16:52:17,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 145 transitions. [2018-11-14 16:52:18,076 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:18,080 INFO L225 Difference]: With dead ends: 186 [2018-11-14 16:52:18,081 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 16:52:18,081 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 91 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-14 16:52:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 16:52:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-14 16:52:18,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:18,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 114 states. [2018-11-14 16:52:18,235 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-14 16:52:18,235 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-14 16:52:18,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:18,238 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-11-14 16:52:18,238 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-14 16:52:18,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:18,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:18,239 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-14 16:52:18,239 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-14 16:52:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:18,242 INFO L93 Difference]: Finished difference Result 114 states and 117 transitions. [2018-11-14 16:52:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-14 16:52:18,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:18,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:18,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:18,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-14 16:52:18,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 117 transitions. [2018-11-14 16:52:18,245 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 117 transitions. Word has length 93 [2018-11-14 16:52:18,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:18,246 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 117 transitions. [2018-11-14 16:52:18,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:52:18,246 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 117 transitions. [2018-11-14 16:52:18,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 16:52:18,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:18,247 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:18,248 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:18,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:18,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1679068228, now seen corresponding path program 10 times [2018-11-14 16:52:18,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:18,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:18,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:18,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:18,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:18,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {5947#true} call ULTIMATE.init(); {5947#true} is VALID [2018-11-14 16:52:18,878 INFO L273 TraceCheckUtils]: 1: Hoare triple {5947#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5947#true} is VALID [2018-11-14 16:52:18,879 INFO L273 TraceCheckUtils]: 2: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:18,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5947#true} {5947#true} #80#return; {5947#true} is VALID [2018-11-14 16:52:18,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {5947#true} call #t~ret6 := main(); {5947#true} is VALID [2018-11-14 16:52:18,880 INFO L273 TraceCheckUtils]: 5: Hoare triple {5947#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5949#(= main_~i~0 0)} is VALID [2018-11-14 16:52:18,880 INFO L273 TraceCheckUtils]: 6: Hoare triple {5949#(= main_~i~0 0)} assume true; {5949#(= main_~i~0 0)} is VALID [2018-11-14 16:52:18,881 INFO L273 TraceCheckUtils]: 7: Hoare triple {5949#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5950#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:18,881 INFO L273 TraceCheckUtils]: 8: Hoare triple {5950#(<= main_~i~0 1)} assume true; {5950#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:18,882 INFO L273 TraceCheckUtils]: 9: Hoare triple {5950#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5951#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:18,882 INFO L273 TraceCheckUtils]: 10: Hoare triple {5951#(<= main_~i~0 2)} assume true; {5951#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:18,883 INFO L273 TraceCheckUtils]: 11: Hoare triple {5951#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5952#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:18,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {5952#(<= main_~i~0 3)} assume true; {5952#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:18,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {5952#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5953#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:18,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {5953#(<= main_~i~0 4)} assume true; {5953#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:18,885 INFO L273 TraceCheckUtils]: 15: Hoare triple {5953#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5954#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:18,886 INFO L273 TraceCheckUtils]: 16: Hoare triple {5954#(<= main_~i~0 5)} assume true; {5954#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:18,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {5954#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5955#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:18,887 INFO L273 TraceCheckUtils]: 18: Hoare triple {5955#(<= main_~i~0 6)} assume true; {5955#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:18,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {5955#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5956#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:18,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {5956#(<= main_~i~0 7)} assume true; {5956#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:18,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {5956#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5957#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:18,890 INFO L273 TraceCheckUtils]: 22: Hoare triple {5957#(<= main_~i~0 8)} assume true; {5957#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:18,891 INFO L273 TraceCheckUtils]: 23: Hoare triple {5957#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5958#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:18,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {5958#(<= main_~i~0 9)} assume true; {5958#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:18,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {5958#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5959#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:18,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {5959#(<= main_~i~0 10)} assume true; {5959#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:18,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {5959#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5960#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:18,895 INFO L273 TraceCheckUtils]: 28: Hoare triple {5960#(<= main_~i~0 11)} assume true; {5960#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:18,895 INFO L273 TraceCheckUtils]: 29: Hoare triple {5960#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5948#false} is VALID [2018-11-14 16:52:18,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {5948#false} ~i~0 := 0; {5948#false} is VALID [2018-11-14 16:52:18,896 INFO L273 TraceCheckUtils]: 31: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,896 INFO L273 TraceCheckUtils]: 32: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,896 INFO L273 TraceCheckUtils]: 33: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,896 INFO L273 TraceCheckUtils]: 34: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,897 INFO L273 TraceCheckUtils]: 35: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,897 INFO L273 TraceCheckUtils]: 36: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,897 INFO L273 TraceCheckUtils]: 37: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,897 INFO L273 TraceCheckUtils]: 38: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,897 INFO L273 TraceCheckUtils]: 39: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,898 INFO L273 TraceCheckUtils]: 40: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,898 INFO L273 TraceCheckUtils]: 41: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,898 INFO L273 TraceCheckUtils]: 42: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,898 INFO L273 TraceCheckUtils]: 43: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,898 INFO L273 TraceCheckUtils]: 44: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,898 INFO L273 TraceCheckUtils]: 45: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,899 INFO L273 TraceCheckUtils]: 46: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,899 INFO L273 TraceCheckUtils]: 47: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,899 INFO L273 TraceCheckUtils]: 48: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,899 INFO L273 TraceCheckUtils]: 49: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,899 INFO L273 TraceCheckUtils]: 50: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,899 INFO L273 TraceCheckUtils]: 51: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,899 INFO L273 TraceCheckUtils]: 52: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,899 INFO L273 TraceCheckUtils]: 53: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,899 INFO L273 TraceCheckUtils]: 54: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,900 INFO L273 TraceCheckUtils]: 55: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,900 INFO L273 TraceCheckUtils]: 56: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,900 INFO L273 TraceCheckUtils]: 57: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,900 INFO L273 TraceCheckUtils]: 58: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,900 INFO L273 TraceCheckUtils]: 59: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,900 INFO L273 TraceCheckUtils]: 60: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,900 INFO L273 TraceCheckUtils]: 61: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,900 INFO L273 TraceCheckUtils]: 62: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5948#false} is VALID [2018-11-14 16:52:18,901 INFO L273 TraceCheckUtils]: 63: Hoare triple {5948#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5948#false} is VALID [2018-11-14 16:52:18,901 INFO L273 TraceCheckUtils]: 64: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,901 INFO L273 TraceCheckUtils]: 65: Hoare triple {5948#false} assume !(~i~0 < 100000); {5948#false} is VALID [2018-11-14 16:52:18,901 INFO L273 TraceCheckUtils]: 66: Hoare triple {5948#false} ~i~0 := 0; {5948#false} is VALID [2018-11-14 16:52:18,901 INFO L273 TraceCheckUtils]: 67: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,901 INFO L273 TraceCheckUtils]: 68: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,901 INFO L273 TraceCheckUtils]: 69: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,901 INFO L273 TraceCheckUtils]: 70: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,902 INFO L273 TraceCheckUtils]: 71: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,902 INFO L273 TraceCheckUtils]: 72: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,902 INFO L273 TraceCheckUtils]: 73: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,902 INFO L273 TraceCheckUtils]: 74: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,902 INFO L273 TraceCheckUtils]: 75: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,902 INFO L273 TraceCheckUtils]: 76: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,902 INFO L273 TraceCheckUtils]: 77: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,902 INFO L273 TraceCheckUtils]: 78: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,902 INFO L273 TraceCheckUtils]: 79: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,903 INFO L273 TraceCheckUtils]: 80: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,903 INFO L273 TraceCheckUtils]: 81: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,903 INFO L273 TraceCheckUtils]: 82: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,903 INFO L273 TraceCheckUtils]: 83: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,903 INFO L273 TraceCheckUtils]: 84: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,903 INFO L273 TraceCheckUtils]: 85: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,903 INFO L273 TraceCheckUtils]: 86: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,903 INFO L273 TraceCheckUtils]: 87: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,904 INFO L273 TraceCheckUtils]: 88: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,904 INFO L273 TraceCheckUtils]: 89: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,904 INFO L273 TraceCheckUtils]: 90: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,904 INFO L273 TraceCheckUtils]: 91: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,904 INFO L273 TraceCheckUtils]: 92: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,904 INFO L273 TraceCheckUtils]: 93: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,904 INFO L273 TraceCheckUtils]: 94: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,904 INFO L273 TraceCheckUtils]: 95: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,905 INFO L273 TraceCheckUtils]: 96: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,905 INFO L273 TraceCheckUtils]: 97: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,905 INFO L273 TraceCheckUtils]: 98: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:18,905 INFO L273 TraceCheckUtils]: 99: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:18,905 INFO L273 TraceCheckUtils]: 100: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,905 INFO L273 TraceCheckUtils]: 101: Hoare triple {5948#false} assume !(~i~0 < 100000); {5948#false} is VALID [2018-11-14 16:52:18,905 INFO L273 TraceCheckUtils]: 102: Hoare triple {5948#false} havoc ~x~0;~x~0 := 0; {5948#false} is VALID [2018-11-14 16:52:18,906 INFO L273 TraceCheckUtils]: 103: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:18,906 INFO L273 TraceCheckUtils]: 104: Hoare triple {5948#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {5948#false} is VALID [2018-11-14 16:52:18,906 INFO L256 TraceCheckUtils]: 105: Hoare triple {5948#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5948#false} is VALID [2018-11-14 16:52:18,906 INFO L273 TraceCheckUtils]: 106: Hoare triple {5948#false} ~cond := #in~cond; {5948#false} is VALID [2018-11-14 16:52:18,906 INFO L273 TraceCheckUtils]: 107: Hoare triple {5948#false} assume ~cond == 0; {5948#false} is VALID [2018-11-14 16:52:18,906 INFO L273 TraceCheckUtils]: 108: Hoare triple {5948#false} assume !false; {5948#false} is VALID [2018-11-14 16:52:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-11-14 16:52:18,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:18,912 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-14 16:52:18,922 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:52:18,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:52:18,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:52:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:18,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:52:19,143 INFO L256 TraceCheckUtils]: 0: Hoare triple {5947#true} call ULTIMATE.init(); {5947#true} is VALID [2018-11-14 16:52:19,143 INFO L273 TraceCheckUtils]: 1: Hoare triple {5947#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5947#true} is VALID [2018-11-14 16:52:19,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5947#true} {5947#true} #80#return; {5947#true} is VALID [2018-11-14 16:52:19,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {5947#true} call #t~ret6 := main(); {5947#true} is VALID [2018-11-14 16:52:19,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {5947#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5947#true} is VALID [2018-11-14 16:52:19,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 12: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,145 INFO L273 TraceCheckUtils]: 14: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,146 INFO L273 TraceCheckUtils]: 17: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,146 INFO L273 TraceCheckUtils]: 18: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,146 INFO L273 TraceCheckUtils]: 19: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,146 INFO L273 TraceCheckUtils]: 20: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,146 INFO L273 TraceCheckUtils]: 21: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,147 INFO L273 TraceCheckUtils]: 23: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,147 INFO L273 TraceCheckUtils]: 24: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,147 INFO L273 TraceCheckUtils]: 25: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,147 INFO L273 TraceCheckUtils]: 26: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,147 INFO L273 TraceCheckUtils]: 27: Hoare triple {5947#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5947#true} is VALID [2018-11-14 16:52:19,147 INFO L273 TraceCheckUtils]: 28: Hoare triple {5947#true} assume true; {5947#true} is VALID [2018-11-14 16:52:19,147 INFO L273 TraceCheckUtils]: 29: Hoare triple {5947#true} assume !(~i~0 < 100000); {5947#true} is VALID [2018-11-14 16:52:19,148 INFO L273 TraceCheckUtils]: 30: Hoare triple {5947#true} ~i~0 := 0; {6054#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:19,148 INFO L273 TraceCheckUtils]: 31: Hoare triple {6054#(<= main_~i~0 0)} assume true; {6054#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:19,148 INFO L273 TraceCheckUtils]: 32: Hoare triple {6054#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6054#(<= main_~i~0 0)} is VALID [2018-11-14 16:52:19,149 INFO L273 TraceCheckUtils]: 33: Hoare triple {6054#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5950#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:19,149 INFO L273 TraceCheckUtils]: 34: Hoare triple {5950#(<= main_~i~0 1)} assume true; {5950#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:19,150 INFO L273 TraceCheckUtils]: 35: Hoare triple {5950#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5950#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:19,150 INFO L273 TraceCheckUtils]: 36: Hoare triple {5950#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5951#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:19,150 INFO L273 TraceCheckUtils]: 37: Hoare triple {5951#(<= main_~i~0 2)} assume true; {5951#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:19,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {5951#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5951#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:19,151 INFO L273 TraceCheckUtils]: 39: Hoare triple {5951#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5952#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:19,152 INFO L273 TraceCheckUtils]: 40: Hoare triple {5952#(<= main_~i~0 3)} assume true; {5952#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:19,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {5952#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5952#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:19,153 INFO L273 TraceCheckUtils]: 42: Hoare triple {5952#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5953#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:19,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {5953#(<= main_~i~0 4)} assume true; {5953#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:19,154 INFO L273 TraceCheckUtils]: 44: Hoare triple {5953#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5953#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:19,155 INFO L273 TraceCheckUtils]: 45: Hoare triple {5953#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5954#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:19,155 INFO L273 TraceCheckUtils]: 46: Hoare triple {5954#(<= main_~i~0 5)} assume true; {5954#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:19,156 INFO L273 TraceCheckUtils]: 47: Hoare triple {5954#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5954#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:19,156 INFO L273 TraceCheckUtils]: 48: Hoare triple {5954#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5955#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:19,157 INFO L273 TraceCheckUtils]: 49: Hoare triple {5955#(<= main_~i~0 6)} assume true; {5955#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:19,157 INFO L273 TraceCheckUtils]: 50: Hoare triple {5955#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5955#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:19,158 INFO L273 TraceCheckUtils]: 51: Hoare triple {5955#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5956#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:19,159 INFO L273 TraceCheckUtils]: 52: Hoare triple {5956#(<= main_~i~0 7)} assume true; {5956#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:19,159 INFO L273 TraceCheckUtils]: 53: Hoare triple {5956#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5956#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:19,160 INFO L273 TraceCheckUtils]: 54: Hoare triple {5956#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5957#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:19,161 INFO L273 TraceCheckUtils]: 55: Hoare triple {5957#(<= main_~i~0 8)} assume true; {5957#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:19,161 INFO L273 TraceCheckUtils]: 56: Hoare triple {5957#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5957#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:19,162 INFO L273 TraceCheckUtils]: 57: Hoare triple {5957#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5958#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:19,162 INFO L273 TraceCheckUtils]: 58: Hoare triple {5958#(<= main_~i~0 9)} assume true; {5958#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:19,163 INFO L273 TraceCheckUtils]: 59: Hoare triple {5958#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5958#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:19,164 INFO L273 TraceCheckUtils]: 60: Hoare triple {5958#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5959#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:19,164 INFO L273 TraceCheckUtils]: 61: Hoare triple {5959#(<= main_~i~0 10)} assume true; {5959#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:19,165 INFO L273 TraceCheckUtils]: 62: Hoare triple {5959#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {5959#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:19,166 INFO L273 TraceCheckUtils]: 63: Hoare triple {5959#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {5960#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:19,166 INFO L273 TraceCheckUtils]: 64: Hoare triple {5960#(<= main_~i~0 11)} assume true; {5960#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:19,167 INFO L273 TraceCheckUtils]: 65: Hoare triple {5960#(<= main_~i~0 11)} assume !(~i~0 < 100000); {5948#false} is VALID [2018-11-14 16:52:19,167 INFO L273 TraceCheckUtils]: 66: Hoare triple {5948#false} ~i~0 := 0; {5948#false} is VALID [2018-11-14 16:52:19,167 INFO L273 TraceCheckUtils]: 67: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,168 INFO L273 TraceCheckUtils]: 68: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,168 INFO L273 TraceCheckUtils]: 69: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,168 INFO L273 TraceCheckUtils]: 70: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,168 INFO L273 TraceCheckUtils]: 71: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,168 INFO L273 TraceCheckUtils]: 72: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,169 INFO L273 TraceCheckUtils]: 73: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,169 INFO L273 TraceCheckUtils]: 74: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,169 INFO L273 TraceCheckUtils]: 75: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,169 INFO L273 TraceCheckUtils]: 76: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,169 INFO L273 TraceCheckUtils]: 77: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,170 INFO L273 TraceCheckUtils]: 78: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,170 INFO L273 TraceCheckUtils]: 79: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,170 INFO L273 TraceCheckUtils]: 80: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,170 INFO L273 TraceCheckUtils]: 81: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,170 INFO L273 TraceCheckUtils]: 82: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,171 INFO L273 TraceCheckUtils]: 83: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,171 INFO L273 TraceCheckUtils]: 84: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,171 INFO L273 TraceCheckUtils]: 85: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,171 INFO L273 TraceCheckUtils]: 86: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,171 INFO L273 TraceCheckUtils]: 87: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,172 INFO L273 TraceCheckUtils]: 88: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,172 INFO L273 TraceCheckUtils]: 89: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,172 INFO L273 TraceCheckUtils]: 90: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,172 INFO L273 TraceCheckUtils]: 91: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,172 INFO L273 TraceCheckUtils]: 92: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,172 INFO L273 TraceCheckUtils]: 93: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,173 INFO L273 TraceCheckUtils]: 94: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,173 INFO L273 TraceCheckUtils]: 95: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,173 INFO L273 TraceCheckUtils]: 96: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,173 INFO L273 TraceCheckUtils]: 97: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,173 INFO L273 TraceCheckUtils]: 98: Hoare triple {5948#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {5948#false} is VALID [2018-11-14 16:52:19,173 INFO L273 TraceCheckUtils]: 99: Hoare triple {5948#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5948#false} is VALID [2018-11-14 16:52:19,173 INFO L273 TraceCheckUtils]: 100: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,174 INFO L273 TraceCheckUtils]: 101: Hoare triple {5948#false} assume !(~i~0 < 100000); {5948#false} is VALID [2018-11-14 16:52:19,174 INFO L273 TraceCheckUtils]: 102: Hoare triple {5948#false} havoc ~x~0;~x~0 := 0; {5948#false} is VALID [2018-11-14 16:52:19,174 INFO L273 TraceCheckUtils]: 103: Hoare triple {5948#false} assume true; {5948#false} is VALID [2018-11-14 16:52:19,174 INFO L273 TraceCheckUtils]: 104: Hoare triple {5948#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {5948#false} is VALID [2018-11-14 16:52:19,174 INFO L256 TraceCheckUtils]: 105: Hoare triple {5948#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {5948#false} is VALID [2018-11-14 16:52:19,174 INFO L273 TraceCheckUtils]: 106: Hoare triple {5948#false} ~cond := #in~cond; {5948#false} is VALID [2018-11-14 16:52:19,174 INFO L273 TraceCheckUtils]: 107: Hoare triple {5948#false} assume ~cond == 0; {5948#false} is VALID [2018-11-14 16:52:19,174 INFO L273 TraceCheckUtils]: 108: Hoare triple {5948#false} assume !false; {5948#false} is VALID [2018-11-14 16:52:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2018-11-14 16:52:19,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:52:19,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 16:52:19,201 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2018-11-14 16:52:19,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:52:19,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:52:19,278 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-14 16:52:19,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:52:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:52:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:52:19,279 INFO L87 Difference]: Start difference. First operand 114 states and 117 transitions. Second operand 15 states. [2018-11-14 16:52:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:19,770 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-11-14 16:52:19,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:52:19,770 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2018-11-14 16:52:19,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:52:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:52:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 152 transitions. [2018-11-14 16:52:19,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:52:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 152 transitions. [2018-11-14 16:52:19,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 152 transitions. [2018-11-14 16:52:20,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:52:20,419 INFO L225 Difference]: With dead ends: 208 [2018-11-14 16:52:20,419 INFO L226 Difference]: Without dead ends: 124 [2018-11-14 16:52:20,420 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 109 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-14 16:52:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-14 16:52:20,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-14 16:52:20,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:52:20,464 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2018-11-14 16:52:20,464 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2018-11-14 16:52:20,464 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2018-11-14 16:52:20,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:20,468 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-11-14 16:52:20,468 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2018-11-14 16:52:20,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:20,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:20,469 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2018-11-14 16:52:20,469 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2018-11-14 16:52:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:52:20,471 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-11-14 16:52:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 127 transitions. [2018-11-14 16:52:20,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:52:20,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:52:20,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:52:20,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:52:20,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-14 16:52:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 125 transitions. [2018-11-14 16:52:20,475 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 125 transitions. Word has length 109 [2018-11-14 16:52:20,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:52:20,476 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 125 transitions. [2018-11-14 16:52:20,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:52:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 125 transitions. [2018-11-14 16:52:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-14 16:52:20,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:52:20,477 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:52:20,478 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:52:20,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:52:20,478 INFO L82 PathProgramCache]: Analyzing trace with hash 566709785, now seen corresponding path program 11 times [2018-11-14 16:52:20,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:52:20,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:52:20,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:20,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:52:20,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:52:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:52:21,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {6985#true} call ULTIMATE.init(); {6985#true} is VALID [2018-11-14 16:52:21,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {6985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6985#true} is VALID [2018-11-14 16:52:21,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:52:21,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6985#true} {6985#true} #80#return; {6985#true} is VALID [2018-11-14 16:52:21,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {6985#true} call #t~ret6 := main(); {6985#true} is VALID [2018-11-14 16:52:21,132 INFO L273 TraceCheckUtils]: 5: Hoare triple {6985#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6987#(= main_~i~0 0)} is VALID [2018-11-14 16:52:21,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {6987#(= main_~i~0 0)} assume true; {6987#(= main_~i~0 0)} is VALID [2018-11-14 16:52:21,133 INFO L273 TraceCheckUtils]: 7: Hoare triple {6987#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6988#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:21,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {6988#(<= main_~i~0 1)} assume true; {6988#(<= main_~i~0 1)} is VALID [2018-11-14 16:52:21,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {6988#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6989#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:21,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {6989#(<= main_~i~0 2)} assume true; {6989#(<= main_~i~0 2)} is VALID [2018-11-14 16:52:21,135 INFO L273 TraceCheckUtils]: 11: Hoare triple {6989#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6990#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:21,135 INFO L273 TraceCheckUtils]: 12: Hoare triple {6990#(<= main_~i~0 3)} assume true; {6990#(<= main_~i~0 3)} is VALID [2018-11-14 16:52:21,136 INFO L273 TraceCheckUtils]: 13: Hoare triple {6990#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6991#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:21,137 INFO L273 TraceCheckUtils]: 14: Hoare triple {6991#(<= main_~i~0 4)} assume true; {6991#(<= main_~i~0 4)} is VALID [2018-11-14 16:52:21,138 INFO L273 TraceCheckUtils]: 15: Hoare triple {6991#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6992#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:21,138 INFO L273 TraceCheckUtils]: 16: Hoare triple {6992#(<= main_~i~0 5)} assume true; {6992#(<= main_~i~0 5)} is VALID [2018-11-14 16:52:21,139 INFO L273 TraceCheckUtils]: 17: Hoare triple {6992#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6993#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:21,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {6993#(<= main_~i~0 6)} assume true; {6993#(<= main_~i~0 6)} is VALID [2018-11-14 16:52:21,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {6993#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6994#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:21,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {6994#(<= main_~i~0 7)} assume true; {6994#(<= main_~i~0 7)} is VALID [2018-11-14 16:52:21,160 INFO L273 TraceCheckUtils]: 21: Hoare triple {6994#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6995#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:21,161 INFO L273 TraceCheckUtils]: 22: Hoare triple {6995#(<= main_~i~0 8)} assume true; {6995#(<= main_~i~0 8)} is VALID [2018-11-14 16:52:21,161 INFO L273 TraceCheckUtils]: 23: Hoare triple {6995#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6996#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:21,162 INFO L273 TraceCheckUtils]: 24: Hoare triple {6996#(<= main_~i~0 9)} assume true; {6996#(<= main_~i~0 9)} is VALID [2018-11-14 16:52:21,162 INFO L273 TraceCheckUtils]: 25: Hoare triple {6996#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6997#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:21,163 INFO L273 TraceCheckUtils]: 26: Hoare triple {6997#(<= main_~i~0 10)} assume true; {6997#(<= main_~i~0 10)} is VALID [2018-11-14 16:52:21,164 INFO L273 TraceCheckUtils]: 27: Hoare triple {6997#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6998#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:21,164 INFO L273 TraceCheckUtils]: 28: Hoare triple {6998#(<= main_~i~0 11)} assume true; {6998#(<= main_~i~0 11)} is VALID [2018-11-14 16:52:21,165 INFO L273 TraceCheckUtils]: 29: Hoare triple {6998#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6999#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:21,166 INFO L273 TraceCheckUtils]: 30: Hoare triple {6999#(<= main_~i~0 12)} assume true; {6999#(<= main_~i~0 12)} is VALID [2018-11-14 16:52:21,166 INFO L273 TraceCheckUtils]: 31: Hoare triple {6999#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6986#false} is VALID [2018-11-14 16:52:21,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {6986#false} ~i~0 := 0; {6986#false} is VALID [2018-11-14 16:52:21,167 INFO L273 TraceCheckUtils]: 33: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,167 INFO L273 TraceCheckUtils]: 34: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,167 INFO L273 TraceCheckUtils]: 35: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,167 INFO L273 TraceCheckUtils]: 36: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,168 INFO L273 TraceCheckUtils]: 37: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,168 INFO L273 TraceCheckUtils]: 38: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,168 INFO L273 TraceCheckUtils]: 39: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,168 INFO L273 TraceCheckUtils]: 40: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,168 INFO L273 TraceCheckUtils]: 41: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,169 INFO L273 TraceCheckUtils]: 42: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,169 INFO L273 TraceCheckUtils]: 43: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,169 INFO L273 TraceCheckUtils]: 44: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,169 INFO L273 TraceCheckUtils]: 46: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,170 INFO L273 TraceCheckUtils]: 47: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,170 INFO L273 TraceCheckUtils]: 48: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,170 INFO L273 TraceCheckUtils]: 49: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,170 INFO L273 TraceCheckUtils]: 50: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,170 INFO L273 TraceCheckUtils]: 51: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,171 INFO L273 TraceCheckUtils]: 52: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,171 INFO L273 TraceCheckUtils]: 53: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,171 INFO L273 TraceCheckUtils]: 54: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,171 INFO L273 TraceCheckUtils]: 55: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,171 INFO L273 TraceCheckUtils]: 56: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,171 INFO L273 TraceCheckUtils]: 57: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,171 INFO L273 TraceCheckUtils]: 58: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,172 INFO L273 TraceCheckUtils]: 59: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,172 INFO L273 TraceCheckUtils]: 60: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,172 INFO L273 TraceCheckUtils]: 61: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,172 INFO L273 TraceCheckUtils]: 62: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,172 INFO L273 TraceCheckUtils]: 63: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,172 INFO L273 TraceCheckUtils]: 64: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,172 INFO L273 TraceCheckUtils]: 65: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,172 INFO L273 TraceCheckUtils]: 66: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,173 INFO L273 TraceCheckUtils]: 67: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6986#false} is VALID [2018-11-14 16:52:21,173 INFO L273 TraceCheckUtils]: 68: Hoare triple {6986#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6986#false} is VALID [2018-11-14 16:52:21,173 INFO L273 TraceCheckUtils]: 69: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,173 INFO L273 TraceCheckUtils]: 70: Hoare triple {6986#false} assume !(~i~0 < 100000); {6986#false} is VALID [2018-11-14 16:52:21,173 INFO L273 TraceCheckUtils]: 71: Hoare triple {6986#false} ~i~0 := 0; {6986#false} is VALID [2018-11-14 16:52:21,173 INFO L273 TraceCheckUtils]: 72: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,173 INFO L273 TraceCheckUtils]: 73: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,173 INFO L273 TraceCheckUtils]: 74: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,173 INFO L273 TraceCheckUtils]: 75: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,174 INFO L273 TraceCheckUtils]: 76: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,174 INFO L273 TraceCheckUtils]: 77: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,174 INFO L273 TraceCheckUtils]: 78: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,174 INFO L273 TraceCheckUtils]: 79: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,174 INFO L273 TraceCheckUtils]: 80: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,174 INFO L273 TraceCheckUtils]: 81: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,174 INFO L273 TraceCheckUtils]: 82: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,174 INFO L273 TraceCheckUtils]: 83: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,175 INFO L273 TraceCheckUtils]: 84: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,175 INFO L273 TraceCheckUtils]: 85: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,175 INFO L273 TraceCheckUtils]: 86: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,175 INFO L273 TraceCheckUtils]: 87: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,175 INFO L273 TraceCheckUtils]: 88: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,175 INFO L273 TraceCheckUtils]: 89: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,175 INFO L273 TraceCheckUtils]: 90: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,175 INFO L273 TraceCheckUtils]: 91: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,175 INFO L273 TraceCheckUtils]: 92: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,176 INFO L273 TraceCheckUtils]: 93: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,176 INFO L273 TraceCheckUtils]: 94: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,176 INFO L273 TraceCheckUtils]: 95: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,176 INFO L273 TraceCheckUtils]: 96: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,176 INFO L273 TraceCheckUtils]: 97: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,176 INFO L273 TraceCheckUtils]: 98: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,176 INFO L273 TraceCheckUtils]: 99: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,176 INFO L273 TraceCheckUtils]: 100: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,177 INFO L273 TraceCheckUtils]: 101: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,177 INFO L273 TraceCheckUtils]: 102: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,177 INFO L273 TraceCheckUtils]: 103: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,177 INFO L273 TraceCheckUtils]: 104: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,177 INFO L273 TraceCheckUtils]: 105: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,177 INFO L273 TraceCheckUtils]: 106: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:52:21,177 INFO L273 TraceCheckUtils]: 107: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:52:21,177 INFO L273 TraceCheckUtils]: 108: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,177 INFO L273 TraceCheckUtils]: 109: Hoare triple {6986#false} assume !(~i~0 < 100000); {6986#false} is VALID [2018-11-14 16:52:21,178 INFO L273 TraceCheckUtils]: 110: Hoare triple {6986#false} havoc ~x~0;~x~0 := 0; {6986#false} is VALID [2018-11-14 16:52:21,178 INFO L273 TraceCheckUtils]: 111: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:52:21,178 INFO L273 TraceCheckUtils]: 112: Hoare triple {6986#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {6986#false} is VALID [2018-11-14 16:52:21,178 INFO L256 TraceCheckUtils]: 113: Hoare triple {6986#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {6986#false} is VALID [2018-11-14 16:52:21,178 INFO L273 TraceCheckUtils]: 114: Hoare triple {6986#false} ~cond := #in~cond; {6986#false} is VALID [2018-11-14 16:52:21,178 INFO L273 TraceCheckUtils]: 115: Hoare triple {6986#false} assume ~cond == 0; {6986#false} is VALID [2018-11-14 16:52:21,178 INFO L273 TraceCheckUtils]: 116: Hoare triple {6986#false} assume !false; {6986#false} is VALID [2018-11-14 16:52:21,184 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2018-11-14 16:52:21,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:52:21,184 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-14 16:52:21,194 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 16:53:11,880 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-14 16:53:11,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:53:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:11,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:53:12,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {6985#true} call ULTIMATE.init(); {6985#true} is VALID [2018-11-14 16:53:12,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {6985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6985#true} is VALID [2018-11-14 16:53:12,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6985#true} {6985#true} #80#return; {6985#true} is VALID [2018-11-14 16:53:12,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {6985#true} call #t~ret6 := main(); {6985#true} is VALID [2018-11-14 16:53:12,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {6985#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6985#true} is VALID [2018-11-14 16:53:12,105 INFO L273 TraceCheckUtils]: 6: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,106 INFO L273 TraceCheckUtils]: 8: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,106 INFO L273 TraceCheckUtils]: 9: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,106 INFO L273 TraceCheckUtils]: 13: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,107 INFO L273 TraceCheckUtils]: 14: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,107 INFO L273 TraceCheckUtils]: 15: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,107 INFO L273 TraceCheckUtils]: 16: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,107 INFO L273 TraceCheckUtils]: 17: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,107 INFO L273 TraceCheckUtils]: 18: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,108 INFO L273 TraceCheckUtils]: 22: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,108 INFO L273 TraceCheckUtils]: 23: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,108 INFO L273 TraceCheckUtils]: 26: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,108 INFO L273 TraceCheckUtils]: 28: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,108 INFO L273 TraceCheckUtils]: 29: Hoare triple {6985#true} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6985#true} is VALID [2018-11-14 16:53:12,108 INFO L273 TraceCheckUtils]: 30: Hoare triple {6985#true} assume true; {6985#true} is VALID [2018-11-14 16:53:12,109 INFO L273 TraceCheckUtils]: 31: Hoare triple {6985#true} assume !(~i~0 < 100000); {6985#true} is VALID [2018-11-14 16:53:12,109 INFO L273 TraceCheckUtils]: 32: Hoare triple {6985#true} ~i~0 := 0; {7099#(<= main_~i~0 0)} is VALID [2018-11-14 16:53:12,109 INFO L273 TraceCheckUtils]: 33: Hoare triple {7099#(<= main_~i~0 0)} assume true; {7099#(<= main_~i~0 0)} is VALID [2018-11-14 16:53:12,110 INFO L273 TraceCheckUtils]: 34: Hoare triple {7099#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {7099#(<= main_~i~0 0)} is VALID [2018-11-14 16:53:12,110 INFO L273 TraceCheckUtils]: 35: Hoare triple {7099#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6988#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:12,111 INFO L273 TraceCheckUtils]: 36: Hoare triple {6988#(<= main_~i~0 1)} assume true; {6988#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:12,111 INFO L273 TraceCheckUtils]: 37: Hoare triple {6988#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6988#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:12,111 INFO L273 TraceCheckUtils]: 38: Hoare triple {6988#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6989#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:12,112 INFO L273 TraceCheckUtils]: 39: Hoare triple {6989#(<= main_~i~0 2)} assume true; {6989#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:12,112 INFO L273 TraceCheckUtils]: 40: Hoare triple {6989#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6989#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:12,112 INFO L273 TraceCheckUtils]: 41: Hoare triple {6989#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6990#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:12,113 INFO L273 TraceCheckUtils]: 42: Hoare triple {6990#(<= main_~i~0 3)} assume true; {6990#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:12,113 INFO L273 TraceCheckUtils]: 43: Hoare triple {6990#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6990#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:12,114 INFO L273 TraceCheckUtils]: 44: Hoare triple {6990#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6991#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:12,115 INFO L273 TraceCheckUtils]: 45: Hoare triple {6991#(<= main_~i~0 4)} assume true; {6991#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:12,115 INFO L273 TraceCheckUtils]: 46: Hoare triple {6991#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6991#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:12,116 INFO L273 TraceCheckUtils]: 47: Hoare triple {6991#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6992#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:12,116 INFO L273 TraceCheckUtils]: 48: Hoare triple {6992#(<= main_~i~0 5)} assume true; {6992#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:12,117 INFO L273 TraceCheckUtils]: 49: Hoare triple {6992#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6992#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:12,118 INFO L273 TraceCheckUtils]: 50: Hoare triple {6992#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6993#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:12,118 INFO L273 TraceCheckUtils]: 51: Hoare triple {6993#(<= main_~i~0 6)} assume true; {6993#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:12,119 INFO L273 TraceCheckUtils]: 52: Hoare triple {6993#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6993#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:12,120 INFO L273 TraceCheckUtils]: 53: Hoare triple {6993#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6994#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:12,120 INFO L273 TraceCheckUtils]: 54: Hoare triple {6994#(<= main_~i~0 7)} assume true; {6994#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:12,121 INFO L273 TraceCheckUtils]: 55: Hoare triple {6994#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6994#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:12,121 INFO L273 TraceCheckUtils]: 56: Hoare triple {6994#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6995#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:12,122 INFO L273 TraceCheckUtils]: 57: Hoare triple {6995#(<= main_~i~0 8)} assume true; {6995#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:12,122 INFO L273 TraceCheckUtils]: 58: Hoare triple {6995#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6995#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:12,123 INFO L273 TraceCheckUtils]: 59: Hoare triple {6995#(<= main_~i~0 8)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6996#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:12,124 INFO L273 TraceCheckUtils]: 60: Hoare triple {6996#(<= main_~i~0 9)} assume true; {6996#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:12,124 INFO L273 TraceCheckUtils]: 61: Hoare triple {6996#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6996#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:12,125 INFO L273 TraceCheckUtils]: 62: Hoare triple {6996#(<= main_~i~0 9)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6997#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:12,126 INFO L273 TraceCheckUtils]: 63: Hoare triple {6997#(<= main_~i~0 10)} assume true; {6997#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:12,126 INFO L273 TraceCheckUtils]: 64: Hoare triple {6997#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6997#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:12,127 INFO L273 TraceCheckUtils]: 65: Hoare triple {6997#(<= main_~i~0 10)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6998#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:12,127 INFO L273 TraceCheckUtils]: 66: Hoare triple {6998#(<= main_~i~0 11)} assume true; {6998#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:12,128 INFO L273 TraceCheckUtils]: 67: Hoare triple {6998#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {6998#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:12,129 INFO L273 TraceCheckUtils]: 68: Hoare triple {6998#(<= main_~i~0 11)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {6999#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:12,129 INFO L273 TraceCheckUtils]: 69: Hoare triple {6999#(<= main_~i~0 12)} assume true; {6999#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:12,130 INFO L273 TraceCheckUtils]: 70: Hoare triple {6999#(<= main_~i~0 12)} assume !(~i~0 < 100000); {6986#false} is VALID [2018-11-14 16:53:12,130 INFO L273 TraceCheckUtils]: 71: Hoare triple {6986#false} ~i~0 := 0; {6986#false} is VALID [2018-11-14 16:53:12,130 INFO L273 TraceCheckUtils]: 72: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,131 INFO L273 TraceCheckUtils]: 73: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,131 INFO L273 TraceCheckUtils]: 74: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,131 INFO L273 TraceCheckUtils]: 75: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,131 INFO L273 TraceCheckUtils]: 76: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,131 INFO L273 TraceCheckUtils]: 77: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,132 INFO L273 TraceCheckUtils]: 78: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,132 INFO L273 TraceCheckUtils]: 79: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,132 INFO L273 TraceCheckUtils]: 80: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,132 INFO L273 TraceCheckUtils]: 81: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,132 INFO L273 TraceCheckUtils]: 82: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,133 INFO L273 TraceCheckUtils]: 83: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,133 INFO L273 TraceCheckUtils]: 84: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,133 INFO L273 TraceCheckUtils]: 85: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,133 INFO L273 TraceCheckUtils]: 86: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,134 INFO L273 TraceCheckUtils]: 87: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,134 INFO L273 TraceCheckUtils]: 88: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,134 INFO L273 TraceCheckUtils]: 89: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,134 INFO L273 TraceCheckUtils]: 90: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,134 INFO L273 TraceCheckUtils]: 91: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,135 INFO L273 TraceCheckUtils]: 92: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,135 INFO L273 TraceCheckUtils]: 93: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,135 INFO L273 TraceCheckUtils]: 94: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,135 INFO L273 TraceCheckUtils]: 95: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,135 INFO L273 TraceCheckUtils]: 96: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,135 INFO L273 TraceCheckUtils]: 97: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,135 INFO L273 TraceCheckUtils]: 98: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,135 INFO L273 TraceCheckUtils]: 99: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,136 INFO L273 TraceCheckUtils]: 100: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,136 INFO L273 TraceCheckUtils]: 101: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,136 INFO L273 TraceCheckUtils]: 102: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,136 INFO L273 TraceCheckUtils]: 103: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,136 INFO L273 TraceCheckUtils]: 104: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,136 INFO L273 TraceCheckUtils]: 105: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,136 INFO L273 TraceCheckUtils]: 106: Hoare triple {6986#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {6986#false} is VALID [2018-11-14 16:53:12,136 INFO L273 TraceCheckUtils]: 107: Hoare triple {6986#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6986#false} is VALID [2018-11-14 16:53:12,137 INFO L273 TraceCheckUtils]: 108: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,137 INFO L273 TraceCheckUtils]: 109: Hoare triple {6986#false} assume !(~i~0 < 100000); {6986#false} is VALID [2018-11-14 16:53:12,137 INFO L273 TraceCheckUtils]: 110: Hoare triple {6986#false} havoc ~x~0;~x~0 := 0; {6986#false} is VALID [2018-11-14 16:53:12,137 INFO L273 TraceCheckUtils]: 111: Hoare triple {6986#false} assume true; {6986#false} is VALID [2018-11-14 16:53:12,137 INFO L273 TraceCheckUtils]: 112: Hoare triple {6986#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {6986#false} is VALID [2018-11-14 16:53:12,137 INFO L256 TraceCheckUtils]: 113: Hoare triple {6986#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {6986#false} is VALID [2018-11-14 16:53:12,138 INFO L273 TraceCheckUtils]: 114: Hoare triple {6986#false} ~cond := #in~cond; {6986#false} is VALID [2018-11-14 16:53:12,138 INFO L273 TraceCheckUtils]: 115: Hoare triple {6986#false} assume ~cond == 0; {6986#false} is VALID [2018-11-14 16:53:12,138 INFO L273 TraceCheckUtils]: 116: Hoare triple {6986#false} assume !false; {6986#false} is VALID [2018-11-14 16:53:12,146 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-11-14 16:53:12,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:53:12,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 16:53:12,179 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2018-11-14 16:53:12,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:53:12,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:53:12,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:12,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:53:12,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:53:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:53:12,268 INFO L87 Difference]: Start difference. First operand 122 states and 125 transitions. Second operand 16 states. [2018-11-14 16:53:13,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:13,195 INFO L93 Difference]: Finished difference Result 222 states and 230 transitions. [2018-11-14 16:53:13,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 16:53:13,195 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2018-11-14 16:53:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:53:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:53:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2018-11-14 16:53:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:53:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 160 transitions. [2018-11-14 16:53:13,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 160 transitions. [2018-11-14 16:53:13,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:53:13,939 INFO L225 Difference]: With dead ends: 222 [2018-11-14 16:53:13,939 INFO L226 Difference]: Without dead ends: 132 [2018-11-14 16:53:13,940 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:53:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-14 16:53:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-14 16:53:13,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:53:13,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 130 states. [2018-11-14 16:53:13,987 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 130 states. [2018-11-14 16:53:13,987 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 130 states. [2018-11-14 16:53:13,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:13,990 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-14 16:53:13,990 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-11-14 16:53:13,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:13,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:13,991 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 132 states. [2018-11-14 16:53:13,991 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 132 states. [2018-11-14 16:53:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:53:13,994 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-14 16:53:13,994 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-11-14 16:53:13,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:53:13,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:53:13,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:53:13,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:53:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-14 16:53:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2018-11-14 16:53:13,998 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 117 [2018-11-14 16:53:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:53:13,998 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2018-11-14 16:53:13,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:53:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2018-11-14 16:53:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-14 16:53:14,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:53:14,000 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:53:14,000 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:53:14,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:53:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1191870000, now seen corresponding path program 12 times [2018-11-14 16:53:14,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 16:53:14,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 16:53:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:14,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:53:14,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 16:53:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:53:15,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {8094#true} call ULTIMATE.init(); {8094#true} is VALID [2018-11-14 16:53:15,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {8094#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8094#true} is VALID [2018-11-14 16:53:15,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {8094#true} assume true; {8094#true} is VALID [2018-11-14 16:53:15,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8094#true} {8094#true} #80#return; {8094#true} is VALID [2018-11-14 16:53:15,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {8094#true} call #t~ret6 := main(); {8094#true} is VALID [2018-11-14 16:53:15,075 INFO L273 TraceCheckUtils]: 5: Hoare triple {8094#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8096#(= main_~i~0 0)} is VALID [2018-11-14 16:53:15,076 INFO L273 TraceCheckUtils]: 6: Hoare triple {8096#(= main_~i~0 0)} assume true; {8096#(= main_~i~0 0)} is VALID [2018-11-14 16:53:15,094 INFO L273 TraceCheckUtils]: 7: Hoare triple {8096#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8097#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:15,103 INFO L273 TraceCheckUtils]: 8: Hoare triple {8097#(<= main_~i~0 1)} assume true; {8097#(<= main_~i~0 1)} is VALID [2018-11-14 16:53:15,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {8097#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8098#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:15,125 INFO L273 TraceCheckUtils]: 10: Hoare triple {8098#(<= main_~i~0 2)} assume true; {8098#(<= main_~i~0 2)} is VALID [2018-11-14 16:53:15,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {8098#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8099#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:15,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {8099#(<= main_~i~0 3)} assume true; {8099#(<= main_~i~0 3)} is VALID [2018-11-14 16:53:15,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {8099#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8100#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:15,129 INFO L273 TraceCheckUtils]: 14: Hoare triple {8100#(<= main_~i~0 4)} assume true; {8100#(<= main_~i~0 4)} is VALID [2018-11-14 16:53:15,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {8100#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8101#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:15,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {8101#(<= main_~i~0 5)} assume true; {8101#(<= main_~i~0 5)} is VALID [2018-11-14 16:53:15,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {8101#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8102#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:15,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {8102#(<= main_~i~0 6)} assume true; {8102#(<= main_~i~0 6)} is VALID [2018-11-14 16:53:15,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {8102#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8103#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:15,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {8103#(<= main_~i~0 7)} assume true; {8103#(<= main_~i~0 7)} is VALID [2018-11-14 16:53:15,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {8103#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8104#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:15,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {8104#(<= main_~i~0 8)} assume true; {8104#(<= main_~i~0 8)} is VALID [2018-11-14 16:53:15,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {8104#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8105#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:15,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {8105#(<= main_~i~0 9)} assume true; {8105#(<= main_~i~0 9)} is VALID [2018-11-14 16:53:15,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {8105#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8106#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:15,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {8106#(<= main_~i~0 10)} assume true; {8106#(<= main_~i~0 10)} is VALID [2018-11-14 16:53:15,138 INFO L273 TraceCheckUtils]: 27: Hoare triple {8106#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8107#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:15,138 INFO L273 TraceCheckUtils]: 28: Hoare triple {8107#(<= main_~i~0 11)} assume true; {8107#(<= main_~i~0 11)} is VALID [2018-11-14 16:53:15,139 INFO L273 TraceCheckUtils]: 29: Hoare triple {8107#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8108#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:15,140 INFO L273 TraceCheckUtils]: 30: Hoare triple {8108#(<= main_~i~0 12)} assume true; {8108#(<= main_~i~0 12)} is VALID [2018-11-14 16:53:15,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {8108#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8109#(<= main_~i~0 13)} is VALID [2018-11-14 16:53:15,141 INFO L273 TraceCheckUtils]: 32: Hoare triple {8109#(<= main_~i~0 13)} assume true; {8109#(<= main_~i~0 13)} is VALID [2018-11-14 16:53:15,142 INFO L273 TraceCheckUtils]: 33: Hoare triple {8109#(<= main_~i~0 13)} assume !(~i~0 < 100000); {8095#false} is VALID [2018-11-14 16:53:15,142 INFO L273 TraceCheckUtils]: 34: Hoare triple {8095#false} ~i~0 := 0; {8095#false} is VALID [2018-11-14 16:53:15,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,142 INFO L273 TraceCheckUtils]: 36: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,143 INFO L273 TraceCheckUtils]: 37: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,143 INFO L273 TraceCheckUtils]: 38: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,143 INFO L273 TraceCheckUtils]: 39: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,143 INFO L273 TraceCheckUtils]: 40: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,144 INFO L273 TraceCheckUtils]: 44: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,144 INFO L273 TraceCheckUtils]: 45: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,144 INFO L273 TraceCheckUtils]: 46: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,145 INFO L273 TraceCheckUtils]: 47: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,145 INFO L273 TraceCheckUtils]: 48: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,145 INFO L273 TraceCheckUtils]: 49: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,145 INFO L273 TraceCheckUtils]: 50: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,145 INFO L273 TraceCheckUtils]: 51: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,145 INFO L273 TraceCheckUtils]: 52: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,145 INFO L273 TraceCheckUtils]: 54: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,145 INFO L273 TraceCheckUtils]: 55: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,146 INFO L273 TraceCheckUtils]: 56: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,146 INFO L273 TraceCheckUtils]: 57: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,146 INFO L273 TraceCheckUtils]: 58: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,146 INFO L273 TraceCheckUtils]: 59: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,146 INFO L273 TraceCheckUtils]: 60: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,146 INFO L273 TraceCheckUtils]: 61: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,146 INFO L273 TraceCheckUtils]: 62: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,146 INFO L273 TraceCheckUtils]: 63: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,146 INFO L273 TraceCheckUtils]: 64: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,147 INFO L273 TraceCheckUtils]: 65: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,147 INFO L273 TraceCheckUtils]: 66: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,147 INFO L273 TraceCheckUtils]: 67: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,147 INFO L273 TraceCheckUtils]: 68: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,147 INFO L273 TraceCheckUtils]: 69: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,147 INFO L273 TraceCheckUtils]: 70: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,147 INFO L273 TraceCheckUtils]: 71: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,147 INFO L273 TraceCheckUtils]: 72: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);call write~int(#t~mem1, ~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);havoc #t~mem1; {8095#false} is VALID [2018-11-14 16:53:15,148 INFO L273 TraceCheckUtils]: 73: Hoare triple {8095#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {8095#false} is VALID [2018-11-14 16:53:15,148 INFO L273 TraceCheckUtils]: 74: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,148 INFO L273 TraceCheckUtils]: 75: Hoare triple {8095#false} assume !(~i~0 < 100000); {8095#false} is VALID [2018-11-14 16:53:15,148 INFO L273 TraceCheckUtils]: 76: Hoare triple {8095#false} ~i~0 := 0; {8095#false} is VALID [2018-11-14 16:53:15,148 INFO L273 TraceCheckUtils]: 77: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,148 INFO L273 TraceCheckUtils]: 78: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,148 INFO L273 TraceCheckUtils]: 79: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,149 INFO L273 TraceCheckUtils]: 80: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,149 INFO L273 TraceCheckUtils]: 81: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,149 INFO L273 TraceCheckUtils]: 82: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,149 INFO L273 TraceCheckUtils]: 83: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,149 INFO L273 TraceCheckUtils]: 84: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,149 INFO L273 TraceCheckUtils]: 85: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,149 INFO L273 TraceCheckUtils]: 86: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,149 INFO L273 TraceCheckUtils]: 87: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,149 INFO L273 TraceCheckUtils]: 88: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,150 INFO L273 TraceCheckUtils]: 89: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,150 INFO L273 TraceCheckUtils]: 90: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,150 INFO L273 TraceCheckUtils]: 91: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,150 INFO L273 TraceCheckUtils]: 92: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,150 INFO L273 TraceCheckUtils]: 93: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,150 INFO L273 TraceCheckUtils]: 94: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,150 INFO L273 TraceCheckUtils]: 95: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,150 INFO L273 TraceCheckUtils]: 96: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,151 INFO L273 TraceCheckUtils]: 97: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,151 INFO L273 TraceCheckUtils]: 98: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,151 INFO L273 TraceCheckUtils]: 99: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,151 INFO L273 TraceCheckUtils]: 100: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,151 INFO L273 TraceCheckUtils]: 101: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,151 INFO L273 TraceCheckUtils]: 102: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,151 INFO L273 TraceCheckUtils]: 103: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,151 INFO L273 TraceCheckUtils]: 104: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,151 INFO L273 TraceCheckUtils]: 105: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,152 INFO L273 TraceCheckUtils]: 106: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,152 INFO L273 TraceCheckUtils]: 107: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,152 INFO L273 TraceCheckUtils]: 108: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,152 INFO L273 TraceCheckUtils]: 109: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,152 INFO L273 TraceCheckUtils]: 110: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,152 INFO L273 TraceCheckUtils]: 111: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,152 INFO L273 TraceCheckUtils]: 112: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,152 INFO L273 TraceCheckUtils]: 113: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,152 INFO L273 TraceCheckUtils]: 114: Hoare triple {8095#false} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#b~0.base, ~#b~0.offset + ~i~0 * 4, 4);call write~int(#t~mem3 + ~i~0, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);havoc #t~mem3; {8095#false} is VALID [2018-11-14 16:53:15,153 INFO L273 TraceCheckUtils]: 115: Hoare triple {8095#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8095#false} is VALID [2018-11-14 16:53:15,153 INFO L273 TraceCheckUtils]: 116: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,153 INFO L273 TraceCheckUtils]: 117: Hoare triple {8095#false} assume !(~i~0 < 100000); {8095#false} is VALID [2018-11-14 16:53:15,153 INFO L273 TraceCheckUtils]: 118: Hoare triple {8095#false} havoc ~x~0;~x~0 := 0; {8095#false} is VALID [2018-11-14 16:53:15,153 INFO L273 TraceCheckUtils]: 119: Hoare triple {8095#false} assume true; {8095#false} is VALID [2018-11-14 16:53:15,153 INFO L273 TraceCheckUtils]: 120: Hoare triple {8095#false} assume !!(~x~0 < 100000);call #t~mem5 := read~int(~#b~0.base, ~#b~0.offset + ~x~0 * 4, 4); {8095#false} is VALID [2018-11-14 16:53:15,154 INFO L256 TraceCheckUtils]: 121: Hoare triple {8095#false} call __VERIFIER_assert((if #t~mem5 == 42 + ~x~0 then 1 else 0)); {8095#false} is VALID [2018-11-14 16:53:15,154 INFO L273 TraceCheckUtils]: 122: Hoare triple {8095#false} ~cond := #in~cond; {8095#false} is VALID [2018-11-14 16:53:15,154 INFO L273 TraceCheckUtils]: 123: Hoare triple {8095#false} assume ~cond == 0; {8095#false} is VALID [2018-11-14 16:53:15,154 INFO L273 TraceCheckUtils]: 124: Hoare triple {8095#false} assume !false; {8095#false} is VALID [2018-11-14 16:53:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2018-11-14 16:53:15,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 16:53:15,163 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-14 16:53:15,174 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE