java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_two_index_06_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:49:08,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:49:08,426 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:49:08,439 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:49:08,439 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:49:08,440 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:49:08,442 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:49:08,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:49:08,448 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:49:08,449 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:49:08,451 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:49:08,451 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:49:08,452 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:49:08,454 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:49:08,463 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:49:08,464 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:49:08,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:49:08,467 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:49:08,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:49:08,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:49:08,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:49:08,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:49:08,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:49:08,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:49:08,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:49:08,482 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:49:08,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:49:08,483 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:49:08,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:49:08,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:49:08,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:49:08,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:49:08,487 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:49:08,487 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:49:08,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:49:08,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:49:08,489 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 17:49:08,504 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:49:08,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:49:08,505 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:49:08,505 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:49:08,506 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:49:08,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:49:08,507 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:49:08,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:49:08,507 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:49:08,507 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:49:08,507 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:49:08,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:49:08,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:49:08,508 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:49:08,508 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:49:08,508 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:49:08,508 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:49:08,509 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:49:08,509 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:49:08,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:49:08,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:49:08,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:49:08,510 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:49:08,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:49:08,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:49:08,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:49:08,511 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:49:08,511 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:49:08,511 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:49:08,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:49:08,511 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:49:08,512 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:49:08,512 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:49:08,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:49:08,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:49:08,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:49:08,573 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:49:08,573 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:49:08,574 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_two_index_06_true-unreach-call.i [2018-11-14 17:49:08,642 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d6c8e7b/493b2212f0e945b0bcf1e6d05410bbe3/FLAG5c28ca8b3 [2018-11-14 17:49:09,063 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:49:09,064 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_two_index_06_true-unreach-call.i [2018-11-14 17:49:09,070 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d6c8e7b/493b2212f0e945b0bcf1e6d05410bbe3/FLAG5c28ca8b3 [2018-11-14 17:49:09,083 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d6c8e7b/493b2212f0e945b0bcf1e6d05410bbe3 [2018-11-14 17:49:09,094 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:49:09,096 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:49:09,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:49:09,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:49:09,101 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:49:09,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:49:09" (1/1) ... [2018-11-14 17:49:09,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b31ec7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09, skipping insertion in model container [2018-11-14 17:49:09,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:49:09" (1/1) ... [2018-11-14 17:49:09,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:49:09,139 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:49:09,395 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:49:09,401 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:49:09,431 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:49:09,456 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:49:09,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09 WrapperNode [2018-11-14 17:49:09,457 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:49:09,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:49:09,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:49:09,458 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:49:09,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09" (1/1) ... [2018-11-14 17:49:09,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09" (1/1) ... [2018-11-14 17:49:09,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09" (1/1) ... [2018-11-14 17:49:09,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09" (1/1) ... [2018-11-14 17:49:09,513 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09" (1/1) ... [2018-11-14 17:49:09,523 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09" (1/1) ... [2018-11-14 17:49:09,525 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09" (1/1) ... [2018-11-14 17:49:09,527 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:49:09,528 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:49:09,528 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:49:09,528 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:49:09,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:49:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:49:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:49:09,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:49:09,659 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:49:09,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:49:09,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:49:09,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:49:09,659 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:49:09,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:49:09,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:49:09,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:49:09,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:49:09,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:49:09,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:49:09,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:49:10,237 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:49:10,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:49:10 BoogieIcfgContainer [2018-11-14 17:49:10,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:49:10,239 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:49:10,239 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:49:10,243 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:49:10,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:49:09" (1/3) ... [2018-11-14 17:49:10,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ffc9a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:49:10, skipping insertion in model container [2018-11-14 17:49:10,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:49:09" (2/3) ... [2018-11-14 17:49:10,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31ffc9a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:49:10, skipping insertion in model container [2018-11-14 17:49:10,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:49:10" (3/3) ... [2018-11-14 17:49:10,247 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_two_index_06_true-unreach-call.i [2018-11-14 17:49:10,257 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:49:10,266 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:49:10,283 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:49:10,317 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:49:10,318 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:49:10,318 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:49:10,318 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:49:10,319 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:49:10,319 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:49:10,319 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:49:10,319 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:49:10,319 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:49:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-14 17:49:10,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:49:10,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:49:10,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:49:10,349 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:49:10,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:49:10,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1015131587, now seen corresponding path program 1 times [2018-11-14 17:49:10,361 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:49:10,362 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:49:10,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:49:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:10,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:49:10,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-14 17:49:10,638 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {30#true} is VALID [2018-11-14 17:49:10,638 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-14 17:49:10,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #63#return; {30#true} is VALID [2018-11-14 17:49:10,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret4 := main(); {30#true} is VALID [2018-11-14 17:49:10,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {30#true} is VALID [2018-11-14 17:49:10,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-14 17:49:10,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 1bv32; {31#false} is VALID [2018-11-14 17:49:10,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !true; {31#false} is VALID [2018-11-14 17:49:10,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 1bv32;~j~0 := 0bv32; {31#false} is VALID [2018-11-14 17:49:10,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume true; {31#false} is VALID [2018-11-14 17:49:10,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {31#false} is VALID [2018-11-14 17:49:10,642 INFO L256 TraceCheckUtils]: 12: Hoare triple {31#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-14 17:49:10,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-14 17:49:10,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} assume ~cond == 0bv32; {31#false} is VALID [2018-11-14 17:49:10,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-14 17:49:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:49:10,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:49:10,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:49:10,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:49:10,661 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:49:10,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:49:10,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:49:10,798 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-14 17:49:10,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:49:10,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:49:10,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:49:10,812 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-14 17:49:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:11,041 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-14 17:49:11,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:49:11,042 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:49:11,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:49:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:49:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 17:49:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:49:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 57 transitions. [2018-11-14 17:49:11,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 57 transitions. [2018-11-14 17:49:11,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:11,359 INFO L225 Difference]: With dead ends: 46 [2018-11-14 17:49:11,360 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 17:49:11,364 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:49:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 17:49:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 17:49:11,433 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:49:11,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 17:49:11,434 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:49:11,434 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:49:11,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:11,439 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 17:49:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 17:49:11,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:11,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:11,440 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 17:49:11,440 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 17:49:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:11,444 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-14 17:49:11,444 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 17:49:11,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:11,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:11,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:49:11,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:49:11,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 17:49:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-14 17:49:11,451 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2018-11-14 17:49:11,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:49:11,451 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-14 17:49:11,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:49:11,452 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-14 17:49:11,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:49:11,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:49:11,453 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:49:11,453 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:49:11,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:49:11,454 INFO L82 PathProgramCache]: Analyzing trace with hash -669754579, now seen corresponding path program 1 times [2018-11-14 17:49:11,454 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:49:11,455 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:49:11,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:49:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:11,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:49:11,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {213#true} call ULTIMATE.init(); {213#true} is VALID [2018-11-14 17:49:11,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {213#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {213#true} is VALID [2018-11-14 17:49:11,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2018-11-14 17:49:11,621 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #63#return; {213#true} is VALID [2018-11-14 17:49:11,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {213#true} call #t~ret4 := main(); {213#true} is VALID [2018-11-14 17:49:11,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {213#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:49:11,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {233#(= main_~i~0 (_ bv0 32))} assume true; {233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:49:11,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {233#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {214#false} is VALID [2018-11-14 17:49:11,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {214#false} ~i~0 := 1bv32; {214#false} is VALID [2018-11-14 17:49:11,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {214#false} assume true; {214#false} is VALID [2018-11-14 17:49:11,627 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#false} assume !~bvslt32(~i~0, 10000bv32); {214#false} is VALID [2018-11-14 17:49:11,627 INFO L273 TraceCheckUtils]: 11: Hoare triple {214#false} ~i~0 := 1bv32;~j~0 := 0bv32; {214#false} is VALID [2018-11-14 17:49:11,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {214#false} assume true; {214#false} is VALID [2018-11-14 17:49:11,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {214#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {214#false} is VALID [2018-11-14 17:49:11,628 INFO L256 TraceCheckUtils]: 14: Hoare triple {214#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {214#false} is VALID [2018-11-14 17:49:11,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {214#false} ~cond := #in~cond; {214#false} is VALID [2018-11-14 17:49:11,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {214#false} assume ~cond == 0bv32; {214#false} is VALID [2018-11-14 17:49:11,629 INFO L273 TraceCheckUtils]: 17: Hoare triple {214#false} assume !false; {214#false} is VALID [2018-11-14 17:49:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:49:11,632 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:49:11,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:49:11,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:49:11,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 17:49:11,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:49:11,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:49:11,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:11,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:49:11,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:49:11,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:49:11,705 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-14 17:49:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:12,131 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-11-14 17:49:12,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:49:12,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-14 17:49:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:49:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:49:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 17:49:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:49:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2018-11-14 17:49:12,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2018-11-14 17:49:12,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:12,269 INFO L225 Difference]: With dead ends: 38 [2018-11-14 17:49:12,269 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 17:49:12,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:49:12,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 17:49:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 17:49:12,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:49:12,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 17:49:12,290 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:49:12,290 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:49:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:12,293 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 17:49:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 17:49:12,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:12,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:12,295 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 17:49:12,295 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 17:49:12,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:12,297 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-14 17:49:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 17:49:12,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:12,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:12,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:49:12,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:49:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:49:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-14 17:49:12,301 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 18 [2018-11-14 17:49:12,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:49:12,302 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-14 17:49:12,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:49:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-14 17:49:12,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:49:12,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:49:12,303 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:49:12,304 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:49:12,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:49:12,304 INFO L82 PathProgramCache]: Analyzing trace with hash 619123155, now seen corresponding path program 1 times [2018-11-14 17:49:12,305 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:49:12,305 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:49:12,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:49:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:12,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:49:12,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {403#true} is VALID [2018-11-14 17:49:12,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {403#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {403#true} is VALID [2018-11-14 17:49:12,465 INFO L273 TraceCheckUtils]: 2: Hoare triple {403#true} assume true; {403#true} is VALID [2018-11-14 17:49:12,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {403#true} {403#true} #63#return; {403#true} is VALID [2018-11-14 17:49:12,466 INFO L256 TraceCheckUtils]: 4: Hoare triple {403#true} call #t~ret4 := main(); {403#true} is VALID [2018-11-14 17:49:12,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {403#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {423#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:49:12,475 INFO L273 TraceCheckUtils]: 6: Hoare triple {423#(= main_~i~0 (_ bv0 32))} assume true; {423#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:49:12,477 INFO L273 TraceCheckUtils]: 7: Hoare triple {423#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {430#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:12,479 INFO L273 TraceCheckUtils]: 8: Hoare triple {430#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {430#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:12,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {430#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {404#false} is VALID [2018-11-14 17:49:12,480 INFO L273 TraceCheckUtils]: 10: Hoare triple {404#false} ~i~0 := 1bv32; {404#false} is VALID [2018-11-14 17:49:12,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {404#false} assume true; {404#false} is VALID [2018-11-14 17:49:12,481 INFO L273 TraceCheckUtils]: 12: Hoare triple {404#false} assume !~bvslt32(~i~0, 10000bv32); {404#false} is VALID [2018-11-14 17:49:12,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {404#false} ~i~0 := 1bv32;~j~0 := 0bv32; {404#false} is VALID [2018-11-14 17:49:12,482 INFO L273 TraceCheckUtils]: 14: Hoare triple {404#false} assume true; {404#false} is VALID [2018-11-14 17:49:12,482 INFO L273 TraceCheckUtils]: 15: Hoare triple {404#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {404#false} is VALID [2018-11-14 17:49:12,482 INFO L256 TraceCheckUtils]: 16: Hoare triple {404#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {404#false} is VALID [2018-11-14 17:49:12,483 INFO L273 TraceCheckUtils]: 17: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID [2018-11-14 17:49:12,483 INFO L273 TraceCheckUtils]: 18: Hoare triple {404#false} assume ~cond == 0bv32; {404#false} is VALID [2018-11-14 17:49:12,484 INFO L273 TraceCheckUtils]: 19: Hoare triple {404#false} assume !false; {404#false} is VALID [2018-11-14 17:49:12,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:49:12,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:49:12,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {404#false} assume !false; {404#false} is VALID [2018-11-14 17:49:12,739 INFO L273 TraceCheckUtils]: 18: Hoare triple {404#false} assume ~cond == 0bv32; {404#false} is VALID [2018-11-14 17:49:12,739 INFO L273 TraceCheckUtils]: 17: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID [2018-11-14 17:49:12,739 INFO L256 TraceCheckUtils]: 16: Hoare triple {404#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {404#false} is VALID [2018-11-14 17:49:12,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {404#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {404#false} is VALID [2018-11-14 17:49:12,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {404#false} assume true; {404#false} is VALID [2018-11-14 17:49:12,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {404#false} ~i~0 := 1bv32;~j~0 := 0bv32; {404#false} is VALID [2018-11-14 17:49:12,740 INFO L273 TraceCheckUtils]: 12: Hoare triple {404#false} assume !~bvslt32(~i~0, 10000bv32); {404#false} is VALID [2018-11-14 17:49:12,741 INFO L273 TraceCheckUtils]: 11: Hoare triple {404#false} assume true; {404#false} is VALID [2018-11-14 17:49:12,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {404#false} ~i~0 := 1bv32; {404#false} is VALID [2018-11-14 17:49:12,744 INFO L273 TraceCheckUtils]: 9: Hoare triple {497#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {404#false} is VALID [2018-11-14 17:49:12,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {497#(bvslt main_~i~0 (_ bv10000 32))} assume true; {497#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-14 17:49:12,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {497#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-14 17:49:12,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume true; {504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:12,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {403#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {504#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:12,752 INFO L256 TraceCheckUtils]: 4: Hoare triple {403#true} call #t~ret4 := main(); {403#true} is VALID [2018-11-14 17:49:12,752 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {403#true} {403#true} #63#return; {403#true} is VALID [2018-11-14 17:49:12,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {403#true} assume true; {403#true} is VALID [2018-11-14 17:49:12,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {403#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {403#true} is VALID [2018-11-14 17:49:12,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {403#true} is VALID [2018-11-14 17:49:12,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:49:12,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:49:12,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:49:12,757 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:49:12,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:49:12,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:49:12,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:12,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:49:12,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:49:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:49:12,825 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 6 states. [2018-11-14 17:49:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:13,492 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-14 17:49:13,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:49:13,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:49:13,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:49:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:49:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 17:49:13,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:49:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-14 17:49:13,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 66 transitions. [2018-11-14 17:49:13,667 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:13,669 INFO L225 Difference]: With dead ends: 56 [2018-11-14 17:49:13,670 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:49:13,671 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:49:13,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:49:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2018-11-14 17:49:13,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:49:13,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 34 states. [2018-11-14 17:49:13,697 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 34 states. [2018-11-14 17:49:13,698 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 34 states. [2018-11-14 17:49:13,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:13,703 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:49:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:49:13,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:13,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:13,704 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 42 states. [2018-11-14 17:49:13,704 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 42 states. [2018-11-14 17:49:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:13,708 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-14 17:49:13,708 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-14 17:49:13,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:13,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:13,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:49:13,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:49:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 17:49:13,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-14 17:49:13,712 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 20 [2018-11-14 17:49:13,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:49:13,712 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-14 17:49:13,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:49:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-14 17:49:13,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 17:49:13,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:49:13,714 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:49:13,714 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:49:13,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:49:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash -858280327, now seen corresponding path program 1 times [2018-11-14 17:49:13,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:49:13,716 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:49:13,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:49:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:13,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:49:13,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {742#true} call ULTIMATE.init(); {742#true} is VALID [2018-11-14 17:49:13,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {742#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {742#true} is VALID [2018-11-14 17:49:13,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {742#true} assume true; {742#true} is VALID [2018-11-14 17:49:13,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {742#true} {742#true} #63#return; {742#true} is VALID [2018-11-14 17:49:13,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {742#true} call #t~ret4 := main(); {742#true} is VALID [2018-11-14 17:49:14,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {742#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {762#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:49:14,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {762#(= main_~i~0 (_ bv0 32))} assume true; {762#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:49:14,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {762#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {769#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:14,002 INFO L273 TraceCheckUtils]: 8: Hoare triple {769#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {769#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:14,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {769#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {776#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:14,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {776#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {776#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:14,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {776#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {783#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:14,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {783#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {783#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:14,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {783#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {790#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:14,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {790#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {790#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:14,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {790#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {743#false} is VALID [2018-11-14 17:49:14,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {743#false} ~i~0 := 1bv32; {743#false} is VALID [2018-11-14 17:49:14,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 17:49:14,013 INFO L273 TraceCheckUtils]: 18: Hoare triple {743#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {743#false} is VALID [2018-11-14 17:49:14,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 17:49:14,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {743#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {743#false} is VALID [2018-11-14 17:49:14,014 INFO L273 TraceCheckUtils]: 21: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 17:49:14,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {743#false} assume !~bvslt32(~i~0, 10000bv32); {743#false} is VALID [2018-11-14 17:49:14,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {743#false} ~i~0 := 1bv32;~j~0 := 0bv32; {743#false} is VALID [2018-11-14 17:49:14,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 17:49:14,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {743#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {743#false} is VALID [2018-11-14 17:49:14,015 INFO L256 TraceCheckUtils]: 26: Hoare triple {743#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {743#false} is VALID [2018-11-14 17:49:14,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {743#false} ~cond := #in~cond; {743#false} is VALID [2018-11-14 17:49:14,015 INFO L273 TraceCheckUtils]: 28: Hoare triple {743#false} assume ~cond == 0bv32; {743#false} is VALID [2018-11-14 17:49:14,016 INFO L273 TraceCheckUtils]: 29: Hoare triple {743#false} assume !false; {743#false} is VALID [2018-11-14 17:49:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 17:49:14,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:49:14,205 INFO L273 TraceCheckUtils]: 29: Hoare triple {743#false} assume !false; {743#false} is VALID [2018-11-14 17:49:14,206 INFO L273 TraceCheckUtils]: 28: Hoare triple {743#false} assume ~cond == 0bv32; {743#false} is VALID [2018-11-14 17:49:14,206 INFO L273 TraceCheckUtils]: 27: Hoare triple {743#false} ~cond := #in~cond; {743#false} is VALID [2018-11-14 17:49:14,206 INFO L256 TraceCheckUtils]: 26: Hoare triple {743#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {743#false} is VALID [2018-11-14 17:49:14,207 INFO L273 TraceCheckUtils]: 25: Hoare triple {743#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {743#false} is VALID [2018-11-14 17:49:14,207 INFO L273 TraceCheckUtils]: 24: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 17:49:14,207 INFO L273 TraceCheckUtils]: 23: Hoare triple {743#false} ~i~0 := 1bv32;~j~0 := 0bv32; {743#false} is VALID [2018-11-14 17:49:14,208 INFO L273 TraceCheckUtils]: 22: Hoare triple {743#false} assume !~bvslt32(~i~0, 10000bv32); {743#false} is VALID [2018-11-14 17:49:14,208 INFO L273 TraceCheckUtils]: 21: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 17:49:14,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {743#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {743#false} is VALID [2018-11-14 17:49:14,209 INFO L273 TraceCheckUtils]: 19: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 17:49:14,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {743#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {743#false} is VALID [2018-11-14 17:49:14,209 INFO L273 TraceCheckUtils]: 17: Hoare triple {743#false} assume true; {743#false} is VALID [2018-11-14 17:49:14,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {743#false} ~i~0 := 1bv32; {743#false} is VALID [2018-11-14 17:49:14,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {881#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {743#false} is VALID [2018-11-14 17:49:14,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {881#(bvslt main_~i~0 (_ bv10000 32))} assume true; {881#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-14 17:49:14,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {888#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {881#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-14 17:49:14,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {888#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume true; {888#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:14,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {895#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {888#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:14,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {895#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume true; {895#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:14,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {902#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {895#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:14,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {902#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume true; {902#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:14,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {909#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {902#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:14,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {909#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume true; {909#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:14,259 INFO L273 TraceCheckUtils]: 5: Hoare triple {742#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {909#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:14,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {742#true} call #t~ret4 := main(); {742#true} is VALID [2018-11-14 17:49:14,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {742#true} {742#true} #63#return; {742#true} is VALID [2018-11-14 17:49:14,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {742#true} assume true; {742#true} is VALID [2018-11-14 17:49:14,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {742#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {742#true} is VALID [2018-11-14 17:49:14,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {742#true} call ULTIMATE.init(); {742#true} is VALID [2018-11-14 17:49:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 17:49:14,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:49:14,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:49:14,264 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-14 17:49:14,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:49:14,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:49:14,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:14,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:49:14,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:49:14,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:49:14,458 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 12 states. [2018-11-14 17:49:15,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:15,852 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-14 17:49:15,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:49:15,852 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-14 17:49:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:49:15,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:49:15,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2018-11-14 17:49:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:49:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2018-11-14 17:49:15,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 79 transitions. [2018-11-14 17:49:16,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:16,040 INFO L225 Difference]: With dead ends: 72 [2018-11-14 17:49:16,040 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 17:49:16,041 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:49:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 17:49:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-14 17:49:16,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:49:16,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 46 states. [2018-11-14 17:49:16,080 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 46 states. [2018-11-14 17:49:16,081 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 46 states. [2018-11-14 17:49:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:16,085 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 17:49:16,085 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 17:49:16,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:16,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:16,086 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 54 states. [2018-11-14 17:49:16,087 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 54 states. [2018-11-14 17:49:16,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:16,090 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-14 17:49:16,090 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-14 17:49:16,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:16,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:16,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:49:16,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:49:16,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:49:16,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-11-14 17:49:16,094 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 30 [2018-11-14 17:49:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:49:16,095 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-11-14 17:49:16,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:49:16,095 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-11-14 17:49:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:49:16,096 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:49:16,097 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:49:16,097 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:49:16,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:49:16,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1719040477, now seen corresponding path program 2 times [2018-11-14 17:49:16,098 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:49:16,098 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:49:16,118 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:49:16,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:49:16,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:49:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:16,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:49:16,549 INFO L256 TraceCheckUtils]: 0: Hoare triple {1219#true} call ULTIMATE.init(); {1219#true} is VALID [2018-11-14 17:49:16,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {1219#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1219#true} is VALID [2018-11-14 17:49:16,550 INFO L273 TraceCheckUtils]: 2: Hoare triple {1219#true} assume true; {1219#true} is VALID [2018-11-14 17:49:16,551 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1219#true} {1219#true} #63#return; {1219#true} is VALID [2018-11-14 17:49:16,551 INFO L256 TraceCheckUtils]: 4: Hoare triple {1219#true} call #t~ret4 := main(); {1219#true} is VALID [2018-11-14 17:49:16,552 INFO L273 TraceCheckUtils]: 5: Hoare triple {1219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1239#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:49:16,552 INFO L273 TraceCheckUtils]: 6: Hoare triple {1239#(= main_~i~0 (_ bv0 32))} assume true; {1239#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:49:16,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {1239#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1246#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,553 INFO L273 TraceCheckUtils]: 8: Hoare triple {1246#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1246#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {1246#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1253#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,555 INFO L273 TraceCheckUtils]: 10: Hoare triple {1253#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1253#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,556 INFO L273 TraceCheckUtils]: 11: Hoare triple {1253#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1260#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,557 INFO L273 TraceCheckUtils]: 12: Hoare triple {1260#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1260#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {1260#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1267#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 17:49:16,559 INFO L273 TraceCheckUtils]: 14: Hoare triple {1267#(= (_ bv4 32) main_~i~0)} assume true; {1267#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 17:49:16,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {1267#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1274#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {1274#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1274#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {1274#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1281#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 17:49:16,563 INFO L273 TraceCheckUtils]: 18: Hoare triple {1281#(= (_ bv6 32) main_~i~0)} assume true; {1281#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 17:49:16,564 INFO L273 TraceCheckUtils]: 19: Hoare triple {1281#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1288#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {1288#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {1288#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {1288#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1295#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,567 INFO L273 TraceCheckUtils]: 22: Hoare triple {1295#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {1295#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,568 INFO L273 TraceCheckUtils]: 23: Hoare triple {1295#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1302#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 17:49:16,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {1302#(= (_ bv9 32) main_~i~0)} assume true; {1302#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 17:49:16,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {1302#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1309#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {1309#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {1309#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:16,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {1309#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {1220#false} is VALID [2018-11-14 17:49:16,572 INFO L273 TraceCheckUtils]: 28: Hoare triple {1220#false} ~i~0 := 1bv32; {1220#false} is VALID [2018-11-14 17:49:16,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {1220#false} assume true; {1220#false} is VALID [2018-11-14 17:49:16,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {1220#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1220#false} is VALID [2018-11-14 17:49:16,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {1220#false} assume true; {1220#false} is VALID [2018-11-14 17:49:16,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {1220#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1220#false} is VALID [2018-11-14 17:49:16,574 INFO L273 TraceCheckUtils]: 33: Hoare triple {1220#false} assume true; {1220#false} is VALID [2018-11-14 17:49:16,574 INFO L273 TraceCheckUtils]: 34: Hoare triple {1220#false} assume !~bvslt32(~i~0, 10000bv32); {1220#false} is VALID [2018-11-14 17:49:16,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {1220#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1220#false} is VALID [2018-11-14 17:49:16,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {1220#false} assume true; {1220#false} is VALID [2018-11-14 17:49:16,575 INFO L273 TraceCheckUtils]: 37: Hoare triple {1220#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {1220#false} is VALID [2018-11-14 17:49:16,575 INFO L256 TraceCheckUtils]: 38: Hoare triple {1220#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1220#false} is VALID [2018-11-14 17:49:16,575 INFO L273 TraceCheckUtils]: 39: Hoare triple {1220#false} ~cond := #in~cond; {1220#false} is VALID [2018-11-14 17:49:16,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {1220#false} assume ~cond == 0bv32; {1220#false} is VALID [2018-11-14 17:49:16,576 INFO L273 TraceCheckUtils]: 41: Hoare triple {1220#false} assume !false; {1220#false} is VALID [2018-11-14 17:49:16,580 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 17:49:16,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:49:17,080 INFO L273 TraceCheckUtils]: 41: Hoare triple {1220#false} assume !false; {1220#false} is VALID [2018-11-14 17:49:17,080 INFO L273 TraceCheckUtils]: 40: Hoare triple {1220#false} assume ~cond == 0bv32; {1220#false} is VALID [2018-11-14 17:49:17,080 INFO L273 TraceCheckUtils]: 39: Hoare triple {1220#false} ~cond := #in~cond; {1220#false} is VALID [2018-11-14 17:49:17,081 INFO L256 TraceCheckUtils]: 38: Hoare triple {1220#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1220#false} is VALID [2018-11-14 17:49:17,081 INFO L273 TraceCheckUtils]: 37: Hoare triple {1220#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {1220#false} is VALID [2018-11-14 17:49:17,081 INFO L273 TraceCheckUtils]: 36: Hoare triple {1220#false} assume true; {1220#false} is VALID [2018-11-14 17:49:17,081 INFO L273 TraceCheckUtils]: 35: Hoare triple {1220#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1220#false} is VALID [2018-11-14 17:49:17,082 INFO L273 TraceCheckUtils]: 34: Hoare triple {1220#false} assume !~bvslt32(~i~0, 10000bv32); {1220#false} is VALID [2018-11-14 17:49:17,082 INFO L273 TraceCheckUtils]: 33: Hoare triple {1220#false} assume true; {1220#false} is VALID [2018-11-14 17:49:17,082 INFO L273 TraceCheckUtils]: 32: Hoare triple {1220#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1220#false} is VALID [2018-11-14 17:49:17,082 INFO L273 TraceCheckUtils]: 31: Hoare triple {1220#false} assume true; {1220#false} is VALID [2018-11-14 17:49:17,082 INFO L273 TraceCheckUtils]: 30: Hoare triple {1220#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {1220#false} is VALID [2018-11-14 17:49:17,082 INFO L273 TraceCheckUtils]: 29: Hoare triple {1220#false} assume true; {1220#false} is VALID [2018-11-14 17:49:17,083 INFO L273 TraceCheckUtils]: 28: Hoare triple {1220#false} ~i~0 := 1bv32; {1220#false} is VALID [2018-11-14 17:49:17,083 INFO L273 TraceCheckUtils]: 27: Hoare triple {1400#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {1220#false} is VALID [2018-11-14 17:49:17,083 INFO L273 TraceCheckUtils]: 26: Hoare triple {1400#(bvslt main_~i~0 (_ bv10000 32))} assume true; {1400#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-14 17:49:17,085 INFO L273 TraceCheckUtils]: 25: Hoare triple {1407#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1400#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-14 17:49:17,085 INFO L273 TraceCheckUtils]: 24: Hoare triple {1407#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume true; {1407#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {1414#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1407#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,092 INFO L273 TraceCheckUtils]: 22: Hoare triple {1414#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume true; {1414#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,096 INFO L273 TraceCheckUtils]: 21: Hoare triple {1421#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1414#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,097 INFO L273 TraceCheckUtils]: 20: Hoare triple {1421#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume true; {1421#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {1428#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1421#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,102 INFO L273 TraceCheckUtils]: 18: Hoare triple {1428#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume true; {1428#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {1435#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1428#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,106 INFO L273 TraceCheckUtils]: 16: Hoare triple {1435#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume true; {1435#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,110 INFO L273 TraceCheckUtils]: 15: Hoare triple {1442#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1435#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {1442#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume true; {1442#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {1449#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1442#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,120 INFO L273 TraceCheckUtils]: 12: Hoare triple {1449#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume true; {1449#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,130 INFO L273 TraceCheckUtils]: 11: Hoare triple {1456#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1449#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,131 INFO L273 TraceCheckUtils]: 10: Hoare triple {1456#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume true; {1456#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,140 INFO L273 TraceCheckUtils]: 9: Hoare triple {1463#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1456#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {1463#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume true; {1463#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {1470#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1463#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {1470#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume true; {1470#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {1219#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1470#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:17,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {1219#true} call #t~ret4 := main(); {1219#true} is VALID [2018-11-14 17:49:17,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1219#true} {1219#true} #63#return; {1219#true} is VALID [2018-11-14 17:49:17,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {1219#true} assume true; {1219#true} is VALID [2018-11-14 17:49:17,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {1219#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1219#true} is VALID [2018-11-14 17:49:17,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {1219#true} call ULTIMATE.init(); {1219#true} is VALID [2018-11-14 17:49:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-14 17:49:17,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:49:17,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 17:49:17,156 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-11-14 17:49:17,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:49:17,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:49:17,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:17,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:49:17,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:49:17,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:49:17,316 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 24 states. [2018-11-14 17:49:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:22,184 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2018-11-14 17:49:22,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:49:22,184 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-11-14 17:49:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:49:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:49:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 125 transitions. [2018-11-14 17:49:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:49:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 125 transitions. [2018-11-14 17:49:22,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 125 transitions. [2018-11-14 17:49:22,431 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:22,434 INFO L225 Difference]: With dead ends: 108 [2018-11-14 17:49:22,435 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 17:49:22,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:49:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 17:49:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2018-11-14 17:49:22,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:49:22,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 74 states. [2018-11-14 17:49:22,507 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 74 states. [2018-11-14 17:49:22,507 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 74 states. [2018-11-14 17:49:22,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:22,512 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-11-14 17:49:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-11-14 17:49:22,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:22,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:22,513 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 90 states. [2018-11-14 17:49:22,513 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 90 states. [2018-11-14 17:49:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:22,519 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-11-14 17:49:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2018-11-14 17:49:22,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:22,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:22,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:49:22,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:49:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 17:49:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-11-14 17:49:22,524 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 42 [2018-11-14 17:49:22,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:49:22,525 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-11-14 17:49:22,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:49:22,525 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-11-14 17:49:22,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 17:49:22,527 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:49:22,527 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:49:22,527 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:49:22,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:49:22,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1082351527, now seen corresponding path program 3 times [2018-11-14 17:49:22,528 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:49:22,528 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:49:22,563 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:49:22,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-14 17:49:22,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:49:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:23,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:49:23,277 INFO L256 TraceCheckUtils]: 0: Hoare triple {1960#true} call ULTIMATE.init(); {1960#true} is VALID [2018-11-14 17:49:23,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {1960#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1960#true} is VALID [2018-11-14 17:49:23,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,278 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1960#true} #63#return; {1960#true} is VALID [2018-11-14 17:49:23,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {1960#true} call #t~ret4 := main(); {1960#true} is VALID [2018-11-14 17:49:23,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {1960#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1960#true} is VALID [2018-11-14 17:49:23,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,281 INFO L273 TraceCheckUtils]: 13: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,281 INFO L273 TraceCheckUtils]: 14: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,282 INFO L273 TraceCheckUtils]: 17: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,283 INFO L273 TraceCheckUtils]: 23: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,283 INFO L273 TraceCheckUtils]: 24: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,283 INFO L273 TraceCheckUtils]: 25: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,284 INFO L273 TraceCheckUtils]: 27: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,284 INFO L273 TraceCheckUtils]: 28: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,284 INFO L273 TraceCheckUtils]: 29: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,284 INFO L273 TraceCheckUtils]: 32: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,285 INFO L273 TraceCheckUtils]: 33: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,285 INFO L273 TraceCheckUtils]: 34: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,285 INFO L273 TraceCheckUtils]: 36: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,286 INFO L273 TraceCheckUtils]: 37: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,286 INFO L273 TraceCheckUtils]: 38: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,286 INFO L273 TraceCheckUtils]: 39: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,286 INFO L273 TraceCheckUtils]: 40: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,287 INFO L273 TraceCheckUtils]: 41: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,287 INFO L273 TraceCheckUtils]: 42: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,287 INFO L273 TraceCheckUtils]: 43: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,287 INFO L273 TraceCheckUtils]: 44: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,288 INFO L273 TraceCheckUtils]: 45: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,288 INFO L273 TraceCheckUtils]: 46: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,288 INFO L273 TraceCheckUtils]: 47: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,289 INFO L273 TraceCheckUtils]: 50: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,289 INFO L273 TraceCheckUtils]: 51: Hoare triple {1960#true} assume !~bvslt32(~i~0, 10000bv32); {1960#true} is VALID [2018-11-14 17:49:23,289 INFO L273 TraceCheckUtils]: 52: Hoare triple {1960#true} ~i~0 := 1bv32; {2121#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:23,296 INFO L273 TraceCheckUtils]: 53: Hoare triple {2121#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2121#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:23,297 INFO L273 TraceCheckUtils]: 54: Hoare triple {2121#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2128#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-14 17:49:23,298 INFO L273 TraceCheckUtils]: 55: Hoare triple {2128#(= (_ bv7 32) main_~i~0)} assume true; {2128#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-14 17:49:23,300 INFO L273 TraceCheckUtils]: 56: Hoare triple {2128#(= (_ bv7 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2135#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:23,300 INFO L273 TraceCheckUtils]: 57: Hoare triple {2135#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {2135#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:23,302 INFO L273 TraceCheckUtils]: 58: Hoare triple {2135#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2142#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:23,302 INFO L273 TraceCheckUtils]: 59: Hoare triple {2142#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume true; {2142#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:23,304 INFO L273 TraceCheckUtils]: 60: Hoare triple {2142#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2149#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-14 17:49:23,304 INFO L273 TraceCheckUtils]: 61: Hoare triple {2149#(= (_ bv25 32) main_~i~0)} assume true; {2149#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-14 17:49:23,306 INFO L273 TraceCheckUtils]: 62: Hoare triple {2149#(= (_ bv25 32) main_~i~0)} assume !~bvslt32(~i~0, 10000bv32); {1961#false} is VALID [2018-11-14 17:49:23,306 INFO L273 TraceCheckUtils]: 63: Hoare triple {1961#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1961#false} is VALID [2018-11-14 17:49:23,306 INFO L273 TraceCheckUtils]: 64: Hoare triple {1961#false} assume true; {1961#false} is VALID [2018-11-14 17:49:23,307 INFO L273 TraceCheckUtils]: 65: Hoare triple {1961#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {1961#false} is VALID [2018-11-14 17:49:23,307 INFO L256 TraceCheckUtils]: 66: Hoare triple {1961#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1961#false} is VALID [2018-11-14 17:49:23,307 INFO L273 TraceCheckUtils]: 67: Hoare triple {1961#false} ~cond := #in~cond; {1961#false} is VALID [2018-11-14 17:49:23,307 INFO L273 TraceCheckUtils]: 68: Hoare triple {1961#false} assume ~cond == 0bv32; {1961#false} is VALID [2018-11-14 17:49:23,308 INFO L273 TraceCheckUtils]: 69: Hoare triple {1961#false} assume !false; {1961#false} is VALID [2018-11-14 17:49:23,311 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-14 17:49:23,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:49:23,574 INFO L273 TraceCheckUtils]: 69: Hoare triple {1961#false} assume !false; {1961#false} is VALID [2018-11-14 17:49:23,574 INFO L273 TraceCheckUtils]: 68: Hoare triple {1961#false} assume ~cond == 0bv32; {1961#false} is VALID [2018-11-14 17:49:23,575 INFO L273 TraceCheckUtils]: 67: Hoare triple {1961#false} ~cond := #in~cond; {1961#false} is VALID [2018-11-14 17:49:23,575 INFO L256 TraceCheckUtils]: 66: Hoare triple {1961#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {1961#false} is VALID [2018-11-14 17:49:23,575 INFO L273 TraceCheckUtils]: 65: Hoare triple {1961#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {1961#false} is VALID [2018-11-14 17:49:23,575 INFO L273 TraceCheckUtils]: 64: Hoare triple {1961#false} assume true; {1961#false} is VALID [2018-11-14 17:49:23,575 INFO L273 TraceCheckUtils]: 63: Hoare triple {1961#false} ~i~0 := 1bv32;~j~0 := 0bv32; {1961#false} is VALID [2018-11-14 17:49:23,578 INFO L273 TraceCheckUtils]: 62: Hoare triple {2198#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {1961#false} is VALID [2018-11-14 17:49:23,578 INFO L273 TraceCheckUtils]: 61: Hoare triple {2198#(bvslt main_~i~0 (_ bv10000 32))} assume true; {2198#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-14 17:49:23,579 INFO L273 TraceCheckUtils]: 60: Hoare triple {2205#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2198#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-14 17:49:23,581 INFO L273 TraceCheckUtils]: 59: Hoare triple {2205#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume true; {2205#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:23,587 INFO L273 TraceCheckUtils]: 58: Hoare triple {2212#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2205#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:23,588 INFO L273 TraceCheckUtils]: 57: Hoare triple {2212#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} assume true; {2212#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:23,594 INFO L273 TraceCheckUtils]: 56: Hoare triple {2219#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2212#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:23,595 INFO L273 TraceCheckUtils]: 55: Hoare triple {2219#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} assume true; {2219#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:23,601 INFO L273 TraceCheckUtils]: 54: Hoare triple {2226#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2219#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:23,602 INFO L273 TraceCheckUtils]: 53: Hoare triple {2226#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv10000 32))} assume true; {2226#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:23,604 INFO L273 TraceCheckUtils]: 52: Hoare triple {1960#true} ~i~0 := 1bv32; {2226#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:23,604 INFO L273 TraceCheckUtils]: 51: Hoare triple {1960#true} assume !~bvslt32(~i~0, 10000bv32); {1960#true} is VALID [2018-11-14 17:49:23,604 INFO L273 TraceCheckUtils]: 50: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,604 INFO L273 TraceCheckUtils]: 49: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,605 INFO L273 TraceCheckUtils]: 48: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,605 INFO L273 TraceCheckUtils]: 47: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,605 INFO L273 TraceCheckUtils]: 46: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,605 INFO L273 TraceCheckUtils]: 45: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,606 INFO L273 TraceCheckUtils]: 44: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,606 INFO L273 TraceCheckUtils]: 43: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,606 INFO L273 TraceCheckUtils]: 42: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,606 INFO L273 TraceCheckUtils]: 41: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,606 INFO L273 TraceCheckUtils]: 40: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,607 INFO L273 TraceCheckUtils]: 39: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,607 INFO L273 TraceCheckUtils]: 38: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,607 INFO L273 TraceCheckUtils]: 37: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,607 INFO L273 TraceCheckUtils]: 36: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,607 INFO L273 TraceCheckUtils]: 35: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,607 INFO L273 TraceCheckUtils]: 34: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,608 INFO L273 TraceCheckUtils]: 33: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,608 INFO L273 TraceCheckUtils]: 32: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,608 INFO L273 TraceCheckUtils]: 31: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,609 INFO L273 TraceCheckUtils]: 27: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,609 INFO L273 TraceCheckUtils]: 26: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,609 INFO L273 TraceCheckUtils]: 23: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,611 INFO L273 TraceCheckUtils]: 17: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,611 INFO L273 TraceCheckUtils]: 16: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,611 INFO L273 TraceCheckUtils]: 15: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,611 INFO L273 TraceCheckUtils]: 14: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,611 INFO L273 TraceCheckUtils]: 11: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,612 INFO L273 TraceCheckUtils]: 10: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,612 INFO L273 TraceCheckUtils]: 7: Hoare triple {1960#true} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {1960#true} is VALID [2018-11-14 17:49:23,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {1960#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1960#true} is VALID [2018-11-14 17:49:23,612 INFO L256 TraceCheckUtils]: 4: Hoare triple {1960#true} call #t~ret4 := main(); {1960#true} is VALID [2018-11-14 17:49:23,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1960#true} {1960#true} #63#return; {1960#true} is VALID [2018-11-14 17:49:23,613 INFO L273 TraceCheckUtils]: 2: Hoare triple {1960#true} assume true; {1960#true} is VALID [2018-11-14 17:49:23,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {1960#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1960#true} is VALID [2018-11-14 17:49:23,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {1960#true} call ULTIMATE.init(); {1960#true} is VALID [2018-11-14 17:49:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-14 17:49:23,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:49:23,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:49:23,623 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-14 17:49:23,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:49:23,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:49:23,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:23,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:49:23,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:49:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:49:23,713 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 12 states. [2018-11-14 17:49:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:25,852 INFO L93 Difference]: Finished difference Result 135 states and 152 transitions. [2018-11-14 17:49:25,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:49:25,852 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2018-11-14 17:49:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:49:25,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:49:25,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2018-11-14 17:49:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:49:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 118 transitions. [2018-11-14 17:49:25,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 118 transitions. [2018-11-14 17:49:26,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:26,142 INFO L225 Difference]: With dead ends: 135 [2018-11-14 17:49:26,142 INFO L226 Difference]: Without dead ends: 124 [2018-11-14 17:49:26,147 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:49:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-14 17:49:26,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 86. [2018-11-14 17:49:26,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:49:26,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 86 states. [2018-11-14 17:49:26,191 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 86 states. [2018-11-14 17:49:26,191 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 86 states. [2018-11-14 17:49:26,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:26,197 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-11-14 17:49:26,197 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-11-14 17:49:26,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:26,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:26,198 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 124 states. [2018-11-14 17:49:26,198 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 124 states. [2018-11-14 17:49:26,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:26,204 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2018-11-14 17:49:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-11-14 17:49:26,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:26,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:26,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:49:26,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:49:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-14 17:49:26,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-11-14 17:49:26,208 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 70 [2018-11-14 17:49:26,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:49:26,209 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-11-14 17:49:26,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:49:26,209 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-11-14 17:49:26,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-14 17:49:26,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:49:26,210 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:49:26,210 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:49:26,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:49:26,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1804527243, now seen corresponding path program 4 times [2018-11-14 17:49:26,211 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:49:26,211 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:49:26,238 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:49:26,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:49:26,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:49:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:49:26,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:49:27,138 INFO L256 TraceCheckUtils]: 0: Hoare triple {2976#true} call ULTIMATE.init(); {2976#true} is VALID [2018-11-14 17:49:27,138 INFO L273 TraceCheckUtils]: 1: Hoare triple {2976#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2976#true} is VALID [2018-11-14 17:49:27,138 INFO L273 TraceCheckUtils]: 2: Hoare triple {2976#true} assume true; {2976#true} is VALID [2018-11-14 17:49:27,139 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2976#true} {2976#true} #63#return; {2976#true} is VALID [2018-11-14 17:49:27,139 INFO L256 TraceCheckUtils]: 4: Hoare triple {2976#true} call #t~ret4 := main(); {2976#true} is VALID [2018-11-14 17:49:27,139 INFO L273 TraceCheckUtils]: 5: Hoare triple {2976#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2996#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:49:27,140 INFO L273 TraceCheckUtils]: 6: Hoare triple {2996#(= main_~i~0 (_ bv0 32))} assume true; {2996#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:49:27,141 INFO L273 TraceCheckUtils]: 7: Hoare triple {2996#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3003#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,141 INFO L273 TraceCheckUtils]: 8: Hoare triple {3003#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3003#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,141 INFO L273 TraceCheckUtils]: 9: Hoare triple {3003#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3010#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,142 INFO L273 TraceCheckUtils]: 10: Hoare triple {3010#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {3010#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {3010#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3017#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {3017#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3017#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {3017#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3024#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,144 INFO L273 TraceCheckUtils]: 14: Hoare triple {3024#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {3024#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,145 INFO L273 TraceCheckUtils]: 15: Hoare triple {3024#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3031#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,146 INFO L273 TraceCheckUtils]: 16: Hoare triple {3031#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3031#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,147 INFO L273 TraceCheckUtils]: 17: Hoare triple {3031#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3038#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,147 INFO L273 TraceCheckUtils]: 18: Hoare triple {3038#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {3038#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {3038#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3045#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,150 INFO L273 TraceCheckUtils]: 20: Hoare triple {3045#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {3045#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,152 INFO L273 TraceCheckUtils]: 21: Hoare triple {3045#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3052#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,152 INFO L273 TraceCheckUtils]: 22: Hoare triple {3052#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {3052#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,153 INFO L273 TraceCheckUtils]: 23: Hoare triple {3052#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3059#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,153 INFO L273 TraceCheckUtils]: 24: Hoare triple {3059#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {3059#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {3059#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3066#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {3066#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {3066#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {3066#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3073#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {3073#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume true; {3073#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {3073#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3080#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {3080#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {3080#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {3080#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3087#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-14 17:49:27,164 INFO L273 TraceCheckUtils]: 32: Hoare triple {3087#(= (_ bv13 32) main_~i~0)} assume true; {3087#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-14 17:49:27,165 INFO L273 TraceCheckUtils]: 33: Hoare triple {3087#(= (_ bv13 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3094#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {3094#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume true; {3094#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,166 INFO L273 TraceCheckUtils]: 35: Hoare triple {3094#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3101#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-14 17:49:27,167 INFO L273 TraceCheckUtils]: 36: Hoare triple {3101#(= (_ bv15 32) main_~i~0)} assume true; {3101#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-14 17:49:27,167 INFO L273 TraceCheckUtils]: 37: Hoare triple {3101#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3108#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,167 INFO L273 TraceCheckUtils]: 38: Hoare triple {3108#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {3108#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,168 INFO L273 TraceCheckUtils]: 39: Hoare triple {3108#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3115#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-14 17:49:27,169 INFO L273 TraceCheckUtils]: 40: Hoare triple {3115#(= (_ bv17 32) main_~i~0)} assume true; {3115#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-14 17:49:27,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {3115#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3122#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,170 INFO L273 TraceCheckUtils]: 42: Hoare triple {3122#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {3122#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,171 INFO L273 TraceCheckUtils]: 43: Hoare triple {3122#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3129#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-14 17:49:27,171 INFO L273 TraceCheckUtils]: 44: Hoare triple {3129#(= (_ bv19 32) main_~i~0)} assume true; {3129#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-14 17:49:27,172 INFO L273 TraceCheckUtils]: 45: Hoare triple {3129#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3136#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,173 INFO L273 TraceCheckUtils]: 46: Hoare triple {3136#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {3136#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,174 INFO L273 TraceCheckUtils]: 47: Hoare triple {3136#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3143#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-14 17:49:27,174 INFO L273 TraceCheckUtils]: 48: Hoare triple {3143#(= (_ bv21 32) main_~i~0)} assume true; {3143#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-14 17:49:27,175 INFO L273 TraceCheckUtils]: 49: Hoare triple {3143#(= (_ bv21 32) main_~i~0)} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3150#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,176 INFO L273 TraceCheckUtils]: 50: Hoare triple {3150#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {3150#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:49:27,176 INFO L273 TraceCheckUtils]: 51: Hoare triple {3150#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 10000bv32); {2977#false} is VALID [2018-11-14 17:49:27,177 INFO L273 TraceCheckUtils]: 52: Hoare triple {2977#false} ~i~0 := 1bv32; {2977#false} is VALID [2018-11-14 17:49:27,177 INFO L273 TraceCheckUtils]: 53: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,177 INFO L273 TraceCheckUtils]: 54: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:27,177 INFO L273 TraceCheckUtils]: 55: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,177 INFO L273 TraceCheckUtils]: 56: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:27,178 INFO L273 TraceCheckUtils]: 57: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,178 INFO L273 TraceCheckUtils]: 58: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:27,178 INFO L273 TraceCheckUtils]: 59: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,178 INFO L273 TraceCheckUtils]: 60: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:27,178 INFO L273 TraceCheckUtils]: 61: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,179 INFO L273 TraceCheckUtils]: 62: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:27,179 INFO L273 TraceCheckUtils]: 63: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,179 INFO L273 TraceCheckUtils]: 64: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:27,179 INFO L273 TraceCheckUtils]: 65: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,179 INFO L273 TraceCheckUtils]: 66: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:27,179 INFO L273 TraceCheckUtils]: 67: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,179 INFO L273 TraceCheckUtils]: 68: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:27,179 INFO L273 TraceCheckUtils]: 69: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,180 INFO L273 TraceCheckUtils]: 70: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:27,180 INFO L273 TraceCheckUtils]: 71: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,180 INFO L273 TraceCheckUtils]: 72: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:27,180 INFO L273 TraceCheckUtils]: 73: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,180 INFO L273 TraceCheckUtils]: 74: Hoare triple {2977#false} assume !~bvslt32(~i~0, 10000bv32); {2977#false} is VALID [2018-11-14 17:49:27,180 INFO L273 TraceCheckUtils]: 75: Hoare triple {2977#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2977#false} is VALID [2018-11-14 17:49:27,180 INFO L273 TraceCheckUtils]: 76: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:27,180 INFO L273 TraceCheckUtils]: 77: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {2977#false} is VALID [2018-11-14 17:49:27,181 INFO L256 TraceCheckUtils]: 78: Hoare triple {2977#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2977#false} is VALID [2018-11-14 17:49:27,181 INFO L273 TraceCheckUtils]: 79: Hoare triple {2977#false} ~cond := #in~cond; {2977#false} is VALID [2018-11-14 17:49:27,181 INFO L273 TraceCheckUtils]: 80: Hoare triple {2977#false} assume ~cond == 0bv32; {2977#false} is VALID [2018-11-14 17:49:27,181 INFO L273 TraceCheckUtils]: 81: Hoare triple {2977#false} assume !false; {2977#false} is VALID [2018-11-14 17:49:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-14 17:49:27,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:49:29,084 INFO L273 TraceCheckUtils]: 81: Hoare triple {2977#false} assume !false; {2977#false} is VALID [2018-11-14 17:49:29,085 INFO L273 TraceCheckUtils]: 80: Hoare triple {2977#false} assume ~cond == 0bv32; {2977#false} is VALID [2018-11-14 17:49:29,085 INFO L273 TraceCheckUtils]: 79: Hoare triple {2977#false} ~cond := #in~cond; {2977#false} is VALID [2018-11-14 17:49:29,085 INFO L256 TraceCheckUtils]: 78: Hoare triple {2977#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1bv32 else 0bv32)); {2977#false} is VALID [2018-11-14 17:49:29,085 INFO L273 TraceCheckUtils]: 77: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~bvmul32(6bv32, ~j~0)))), 4bv32); {2977#false} is VALID [2018-11-14 17:49:29,085 INFO L273 TraceCheckUtils]: 76: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,086 INFO L273 TraceCheckUtils]: 75: Hoare triple {2977#false} ~i~0 := 1bv32;~j~0 := 0bv32; {2977#false} is VALID [2018-11-14 17:49:29,086 INFO L273 TraceCheckUtils]: 74: Hoare triple {2977#false} assume !~bvslt32(~i~0, 10000bv32); {2977#false} is VALID [2018-11-14 17:49:29,086 INFO L273 TraceCheckUtils]: 73: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,086 INFO L273 TraceCheckUtils]: 72: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:29,086 INFO L273 TraceCheckUtils]: 71: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,086 INFO L273 TraceCheckUtils]: 70: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:29,087 INFO L273 TraceCheckUtils]: 69: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,087 INFO L273 TraceCheckUtils]: 68: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:29,087 INFO L273 TraceCheckUtils]: 67: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,087 INFO L273 TraceCheckUtils]: 66: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:29,087 INFO L273 TraceCheckUtils]: 65: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,087 INFO L273 TraceCheckUtils]: 64: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:29,088 INFO L273 TraceCheckUtils]: 63: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,088 INFO L273 TraceCheckUtils]: 62: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:29,088 INFO L273 TraceCheckUtils]: 61: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,088 INFO L273 TraceCheckUtils]: 60: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:29,088 INFO L273 TraceCheckUtils]: 59: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,088 INFO L273 TraceCheckUtils]: 58: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:29,088 INFO L273 TraceCheckUtils]: 57: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,089 INFO L273 TraceCheckUtils]: 56: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:29,089 INFO L273 TraceCheckUtils]: 55: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,089 INFO L273 TraceCheckUtils]: 54: Hoare triple {2977#false} assume !!~bvslt32(~i~0, 10000bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem1;~i~0 := ~bvadd32(6bv32, ~i~0);~j~0 := ~bvadd32(1bv32, ~j~0); {2977#false} is VALID [2018-11-14 17:49:29,089 INFO L273 TraceCheckUtils]: 53: Hoare triple {2977#false} assume true; {2977#false} is VALID [2018-11-14 17:49:29,089 INFO L273 TraceCheckUtils]: 52: Hoare triple {2977#false} ~i~0 := 1bv32; {2977#false} is VALID [2018-11-14 17:49:29,090 INFO L273 TraceCheckUtils]: 51: Hoare triple {3337#(bvslt main_~i~0 (_ bv10000 32))} assume !~bvslt32(~i~0, 10000bv32); {2977#false} is VALID [2018-11-14 17:49:29,090 INFO L273 TraceCheckUtils]: 50: Hoare triple {3337#(bvslt main_~i~0 (_ bv10000 32))} assume true; {3337#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-14 17:49:29,091 INFO L273 TraceCheckUtils]: 49: Hoare triple {3344#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3337#(bvslt main_~i~0 (_ bv10000 32))} is VALID [2018-11-14 17:49:29,091 INFO L273 TraceCheckUtils]: 48: Hoare triple {3344#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} assume true; {3344#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,097 INFO L273 TraceCheckUtils]: 47: Hoare triple {3351#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3344#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,097 INFO L273 TraceCheckUtils]: 46: Hoare triple {3351#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} assume true; {3351#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,102 INFO L273 TraceCheckUtils]: 45: Hoare triple {3358#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3351#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,102 INFO L273 TraceCheckUtils]: 44: Hoare triple {3358#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} assume true; {3358#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,107 INFO L273 TraceCheckUtils]: 43: Hoare triple {3365#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3358#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,108 INFO L273 TraceCheckUtils]: 42: Hoare triple {3365#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} assume true; {3365#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,111 INFO L273 TraceCheckUtils]: 41: Hoare triple {3372#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3365#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,111 INFO L273 TraceCheckUtils]: 40: Hoare triple {3372#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} assume true; {3372#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,115 INFO L273 TraceCheckUtils]: 39: Hoare triple {3379#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3372#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,115 INFO L273 TraceCheckUtils]: 38: Hoare triple {3379#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} assume true; {3379#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,133 INFO L273 TraceCheckUtils]: 37: Hoare triple {3386#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3379#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {3386#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} assume true; {3386#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,142 INFO L273 TraceCheckUtils]: 35: Hoare triple {3393#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3386#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,142 INFO L273 TraceCheckUtils]: 34: Hoare triple {3393#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} assume true; {3393#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {3400#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3393#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,148 INFO L273 TraceCheckUtils]: 32: Hoare triple {3400#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} assume true; {3400#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,151 INFO L273 TraceCheckUtils]: 31: Hoare triple {3407#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3400#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,151 INFO L273 TraceCheckUtils]: 30: Hoare triple {3407#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} assume true; {3407#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,158 INFO L273 TraceCheckUtils]: 29: Hoare triple {3414#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3407#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,158 INFO L273 TraceCheckUtils]: 28: Hoare triple {3414#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} assume true; {3414#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {3421#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3414#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {3421#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} assume true; {3421#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,168 INFO L273 TraceCheckUtils]: 25: Hoare triple {3428#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3421#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,168 INFO L273 TraceCheckUtils]: 24: Hoare triple {3428#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} assume true; {3428#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {3435#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3428#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {3435#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} assume true; {3435#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {3442#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3435#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,182 INFO L273 TraceCheckUtils]: 20: Hoare triple {3442#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} assume true; {3442#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,187 INFO L273 TraceCheckUtils]: 19: Hoare triple {3449#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3442#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,187 INFO L273 TraceCheckUtils]: 18: Hoare triple {3449#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} assume true; {3449#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {3456#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3449#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,192 INFO L273 TraceCheckUtils]: 16: Hoare triple {3456#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} assume true; {3456#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {3463#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3456#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,195 INFO L273 TraceCheckUtils]: 14: Hoare triple {3463#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} assume true; {3463#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,201 INFO L273 TraceCheckUtils]: 13: Hoare triple {3470#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3463#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {3470#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} assume true; {3470#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {3477#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3470#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,205 INFO L273 TraceCheckUtils]: 10: Hoare triple {3477#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} assume true; {3477#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {3484#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3477#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {3484#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} assume true; {3484#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {3491#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} assume !!~bvslt32(~i~0, 10000bv32);call write~intINTTYPE4(#t~nondet0, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet0;~i~0 := ~bvadd32(1bv32, ~i~0); {3484#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {3491#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} assume true; {3491#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {2976#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(40000bv32);~i~0 := 0bv32;~j~0 := 0bv32; {3491#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv10000 32))} is VALID [2018-11-14 17:49:29,218 INFO L256 TraceCheckUtils]: 4: Hoare triple {2976#true} call #t~ret4 := main(); {2976#true} is VALID [2018-11-14 17:49:29,219 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2976#true} {2976#true} #63#return; {2976#true} is VALID [2018-11-14 17:49:29,219 INFO L273 TraceCheckUtils]: 2: Hoare triple {2976#true} assume true; {2976#true} is VALID [2018-11-14 17:49:29,219 INFO L273 TraceCheckUtils]: 1: Hoare triple {2976#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2976#true} is VALID [2018-11-14 17:49:29,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {2976#true} call ULTIMATE.init(); {2976#true} is VALID [2018-11-14 17:49:29,227 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-14 17:49:29,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:49:29,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 17:49:29,236 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 82 [2018-11-14 17:49:29,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:49:29,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 17:49:29,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:29,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 17:49:29,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 17:49:29,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 17:49:29,459 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 48 states. [2018-11-14 17:49:33,628 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 17:49:34,159 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 17:49:34,670 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 17:49:35,212 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 17:49:35,800 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 17:49:36,371 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 17:49:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:50,190 INFO L93 Difference]: Finished difference Result 200 states and 235 transitions. [2018-11-14 17:49:50,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 17:49:50,190 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 82 [2018-11-14 17:49:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:49:50,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:49:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 211 transitions. [2018-11-14 17:49:50,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:49:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 211 transitions. [2018-11-14 17:49:50,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 211 transitions. [2018-11-14 17:49:50,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:49:50,629 INFO L225 Difference]: With dead ends: 200 [2018-11-14 17:49:50,629 INFO L226 Difference]: Without dead ends: 166 [2018-11-14 17:49:50,631 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 17:49:50,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-14 17:49:50,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 134. [2018-11-14 17:49:50,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:49:50,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 134 states. [2018-11-14 17:49:50,739 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 134 states. [2018-11-14 17:49:50,739 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 134 states. [2018-11-14 17:49:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:50,746 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-11-14 17:49:50,746 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2018-11-14 17:49:50,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:50,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:50,747 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 166 states. [2018-11-14 17:49:50,747 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 166 states. [2018-11-14 17:49:50,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:49:50,754 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2018-11-14 17:49:50,754 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 176 transitions. [2018-11-14 17:49:50,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:49:50,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:49:50,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:49:50,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:49:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-14 17:49:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-11-14 17:49:50,759 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 82 [2018-11-14 17:49:50,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:49:50,760 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-11-14 17:49:50,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 17:49:50,760 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-11-14 17:49:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-14 17:49:50,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:49:50,762 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:49:50,762 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:49:50,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:49:50,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1757797125, now seen corresponding path program 5 times [2018-11-14 17:49:50,763 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:49:50,763 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:49:50,788 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1