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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-programs/copysome1_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:23:28,326 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:23:28,330 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:23:28,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:23:28,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:23:28,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:23:28,347 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:23:28,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:23:28,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:23:28,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:23:28,352 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:23:28,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:23:28,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:23:28,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:23:28,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:23:28,356 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:23:28,357 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:23:28,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:23:28,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:23:28,363 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:23:28,364 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:23:28,366 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:23:28,368 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:23:28,369 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:23:28,369 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:23:28,370 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:23:28,371 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:23:28,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:23:28,372 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:23:28,374 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:23:28,374 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:23:28,375 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:23:28,375 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:23:28,375 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:23:28,376 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:23:28,377 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:23:28,378 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-23 12:23:28,401 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:23:28,401 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:23:28,403 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:23:28,403 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:23:28,404 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:23:28,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:23:28,404 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:23:28,404 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:23:28,405 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:23:28,405 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:23:28,405 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:23:28,405 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:23:28,405 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:23:28,406 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:23:28,406 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:23:28,406 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:23:28,406 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:23:28,406 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:23:28,406 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:23:28,407 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:23:28,407 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:23:28,407 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:23:28,407 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:23:28,408 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:23:28,408 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:23:28,408 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:23:28,408 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:23:28,408 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:23:28,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:23:28,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:23:28,409 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:23:28,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:23:28,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:23:28,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:23:28,493 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:23:28,494 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:23:28,495 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-programs/copysome1_false-unreach-call.i [2018-11-23 12:23:28,563 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138a3aabf/c5a2df9d48594dc1bfdec61178f7fc78/FLAGc5155da41 [2018-11-23 12:23:28,980 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:23:28,981 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-programs/copysome1_false-unreach-call.i [2018-11-23 12:23:28,986 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138a3aabf/c5a2df9d48594dc1bfdec61178f7fc78/FLAGc5155da41 [2018-11-23 12:23:29,347 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/138a3aabf/c5a2df9d48594dc1bfdec61178f7fc78 [2018-11-23 12:23:29,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:23:29,358 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:23:29,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:29,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:23:29,363 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:23:29,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d8da9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29, skipping insertion in model container [2018-11-23 12:23:29,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:23:29,402 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:23:29,631 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:29,636 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:23:29,665 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:23:29,688 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:23:29,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29 WrapperNode [2018-11-23 12:23:29,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:23:29,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:29,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:23:29,690 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:23:29,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:23:29,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:23:29,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:23:29,715 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:23:29,725 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (1/1) ... [2018-11-23 12:23:29,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:23:29,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:23:29,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:23:29,751 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:23:29,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (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-23 12:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:23:29,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:23:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:23:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:23:29,873 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:23:29,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:23:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:23:29,874 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:23:29,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:23:30,453 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:23:30,454 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:23:30,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:30 BoogieIcfgContainer [2018-11-23 12:23:30,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:23:30,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:23:30,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:23:30,459 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:23:30,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:23:29" (1/3) ... [2018-11-23 12:23:30,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6411f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:30, skipping insertion in model container [2018-11-23 12:23:30,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:23:29" (2/3) ... [2018-11-23 12:23:30,461 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a6411f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:23:30, skipping insertion in model container [2018-11-23 12:23:30,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:23:30" (3/3) ... [2018-11-23 12:23:30,463 INFO L112 eAbstractionObserver]: Analyzing ICFG copysome1_false-unreach-call.i [2018-11-23 12:23:30,473 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:23:30,480 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:23:30,499 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:23:30,534 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:23:30,535 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:23:30,535 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:23:30,535 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:23:30,536 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:23:30,536 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:23:30,536 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:23:30,536 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:23:30,536 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:23:30,556 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 12:23:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:23:30,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:30,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:30,566 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:30,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash -908266250, now seen corresponding path program 1 times [2018-11-23 12:23:30,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:30,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:30,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:30,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:30,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:30,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 12:23:30,742 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32#true} is VALID [2018-11-23 12:23:30,742 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 12:23:30,743 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #73#return; {32#true} is VALID [2018-11-23 12:23:30,743 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret8 := main(); {32#true} is VALID [2018-11-23 12:23:30,743 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {32#true} is VALID [2018-11-23 12:23:30,744 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 12:23:30,745 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0; {33#false} is VALID [2018-11-23 12:23:30,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !true; {33#false} is VALID [2018-11-23 12:23:30,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {33#false} is VALID [2018-11-23 12:23:30,746 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !!(~x~0 < 200000); {33#false} is VALID [2018-11-23 12:23:30,746 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {33#false} is VALID [2018-11-23 12:23:30,746 INFO L256 TraceCheckUtils]: 12: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {33#false} is VALID [2018-11-23 12:23:30,747 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 12:23:30,747 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2018-11-23 12:23:30,747 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 12:23:30,751 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-23 12:23:30,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:30,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:23:30,758 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:23:30,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:30,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:23:30,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:30,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:23:30,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:23:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:23:30,922 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 12:23:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:31,136 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-23 12:23:31,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:23:31,136 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 12:23:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:23:31,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 12:23:31,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:23:31,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 12:23:31,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 65 transitions. [2018-11-23 12:23:31,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:31,633 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:23:31,633 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:23:31,637 INFO L631 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-23 12:23:31,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:23:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:23:31,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:31,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:23:31,688 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:23:31,689 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:23:31,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:31,694 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:23:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:23:31,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:31,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:31,695 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:23:31,695 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:23:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:31,700 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 12:23:31,700 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:23:31,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:31,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:31,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:31,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:23:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-23 12:23:31,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 16 [2018-11-23 12:23:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:31,707 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-23 12:23:31,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:23:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-23 12:23:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:23:31,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:31,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:31,709 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:31,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:31,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1720229721, now seen corresponding path program 1 times [2018-11-23 12:23:31,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:31,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:31,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:31,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:31,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:31,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {180#true} call ULTIMATE.init(); {180#true} is VALID [2018-11-23 12:23:31,818 INFO L273 TraceCheckUtils]: 1: Hoare triple {180#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {180#true} is VALID [2018-11-23 12:23:31,818 INFO L273 TraceCheckUtils]: 2: Hoare triple {180#true} assume true; {180#true} is VALID [2018-11-23 12:23:31,818 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {180#true} {180#true} #73#return; {180#true} is VALID [2018-11-23 12:23:31,819 INFO L256 TraceCheckUtils]: 4: Hoare triple {180#true} call #t~ret8 := main(); {180#true} is VALID [2018-11-23 12:23:31,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {180#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {182#(= main_~i~0 0)} is VALID [2018-11-23 12:23:31,823 INFO L273 TraceCheckUtils]: 6: Hoare triple {182#(= main_~i~0 0)} assume !(~i~0 < 200000); {181#false} is VALID [2018-11-23 12:23:31,823 INFO L273 TraceCheckUtils]: 7: Hoare triple {181#false} ~i~0 := 0; {181#false} is VALID [2018-11-23 12:23:31,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {181#false} assume !(~i~0 < 200000); {181#false} is VALID [2018-11-23 12:23:31,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {181#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {181#false} is VALID [2018-11-23 12:23:31,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {181#false} assume !!(~x~0 < 200000); {181#false} is VALID [2018-11-23 12:23:31,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {181#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {181#false} is VALID [2018-11-23 12:23:31,826 INFO L256 TraceCheckUtils]: 12: Hoare triple {181#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {181#false} is VALID [2018-11-23 12:23:31,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {181#false} ~cond := #in~cond; {181#false} is VALID [2018-11-23 12:23:31,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {181#false} assume 0 == ~cond; {181#false} is VALID [2018-11-23 12:23:31,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {181#false} assume !false; {181#false} is VALID [2018-11-23 12:23:31,829 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-23 12:23:31,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:31,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:23:31,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:23:31,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:31,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:23:31,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:31,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:23:31,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:23:31,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:23:31,874 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 3 states. [2018-11-23 12:23:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:32,053 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-11-23 12:23:32,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:23:32,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:23:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:23:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:23:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:23:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:23:32,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:23:32,522 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:32,524 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:23:32,524 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:23:32,525 INFO L631 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-23 12:23:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:23:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-11-23 12:23:32,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:32,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 26 states. [2018-11-23 12:23:32,552 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 26 states. [2018-11-23 12:23:32,552 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 26 states. [2018-11-23 12:23:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:32,555 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:23:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:23:32,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:32,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:32,556 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 29 states. [2018-11-23 12:23:32,556 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 29 states. [2018-11-23 12:23:32,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:32,559 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 12:23:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 12:23:32,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:32,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:32,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:32,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:32,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:23:32,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 12:23:32,563 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2018-11-23 12:23:32,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:32,564 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 12:23:32,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:23:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 12:23:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:23:32,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:32,565 INFO L402 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-23 12:23:32,566 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:32,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:32,566 INFO L82 PathProgramCache]: Analyzing trace with hash -2103920742, now seen corresponding path program 1 times [2018-11-23 12:23:32,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:32,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:32,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:32,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:32,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:32,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2018-11-23 12:23:32,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {340#true} is VALID [2018-11-23 12:23:32,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2018-11-23 12:23:32,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #73#return; {340#true} is VALID [2018-11-23 12:23:32,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret8 := main(); {340#true} is VALID [2018-11-23 12:23:32,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {340#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:32,737 INFO L273 TraceCheckUtils]: 6: Hoare triple {342#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:32,739 INFO L273 TraceCheckUtils]: 7: Hoare triple {342#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:32,739 INFO L273 TraceCheckUtils]: 8: Hoare triple {342#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:32,741 INFO L273 TraceCheckUtils]: 9: Hoare triple {342#(<= main_~z~0 150000)} ~i~0 := 0; {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:32,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {342#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {342#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:32,742 INFO L273 TraceCheckUtils]: 11: Hoare triple {342#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {343#(<= main_~i~0 150000)} is VALID [2018-11-23 12:23:32,743 INFO L273 TraceCheckUtils]: 12: Hoare triple {343#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {344#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:32,743 INFO L273 TraceCheckUtils]: 13: Hoare triple {344#(<= main_~i~0 150001)} assume !(~i~0 < 200000); {341#false} is VALID [2018-11-23 12:23:32,744 INFO L273 TraceCheckUtils]: 14: Hoare triple {341#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {341#false} is VALID [2018-11-23 12:23:32,744 INFO L273 TraceCheckUtils]: 15: Hoare triple {341#false} assume !!(~x~0 < 200000); {341#false} is VALID [2018-11-23 12:23:32,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {341#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {341#false} is VALID [2018-11-23 12:23:32,745 INFO L256 TraceCheckUtils]: 17: Hoare triple {341#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {341#false} is VALID [2018-11-23 12:23:32,745 INFO L273 TraceCheckUtils]: 18: Hoare triple {341#false} ~cond := #in~cond; {341#false} is VALID [2018-11-23 12:23:32,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {341#false} assume 0 == ~cond; {341#false} is VALID [2018-11-23 12:23:32,747 INFO L273 TraceCheckUtils]: 20: Hoare triple {341#false} assume !false; {341#false} is VALID [2018-11-23 12:23:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:23:32,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:32,749 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-23 12:23:32,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:32,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:33,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2018-11-23 12:23:33,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {340#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {340#true} is VALID [2018-11-23 12:23:33,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2018-11-23 12:23:33,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #73#return; {340#true} is VALID [2018-11-23 12:23:33,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret8 := main(); {340#true} is VALID [2018-11-23 12:23:33,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {340#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {363#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:33,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {363#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {363#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:33,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {363#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {370#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:33,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {370#(<= main_~i~0 1)} assume !(~i~0 < 200000); {341#false} is VALID [2018-11-23 12:23:33,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {341#false} ~i~0 := 0; {341#false} is VALID [2018-11-23 12:23:33,392 INFO L273 TraceCheckUtils]: 10: Hoare triple {341#false} assume !!(~i~0 < 200000); {341#false} is VALID [2018-11-23 12:23:33,393 INFO L273 TraceCheckUtils]: 11: Hoare triple {341#false} assume !(~i~0 != ~z~0); {341#false} is VALID [2018-11-23 12:23:33,393 INFO L273 TraceCheckUtils]: 12: Hoare triple {341#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {341#false} is VALID [2018-11-23 12:23:33,393 INFO L273 TraceCheckUtils]: 13: Hoare triple {341#false} assume !(~i~0 < 200000); {341#false} is VALID [2018-11-23 12:23:33,394 INFO L273 TraceCheckUtils]: 14: Hoare triple {341#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {341#false} is VALID [2018-11-23 12:23:33,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {341#false} assume !!(~x~0 < 200000); {341#false} is VALID [2018-11-23 12:23:33,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {341#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {341#false} is VALID [2018-11-23 12:23:33,395 INFO L256 TraceCheckUtils]: 17: Hoare triple {341#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {341#false} is VALID [2018-11-23 12:23:33,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {341#false} ~cond := #in~cond; {341#false} is VALID [2018-11-23 12:23:33,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {341#false} assume 0 == ~cond; {341#false} is VALID [2018-11-23 12:23:33,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {341#false} assume !false; {341#false} is VALID [2018-11-23 12:23:33,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:23:33,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:33,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2018-11-23 12:23:33,417 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 12:23:33,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:33,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:23:33,661 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-23 12:23:33,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:23:33,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:23:33,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:23:33,662 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 7 states. [2018-11-23 12:23:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:34,414 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2018-11-23 12:23:34,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:23:34,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-23 12:23:34,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:23:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 12:23:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:23:34,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 77 transitions. [2018-11-23 12:23:34,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 77 transitions. [2018-11-23 12:23:34,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:34,586 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:23:34,586 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:23:34,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:23:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:23:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 12:23:34,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:34,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 41 states. [2018-11-23 12:23:34,649 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 41 states. [2018-11-23 12:23:34,650 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 41 states. [2018-11-23 12:23:34,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:34,654 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:23:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:23:34,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:34,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:34,656 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 44 states. [2018-11-23 12:23:34,656 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 44 states. [2018-11-23 12:23:34,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:34,659 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-11-23 12:23:34,660 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 12:23:34,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:34,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:34,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:34,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:23:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2018-11-23 12:23:34,664 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 21 [2018-11-23 12:23:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:34,664 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2018-11-23 12:23:34,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:23:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2018-11-23 12:23:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:23:34,666 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:34,666 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:34,666 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:34,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:34,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1242247089, now seen corresponding path program 1 times [2018-11-23 12:23:34,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:34,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:34,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:34,807 INFO L256 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {646#true} is VALID [2018-11-23 12:23:34,808 INFO L273 TraceCheckUtils]: 1: Hoare triple {646#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {646#true} is VALID [2018-11-23 12:23:34,808 INFO L273 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2018-11-23 12:23:34,808 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #73#return; {646#true} is VALID [2018-11-23 12:23:34,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret8 := main(); {646#true} is VALID [2018-11-23 12:23:34,809 INFO L273 TraceCheckUtils]: 5: Hoare triple {646#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {646#true} is VALID [2018-11-23 12:23:34,809 INFO L273 TraceCheckUtils]: 6: Hoare triple {646#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {646#true} is VALID [2018-11-23 12:23:34,809 INFO L273 TraceCheckUtils]: 7: Hoare triple {646#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {646#true} is VALID [2018-11-23 12:23:34,809 INFO L273 TraceCheckUtils]: 8: Hoare triple {646#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {646#true} is VALID [2018-11-23 12:23:34,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {646#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {646#true} is VALID [2018-11-23 12:23:34,810 INFO L273 TraceCheckUtils]: 10: Hoare triple {646#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {646#true} is VALID [2018-11-23 12:23:34,810 INFO L273 TraceCheckUtils]: 11: Hoare triple {646#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {646#true} is VALID [2018-11-23 12:23:34,810 INFO L273 TraceCheckUtils]: 12: Hoare triple {646#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {646#true} is VALID [2018-11-23 12:23:34,811 INFO L273 TraceCheckUtils]: 13: Hoare triple {646#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {646#true} is VALID [2018-11-23 12:23:34,811 INFO L273 TraceCheckUtils]: 14: Hoare triple {646#true} assume !(~i~0 < 200000); {646#true} is VALID [2018-11-23 12:23:34,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {646#true} ~i~0 := 0; {646#true} is VALID [2018-11-23 12:23:34,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {646#true} assume !!(~i~0 < 200000); {646#true} is VALID [2018-11-23 12:23:34,812 INFO L273 TraceCheckUtils]: 17: Hoare triple {646#true} assume !(~i~0 != ~z~0); {648#(<= main_~z~0 main_~i~0)} is VALID [2018-11-23 12:23:34,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {648#(<= main_~z~0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {649#(<= (+ main_~z~0 1) main_~i~0)} is VALID [2018-11-23 12:23:34,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {649#(<= (+ main_~z~0 1) main_~i~0)} assume !!(~i~0 < 200000); {649#(<= (+ main_~z~0 1) main_~i~0)} is VALID [2018-11-23 12:23:34,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {649#(<= (+ main_~z~0 1) main_~i~0)} assume !(~i~0 != ~z~0); {647#false} is VALID [2018-11-23 12:23:34,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {647#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {647#false} is VALID [2018-11-23 12:23:34,822 INFO L273 TraceCheckUtils]: 22: Hoare triple {647#false} assume !!(~i~0 < 200000); {647#false} is VALID [2018-11-23 12:23:34,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {647#false} assume !(~i~0 != ~z~0); {647#false} is VALID [2018-11-23 12:23:34,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {647#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {647#false} is VALID [2018-11-23 12:23:34,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {647#false} assume !!(~i~0 < 200000); {647#false} is VALID [2018-11-23 12:23:34,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {647#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {647#false} is VALID [2018-11-23 12:23:34,823 INFO L273 TraceCheckUtils]: 27: Hoare triple {647#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {647#false} is VALID [2018-11-23 12:23:34,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {647#false} assume !(~i~0 < 200000); {647#false} is VALID [2018-11-23 12:23:34,824 INFO L273 TraceCheckUtils]: 29: Hoare triple {647#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {647#false} is VALID [2018-11-23 12:23:34,824 INFO L273 TraceCheckUtils]: 30: Hoare triple {647#false} assume !!(~x~0 < 200000); {647#false} is VALID [2018-11-23 12:23:34,824 INFO L273 TraceCheckUtils]: 31: Hoare triple {647#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {647#false} is VALID [2018-11-23 12:23:34,824 INFO L256 TraceCheckUtils]: 32: Hoare triple {647#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {647#false} is VALID [2018-11-23 12:23:34,825 INFO L273 TraceCheckUtils]: 33: Hoare triple {647#false} ~cond := #in~cond; {647#false} is VALID [2018-11-23 12:23:34,825 INFO L273 TraceCheckUtils]: 34: Hoare triple {647#false} assume 0 == ~cond; {647#false} is VALID [2018-11-23 12:23:34,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {647#false} assume !false; {647#false} is VALID [2018-11-23 12:23:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 12:23:34,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:23:34,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:23:34,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 12:23:34,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:34,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:23:34,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:34,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:23:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:23:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:23:34,875 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 4 states. [2018-11-23 12:23:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:35,082 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2018-11-23 12:23:35,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:23:35,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-23 12:23:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:23:35,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-11-23 12:23:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:23:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2018-11-23 12:23:35,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 53 transitions. [2018-11-23 12:23:35,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:35,197 INFO L225 Difference]: With dead ends: 75 [2018-11-23 12:23:35,197 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:23:35,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:23:35,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:23:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-11-23 12:23:35,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:35,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 52 states. [2018-11-23 12:23:35,261 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 52 states. [2018-11-23 12:23:35,261 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 52 states. [2018-11-23 12:23:35,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:35,265 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 12:23:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 12:23:35,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:35,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:35,266 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 55 states. [2018-11-23 12:23:35,266 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 55 states. [2018-11-23 12:23:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:35,270 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 12:23:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-23 12:23:35,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:35,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:35,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:35,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:35,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:23:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-23 12:23:35,274 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 36 [2018-11-23 12:23:35,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:35,275 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-23 12:23:35,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:23:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2018-11-23 12:23:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:23:35,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:35,277 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:35,277 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:35,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:35,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1444845839, now seen corresponding path program 2 times [2018-11-23 12:23:35,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:35,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:35,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:35,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:35,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:35,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {937#true} call ULTIMATE.init(); {937#true} is VALID [2018-11-23 12:23:35,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {937#true} is VALID [2018-11-23 12:23:35,466 INFO L273 TraceCheckUtils]: 2: Hoare triple {937#true} assume true; {937#true} is VALID [2018-11-23 12:23:35,466 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {937#true} {937#true} #73#return; {937#true} is VALID [2018-11-23 12:23:35,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {937#true} call #t~ret8 := main(); {937#true} is VALID [2018-11-23 12:23:35,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {937#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {939#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,468 INFO L273 TraceCheckUtils]: 7: Hoare triple {939#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {939#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {939#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {939#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {939#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,487 INFO L273 TraceCheckUtils]: 12: Hoare triple {939#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,487 INFO L273 TraceCheckUtils]: 13: Hoare triple {939#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,488 INFO L273 TraceCheckUtils]: 14: Hoare triple {939#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {939#(<= main_~z~0 150000)} ~i~0 := 0; {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {939#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {939#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:35,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {939#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {940#(<= main_~i~0 150000)} is VALID [2018-11-23 12:23:35,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {940#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {941#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:35,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {941#(<= main_~i~0 150001)} assume !!(~i~0 < 200000); {941#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:35,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {941#(<= main_~i~0 150001)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {941#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:35,502 INFO L273 TraceCheckUtils]: 21: Hoare triple {941#(<= main_~i~0 150001)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {942#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:35,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {942#(<= main_~i~0 150002)} assume !!(~i~0 < 200000); {942#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:35,503 INFO L273 TraceCheckUtils]: 23: Hoare triple {942#(<= main_~i~0 150002)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {942#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:35,504 INFO L273 TraceCheckUtils]: 24: Hoare triple {942#(<= main_~i~0 150002)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {943#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:35,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {943#(<= main_~i~0 150003)} assume !!(~i~0 < 200000); {943#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:35,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {943#(<= main_~i~0 150003)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {943#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:35,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {943#(<= main_~i~0 150003)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {944#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:35,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {944#(<= main_~i~0 150004)} assume !(~i~0 < 200000); {938#false} is VALID [2018-11-23 12:23:35,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {938#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {938#false} is VALID [2018-11-23 12:23:35,507 INFO L273 TraceCheckUtils]: 30: Hoare triple {938#false} assume !!(~x~0 < 200000); {938#false} is VALID [2018-11-23 12:23:35,507 INFO L273 TraceCheckUtils]: 31: Hoare triple {938#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {938#false} is VALID [2018-11-23 12:23:35,508 INFO L256 TraceCheckUtils]: 32: Hoare triple {938#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {938#false} is VALID [2018-11-23 12:23:35,508 INFO L273 TraceCheckUtils]: 33: Hoare triple {938#false} ~cond := #in~cond; {938#false} is VALID [2018-11-23 12:23:35,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {938#false} assume 0 == ~cond; {938#false} is VALID [2018-11-23 12:23:35,509 INFO L273 TraceCheckUtils]: 35: Hoare triple {938#false} assume !false; {938#false} is VALID [2018-11-23 12:23:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 12:23:35,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:35,512 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-23 12:23:35,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:23:35,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:23:35,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:23:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:35,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:35,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {937#true} call ULTIMATE.init(); {937#true} is VALID [2018-11-23 12:23:35,909 INFO L273 TraceCheckUtils]: 1: Hoare triple {937#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {937#true} is VALID [2018-11-23 12:23:35,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {937#true} assume true; {937#true} is VALID [2018-11-23 12:23:35,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {937#true} {937#true} #73#return; {937#true} is VALID [2018-11-23 12:23:35,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {937#true} call #t~ret8 := main(); {937#true} is VALID [2018-11-23 12:23:35,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {937#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {963#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:35,912 INFO L273 TraceCheckUtils]: 6: Hoare triple {963#(<= main_~i~0 0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {963#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:35,913 INFO L273 TraceCheckUtils]: 7: Hoare triple {963#(<= main_~i~0 0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {970#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:35,913 INFO L273 TraceCheckUtils]: 8: Hoare triple {970#(<= main_~i~0 1)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {970#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:35,914 INFO L273 TraceCheckUtils]: 9: Hoare triple {970#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {977#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:35,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {977#(<= main_~i~0 2)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {977#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:35,917 INFO L273 TraceCheckUtils]: 11: Hoare triple {977#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {984#(<= main_~i~0 3)} is VALID [2018-11-23 12:23:35,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {984#(<= main_~i~0 3)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {984#(<= main_~i~0 3)} is VALID [2018-11-23 12:23:35,919 INFO L273 TraceCheckUtils]: 13: Hoare triple {984#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {991#(<= main_~i~0 4)} is VALID [2018-11-23 12:23:35,919 INFO L273 TraceCheckUtils]: 14: Hoare triple {991#(<= main_~i~0 4)} assume !(~i~0 < 200000); {938#false} is VALID [2018-11-23 12:23:35,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {938#false} ~i~0 := 0; {938#false} is VALID [2018-11-23 12:23:35,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {938#false} assume !!(~i~0 < 200000); {938#false} is VALID [2018-11-23 12:23:35,920 INFO L273 TraceCheckUtils]: 17: Hoare triple {938#false} assume !(~i~0 != ~z~0); {938#false} is VALID [2018-11-23 12:23:35,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {938#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {938#false} is VALID [2018-11-23 12:23:35,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {938#false} assume !!(~i~0 < 200000); {938#false} is VALID [2018-11-23 12:23:35,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {938#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {938#false} is VALID [2018-11-23 12:23:35,922 INFO L273 TraceCheckUtils]: 21: Hoare triple {938#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {938#false} is VALID [2018-11-23 12:23:35,922 INFO L273 TraceCheckUtils]: 22: Hoare triple {938#false} assume !!(~i~0 < 200000); {938#false} is VALID [2018-11-23 12:23:35,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {938#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {938#false} is VALID [2018-11-23 12:23:35,923 INFO L273 TraceCheckUtils]: 24: Hoare triple {938#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {938#false} is VALID [2018-11-23 12:23:35,923 INFO L273 TraceCheckUtils]: 25: Hoare triple {938#false} assume !!(~i~0 < 200000); {938#false} is VALID [2018-11-23 12:23:35,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {938#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {938#false} is VALID [2018-11-23 12:23:35,924 INFO L273 TraceCheckUtils]: 27: Hoare triple {938#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {938#false} is VALID [2018-11-23 12:23:35,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {938#false} assume !(~i~0 < 200000); {938#false} is VALID [2018-11-23 12:23:35,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {938#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {938#false} is VALID [2018-11-23 12:23:35,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {938#false} assume !!(~x~0 < 200000); {938#false} is VALID [2018-11-23 12:23:35,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {938#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {938#false} is VALID [2018-11-23 12:23:35,925 INFO L256 TraceCheckUtils]: 32: Hoare triple {938#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {938#false} is VALID [2018-11-23 12:23:35,925 INFO L273 TraceCheckUtils]: 33: Hoare triple {938#false} ~cond := #in~cond; {938#false} is VALID [2018-11-23 12:23:35,925 INFO L273 TraceCheckUtils]: 34: Hoare triple {938#false} assume 0 == ~cond; {938#false} is VALID [2018-11-23 12:23:35,926 INFO L273 TraceCheckUtils]: 35: Hoare triple {938#false} assume !false; {938#false} is VALID [2018-11-23 12:23:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 12:23:35,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:35,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 12:23:35,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-23 12:23:35,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:35,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:23:36,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:36,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:23:36,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:23:36,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:23:36,012 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 13 states. [2018-11-23 12:23:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:36,923 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2018-11-23 12:23:36,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:23:36,924 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-23 12:23:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:23:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2018-11-23 12:23:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:23:36,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 119 transitions. [2018-11-23 12:23:36,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 119 transitions. [2018-11-23 12:23:37,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:37,189 INFO L225 Difference]: With dead ends: 148 [2018-11-23 12:23:37,190 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 12:23:37,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:23:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 12:23:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2018-11-23 12:23:37,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:37,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 100 states. [2018-11-23 12:23:37,322 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 100 states. [2018-11-23 12:23:37,322 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 100 states. [2018-11-23 12:23:37,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:37,327 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2018-11-23 12:23:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2018-11-23 12:23:37,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:37,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:37,329 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 111 states. [2018-11-23 12:23:37,329 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 111 states. [2018-11-23 12:23:37,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:37,335 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2018-11-23 12:23:37,335 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2018-11-23 12:23:37,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:37,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:37,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:37,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 12:23:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2018-11-23 12:23:37,342 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 36 [2018-11-23 12:23:37,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:37,342 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2018-11-23 12:23:37,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:23:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2018-11-23 12:23:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:23:37,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:37,344 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:37,345 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:37,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:37,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1575128733, now seen corresponding path program 3 times [2018-11-23 12:23:37,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:37,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:37,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:37,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:37,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:37,802 INFO L256 TraceCheckUtils]: 0: Hoare triple {1640#true} call ULTIMATE.init(); {1640#true} is VALID [2018-11-23 12:23:37,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {1640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1640#true} is VALID [2018-11-23 12:23:37,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {1640#true} assume true; {1640#true} is VALID [2018-11-23 12:23:37,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1640#true} {1640#true} #73#return; {1640#true} is VALID [2018-11-23 12:23:37,804 INFO L256 TraceCheckUtils]: 4: Hoare triple {1640#true} call #t~ret8 := main(); {1640#true} is VALID [2018-11-23 12:23:37,805 INFO L273 TraceCheckUtils]: 5: Hoare triple {1640#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,806 INFO L273 TraceCheckUtils]: 6: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {1642#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,807 INFO L273 TraceCheckUtils]: 9: Hoare triple {1642#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,808 INFO L273 TraceCheckUtils]: 10: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,809 INFO L273 TraceCheckUtils]: 11: Hoare triple {1642#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,810 INFO L273 TraceCheckUtils]: 13: Hoare triple {1642#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,811 INFO L273 TraceCheckUtils]: 14: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {1642#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,812 INFO L273 TraceCheckUtils]: 16: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,812 INFO L273 TraceCheckUtils]: 17: Hoare triple {1642#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,813 INFO L273 TraceCheckUtils]: 18: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {1642#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,814 INFO L273 TraceCheckUtils]: 20: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,815 INFO L273 TraceCheckUtils]: 21: Hoare triple {1642#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,823 INFO L273 TraceCheckUtils]: 22: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,824 INFO L273 TraceCheckUtils]: 23: Hoare triple {1642#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,824 INFO L273 TraceCheckUtils]: 24: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,825 INFO L273 TraceCheckUtils]: 25: Hoare triple {1642#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,843 INFO L273 TraceCheckUtils]: 26: Hoare triple {1642#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,857 INFO L273 TraceCheckUtils]: 27: Hoare triple {1642#(<= main_~z~0 150000)} ~i~0 := 0; {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,866 INFO L273 TraceCheckUtils]: 28: Hoare triple {1642#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {1642#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:37,867 INFO L273 TraceCheckUtils]: 29: Hoare triple {1642#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {1643#(<= main_~i~0 150000)} is VALID [2018-11-23 12:23:37,867 INFO L273 TraceCheckUtils]: 30: Hoare triple {1643#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1644#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:37,868 INFO L273 TraceCheckUtils]: 31: Hoare triple {1644#(<= main_~i~0 150001)} assume !!(~i~0 < 200000); {1644#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:37,874 INFO L273 TraceCheckUtils]: 32: Hoare triple {1644#(<= main_~i~0 150001)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1644#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:37,875 INFO L273 TraceCheckUtils]: 33: Hoare triple {1644#(<= main_~i~0 150001)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1645#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:37,876 INFO L273 TraceCheckUtils]: 34: Hoare triple {1645#(<= main_~i~0 150002)} assume !!(~i~0 < 200000); {1645#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:37,876 INFO L273 TraceCheckUtils]: 35: Hoare triple {1645#(<= main_~i~0 150002)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1645#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:37,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {1645#(<= main_~i~0 150002)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1646#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:37,877 INFO L273 TraceCheckUtils]: 37: Hoare triple {1646#(<= main_~i~0 150003)} assume !!(~i~0 < 200000); {1646#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:37,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {1646#(<= main_~i~0 150003)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1646#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:37,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {1646#(<= main_~i~0 150003)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1647#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:37,878 INFO L273 TraceCheckUtils]: 40: Hoare triple {1647#(<= main_~i~0 150004)} assume !!(~i~0 < 200000); {1647#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:37,879 INFO L273 TraceCheckUtils]: 41: Hoare triple {1647#(<= main_~i~0 150004)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1647#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:37,881 INFO L273 TraceCheckUtils]: 42: Hoare triple {1647#(<= main_~i~0 150004)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1648#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:37,882 INFO L273 TraceCheckUtils]: 43: Hoare triple {1648#(<= main_~i~0 150005)} assume !!(~i~0 < 200000); {1648#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:37,883 INFO L273 TraceCheckUtils]: 44: Hoare triple {1648#(<= main_~i~0 150005)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1648#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:37,883 INFO L273 TraceCheckUtils]: 45: Hoare triple {1648#(<= main_~i~0 150005)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1649#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:37,884 INFO L273 TraceCheckUtils]: 46: Hoare triple {1649#(<= main_~i~0 150006)} assume !!(~i~0 < 200000); {1649#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:37,885 INFO L273 TraceCheckUtils]: 47: Hoare triple {1649#(<= main_~i~0 150006)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1649#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:37,886 INFO L273 TraceCheckUtils]: 48: Hoare triple {1649#(<= main_~i~0 150006)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1650#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:37,887 INFO L273 TraceCheckUtils]: 49: Hoare triple {1650#(<= main_~i~0 150007)} assume !!(~i~0 < 200000); {1650#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:37,889 INFO L273 TraceCheckUtils]: 50: Hoare triple {1650#(<= main_~i~0 150007)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1650#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:37,892 INFO L273 TraceCheckUtils]: 51: Hoare triple {1650#(<= main_~i~0 150007)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1651#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:37,893 INFO L273 TraceCheckUtils]: 52: Hoare triple {1651#(<= main_~i~0 150008)} assume !!(~i~0 < 200000); {1651#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:37,893 INFO L273 TraceCheckUtils]: 53: Hoare triple {1651#(<= main_~i~0 150008)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1651#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:37,894 INFO L273 TraceCheckUtils]: 54: Hoare triple {1651#(<= main_~i~0 150008)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1652#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:37,894 INFO L273 TraceCheckUtils]: 55: Hoare triple {1652#(<= main_~i~0 150009)} assume !!(~i~0 < 200000); {1652#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:37,894 INFO L273 TraceCheckUtils]: 56: Hoare triple {1652#(<= main_~i~0 150009)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1652#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:37,895 INFO L273 TraceCheckUtils]: 57: Hoare triple {1652#(<= main_~i~0 150009)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1653#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:37,896 INFO L273 TraceCheckUtils]: 58: Hoare triple {1653#(<= main_~i~0 150010)} assume !(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:37,896 INFO L273 TraceCheckUtils]: 59: Hoare triple {1641#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {1641#false} is VALID [2018-11-23 12:23:37,896 INFO L273 TraceCheckUtils]: 60: Hoare triple {1641#false} assume !!(~x~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:37,897 INFO L273 TraceCheckUtils]: 61: Hoare triple {1641#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1641#false} is VALID [2018-11-23 12:23:37,897 INFO L256 TraceCheckUtils]: 62: Hoare triple {1641#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1641#false} is VALID [2018-11-23 12:23:37,897 INFO L273 TraceCheckUtils]: 63: Hoare triple {1641#false} ~cond := #in~cond; {1641#false} is VALID [2018-11-23 12:23:37,898 INFO L273 TraceCheckUtils]: 64: Hoare triple {1641#false} assume 0 == ~cond; {1641#false} is VALID [2018-11-23 12:23:37,898 INFO L273 TraceCheckUtils]: 65: Hoare triple {1641#false} assume !false; {1641#false} is VALID [2018-11-23 12:23:37,906 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 12:23:37,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:37,906 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-23 12:23:37,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:23:37,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:23:37,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:23:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:38,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:38,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {1640#true} call ULTIMATE.init(); {1640#true} is VALID [2018-11-23 12:23:38,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {1640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1640#true} is VALID [2018-11-23 12:23:38,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {1640#true} assume true; {1640#true} is VALID [2018-11-23 12:23:38,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1640#true} {1640#true} #73#return; {1640#true} is VALID [2018-11-23 12:23:38,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {1640#true} call #t~ret8 := main(); {1640#true} is VALID [2018-11-23 12:23:38,200 INFO L273 TraceCheckUtils]: 5: Hoare triple {1640#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,202 INFO L273 TraceCheckUtils]: 6: Hoare triple {1672#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {1672#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {1672#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,208 INFO L273 TraceCheckUtils]: 9: Hoare triple {1672#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {1672#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {1672#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {1672#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {1672#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {1672#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {1672#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {1672#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,212 INFO L273 TraceCheckUtils]: 17: Hoare triple {1672#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,212 INFO L273 TraceCheckUtils]: 18: Hoare triple {1672#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {1672#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {1672#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {1672#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {1672#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {1672#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {1672#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {1672#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,218 INFO L273 TraceCheckUtils]: 26: Hoare triple {1672#(<= 150000 main_~z~0)} assume !(~i~0 < 200000); {1672#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:23:38,219 INFO L273 TraceCheckUtils]: 27: Hoare triple {1672#(<= 150000 main_~z~0)} ~i~0 := 0; {1739#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:23:38,220 INFO L273 TraceCheckUtils]: 28: Hoare triple {1739#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} assume !!(~i~0 < 200000); {1739#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:23:38,221 INFO L273 TraceCheckUtils]: 29: Hoare triple {1739#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} assume !(~i~0 != ~z~0); {1641#false} is VALID [2018-11-23 12:23:38,221 INFO L273 TraceCheckUtils]: 30: Hoare triple {1641#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1641#false} is VALID [2018-11-23 12:23:38,221 INFO L273 TraceCheckUtils]: 31: Hoare triple {1641#false} assume !!(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,222 INFO L273 TraceCheckUtils]: 32: Hoare triple {1641#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1641#false} is VALID [2018-11-23 12:23:38,222 INFO L273 TraceCheckUtils]: 33: Hoare triple {1641#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1641#false} is VALID [2018-11-23 12:23:38,222 INFO L273 TraceCheckUtils]: 34: Hoare triple {1641#false} assume !!(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,223 INFO L273 TraceCheckUtils]: 35: Hoare triple {1641#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1641#false} is VALID [2018-11-23 12:23:38,223 INFO L273 TraceCheckUtils]: 36: Hoare triple {1641#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1641#false} is VALID [2018-11-23 12:23:38,223 INFO L273 TraceCheckUtils]: 37: Hoare triple {1641#false} assume !!(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,224 INFO L273 TraceCheckUtils]: 38: Hoare triple {1641#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1641#false} is VALID [2018-11-23 12:23:38,224 INFO L273 TraceCheckUtils]: 39: Hoare triple {1641#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1641#false} is VALID [2018-11-23 12:23:38,224 INFO L273 TraceCheckUtils]: 40: Hoare triple {1641#false} assume !!(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,225 INFO L273 TraceCheckUtils]: 41: Hoare triple {1641#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1641#false} is VALID [2018-11-23 12:23:38,225 INFO L273 TraceCheckUtils]: 42: Hoare triple {1641#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1641#false} is VALID [2018-11-23 12:23:38,225 INFO L273 TraceCheckUtils]: 43: Hoare triple {1641#false} assume !!(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,225 INFO L273 TraceCheckUtils]: 44: Hoare triple {1641#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1641#false} is VALID [2018-11-23 12:23:38,225 INFO L273 TraceCheckUtils]: 45: Hoare triple {1641#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1641#false} is VALID [2018-11-23 12:23:38,226 INFO L273 TraceCheckUtils]: 46: Hoare triple {1641#false} assume !!(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,226 INFO L273 TraceCheckUtils]: 47: Hoare triple {1641#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1641#false} is VALID [2018-11-23 12:23:38,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {1641#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1641#false} is VALID [2018-11-23 12:23:38,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {1641#false} assume !!(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,227 INFO L273 TraceCheckUtils]: 50: Hoare triple {1641#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1641#false} is VALID [2018-11-23 12:23:38,227 INFO L273 TraceCheckUtils]: 51: Hoare triple {1641#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1641#false} is VALID [2018-11-23 12:23:38,227 INFO L273 TraceCheckUtils]: 52: Hoare triple {1641#false} assume !!(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,227 INFO L273 TraceCheckUtils]: 53: Hoare triple {1641#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1641#false} is VALID [2018-11-23 12:23:38,228 INFO L273 TraceCheckUtils]: 54: Hoare triple {1641#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1641#false} is VALID [2018-11-23 12:23:38,228 INFO L273 TraceCheckUtils]: 55: Hoare triple {1641#false} assume !!(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,228 INFO L273 TraceCheckUtils]: 56: Hoare triple {1641#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {1641#false} is VALID [2018-11-23 12:23:38,228 INFO L273 TraceCheckUtils]: 57: Hoare triple {1641#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1641#false} is VALID [2018-11-23 12:23:38,228 INFO L273 TraceCheckUtils]: 58: Hoare triple {1641#false} assume !(~i~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,228 INFO L273 TraceCheckUtils]: 59: Hoare triple {1641#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {1641#false} is VALID [2018-11-23 12:23:38,229 INFO L273 TraceCheckUtils]: 60: Hoare triple {1641#false} assume !!(~x~0 < 200000); {1641#false} is VALID [2018-11-23 12:23:38,229 INFO L273 TraceCheckUtils]: 61: Hoare triple {1641#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {1641#false} is VALID [2018-11-23 12:23:38,229 INFO L256 TraceCheckUtils]: 62: Hoare triple {1641#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1641#false} is VALID [2018-11-23 12:23:38,229 INFO L273 TraceCheckUtils]: 63: Hoare triple {1641#false} ~cond := #in~cond; {1641#false} is VALID [2018-11-23 12:23:38,230 INFO L273 TraceCheckUtils]: 64: Hoare triple {1641#false} assume 0 == ~cond; {1641#false} is VALID [2018-11-23 12:23:38,230 INFO L273 TraceCheckUtils]: 65: Hoare triple {1641#false} assume !false; {1641#false} is VALID [2018-11-23 12:23:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-11-23 12:23:38,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:23:38,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [14] total 16 [2018-11-23 12:23:38,255 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-11-23 12:23:38,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:38,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:23:38,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:38,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:23:38,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:23:38,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:23:38,388 INFO L87 Difference]: Start difference. First operand 100 states and 114 transitions. Second operand 16 states. [2018-11-23 12:23:39,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:39,933 INFO L93 Difference]: Finished difference Result 265 states and 305 transitions. [2018-11-23 12:23:39,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:23:39,933 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-11-23 12:23:39,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:23:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2018-11-23 12:23:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:23:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2018-11-23 12:23:39,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2018-11-23 12:23:40,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:40,143 INFO L225 Difference]: With dead ends: 265 [2018-11-23 12:23:40,143 INFO L226 Difference]: Without dead ends: 192 [2018-11-23 12:23:40,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=304, Invalid=508, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:23:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-23 12:23:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 113. [2018-11-23 12:23:40,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:40,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 113 states. [2018-11-23 12:23:40,816 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 113 states. [2018-11-23 12:23:40,816 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 113 states. [2018-11-23 12:23:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:40,823 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-11-23 12:23:40,823 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2018-11-23 12:23:40,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:40,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:40,824 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 192 states. [2018-11-23 12:23:40,824 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 192 states. [2018-11-23 12:23:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:40,831 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2018-11-23 12:23:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 208 transitions. [2018-11-23 12:23:40,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:40,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:40,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:40,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 12:23:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2018-11-23 12:23:40,837 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 66 [2018-11-23 12:23:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:40,837 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2018-11-23 12:23:40,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:23:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2018-11-23 12:23:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 12:23:40,839 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:40,839 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:40,840 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:40,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:40,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1187837251, now seen corresponding path program 4 times [2018-11-23 12:23:40,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:40,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:40,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:40,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:40,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:41,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {2779#true} call ULTIMATE.init(); {2779#true} is VALID [2018-11-23 12:23:41,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {2779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2779#true} is VALID [2018-11-23 12:23:41,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {2779#true} assume true; {2779#true} is VALID [2018-11-23 12:23:41,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2779#true} {2779#true} #73#return; {2779#true} is VALID [2018-11-23 12:23:41,189 INFO L256 TraceCheckUtils]: 4: Hoare triple {2779#true} call #t~ret8 := main(); {2779#true} is VALID [2018-11-23 12:23:41,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {2779#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,192 INFO L273 TraceCheckUtils]: 9: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,192 INFO L273 TraceCheckUtils]: 10: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,194 INFO L273 TraceCheckUtils]: 15: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,194 INFO L273 TraceCheckUtils]: 16: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,195 INFO L273 TraceCheckUtils]: 17: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,195 INFO L273 TraceCheckUtils]: 18: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,196 INFO L273 TraceCheckUtils]: 19: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,196 INFO L273 TraceCheckUtils]: 20: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,197 INFO L273 TraceCheckUtils]: 21: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,197 INFO L273 TraceCheckUtils]: 22: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,198 INFO L273 TraceCheckUtils]: 23: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,200 INFO L273 TraceCheckUtils]: 26: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,200 INFO L273 TraceCheckUtils]: 27: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,201 INFO L273 TraceCheckUtils]: 28: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,201 INFO L273 TraceCheckUtils]: 29: Hoare triple {2781#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,202 INFO L273 TraceCheckUtils]: 30: Hoare triple {2781#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,203 INFO L273 TraceCheckUtils]: 31: Hoare triple {2781#(<= main_~z~0 150000)} ~i~0 := 0; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,203 INFO L273 TraceCheckUtils]: 32: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,204 INFO L273 TraceCheckUtils]: 33: Hoare triple {2781#(<= main_~z~0 150000)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,204 INFO L273 TraceCheckUtils]: 34: Hoare triple {2781#(<= main_~z~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,205 INFO L273 TraceCheckUtils]: 35: Hoare triple {2781#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {2781#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:41,205 INFO L273 TraceCheckUtils]: 36: Hoare triple {2781#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {2782#(<= main_~i~0 150000)} is VALID [2018-11-23 12:23:41,206 INFO L273 TraceCheckUtils]: 37: Hoare triple {2782#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2783#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:41,207 INFO L273 TraceCheckUtils]: 38: Hoare triple {2783#(<= main_~i~0 150001)} assume !!(~i~0 < 200000); {2783#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:41,207 INFO L273 TraceCheckUtils]: 39: Hoare triple {2783#(<= main_~i~0 150001)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2783#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:41,208 INFO L273 TraceCheckUtils]: 40: Hoare triple {2783#(<= main_~i~0 150001)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2784#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:41,209 INFO L273 TraceCheckUtils]: 41: Hoare triple {2784#(<= main_~i~0 150002)} assume !!(~i~0 < 200000); {2784#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:41,209 INFO L273 TraceCheckUtils]: 42: Hoare triple {2784#(<= main_~i~0 150002)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2784#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:41,215 INFO L273 TraceCheckUtils]: 43: Hoare triple {2784#(<= main_~i~0 150002)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2785#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:41,216 INFO L273 TraceCheckUtils]: 44: Hoare triple {2785#(<= main_~i~0 150003)} assume !!(~i~0 < 200000); {2785#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:41,216 INFO L273 TraceCheckUtils]: 45: Hoare triple {2785#(<= main_~i~0 150003)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2785#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:41,217 INFO L273 TraceCheckUtils]: 46: Hoare triple {2785#(<= main_~i~0 150003)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2786#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:41,217 INFO L273 TraceCheckUtils]: 47: Hoare triple {2786#(<= main_~i~0 150004)} assume !!(~i~0 < 200000); {2786#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:41,217 INFO L273 TraceCheckUtils]: 48: Hoare triple {2786#(<= main_~i~0 150004)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2786#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:41,218 INFO L273 TraceCheckUtils]: 49: Hoare triple {2786#(<= main_~i~0 150004)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2787#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:41,219 INFO L273 TraceCheckUtils]: 50: Hoare triple {2787#(<= main_~i~0 150005)} assume !!(~i~0 < 200000); {2787#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:41,219 INFO L273 TraceCheckUtils]: 51: Hoare triple {2787#(<= main_~i~0 150005)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2787#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:41,220 INFO L273 TraceCheckUtils]: 52: Hoare triple {2787#(<= main_~i~0 150005)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2788#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:41,220 INFO L273 TraceCheckUtils]: 53: Hoare triple {2788#(<= main_~i~0 150006)} assume !!(~i~0 < 200000); {2788#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:41,221 INFO L273 TraceCheckUtils]: 54: Hoare triple {2788#(<= main_~i~0 150006)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2788#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:41,222 INFO L273 TraceCheckUtils]: 55: Hoare triple {2788#(<= main_~i~0 150006)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2789#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:41,222 INFO L273 TraceCheckUtils]: 56: Hoare triple {2789#(<= main_~i~0 150007)} assume !!(~i~0 < 200000); {2789#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:41,223 INFO L273 TraceCheckUtils]: 57: Hoare triple {2789#(<= main_~i~0 150007)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2789#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:41,224 INFO L273 TraceCheckUtils]: 58: Hoare triple {2789#(<= main_~i~0 150007)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2790#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:41,224 INFO L273 TraceCheckUtils]: 59: Hoare triple {2790#(<= main_~i~0 150008)} assume !!(~i~0 < 200000); {2790#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:41,225 INFO L273 TraceCheckUtils]: 60: Hoare triple {2790#(<= main_~i~0 150008)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2790#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:41,226 INFO L273 TraceCheckUtils]: 61: Hoare triple {2790#(<= main_~i~0 150008)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2791#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:41,226 INFO L273 TraceCheckUtils]: 62: Hoare triple {2791#(<= main_~i~0 150009)} assume !!(~i~0 < 200000); {2791#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:41,229 INFO L273 TraceCheckUtils]: 63: Hoare triple {2791#(<= main_~i~0 150009)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2791#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:41,230 INFO L273 TraceCheckUtils]: 64: Hoare triple {2791#(<= main_~i~0 150009)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2792#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:41,230 INFO L273 TraceCheckUtils]: 65: Hoare triple {2792#(<= main_~i~0 150010)} assume !!(~i~0 < 200000); {2792#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:41,231 INFO L273 TraceCheckUtils]: 66: Hoare triple {2792#(<= main_~i~0 150010)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2792#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:41,231 INFO L273 TraceCheckUtils]: 67: Hoare triple {2792#(<= main_~i~0 150010)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2793#(<= main_~i~0 150011)} is VALID [2018-11-23 12:23:41,232 INFO L273 TraceCheckUtils]: 68: Hoare triple {2793#(<= main_~i~0 150011)} assume !(~i~0 < 200000); {2780#false} is VALID [2018-11-23 12:23:41,232 INFO L273 TraceCheckUtils]: 69: Hoare triple {2780#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {2780#false} is VALID [2018-11-23 12:23:41,232 INFO L273 TraceCheckUtils]: 70: Hoare triple {2780#false} assume !!(~x~0 < 200000); {2780#false} is VALID [2018-11-23 12:23:41,233 INFO L273 TraceCheckUtils]: 71: Hoare triple {2780#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2780#false} is VALID [2018-11-23 12:23:41,233 INFO L256 TraceCheckUtils]: 72: Hoare triple {2780#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2780#false} is VALID [2018-11-23 12:23:41,233 INFO L273 TraceCheckUtils]: 73: Hoare triple {2780#false} ~cond := #in~cond; {2780#false} is VALID [2018-11-23 12:23:41,233 INFO L273 TraceCheckUtils]: 74: Hoare triple {2780#false} assume 0 == ~cond; {2780#false} is VALID [2018-11-23 12:23:41,234 INFO L273 TraceCheckUtils]: 75: Hoare triple {2780#false} assume !false; {2780#false} is VALID [2018-11-23 12:23:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2018-11-23 12:23:41,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:41,239 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-23 12:23:41,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:23:41,362 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:23:41,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:23:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:41,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:41,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {2779#true} call ULTIMATE.init(); {2779#true} is VALID [2018-11-23 12:23:41,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {2779#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2779#true} is VALID [2018-11-23 12:23:41,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {2779#true} assume true; {2779#true} is VALID [2018-11-23 12:23:41,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2779#true} {2779#true} #73#return; {2779#true} is VALID [2018-11-23 12:23:41,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {2779#true} call #t~ret8 := main(); {2779#true} is VALID [2018-11-23 12:23:41,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {2779#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {2779#true} is VALID [2018-11-23 12:23:41,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,940 INFO L273 TraceCheckUtils]: 11: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,941 INFO L273 TraceCheckUtils]: 13: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,941 INFO L273 TraceCheckUtils]: 14: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,941 INFO L273 TraceCheckUtils]: 16: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,941 INFO L273 TraceCheckUtils]: 17: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,941 INFO L273 TraceCheckUtils]: 18: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,942 INFO L273 TraceCheckUtils]: 19: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,942 INFO L273 TraceCheckUtils]: 22: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,942 INFO L273 TraceCheckUtils]: 23: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,942 INFO L273 TraceCheckUtils]: 24: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,942 INFO L273 TraceCheckUtils]: 26: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,943 INFO L273 TraceCheckUtils]: 27: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,943 INFO L273 TraceCheckUtils]: 28: Hoare triple {2779#true} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2779#true} is VALID [2018-11-23 12:23:41,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {2779#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2779#true} is VALID [2018-11-23 12:23:41,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {2779#true} assume !(~i~0 < 200000); {2779#true} is VALID [2018-11-23 12:23:41,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {2779#true} ~i~0 := 0; {2890#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:41,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {2890#(<= main_~i~0 0)} assume !!(~i~0 < 200000); {2890#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:41,944 INFO L273 TraceCheckUtils]: 33: Hoare triple {2890#(<= main_~i~0 0)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2890#(<= main_~i~0 0)} is VALID [2018-11-23 12:23:41,945 INFO L273 TraceCheckUtils]: 34: Hoare triple {2890#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2900#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:41,945 INFO L273 TraceCheckUtils]: 35: Hoare triple {2900#(<= main_~i~0 1)} assume !!(~i~0 < 200000); {2900#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:41,945 INFO L273 TraceCheckUtils]: 36: Hoare triple {2900#(<= main_~i~0 1)} assume !(~i~0 != ~z~0); {2900#(<= main_~i~0 1)} is VALID [2018-11-23 12:23:41,946 INFO L273 TraceCheckUtils]: 37: Hoare triple {2900#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2910#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:41,946 INFO L273 TraceCheckUtils]: 38: Hoare triple {2910#(<= main_~i~0 2)} assume !!(~i~0 < 200000); {2910#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:41,946 INFO L273 TraceCheckUtils]: 39: Hoare triple {2910#(<= main_~i~0 2)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2910#(<= main_~i~0 2)} is VALID [2018-11-23 12:23:41,947 INFO L273 TraceCheckUtils]: 40: Hoare triple {2910#(<= main_~i~0 2)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2920#(<= main_~i~0 3)} is VALID [2018-11-23 12:23:41,948 INFO L273 TraceCheckUtils]: 41: Hoare triple {2920#(<= main_~i~0 3)} assume !!(~i~0 < 200000); {2920#(<= main_~i~0 3)} is VALID [2018-11-23 12:23:41,948 INFO L273 TraceCheckUtils]: 42: Hoare triple {2920#(<= main_~i~0 3)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2920#(<= main_~i~0 3)} is VALID [2018-11-23 12:23:41,949 INFO L273 TraceCheckUtils]: 43: Hoare triple {2920#(<= main_~i~0 3)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2930#(<= main_~i~0 4)} is VALID [2018-11-23 12:23:41,950 INFO L273 TraceCheckUtils]: 44: Hoare triple {2930#(<= main_~i~0 4)} assume !!(~i~0 < 200000); {2930#(<= main_~i~0 4)} is VALID [2018-11-23 12:23:41,950 INFO L273 TraceCheckUtils]: 45: Hoare triple {2930#(<= main_~i~0 4)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2930#(<= main_~i~0 4)} is VALID [2018-11-23 12:23:41,951 INFO L273 TraceCheckUtils]: 46: Hoare triple {2930#(<= main_~i~0 4)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2940#(<= main_~i~0 5)} is VALID [2018-11-23 12:23:41,952 INFO L273 TraceCheckUtils]: 47: Hoare triple {2940#(<= main_~i~0 5)} assume !!(~i~0 < 200000); {2940#(<= main_~i~0 5)} is VALID [2018-11-23 12:23:41,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {2940#(<= main_~i~0 5)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2940#(<= main_~i~0 5)} is VALID [2018-11-23 12:23:41,954 INFO L273 TraceCheckUtils]: 49: Hoare triple {2940#(<= main_~i~0 5)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2950#(<= main_~i~0 6)} is VALID [2018-11-23 12:23:41,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {2950#(<= main_~i~0 6)} assume !!(~i~0 < 200000); {2950#(<= main_~i~0 6)} is VALID [2018-11-23 12:23:41,955 INFO L273 TraceCheckUtils]: 51: Hoare triple {2950#(<= main_~i~0 6)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2950#(<= main_~i~0 6)} is VALID [2018-11-23 12:23:41,956 INFO L273 TraceCheckUtils]: 52: Hoare triple {2950#(<= main_~i~0 6)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2960#(<= main_~i~0 7)} is VALID [2018-11-23 12:23:41,957 INFO L273 TraceCheckUtils]: 53: Hoare triple {2960#(<= main_~i~0 7)} assume !!(~i~0 < 200000); {2960#(<= main_~i~0 7)} is VALID [2018-11-23 12:23:41,957 INFO L273 TraceCheckUtils]: 54: Hoare triple {2960#(<= main_~i~0 7)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2960#(<= main_~i~0 7)} is VALID [2018-11-23 12:23:41,958 INFO L273 TraceCheckUtils]: 55: Hoare triple {2960#(<= main_~i~0 7)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2970#(<= main_~i~0 8)} is VALID [2018-11-23 12:23:41,959 INFO L273 TraceCheckUtils]: 56: Hoare triple {2970#(<= main_~i~0 8)} assume !!(~i~0 < 200000); {2970#(<= main_~i~0 8)} is VALID [2018-11-23 12:23:41,959 INFO L273 TraceCheckUtils]: 57: Hoare triple {2970#(<= main_~i~0 8)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2970#(<= main_~i~0 8)} is VALID [2018-11-23 12:23:41,960 INFO L273 TraceCheckUtils]: 58: Hoare triple {2970#(<= main_~i~0 8)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2980#(<= main_~i~0 9)} is VALID [2018-11-23 12:23:41,961 INFO L273 TraceCheckUtils]: 59: Hoare triple {2980#(<= main_~i~0 9)} assume !!(~i~0 < 200000); {2980#(<= main_~i~0 9)} is VALID [2018-11-23 12:23:41,962 INFO L273 TraceCheckUtils]: 60: Hoare triple {2980#(<= main_~i~0 9)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2980#(<= main_~i~0 9)} is VALID [2018-11-23 12:23:41,963 INFO L273 TraceCheckUtils]: 61: Hoare triple {2980#(<= main_~i~0 9)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2990#(<= main_~i~0 10)} is VALID [2018-11-23 12:23:41,963 INFO L273 TraceCheckUtils]: 62: Hoare triple {2990#(<= main_~i~0 10)} assume !!(~i~0 < 200000); {2990#(<= main_~i~0 10)} is VALID [2018-11-23 12:23:41,964 INFO L273 TraceCheckUtils]: 63: Hoare triple {2990#(<= main_~i~0 10)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {2990#(<= main_~i~0 10)} is VALID [2018-11-23 12:23:41,965 INFO L273 TraceCheckUtils]: 64: Hoare triple {2990#(<= main_~i~0 10)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3000#(<= main_~i~0 11)} is VALID [2018-11-23 12:23:41,965 INFO L273 TraceCheckUtils]: 65: Hoare triple {3000#(<= main_~i~0 11)} assume !!(~i~0 < 200000); {3000#(<= main_~i~0 11)} is VALID [2018-11-23 12:23:41,966 INFO L273 TraceCheckUtils]: 66: Hoare triple {3000#(<= main_~i~0 11)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {3000#(<= main_~i~0 11)} is VALID [2018-11-23 12:23:41,967 INFO L273 TraceCheckUtils]: 67: Hoare triple {3000#(<= main_~i~0 11)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3010#(<= main_~i~0 12)} is VALID [2018-11-23 12:23:41,968 INFO L273 TraceCheckUtils]: 68: Hoare triple {3010#(<= main_~i~0 12)} assume !(~i~0 < 200000); {2780#false} is VALID [2018-11-23 12:23:41,968 INFO L273 TraceCheckUtils]: 69: Hoare triple {2780#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {2780#false} is VALID [2018-11-23 12:23:41,968 INFO L273 TraceCheckUtils]: 70: Hoare triple {2780#false} assume !!(~x~0 < 200000); {2780#false} is VALID [2018-11-23 12:23:41,969 INFO L273 TraceCheckUtils]: 71: Hoare triple {2780#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {2780#false} is VALID [2018-11-23 12:23:41,969 INFO L256 TraceCheckUtils]: 72: Hoare triple {2780#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2780#false} is VALID [2018-11-23 12:23:41,969 INFO L273 TraceCheckUtils]: 73: Hoare triple {2780#false} ~cond := #in~cond; {2780#false} is VALID [2018-11-23 12:23:41,970 INFO L273 TraceCheckUtils]: 74: Hoare triple {2780#false} assume 0 == ~cond; {2780#false} is VALID [2018-11-23 12:23:41,970 INFO L273 TraceCheckUtils]: 75: Hoare triple {2780#false} assume !false; {2780#false} is VALID [2018-11-23 12:23:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-23 12:23:41,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:41,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 12:23:41,996 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-11-23 12:23:41,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:41,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:23:42,086 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:42,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:23:42,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:23:42,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:23:42,088 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand 28 states. [2018-11-23 12:23:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:45,330 INFO L93 Difference]: Finished difference Result 652 states and 734 transitions. [2018-11-23 12:23:45,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:23:45,330 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-11-23 12:23:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:23:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 222 transitions. [2018-11-23 12:23:45,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:23:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 222 transitions. [2018-11-23 12:23:45,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 222 transitions. [2018-11-23 12:23:45,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:45,678 INFO L225 Difference]: With dead ends: 652 [2018-11-23 12:23:45,678 INFO L226 Difference]: Without dead ends: 570 [2018-11-23 12:23:45,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1053, Invalid=1703, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:23:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-23 12:23:46,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 217. [2018-11-23 12:23:46,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:46,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 570 states. Second operand 217 states. [2018-11-23 12:23:46,553 INFO L74 IsIncluded]: Start isIncluded. First operand 570 states. Second operand 217 states. [2018-11-23 12:23:46,553 INFO L87 Difference]: Start difference. First operand 570 states. Second operand 217 states. [2018-11-23 12:23:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:46,579 INFO L93 Difference]: Finished difference Result 570 states and 599 transitions. [2018-11-23 12:23:46,579 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 599 transitions. [2018-11-23 12:23:46,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:46,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:46,581 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 570 states. [2018-11-23 12:23:46,581 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 570 states. [2018-11-23 12:23:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:46,607 INFO L93 Difference]: Finished difference Result 570 states and 599 transitions. [2018-11-23 12:23:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 599 transitions. [2018-11-23 12:23:46,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:46,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:46,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:46,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:46,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-23 12:23:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 245 transitions. [2018-11-23 12:23:46,617 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 245 transitions. Word has length 76 [2018-11-23 12:23:46,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:46,617 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 245 transitions. [2018-11-23 12:23:46,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:23:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 245 transitions. [2018-11-23 12:23:46,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-23 12:23:46,619 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:46,619 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:46,622 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:46,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:46,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1035622098, now seen corresponding path program 5 times [2018-11-23 12:23:46,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:46,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:46,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:47,920 INFO L256 TraceCheckUtils]: 0: Hoare triple {5431#true} call ULTIMATE.init(); {5431#true} is VALID [2018-11-23 12:23:47,920 INFO L273 TraceCheckUtils]: 1: Hoare triple {5431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5431#true} is VALID [2018-11-23 12:23:47,920 INFO L273 TraceCheckUtils]: 2: Hoare triple {5431#true} assume true; {5431#true} is VALID [2018-11-23 12:23:47,921 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5431#true} {5431#true} #73#return; {5431#true} is VALID [2018-11-23 12:23:47,921 INFO L256 TraceCheckUtils]: 4: Hoare triple {5431#true} call #t~ret8 := main(); {5431#true} is VALID [2018-11-23 12:23:47,921 INFO L273 TraceCheckUtils]: 5: Hoare triple {5431#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,923 INFO L273 TraceCheckUtils]: 6: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,928 INFO L273 TraceCheckUtils]: 10: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,930 INFO L273 TraceCheckUtils]: 12: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,930 INFO L273 TraceCheckUtils]: 13: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,932 INFO L273 TraceCheckUtils]: 14: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,940 INFO L273 TraceCheckUtils]: 22: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,940 INFO L273 TraceCheckUtils]: 23: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,942 INFO L273 TraceCheckUtils]: 24: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,944 INFO L273 TraceCheckUtils]: 26: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,944 INFO L273 TraceCheckUtils]: 27: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,946 INFO L273 TraceCheckUtils]: 28: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,948 INFO L273 TraceCheckUtils]: 30: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,950 INFO L273 TraceCheckUtils]: 32: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,953 INFO L273 TraceCheckUtils]: 34: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,953 INFO L273 TraceCheckUtils]: 35: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,958 INFO L273 TraceCheckUtils]: 38: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,958 INFO L273 TraceCheckUtils]: 39: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,960 INFO L273 TraceCheckUtils]: 40: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,960 INFO L273 TraceCheckUtils]: 41: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,962 INFO L273 TraceCheckUtils]: 42: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,962 INFO L273 TraceCheckUtils]: 43: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,965 INFO L273 TraceCheckUtils]: 45: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,980 INFO L273 TraceCheckUtils]: 47: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,980 INFO L273 TraceCheckUtils]: 48: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,980 INFO L273 TraceCheckUtils]: 49: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,981 INFO L273 TraceCheckUtils]: 50: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,981 INFO L273 TraceCheckUtils]: 51: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,982 INFO L273 TraceCheckUtils]: 52: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,982 INFO L273 TraceCheckUtils]: 53: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,983 INFO L273 TraceCheckUtils]: 54: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,983 INFO L273 TraceCheckUtils]: 55: Hoare triple {5433#(<= main_~z~0 150000)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,984 INFO L273 TraceCheckUtils]: 56: Hoare triple {5433#(<= main_~z~0 150000)} assume !(~i~0 < 200000); {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,984 INFO L273 TraceCheckUtils]: 57: Hoare triple {5433#(<= main_~z~0 150000)} ~i~0 := 0; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,984 INFO L273 TraceCheckUtils]: 58: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,985 INFO L273 TraceCheckUtils]: 59: Hoare triple {5433#(<= main_~z~0 150000)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,985 INFO L273 TraceCheckUtils]: 60: Hoare triple {5433#(<= main_~z~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,985 INFO L273 TraceCheckUtils]: 61: Hoare triple {5433#(<= main_~z~0 150000)} assume !!(~i~0 < 200000); {5433#(<= main_~z~0 150000)} is VALID [2018-11-23 12:23:47,986 INFO L273 TraceCheckUtils]: 62: Hoare triple {5433#(<= main_~z~0 150000)} assume !(~i~0 != ~z~0); {5434#(<= main_~i~0 150000)} is VALID [2018-11-23 12:23:47,986 INFO L273 TraceCheckUtils]: 63: Hoare triple {5434#(<= main_~i~0 150000)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5435#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:47,987 INFO L273 TraceCheckUtils]: 64: Hoare triple {5435#(<= main_~i~0 150001)} assume !!(~i~0 < 200000); {5435#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:47,987 INFO L273 TraceCheckUtils]: 65: Hoare triple {5435#(<= main_~i~0 150001)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5435#(<= main_~i~0 150001)} is VALID [2018-11-23 12:23:47,988 INFO L273 TraceCheckUtils]: 66: Hoare triple {5435#(<= main_~i~0 150001)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5436#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:47,988 INFO L273 TraceCheckUtils]: 67: Hoare triple {5436#(<= main_~i~0 150002)} assume !!(~i~0 < 200000); {5436#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:47,989 INFO L273 TraceCheckUtils]: 68: Hoare triple {5436#(<= main_~i~0 150002)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5436#(<= main_~i~0 150002)} is VALID [2018-11-23 12:23:48,001 INFO L273 TraceCheckUtils]: 69: Hoare triple {5436#(<= main_~i~0 150002)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5437#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:48,001 INFO L273 TraceCheckUtils]: 70: Hoare triple {5437#(<= main_~i~0 150003)} assume !!(~i~0 < 200000); {5437#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:48,002 INFO L273 TraceCheckUtils]: 71: Hoare triple {5437#(<= main_~i~0 150003)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5437#(<= main_~i~0 150003)} is VALID [2018-11-23 12:23:48,002 INFO L273 TraceCheckUtils]: 72: Hoare triple {5437#(<= main_~i~0 150003)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5438#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:48,003 INFO L273 TraceCheckUtils]: 73: Hoare triple {5438#(<= main_~i~0 150004)} assume !!(~i~0 < 200000); {5438#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:48,003 INFO L273 TraceCheckUtils]: 74: Hoare triple {5438#(<= main_~i~0 150004)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5438#(<= main_~i~0 150004)} is VALID [2018-11-23 12:23:48,003 INFO L273 TraceCheckUtils]: 75: Hoare triple {5438#(<= main_~i~0 150004)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5439#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:48,004 INFO L273 TraceCheckUtils]: 76: Hoare triple {5439#(<= main_~i~0 150005)} assume !!(~i~0 < 200000); {5439#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:48,004 INFO L273 TraceCheckUtils]: 77: Hoare triple {5439#(<= main_~i~0 150005)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5439#(<= main_~i~0 150005)} is VALID [2018-11-23 12:23:48,005 INFO L273 TraceCheckUtils]: 78: Hoare triple {5439#(<= main_~i~0 150005)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5440#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:48,005 INFO L273 TraceCheckUtils]: 79: Hoare triple {5440#(<= main_~i~0 150006)} assume !!(~i~0 < 200000); {5440#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:48,006 INFO L273 TraceCheckUtils]: 80: Hoare triple {5440#(<= main_~i~0 150006)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5440#(<= main_~i~0 150006)} is VALID [2018-11-23 12:23:48,007 INFO L273 TraceCheckUtils]: 81: Hoare triple {5440#(<= main_~i~0 150006)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5441#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:48,007 INFO L273 TraceCheckUtils]: 82: Hoare triple {5441#(<= main_~i~0 150007)} assume !!(~i~0 < 200000); {5441#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:48,018 INFO L273 TraceCheckUtils]: 83: Hoare triple {5441#(<= main_~i~0 150007)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5441#(<= main_~i~0 150007)} is VALID [2018-11-23 12:23:48,019 INFO L273 TraceCheckUtils]: 84: Hoare triple {5441#(<= main_~i~0 150007)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5442#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:48,019 INFO L273 TraceCheckUtils]: 85: Hoare triple {5442#(<= main_~i~0 150008)} assume !!(~i~0 < 200000); {5442#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:48,020 INFO L273 TraceCheckUtils]: 86: Hoare triple {5442#(<= main_~i~0 150008)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5442#(<= main_~i~0 150008)} is VALID [2018-11-23 12:23:48,020 INFO L273 TraceCheckUtils]: 87: Hoare triple {5442#(<= main_~i~0 150008)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5443#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:48,020 INFO L273 TraceCheckUtils]: 88: Hoare triple {5443#(<= main_~i~0 150009)} assume !!(~i~0 < 200000); {5443#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:48,021 INFO L273 TraceCheckUtils]: 89: Hoare triple {5443#(<= main_~i~0 150009)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5443#(<= main_~i~0 150009)} is VALID [2018-11-23 12:23:48,021 INFO L273 TraceCheckUtils]: 90: Hoare triple {5443#(<= main_~i~0 150009)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5444#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:48,022 INFO L273 TraceCheckUtils]: 91: Hoare triple {5444#(<= main_~i~0 150010)} assume !!(~i~0 < 200000); {5444#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:48,022 INFO L273 TraceCheckUtils]: 92: Hoare triple {5444#(<= main_~i~0 150010)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5444#(<= main_~i~0 150010)} is VALID [2018-11-23 12:23:48,023 INFO L273 TraceCheckUtils]: 93: Hoare triple {5444#(<= main_~i~0 150010)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5445#(<= main_~i~0 150011)} is VALID [2018-11-23 12:23:48,024 INFO L273 TraceCheckUtils]: 94: Hoare triple {5445#(<= main_~i~0 150011)} assume !!(~i~0 < 200000); {5445#(<= main_~i~0 150011)} is VALID [2018-11-23 12:23:48,024 INFO L273 TraceCheckUtils]: 95: Hoare triple {5445#(<= main_~i~0 150011)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5445#(<= main_~i~0 150011)} is VALID [2018-11-23 12:23:48,025 INFO L273 TraceCheckUtils]: 96: Hoare triple {5445#(<= main_~i~0 150011)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5446#(<= main_~i~0 150012)} is VALID [2018-11-23 12:23:48,026 INFO L273 TraceCheckUtils]: 97: Hoare triple {5446#(<= main_~i~0 150012)} assume !!(~i~0 < 200000); {5446#(<= main_~i~0 150012)} is VALID [2018-11-23 12:23:48,026 INFO L273 TraceCheckUtils]: 98: Hoare triple {5446#(<= main_~i~0 150012)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5446#(<= main_~i~0 150012)} is VALID [2018-11-23 12:23:48,027 INFO L273 TraceCheckUtils]: 99: Hoare triple {5446#(<= main_~i~0 150012)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5447#(<= main_~i~0 150013)} is VALID [2018-11-23 12:23:48,028 INFO L273 TraceCheckUtils]: 100: Hoare triple {5447#(<= main_~i~0 150013)} assume !!(~i~0 < 200000); {5447#(<= main_~i~0 150013)} is VALID [2018-11-23 12:23:48,028 INFO L273 TraceCheckUtils]: 101: Hoare triple {5447#(<= main_~i~0 150013)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5447#(<= main_~i~0 150013)} is VALID [2018-11-23 12:23:48,029 INFO L273 TraceCheckUtils]: 102: Hoare triple {5447#(<= main_~i~0 150013)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5448#(<= main_~i~0 150014)} is VALID [2018-11-23 12:23:48,030 INFO L273 TraceCheckUtils]: 103: Hoare triple {5448#(<= main_~i~0 150014)} assume !!(~i~0 < 200000); {5448#(<= main_~i~0 150014)} is VALID [2018-11-23 12:23:48,030 INFO L273 TraceCheckUtils]: 104: Hoare triple {5448#(<= main_~i~0 150014)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5448#(<= main_~i~0 150014)} is VALID [2018-11-23 12:23:48,031 INFO L273 TraceCheckUtils]: 105: Hoare triple {5448#(<= main_~i~0 150014)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5449#(<= main_~i~0 150015)} is VALID [2018-11-23 12:23:48,032 INFO L273 TraceCheckUtils]: 106: Hoare triple {5449#(<= main_~i~0 150015)} assume !!(~i~0 < 200000); {5449#(<= main_~i~0 150015)} is VALID [2018-11-23 12:23:48,033 INFO L273 TraceCheckUtils]: 107: Hoare triple {5449#(<= main_~i~0 150015)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5449#(<= main_~i~0 150015)} is VALID [2018-11-23 12:23:48,033 INFO L273 TraceCheckUtils]: 108: Hoare triple {5449#(<= main_~i~0 150015)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5450#(<= main_~i~0 150016)} is VALID [2018-11-23 12:23:48,034 INFO L273 TraceCheckUtils]: 109: Hoare triple {5450#(<= main_~i~0 150016)} assume !!(~i~0 < 200000); {5450#(<= main_~i~0 150016)} is VALID [2018-11-23 12:23:48,035 INFO L273 TraceCheckUtils]: 110: Hoare triple {5450#(<= main_~i~0 150016)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5450#(<= main_~i~0 150016)} is VALID [2018-11-23 12:23:48,036 INFO L273 TraceCheckUtils]: 111: Hoare triple {5450#(<= main_~i~0 150016)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5451#(<= main_~i~0 150017)} is VALID [2018-11-23 12:23:48,036 INFO L273 TraceCheckUtils]: 112: Hoare triple {5451#(<= main_~i~0 150017)} assume !!(~i~0 < 200000); {5451#(<= main_~i~0 150017)} is VALID [2018-11-23 12:23:48,037 INFO L273 TraceCheckUtils]: 113: Hoare triple {5451#(<= main_~i~0 150017)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5451#(<= main_~i~0 150017)} is VALID [2018-11-23 12:23:48,038 INFO L273 TraceCheckUtils]: 114: Hoare triple {5451#(<= main_~i~0 150017)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5452#(<= main_~i~0 150018)} is VALID [2018-11-23 12:23:48,038 INFO L273 TraceCheckUtils]: 115: Hoare triple {5452#(<= main_~i~0 150018)} assume !!(~i~0 < 200000); {5452#(<= main_~i~0 150018)} is VALID [2018-11-23 12:23:48,039 INFO L273 TraceCheckUtils]: 116: Hoare triple {5452#(<= main_~i~0 150018)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5452#(<= main_~i~0 150018)} is VALID [2018-11-23 12:23:48,040 INFO L273 TraceCheckUtils]: 117: Hoare triple {5452#(<= main_~i~0 150018)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5453#(<= main_~i~0 150019)} is VALID [2018-11-23 12:23:48,041 INFO L273 TraceCheckUtils]: 118: Hoare triple {5453#(<= main_~i~0 150019)} assume !!(~i~0 < 200000); {5453#(<= main_~i~0 150019)} is VALID [2018-11-23 12:23:48,041 INFO L273 TraceCheckUtils]: 119: Hoare triple {5453#(<= main_~i~0 150019)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5453#(<= main_~i~0 150019)} is VALID [2018-11-23 12:23:48,042 INFO L273 TraceCheckUtils]: 120: Hoare triple {5453#(<= main_~i~0 150019)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5454#(<= main_~i~0 150020)} is VALID [2018-11-23 12:23:48,043 INFO L273 TraceCheckUtils]: 121: Hoare triple {5454#(<= main_~i~0 150020)} assume !!(~i~0 < 200000); {5454#(<= main_~i~0 150020)} is VALID [2018-11-23 12:23:48,043 INFO L273 TraceCheckUtils]: 122: Hoare triple {5454#(<= main_~i~0 150020)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5454#(<= main_~i~0 150020)} is VALID [2018-11-23 12:23:48,044 INFO L273 TraceCheckUtils]: 123: Hoare triple {5454#(<= main_~i~0 150020)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5455#(<= main_~i~0 150021)} is VALID [2018-11-23 12:23:48,045 INFO L273 TraceCheckUtils]: 124: Hoare triple {5455#(<= main_~i~0 150021)} assume !!(~i~0 < 200000); {5455#(<= main_~i~0 150021)} is VALID [2018-11-23 12:23:48,046 INFO L273 TraceCheckUtils]: 125: Hoare triple {5455#(<= main_~i~0 150021)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5455#(<= main_~i~0 150021)} is VALID [2018-11-23 12:23:48,046 INFO L273 TraceCheckUtils]: 126: Hoare triple {5455#(<= main_~i~0 150021)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5456#(<= main_~i~0 150022)} is VALID [2018-11-23 12:23:48,047 INFO L273 TraceCheckUtils]: 127: Hoare triple {5456#(<= main_~i~0 150022)} assume !!(~i~0 < 200000); {5456#(<= main_~i~0 150022)} is VALID [2018-11-23 12:23:48,048 INFO L273 TraceCheckUtils]: 128: Hoare triple {5456#(<= main_~i~0 150022)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5456#(<= main_~i~0 150022)} is VALID [2018-11-23 12:23:48,049 INFO L273 TraceCheckUtils]: 129: Hoare triple {5456#(<= main_~i~0 150022)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5457#(<= main_~i~0 150023)} is VALID [2018-11-23 12:23:48,049 INFO L273 TraceCheckUtils]: 130: Hoare triple {5457#(<= main_~i~0 150023)} assume !!(~i~0 < 200000); {5457#(<= main_~i~0 150023)} is VALID [2018-11-23 12:23:48,050 INFO L273 TraceCheckUtils]: 131: Hoare triple {5457#(<= main_~i~0 150023)} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5457#(<= main_~i~0 150023)} is VALID [2018-11-23 12:23:48,051 INFO L273 TraceCheckUtils]: 132: Hoare triple {5457#(<= main_~i~0 150023)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5458#(<= main_~i~0 150024)} is VALID [2018-11-23 12:23:48,052 INFO L273 TraceCheckUtils]: 133: Hoare triple {5458#(<= main_~i~0 150024)} assume !(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:23:48,052 INFO L273 TraceCheckUtils]: 134: Hoare triple {5432#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {5432#false} is VALID [2018-11-23 12:23:48,052 INFO L273 TraceCheckUtils]: 135: Hoare triple {5432#false} assume !!(~x~0 < 200000); {5432#false} is VALID [2018-11-23 12:23:48,052 INFO L273 TraceCheckUtils]: 136: Hoare triple {5432#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5432#false} is VALID [2018-11-23 12:23:48,053 INFO L256 TraceCheckUtils]: 137: Hoare triple {5432#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5432#false} is VALID [2018-11-23 12:23:48,053 INFO L273 TraceCheckUtils]: 138: Hoare triple {5432#false} ~cond := #in~cond; {5432#false} is VALID [2018-11-23 12:23:48,053 INFO L273 TraceCheckUtils]: 139: Hoare triple {5432#false} assume 0 == ~cond; {5432#false} is VALID [2018-11-23 12:23:48,054 INFO L273 TraceCheckUtils]: 140: Hoare triple {5432#false} assume !false; {5432#false} is VALID [2018-11-23 12:23:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 0 proven. 923 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2018-11-23 12:23:48,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:48,068 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-23 12:23:48,081 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:27:04,166 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2018-11-23 12:27:04,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:27:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:27:04,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:27:04,483 INFO L256 TraceCheckUtils]: 0: Hoare triple {5431#true} call ULTIMATE.init(); {5431#true} is VALID [2018-11-23 12:27:04,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {5431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5431#true} is VALID [2018-11-23 12:27:04,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {5431#true} assume true; {5431#true} is VALID [2018-11-23 12:27:04,484 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5431#true} {5431#true} #73#return; {5431#true} is VALID [2018-11-23 12:27:04,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {5431#true} call #t~ret8 := main(); {5431#true} is VALID [2018-11-23 12:27:04,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {5431#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(800000);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(800000);havoc ~i~0;havoc ~z~0;~z~0 := 150000;~i~0 := 0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,488 INFO L273 TraceCheckUtils]: 12: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,489 INFO L273 TraceCheckUtils]: 13: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,489 INFO L273 TraceCheckUtils]: 14: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,490 INFO L273 TraceCheckUtils]: 15: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,490 INFO L273 TraceCheckUtils]: 16: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,492 INFO L273 TraceCheckUtils]: 20: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,493 INFO L273 TraceCheckUtils]: 21: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,493 INFO L273 TraceCheckUtils]: 22: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,494 INFO L273 TraceCheckUtils]: 23: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,495 INFO L273 TraceCheckUtils]: 24: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,495 INFO L273 TraceCheckUtils]: 25: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,496 INFO L273 TraceCheckUtils]: 26: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,496 INFO L273 TraceCheckUtils]: 27: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,497 INFO L273 TraceCheckUtils]: 28: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,497 INFO L273 TraceCheckUtils]: 29: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,498 INFO L273 TraceCheckUtils]: 31: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,499 INFO L273 TraceCheckUtils]: 33: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,500 INFO L273 TraceCheckUtils]: 35: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,501 INFO L273 TraceCheckUtils]: 36: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,501 INFO L273 TraceCheckUtils]: 37: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,502 INFO L273 TraceCheckUtils]: 38: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,503 INFO L273 TraceCheckUtils]: 39: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,503 INFO L273 TraceCheckUtils]: 40: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,504 INFO L273 TraceCheckUtils]: 42: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,505 INFO L273 TraceCheckUtils]: 43: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,505 INFO L273 TraceCheckUtils]: 44: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,506 INFO L273 TraceCheckUtils]: 45: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,506 INFO L273 TraceCheckUtils]: 46: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,507 INFO L273 TraceCheckUtils]: 47: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,507 INFO L273 TraceCheckUtils]: 48: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,508 INFO L273 TraceCheckUtils]: 49: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,508 INFO L273 TraceCheckUtils]: 50: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,509 INFO L273 TraceCheckUtils]: 51: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,510 INFO L273 TraceCheckUtils]: 52: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,510 INFO L273 TraceCheckUtils]: 53: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,511 INFO L273 TraceCheckUtils]: 54: Hoare triple {5477#(<= 150000 main_~z~0)} assume !!(~i~0 < 200000);assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;call write~int(#t~nondet1, ~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,511 INFO L273 TraceCheckUtils]: 55: Hoare triple {5477#(<= 150000 main_~z~0)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,512 INFO L273 TraceCheckUtils]: 56: Hoare triple {5477#(<= 150000 main_~z~0)} assume !(~i~0 < 200000); {5477#(<= 150000 main_~z~0)} is VALID [2018-11-23 12:27:04,512 INFO L273 TraceCheckUtils]: 57: Hoare triple {5477#(<= 150000 main_~z~0)} ~i~0 := 0; {5634#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:27:04,530 INFO L273 TraceCheckUtils]: 58: Hoare triple {5634#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} assume !!(~i~0 < 200000); {5634#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:27:04,536 INFO L273 TraceCheckUtils]: 59: Hoare triple {5634#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5634#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:27:04,537 INFO L273 TraceCheckUtils]: 60: Hoare triple {5634#(and (<= 150000 main_~z~0) (<= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5644#(and (<= main_~i~0 1) (<= 150000 main_~z~0))} is VALID [2018-11-23 12:27:04,537 INFO L273 TraceCheckUtils]: 61: Hoare triple {5644#(and (<= main_~i~0 1) (<= 150000 main_~z~0))} assume !!(~i~0 < 200000); {5644#(and (<= main_~i~0 1) (<= 150000 main_~z~0))} is VALID [2018-11-23 12:27:04,538 INFO L273 TraceCheckUtils]: 62: Hoare triple {5644#(and (<= main_~i~0 1) (<= 150000 main_~z~0))} assume !(~i~0 != ~z~0); {5432#false} is VALID [2018-11-23 12:27:04,538 INFO L273 TraceCheckUtils]: 63: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,538 INFO L273 TraceCheckUtils]: 64: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,538 INFO L273 TraceCheckUtils]: 65: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,538 INFO L273 TraceCheckUtils]: 66: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,538 INFO L273 TraceCheckUtils]: 67: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,538 INFO L273 TraceCheckUtils]: 68: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,539 INFO L273 TraceCheckUtils]: 69: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,539 INFO L273 TraceCheckUtils]: 70: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,539 INFO L273 TraceCheckUtils]: 71: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,539 INFO L273 TraceCheckUtils]: 72: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,539 INFO L273 TraceCheckUtils]: 73: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,539 INFO L273 TraceCheckUtils]: 74: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,539 INFO L273 TraceCheckUtils]: 75: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,540 INFO L273 TraceCheckUtils]: 76: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,540 INFO L273 TraceCheckUtils]: 77: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,540 INFO L273 TraceCheckUtils]: 78: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,540 INFO L273 TraceCheckUtils]: 79: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,540 INFO L273 TraceCheckUtils]: 80: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,541 INFO L273 TraceCheckUtils]: 81: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,541 INFO L273 TraceCheckUtils]: 82: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,541 INFO L273 TraceCheckUtils]: 83: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,541 INFO L273 TraceCheckUtils]: 84: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,541 INFO L273 TraceCheckUtils]: 85: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,542 INFO L273 TraceCheckUtils]: 86: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,542 INFO L273 TraceCheckUtils]: 87: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,542 INFO L273 TraceCheckUtils]: 88: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,542 INFO L273 TraceCheckUtils]: 89: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,542 INFO L273 TraceCheckUtils]: 90: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,542 INFO L273 TraceCheckUtils]: 91: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,542 INFO L273 TraceCheckUtils]: 92: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,542 INFO L273 TraceCheckUtils]: 93: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,543 INFO L273 TraceCheckUtils]: 94: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,543 INFO L273 TraceCheckUtils]: 95: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,543 INFO L273 TraceCheckUtils]: 96: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,543 INFO L273 TraceCheckUtils]: 97: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,543 INFO L273 TraceCheckUtils]: 98: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,543 INFO L273 TraceCheckUtils]: 99: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,543 INFO L273 TraceCheckUtils]: 100: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,543 INFO L273 TraceCheckUtils]: 101: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,544 INFO L273 TraceCheckUtils]: 102: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,544 INFO L273 TraceCheckUtils]: 103: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,544 INFO L273 TraceCheckUtils]: 104: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,544 INFO L273 TraceCheckUtils]: 105: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,544 INFO L273 TraceCheckUtils]: 106: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,544 INFO L273 TraceCheckUtils]: 107: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,544 INFO L273 TraceCheckUtils]: 108: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,544 INFO L273 TraceCheckUtils]: 109: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,545 INFO L273 TraceCheckUtils]: 110: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,545 INFO L273 TraceCheckUtils]: 111: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,545 INFO L273 TraceCheckUtils]: 112: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,545 INFO L273 TraceCheckUtils]: 113: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,545 INFO L273 TraceCheckUtils]: 114: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,545 INFO L273 TraceCheckUtils]: 115: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,545 INFO L273 TraceCheckUtils]: 116: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,545 INFO L273 TraceCheckUtils]: 117: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,546 INFO L273 TraceCheckUtils]: 118: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,546 INFO L273 TraceCheckUtils]: 119: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,546 INFO L273 TraceCheckUtils]: 120: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,546 INFO L273 TraceCheckUtils]: 121: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,546 INFO L273 TraceCheckUtils]: 122: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,546 INFO L273 TraceCheckUtils]: 123: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,546 INFO L273 TraceCheckUtils]: 124: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,546 INFO L273 TraceCheckUtils]: 125: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,546 INFO L273 TraceCheckUtils]: 126: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,547 INFO L273 TraceCheckUtils]: 127: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,547 INFO L273 TraceCheckUtils]: 128: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,547 INFO L273 TraceCheckUtils]: 129: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,547 INFO L273 TraceCheckUtils]: 130: Hoare triple {5432#false} assume !!(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,547 INFO L273 TraceCheckUtils]: 131: Hoare triple {5432#false} assume ~i~0 != ~z~0;call #t~mem4 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~i~0, 4);call write~int(#t~mem4, ~#a2~0.base, ~#a2~0.offset + 4 * ~i~0, 4);havoc #t~mem4; {5432#false} is VALID [2018-11-23 12:27:04,547 INFO L273 TraceCheckUtils]: 132: Hoare triple {5432#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5432#false} is VALID [2018-11-23 12:27:04,547 INFO L273 TraceCheckUtils]: 133: Hoare triple {5432#false} assume !(~i~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,547 INFO L273 TraceCheckUtils]: 134: Hoare triple {5432#false} havoc ~x~0;~z~0 := 150001;~x~0 := 0; {5432#false} is VALID [2018-11-23 12:27:04,548 INFO L273 TraceCheckUtils]: 135: Hoare triple {5432#false} assume !!(~x~0 < 200000); {5432#false} is VALID [2018-11-23 12:27:04,548 INFO L273 TraceCheckUtils]: 136: Hoare triple {5432#false} assume ~x~0 != ~z~0;call #t~mem6 := read~int(~#a1~0.base, ~#a1~0.offset + 4 * ~x~0, 4);call #t~mem7 := read~int(~#a2~0.base, ~#a2~0.offset + 4 * ~x~0, 4); {5432#false} is VALID [2018-11-23 12:27:04,548 INFO L256 TraceCheckUtils]: 137: Hoare triple {5432#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {5432#false} is VALID [2018-11-23 12:27:04,548 INFO L273 TraceCheckUtils]: 138: Hoare triple {5432#false} ~cond := #in~cond; {5432#false} is VALID [2018-11-23 12:27:04,548 INFO L273 TraceCheckUtils]: 139: Hoare triple {5432#false} assume 0 == ~cond; {5432#false} is VALID [2018-11-23 12:27:04,548 INFO L273 TraceCheckUtils]: 140: Hoare triple {5432#false} assume !false; {5432#false} is VALID [2018-11-23 12:27:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1550 backedges. 118 proven. 2 refuted. 0 times theorem prover too weak. 1430 trivial. 0 not checked. [2018-11-23 12:27:04,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:27:04,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 5] total 31 [2018-11-23 12:27:04,603 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 141 [2018-11-23 12:27:04,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:27:04,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:27:04,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:04,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:27:04,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:27:04,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=518, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:27:04,708 INFO L87 Difference]: Start difference. First operand 217 states and 245 transitions. Second operand 31 states. [2018-11-23 12:27:10,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:10,285 INFO L93 Difference]: Finished difference Result 945 states and 1020 transitions. [2018-11-23 12:27:10,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:27:10,285 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 141 [2018-11-23 12:27:10,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:27:10,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 223 transitions. [2018-11-23 12:27:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:27:10,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 223 transitions. [2018-11-23 12:27:10,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 223 transitions. [2018-11-23 12:27:10,562 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:27:10,600 INFO L225 Difference]: With dead ends: 945 [2018-11-23 12:27:10,601 INFO L226 Difference]: Without dead ends: 785 [2018-11-23 12:27:10,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1280, Invalid=2142, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 12:27:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-11-23 12:27:11,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 230. [2018-11-23 12:27:11,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:27:11,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 785 states. Second operand 230 states. [2018-11-23 12:27:11,137 INFO L74 IsIncluded]: Start isIncluded. First operand 785 states. Second operand 230 states. [2018-11-23 12:27:11,137 INFO L87 Difference]: Start difference. First operand 785 states. Second operand 230 states. [2018-11-23 12:27:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:11,177 INFO L93 Difference]: Finished difference Result 785 states and 815 transitions. [2018-11-23 12:27:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 815 transitions. [2018-11-23 12:27:11,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:11,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:11,179 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand 785 states. [2018-11-23 12:27:11,179 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 785 states. [2018-11-23 12:27:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:27:11,218 INFO L93 Difference]: Finished difference Result 785 states and 815 transitions. [2018-11-23 12:27:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 815 transitions. [2018-11-23 12:27:11,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:27:11,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:27:11,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:27:11,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:27:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-23 12:27:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 259 transitions. [2018-11-23 12:27:11,228 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 259 transitions. Word has length 141 [2018-11-23 12:27:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:27:11,228 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 259 transitions. [2018-11-23 12:27:11,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:27:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 259 transitions. [2018-11-23 12:27:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 12:27:11,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:27:11,230 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:27:11,231 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:27:11,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:27:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash 165044102, now seen corresponding path program 6 times [2018-11-23 12:27:11,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:27:11,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:27:11,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:11,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:27:11,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:27:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat