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.epf -i ../../../trunk/examples/svcomp/array-tiling/mlceu_false-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:04:38,485 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:04:38,487 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:04:38,505 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:04:38,506 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:04:38,507 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:04:38,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:04:38,510 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:04:38,512 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:04:38,513 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:04:38,514 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:04:38,514 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:04:38,515 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:04:38,516 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:04:38,517 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:04:38,518 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:04:38,519 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:04:38,520 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:04:38,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:04:38,524 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:04:38,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:04:38,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:04:38,532 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:04:38,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:04:38,533 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:04:38,534 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:04:38,535 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:04:38,536 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:04:38,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:04:38,541 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:04:38,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:04:38,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:04:38,545 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:04:38,545 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:04:38,546 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:04:38,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:04:38,549 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:04:38,579 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:04:38,580 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:04:38,581 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:04:38,581 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:04:38,582 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:04:38,582 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:04:38,582 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:04:38,583 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:04:38,583 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:04:38,583 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:04:38,584 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:04:38,584 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:04:38,584 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:04:38,584 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:04:38,584 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:04:38,584 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:04:38,585 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:04:38,585 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:04:38,585 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:04:38,585 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:04:38,585 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:04:38,588 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:04:38,588 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:04:38,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:04:38,589 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:04:38,589 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:04:38,589 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:04:38,589 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:04:38,589 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:04:38,590 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:04:38,590 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:04:38,590 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:04:38,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:04:38,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:04:38,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:04:38,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:04:38,654 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:04:38,655 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mlceu_false-unreach-call.i [2018-11-14 16:04:38,728 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9369c904/87b09c4da25741bba5350f2899f7116e/FLAG3e5625872 [2018-11-14 16:04:39,161 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:04:39,161 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mlceu_false-unreach-call.i [2018-11-14 16:04:39,167 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9369c904/87b09c4da25741bba5350f2899f7116e/FLAG3e5625872 [2018-11-14 16:04:39,186 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9369c904/87b09c4da25741bba5350f2899f7116e [2018-11-14 16:04:39,203 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:04:39,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:04:39,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:04:39,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:04:39,215 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:04:39,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:04:39" (1/1) ... [2018-11-14 16:04:39,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3ffb77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39, skipping insertion in model container [2018-11-14 16:04:39,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:04:39" (1/1) ... [2018-11-14 16:04:39,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:04:39,254 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:04:39,512 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:04:39,518 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:04:39,546 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:04:39,582 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:04:39,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39 WrapperNode [2018-11-14 16:04:39,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:04:39,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:04:39,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:04:39,585 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:04:39,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39" (1/1) ... [2018-11-14 16:04:39,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39" (1/1) ... [2018-11-14 16:04:39,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39" (1/1) ... [2018-11-14 16:04:39,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39" (1/1) ... [2018-11-14 16:04:39,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39" (1/1) ... [2018-11-14 16:04:39,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39" (1/1) ... [2018-11-14 16:04:39,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39" (1/1) ... [2018-11-14 16:04:39,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:04:39,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:04:39,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:04:39,658 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:04:39,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:04:39,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:04:39,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:04:39,790 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:04:39,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:04:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:04:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:04:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:04:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:04:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:04:39,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:04:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:04:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:04:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:04:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:04:39,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:04:39,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:04:40,375 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:04:40,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:04:40 BoogieIcfgContainer [2018-11-14 16:04:40,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:04:40,377 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:04:40,377 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:04:40,381 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:04:40,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:04:39" (1/3) ... [2018-11-14 16:04:40,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdb0c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:04:40, skipping insertion in model container [2018-11-14 16:04:40,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:04:39" (2/3) ... [2018-11-14 16:04:40,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdb0c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:04:40, skipping insertion in model container [2018-11-14 16:04:40,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:04:40" (3/3) ... [2018-11-14 16:04:40,385 INFO L112 eAbstractionObserver]: Analyzing ICFG mlceu_false-unreach-call.i [2018-11-14 16:04:40,395 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:04:40,404 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:04:40,423 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:04:40,457 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:04:40,458 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:04:40,458 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:04:40,458 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:04:40,458 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:04:40,459 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:04:40,459 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:04:40,459 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:04:40,459 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:04:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-14 16:04:40,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:04:40,486 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:40,488 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:40,491 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:40,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:40,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1484785060, now seen corresponding path program 1 times [2018-11-14 16:04:40,503 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:40,504 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 16:04:40,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:04:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:40,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:40,718 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-14 16:04:40,722 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {32#true} is VALID [2018-11-14 16:04:40,722 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 16:04:40,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #63#return; {32#true} is VALID [2018-11-14 16:04:40,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2018-11-14 16:04:40,724 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {32#true} is VALID [2018-11-14 16:04:40,724 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {32#true} is VALID [2018-11-14 16:04:40,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-14 16:04:40,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-14 16:04:40,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2018-11-14 16:04:40,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {33#false} is VALID [2018-11-14 16:04:40,739 INFO L256 TraceCheckUtils]: 11: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {33#false} is VALID [2018-11-14 16:04:40,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-14 16:04:40,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume ~cond == 0bv32; {33#false} is VALID [2018-11-14 16:04:40,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-14 16:04:40,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:04:40,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:04:40,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:04:40,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:04:40,759 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 16:04:40,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:40,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:04:40,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:40,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:04:40,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:04:40,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:04:40,972 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-14 16:04:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:41,156 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-14 16:04:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:04:41,156 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 16:04:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:04:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-14 16:04:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:04:41,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-14 16:04:41,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2018-11-14 16:04:41,463 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:41,476 INFO L225 Difference]: With dead ends: 47 [2018-11-14 16:04:41,476 INFO L226 Difference]: Without dead ends: 23 [2018-11-14 16:04:41,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:04:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-14 16:04:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-14 16:04:41,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:41,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-14 16:04:41,529 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 16:04:41,529 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 16:04:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:41,534 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 16:04:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 16:04:41,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:41,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:41,535 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-14 16:04:41,535 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-14 16:04:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:41,540 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-14 16:04:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 16:04:41,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:41,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:41,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:41,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:41,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 16:04:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-14 16:04:41,546 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-14 16:04:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:41,546 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-14 16:04:41,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:04:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-14 16:04:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 16:04:41,548 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:41,548 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:41,548 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:41,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash 144632911, now seen corresponding path program 1 times [2018-11-14 16:04:41,549 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:41,550 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 16:04:41,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:04:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:41,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:41,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {213#true} call ULTIMATE.init(); {213#true} is VALID [2018-11-14 16:04:41,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {213#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {213#true} is VALID [2018-11-14 16:04:41,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2018-11-14 16:04:41,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #63#return; {213#true} is VALID [2018-11-14 16:04:41,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {213#true} call #t~ret5 := main(); {213#true} is VALID [2018-11-14 16:04:41,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {213#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {213#true} is VALID [2018-11-14 16:04:41,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {213#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {236#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:41,734 INFO L273 TraceCheckUtils]: 7: Hoare triple {236#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {236#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:41,736 INFO L273 TraceCheckUtils]: 8: Hoare triple {236#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {214#false} is VALID [2018-11-14 16:04:41,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {214#false} ~i~0 := 0bv32; {214#false} is VALID [2018-11-14 16:04:41,736 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#false} assume true; {214#false} is VALID [2018-11-14 16:04:41,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {214#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {214#false} is VALID [2018-11-14 16:04:41,737 INFO L256 TraceCheckUtils]: 12: Hoare triple {214#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {214#false} is VALID [2018-11-14 16:04:41,737 INFO L273 TraceCheckUtils]: 13: Hoare triple {214#false} ~cond := #in~cond; {214#false} is VALID [2018-11-14 16:04:41,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {214#false} assume ~cond == 0bv32; {214#false} is VALID [2018-11-14 16:04:41,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {214#false} assume !false; {214#false} is VALID [2018-11-14 16:04:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:04:41,742 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:04:41,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:04:41,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:04:41,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 16:04:41,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:41,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:04:41,791 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 16:04:41,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:04:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:04:41,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:04:41,792 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2018-11-14 16:04:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:42,332 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-14 16:04:42,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:04:42,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 16:04:42,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:04:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-14 16:04:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:04:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2018-11-14 16:04:42,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 49 transitions. [2018-11-14 16:04:42,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:42,495 INFO L225 Difference]: With dead ends: 43 [2018-11-14 16:04:42,495 INFO L226 Difference]: Without dead ends: 27 [2018-11-14 16:04:42,496 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:04:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-14 16:04:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-14 16:04:42,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:42,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2018-11-14 16:04:42,518 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2018-11-14 16:04:42,519 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2018-11-14 16:04:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:42,521 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-14 16:04:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 16:04:42,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:42,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:42,522 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2018-11-14 16:04:42,522 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2018-11-14 16:04:42,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:42,525 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-14 16:04:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 16:04:42,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:42,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:42,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:42,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 16:04:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-14 16:04:42,529 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 16 [2018-11-14 16:04:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:42,529 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-14 16:04:42,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:04:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-14 16:04:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:04:42,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:42,531 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 16:04:42,531 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:42,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:42,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1739329064, now seen corresponding path program 1 times [2018-11-14 16:04:42,532 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:42,532 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 16:04:42,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:04:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:42,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:42,763 INFO L256 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {408#true} is VALID [2018-11-14 16:04:42,763 INFO L273 TraceCheckUtils]: 1: Hoare triple {408#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {408#true} is VALID [2018-11-14 16:04:42,763 INFO L273 TraceCheckUtils]: 2: Hoare triple {408#true} assume true; {408#true} is VALID [2018-11-14 16:04:42,764 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {408#true} {408#true} #63#return; {408#true} is VALID [2018-11-14 16:04:42,764 INFO L256 TraceCheckUtils]: 4: Hoare triple {408#true} call #t~ret5 := main(); {408#true} is VALID [2018-11-14 16:04:42,765 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {408#true} is VALID [2018-11-14 16:04:42,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {408#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:42,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:42,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:42,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:42,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {431#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {444#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:42,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {444#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {444#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:42,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {444#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {409#false} is VALID [2018-11-14 16:04:42,840 INFO L273 TraceCheckUtils]: 13: Hoare triple {409#false} ~i~0 := 0bv32; {409#false} is VALID [2018-11-14 16:04:42,841 INFO L273 TraceCheckUtils]: 14: Hoare triple {409#false} assume true; {409#false} is VALID [2018-11-14 16:04:42,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {409#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {409#false} is VALID [2018-11-14 16:04:42,841 INFO L256 TraceCheckUtils]: 16: Hoare triple {409#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {409#false} is VALID [2018-11-14 16:04:42,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {409#false} ~cond := #in~cond; {409#false} is VALID [2018-11-14 16:04:42,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {409#false} assume ~cond == 0bv32; {409#false} is VALID [2018-11-14 16:04:42,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {409#false} assume !false; {409#false} is VALID [2018-11-14 16:04:42,844 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 16:04:42,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:04:42,978 INFO L273 TraceCheckUtils]: 19: Hoare triple {409#false} assume !false; {409#false} is VALID [2018-11-14 16:04:42,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {409#false} assume ~cond == 0bv32; {409#false} is VALID [2018-11-14 16:04:42,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {409#false} ~cond := #in~cond; {409#false} is VALID [2018-11-14 16:04:42,979 INFO L256 TraceCheckUtils]: 16: Hoare triple {409#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {409#false} is VALID [2018-11-14 16:04:42,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {409#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {409#false} is VALID [2018-11-14 16:04:42,979 INFO L273 TraceCheckUtils]: 14: Hoare triple {409#false} assume true; {409#false} is VALID [2018-11-14 16:04:42,979 INFO L273 TraceCheckUtils]: 13: Hoare triple {409#false} ~i~0 := 0bv32; {409#false} is VALID [2018-11-14 16:04:42,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {493#(bvslt main_~i~0 ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {409#false} is VALID [2018-11-14 16:04:42,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {493#(bvslt main_~i~0 ~SIZE~0)} assume true; {493#(bvslt main_~i~0 ~SIZE~0)} is VALID [2018-11-14 16:04:42,983 INFO L273 TraceCheckUtils]: 10: Hoare triple {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {493#(bvslt main_~i~0 ~SIZE~0)} is VALID [2018-11-14 16:04:42,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-14 16:04:42,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-14 16:04:42,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume true; {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-14 16:04:42,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {408#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {500#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-14 16:04:42,993 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {408#true} is VALID [2018-11-14 16:04:42,993 INFO L256 TraceCheckUtils]: 4: Hoare triple {408#true} call #t~ret5 := main(); {408#true} is VALID [2018-11-14 16:04:42,993 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {408#true} {408#true} #63#return; {408#true} is VALID [2018-11-14 16:04:42,994 INFO L273 TraceCheckUtils]: 2: Hoare triple {408#true} assume true; {408#true} is VALID [2018-11-14 16:04:42,994 INFO L273 TraceCheckUtils]: 1: Hoare triple {408#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {408#true} is VALID [2018-11-14 16:04:42,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {408#true} is VALID [2018-11-14 16:04:42,995 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 16:04:42,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:04:42,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 16:04:43,000 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 16:04:43,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:43,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:04:43,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:43,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:04:43,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:04:43,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:04:43,071 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 6 states. [2018-11-14 16:04:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:43,531 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-14 16:04:43,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:04:43,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 16:04:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:04:43,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 16:04:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:04:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2018-11-14 16:04:43,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2018-11-14 16:04:43,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:43,638 INFO L225 Difference]: With dead ends: 47 [2018-11-14 16:04:43,638 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 16:04:43,639 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:04:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 16:04:43,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-14 16:04:43,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:43,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-14 16:04:43,654 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-14 16:04:43,654 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-14 16:04:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:43,657 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-14 16:04:43,657 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-14 16:04:43,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:43,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:43,658 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-14 16:04:43,658 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-14 16:04:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:43,661 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-14 16:04:43,661 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-14 16:04:43,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:43,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:43,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:43,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:43,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 16:04:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-11-14 16:04:43,665 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 20 [2018-11-14 16:04:43,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:43,665 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-11-14 16:04:43,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:04:43,665 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-11-14 16:04:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 16:04:43,666 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:43,666 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:43,667 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:43,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1429379969, now seen corresponding path program 2 times [2018-11-14 16:04:43,668 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:43,668 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 16:04:43,684 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:04:43,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:04:43,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:04:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:43,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:43,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-14 16:04:43,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-14 16:04:43,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:04:43,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:43,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:43,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-14 16:04:44,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-14 16:04:44,183 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:04:44,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-14 16:04:44,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:04:44,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:44,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:44,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-14 16:04:44,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-14 16:04:44,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-14 16:04:44,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:04:44,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:44,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:44,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2018-11-14 16:04:44,413 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:04:44,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {696#true} call ULTIMATE.init(); {696#true} is VALID [2018-11-14 16:04:44,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {696#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {696#true} is VALID [2018-11-14 16:04:44,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-14 16:04:44,490 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {696#true} {696#true} #63#return; {696#true} is VALID [2018-11-14 16:04:44,490 INFO L256 TraceCheckUtils]: 4: Hoare triple {696#true} call #t~ret5 := main(); {696#true} is VALID [2018-11-14 16:04:44,491 INFO L273 TraceCheckUtils]: 5: Hoare triple {696#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {696#true} is VALID [2018-11-14 16:04:44,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:44,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:44,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:44,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {719#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {729#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:44,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {729#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= main_~i~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:44,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:44,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:44,528 INFO L273 TraceCheckUtils]: 13: Hoare triple {733#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:04:44,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:04:44,557 INFO L273 TraceCheckUtils]: 15: Hoare triple {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} assume true; {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:04:44,566 INFO L273 TraceCheckUtils]: 16: Hoare triple {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-14 16:04:44,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {743#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {756#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:44,592 INFO L273 TraceCheckUtils]: 18: Hoare triple {756#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {756#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:44,605 INFO L273 TraceCheckUtils]: 19: Hoare triple {756#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {763#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-14 16:04:44,617 INFO L256 TraceCheckUtils]: 20: Hoare triple {763#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {767#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:44,631 INFO L273 TraceCheckUtils]: 21: Hoare triple {767#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {771#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:44,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {771#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {697#false} is VALID [2018-11-14 16:04:44,641 INFO L273 TraceCheckUtils]: 23: Hoare triple {697#false} assume !false; {697#false} is VALID [2018-11-14 16:04:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:04:44,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:04:44,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-14 16:04:44,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-14 16:04:45,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-14 16:04:45,046 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:04:45,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:45,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:45,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:45,071 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2018-11-14 16:04:45,076 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:04:45,138 INFO L273 TraceCheckUtils]: 23: Hoare triple {697#false} assume !false; {697#false} is VALID [2018-11-14 16:04:45,139 INFO L273 TraceCheckUtils]: 22: Hoare triple {781#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {697#false} is VALID [2018-11-14 16:04:45,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {785#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {781#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:04:45,141 INFO L256 TraceCheckUtils]: 20: Hoare triple {763#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {785#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:04:45,142 INFO L273 TraceCheckUtils]: 19: Hoare triple {792#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {763#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-14 16:04:45,143 INFO L273 TraceCheckUtils]: 18: Hoare triple {792#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume true; {792#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-14 16:04:45,145 INFO L273 TraceCheckUtils]: 17: Hoare triple {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} ~i~0 := 0bv32; {792#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-14 16:04:45,145 INFO L273 TraceCheckUtils]: 16: Hoare triple {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-14 16:04:45,146 INFO L273 TraceCheckUtils]: 15: Hoare triple {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} assume true; {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-14 16:04:45,147 INFO L273 TraceCheckUtils]: 14: Hoare triple {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-14 16:04:45,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {799#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-14 16:04:45,156 INFO L273 TraceCheckUtils]: 12: Hoare triple {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} assume !!~bvslt32(~i~0, ~SIZE~0); {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} is VALID [2018-11-14 16:04:45,156 INFO L273 TraceCheckUtils]: 11: Hoare triple {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} assume true; {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} is VALID [2018-11-14 16:04:45,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {822#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) |main_~#a~0.offset|))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {812#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)) (_ bv0 32)) |main_~#a~0.offset|))} is VALID [2018-11-14 16:04:45,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {822#(= (_ bv0 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)) |main_~#a~0.offset|))} is VALID [2018-11-14 16:04:45,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:45,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} assume true; {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:45,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {826#(or (= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0)) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:45,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {696#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {696#true} is VALID [2018-11-14 16:04:45,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {696#true} call #t~ret5 := main(); {696#true} is VALID [2018-11-14 16:04:45,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {696#true} {696#true} #63#return; {696#true} is VALID [2018-11-14 16:04:45,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-14 16:04:45,165 INFO L273 TraceCheckUtils]: 1: Hoare triple {696#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {696#true} is VALID [2018-11-14 16:04:45,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {696#true} call ULTIMATE.init(); {696#true} is VALID [2018-11-14 16:04:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:04:45,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:04:45,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-14 16:04:45,170 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-14 16:04:45,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:45,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 16:04:45,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:45,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 16:04:45,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 16:04:45,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-11-14 16:04:45,305 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 17 states. [2018-11-14 16:04:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:47,181 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2018-11-14 16:04:47,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:04:47,181 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-11-14 16:04:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:04:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2018-11-14 16:04:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 16:04:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 71 transitions. [2018-11-14 16:04:47,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 71 transitions. [2018-11-14 16:04:47,458 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:47,462 INFO L225 Difference]: With dead ends: 64 [2018-11-14 16:04:47,462 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 16:04:47,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:04:47,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 16:04:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 47. [2018-11-14 16:04:47,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:47,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 47 states. [2018-11-14 16:04:47,526 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 47 states. [2018-11-14 16:04:47,527 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 47 states. [2018-11-14 16:04:47,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:47,533 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-14 16:04:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-14 16:04:47,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:47,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:47,534 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 62 states. [2018-11-14 16:04:47,534 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 62 states. [2018-11-14 16:04:47,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:47,539 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-14 16:04:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-14 16:04:47,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:47,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:47,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:47,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-14 16:04:47,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-14 16:04:47,543 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 24 [2018-11-14 16:04:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:47,544 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-14 16:04:47,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 16:04:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-14 16:04:47,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 16:04:47,545 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:47,545 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:47,545 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:47,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:47,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1379438888, now seen corresponding path program 1 times [2018-11-14 16:04:47,546 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:47,546 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 16:04:47,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:04:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:47,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:47,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {1139#true} call ULTIMATE.init(); {1139#true} is VALID [2018-11-14 16:04:47,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {1139#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1139#true} is VALID [2018-11-14 16:04:47,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {1139#true} assume true; {1139#true} is VALID [2018-11-14 16:04:47,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1139#true} {1139#true} #63#return; {1139#true} is VALID [2018-11-14 16:04:47,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {1139#true} call #t~ret5 := main(); {1139#true} is VALID [2018-11-14 16:04:47,704 INFO L273 TraceCheckUtils]: 5: Hoare triple {1139#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1139#true} is VALID [2018-11-14 16:04:47,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {1139#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {1162#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:47,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {1162#(= main_~i~0 (_ bv0 32))} assume true; {1162#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:47,726 INFO L273 TraceCheckUtils]: 8: Hoare triple {1162#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {1162#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:47,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {1162#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1162#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:47,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {1162#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:47,730 INFO L273 TraceCheckUtils]: 11: Hoare triple {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:47,730 INFO L273 TraceCheckUtils]: 12: Hoare triple {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:47,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:47,731 INFO L273 TraceCheckUtils]: 14: Hoare triple {1175#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1188#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:04:47,732 INFO L273 TraceCheckUtils]: 15: Hoare triple {1188#(= (_ bv2 32) main_~i~0)} assume true; {1188#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:04:47,732 INFO L273 TraceCheckUtils]: 16: Hoare triple {1188#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {1188#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:04:47,733 INFO L273 TraceCheckUtils]: 17: Hoare triple {1188#(= (_ bv2 32) main_~i~0)} assume ~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1140#false} is VALID [2018-11-14 16:04:47,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {1140#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1140#false} is VALID [2018-11-14 16:04:47,733 INFO L273 TraceCheckUtils]: 19: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-14 16:04:47,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {1140#false} assume !~bvslt32(~i~0, ~SIZE~0); {1140#false} is VALID [2018-11-14 16:04:47,734 INFO L273 TraceCheckUtils]: 21: Hoare triple {1140#false} ~i~0 := 0bv32; {1140#false} is VALID [2018-11-14 16:04:47,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-14 16:04:47,735 INFO L273 TraceCheckUtils]: 23: Hoare triple {1140#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1140#false} is VALID [2018-11-14 16:04:47,735 INFO L256 TraceCheckUtils]: 24: Hoare triple {1140#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {1140#false} is VALID [2018-11-14 16:04:47,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {1140#false} ~cond := #in~cond; {1140#false} is VALID [2018-11-14 16:04:47,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {1140#false} assume ~cond == 0bv32; {1140#false} is VALID [2018-11-14 16:04:47,736 INFO L273 TraceCheckUtils]: 27: Hoare triple {1140#false} assume !false; {1140#false} is VALID [2018-11-14 16:04:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:04:47,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:04:47,830 INFO L273 TraceCheckUtils]: 27: Hoare triple {1140#false} assume !false; {1140#false} is VALID [2018-11-14 16:04:47,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {1140#false} assume ~cond == 0bv32; {1140#false} is VALID [2018-11-14 16:04:47,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {1140#false} ~cond := #in~cond; {1140#false} is VALID [2018-11-14 16:04:47,832 INFO L256 TraceCheckUtils]: 24: Hoare triple {1140#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {1140#false} is VALID [2018-11-14 16:04:47,832 INFO L273 TraceCheckUtils]: 23: Hoare triple {1140#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1140#false} is VALID [2018-11-14 16:04:47,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-14 16:04:47,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {1140#false} ~i~0 := 0bv32; {1140#false} is VALID [2018-11-14 16:04:47,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {1140#false} assume !~bvslt32(~i~0, ~SIZE~0); {1140#false} is VALID [2018-11-14 16:04:47,833 INFO L273 TraceCheckUtils]: 19: Hoare triple {1140#false} assume true; {1140#false} is VALID [2018-11-14 16:04:47,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {1140#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1140#false} is VALID [2018-11-14 16:04:47,834 INFO L273 TraceCheckUtils]: 17: Hoare triple {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume ~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1140#false} is VALID [2018-11-14 16:04:47,835 INFO L273 TraceCheckUtils]: 16: Hoare triple {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,835 INFO L273 TraceCheckUtils]: 15: Hoare triple {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume true; {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1258#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,837 INFO L273 TraceCheckUtils]: 11: Hoare triple {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1268#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,843 INFO L273 TraceCheckUtils]: 7: Hoare triple {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {1139#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {1281#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:47,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {1139#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1139#true} is VALID [2018-11-14 16:04:47,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {1139#true} call #t~ret5 := main(); {1139#true} is VALID [2018-11-14 16:04:47,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1139#true} {1139#true} #63#return; {1139#true} is VALID [2018-11-14 16:04:47,845 INFO L273 TraceCheckUtils]: 2: Hoare triple {1139#true} assume true; {1139#true} is VALID [2018-11-14 16:04:47,845 INFO L273 TraceCheckUtils]: 1: Hoare triple {1139#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1139#true} is VALID [2018-11-14 16:04:47,846 INFO L256 TraceCheckUtils]: 0: Hoare triple {1139#true} call ULTIMATE.init(); {1139#true} is VALID [2018-11-14 16:04:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 16:04:47,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:04:47,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 16:04:47,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-14 16:04:47,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:47,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:04:47,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:47,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:04:47,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:04:47,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:04:47,919 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 8 states. [2018-11-14 16:04:49,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:49,192 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2018-11-14 16:04:49,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:04:49,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-14 16:04:49,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:04:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2018-11-14 16:04:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:04:49,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 115 transitions. [2018-11-14 16:04:49,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 115 transitions. [2018-11-14 16:04:49,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:49,480 INFO L225 Difference]: With dead ends: 114 [2018-11-14 16:04:49,480 INFO L226 Difference]: Without dead ends: 98 [2018-11-14 16:04:49,481 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:04:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-14 16:04:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 63. [2018-11-14 16:04:49,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:49,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 63 states. [2018-11-14 16:04:49,571 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 63 states. [2018-11-14 16:04:49,571 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 63 states. [2018-11-14 16:04:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:49,578 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2018-11-14 16:04:49,578 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2018-11-14 16:04:49,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:49,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:49,580 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 98 states. [2018-11-14 16:04:49,580 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 98 states. [2018-11-14 16:04:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:49,586 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2018-11-14 16:04:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 113 transitions. [2018-11-14 16:04:49,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:49,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:49,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:49,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 16:04:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2018-11-14 16:04:49,592 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 28 [2018-11-14 16:04:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:49,592 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2018-11-14 16:04:49,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:04:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2018-11-14 16:04:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 16:04:49,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:49,594 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:49,594 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:49,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:49,595 INFO L82 PathProgramCache]: Analyzing trace with hash 526094817, now seen corresponding path program 1 times [2018-11-14 16:04:49,595 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:49,595 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 16:04:49,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:04:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:49,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:50,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {1747#true} call ULTIMATE.init(); {1747#true} is VALID [2018-11-14 16:04:50,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {1747#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1747#true} is VALID [2018-11-14 16:04:50,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {1747#true} assume true; {1747#true} is VALID [2018-11-14 16:04:50,081 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1747#true} {1747#true} #63#return; {1747#true} is VALID [2018-11-14 16:04:50,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {1747#true} call #t~ret5 := main(); {1747#true} is VALID [2018-11-14 16:04:50,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {1747#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1747#true} is VALID [2018-11-14 16:04:50,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {1747#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,126 INFO L273 TraceCheckUtils]: 9: Hoare triple {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {1770#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:50,130 INFO L273 TraceCheckUtils]: 11: Hoare triple {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:50,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:50,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:50,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {1783#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1796#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:04:50,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {1796#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume true; {1796#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:04:50,133 INFO L273 TraceCheckUtils]: 16: Hoare triple {1796#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~i~0, ~SIZE~0); {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,134 INFO L273 TraceCheckUtils]: 17: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~i~0 := 0bv32; {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,134 INFO L273 TraceCheckUtils]: 18: Hoare triple {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,135 INFO L273 TraceCheckUtils]: 19: Hoare triple {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,137 INFO L256 TraceCheckUtils]: 20: Hoare triple {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,137 INFO L273 TraceCheckUtils]: 21: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,138 INFO L273 TraceCheckUtils]: 22: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(~cond == 0bv32); {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,139 INFO L273 TraceCheckUtils]: 23: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,140 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #67#return; {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,141 INFO L273 TraceCheckUtils]: 25: Hoare triple {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} havoc #t~mem4; {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {1807#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:50,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:50,150 INFO L273 TraceCheckUtils]: 28: Hoare triple {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:50,151 INFO L256 TraceCheckUtils]: 29: Hoare triple {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(~cond == 0bv32); {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,153 INFO L273 TraceCheckUtils]: 32: Hoare triple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:04:50,153 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1803#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:50,154 INFO L273 TraceCheckUtils]: 34: Hoare triple {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:50,155 INFO L273 TraceCheckUtils]: 35: Hoare triple {1835#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1863#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:04:50,155 INFO L273 TraceCheckUtils]: 36: Hoare triple {1863#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume true; {1863#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:04:50,156 INFO L273 TraceCheckUtils]: 37: Hoare triple {1863#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1748#false} is VALID [2018-11-14 16:04:50,157 INFO L256 TraceCheckUtils]: 38: Hoare triple {1748#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {1748#false} is VALID [2018-11-14 16:04:50,157 INFO L273 TraceCheckUtils]: 39: Hoare triple {1748#false} ~cond := #in~cond; {1748#false} is VALID [2018-11-14 16:04:50,157 INFO L273 TraceCheckUtils]: 40: Hoare triple {1748#false} assume ~cond == 0bv32; {1748#false} is VALID [2018-11-14 16:04:50,157 INFO L273 TraceCheckUtils]: 41: Hoare triple {1748#false} assume !false; {1748#false} is VALID [2018-11-14 16:04:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:04:50,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:04:50,462 INFO L273 TraceCheckUtils]: 41: Hoare triple {1748#false} assume !false; {1748#false} is VALID [2018-11-14 16:04:50,463 INFO L273 TraceCheckUtils]: 40: Hoare triple {1748#false} assume ~cond == 0bv32; {1748#false} is VALID [2018-11-14 16:04:50,463 INFO L273 TraceCheckUtils]: 39: Hoare triple {1748#false} ~cond := #in~cond; {1748#false} is VALID [2018-11-14 16:04:50,463 INFO L256 TraceCheckUtils]: 38: Hoare triple {1748#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {1748#false} is VALID [2018-11-14 16:04:50,464 INFO L273 TraceCheckUtils]: 37: Hoare triple {1894#(not (bvslt main_~i~0 ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1748#false} is VALID [2018-11-14 16:04:50,465 INFO L273 TraceCheckUtils]: 36: Hoare triple {1894#(not (bvslt main_~i~0 ~SIZE~0))} assume true; {1894#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-14 16:04:50,466 INFO L273 TraceCheckUtils]: 35: Hoare triple {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1894#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-14 16:04:50,466 INFO L273 TraceCheckUtils]: 34: Hoare triple {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} havoc #t~mem4; {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,467 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1747#true} {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #67#return; {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,468 INFO L273 TraceCheckUtils]: 32: Hoare triple {1747#true} assume true; {1747#true} is VALID [2018-11-14 16:04:50,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {1747#true} assume !(~cond == 0bv32); {1747#true} is VALID [2018-11-14 16:04:50,468 INFO L273 TraceCheckUtils]: 30: Hoare triple {1747#true} ~cond := #in~cond; {1747#true} is VALID [2018-11-14 16:04:50,469 INFO L256 TraceCheckUtils]: 29: Hoare triple {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {1747#true} is VALID [2018-11-14 16:04:50,470 INFO L273 TraceCheckUtils]: 28: Hoare triple {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,470 INFO L273 TraceCheckUtils]: 27: Hoare triple {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,496 INFO L273 TraceCheckUtils]: 26: Hoare triple {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1901#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,496 INFO L273 TraceCheckUtils]: 25: Hoare triple {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} havoc #t~mem4; {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,497 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1747#true} {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #67#return; {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,497 INFO L273 TraceCheckUtils]: 23: Hoare triple {1747#true} assume true; {1747#true} is VALID [2018-11-14 16:04:50,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {1747#true} assume !(~cond == 0bv32); {1747#true} is VALID [2018-11-14 16:04:50,498 INFO L273 TraceCheckUtils]: 21: Hoare triple {1747#true} ~cond := #in~cond; {1747#true} is VALID [2018-11-14 16:04:50,498 INFO L256 TraceCheckUtils]: 20: Hoare triple {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {1747#true} is VALID [2018-11-14 16:04:50,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume true; {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {1957#(not (bvslt (_ bv2 32) ~SIZE~0))} ~i~0 := 0bv32; {1929#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {1961#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} assume !~bvslt32(~i~0, ~SIZE~0); {1957#(not (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-14 16:04:50,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {1961#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} assume true; {1961#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-14 16:04:50,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1961#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-14 16:04:50,504 INFO L273 TraceCheckUtils]: 13: Hoare triple {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,505 INFO L273 TraceCheckUtils]: 12: Hoare triple {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1968#(or (not (bvslt (_ bv2 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:04:50,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-14 16:04:50,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume !!~bvslt32(~i~0, ~SIZE~0); {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-14 16:04:50,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} assume true; {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-14 16:04:50,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {1747#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {1981#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (not (bvslt (_ bv2 32) ~SIZE~0)))} is VALID [2018-11-14 16:04:50,534 INFO L273 TraceCheckUtils]: 5: Hoare triple {1747#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1747#true} is VALID [2018-11-14 16:04:50,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {1747#true} call #t~ret5 := main(); {1747#true} is VALID [2018-11-14 16:04:50,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1747#true} {1747#true} #63#return; {1747#true} is VALID [2018-11-14 16:04:50,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {1747#true} assume true; {1747#true} is VALID [2018-11-14 16:04:50,535 INFO L273 TraceCheckUtils]: 1: Hoare triple {1747#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1747#true} is VALID [2018-11-14 16:04:50,535 INFO L256 TraceCheckUtils]: 0: Hoare triple {1747#true} call ULTIMATE.init(); {1747#true} is VALID [2018-11-14 16:04:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:04:50,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:04:50,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 16:04:50,548 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-14 16:04:50,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:50,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:04:50,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:50,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:04:50,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:04:50,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:04:50,718 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand 16 states. [2018-11-14 16:04:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:52,357 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2018-11-14 16:04:52,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:04:52,357 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-14 16:04:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:04:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-14 16:04:52,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:04:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 81 transitions. [2018-11-14 16:04:52,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 81 transitions. [2018-11-14 16:04:52,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:52,561 INFO L225 Difference]: With dead ends: 103 [2018-11-14 16:04:52,561 INFO L226 Difference]: Without dead ends: 75 [2018-11-14 16:04:52,562 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-11-14 16:04:52,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-14 16:04:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2018-11-14 16:04:52,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:52,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 63 states. [2018-11-14 16:04:52,637 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 63 states. [2018-11-14 16:04:52,637 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 63 states. [2018-11-14 16:04:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:52,641 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-14 16:04:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-14 16:04:52,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:52,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:52,642 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 75 states. [2018-11-14 16:04:52,642 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 75 states. [2018-11-14 16:04:52,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:52,646 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2018-11-14 16:04:52,646 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2018-11-14 16:04:52,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:52,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:52,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:52,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:52,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 16:04:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2018-11-14 16:04:52,650 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 42 [2018-11-14 16:04:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:52,650 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2018-11-14 16:04:52,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:04:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2018-11-14 16:04:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 16:04:52,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:52,651 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:52,652 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:52,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:52,652 INFO L82 PathProgramCache]: Analyzing trace with hash 665453884, now seen corresponding path program 2 times [2018-11-14 16:04:52,653 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:52,653 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 16:04:52,676 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:04:52,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:04:52,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:04:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:52,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:52,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2388#true} is VALID [2018-11-14 16:04:52,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {2388#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2388#true} is VALID [2018-11-14 16:04:52,892 INFO L273 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 16:04:52,892 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #63#return; {2388#true} is VALID [2018-11-14 16:04:52,892 INFO L256 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret5 := main(); {2388#true} is VALID [2018-11-14 16:04:52,892 INFO L273 TraceCheckUtils]: 5: Hoare triple {2388#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2388#true} is VALID [2018-11-14 16:04:52,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {2388#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {2411#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:52,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {2411#(= main_~i~0 (_ bv0 32))} assume true; {2411#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:52,893 INFO L273 TraceCheckUtils]: 8: Hoare triple {2411#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {2411#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:52,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {2411#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2411#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:52,894 INFO L273 TraceCheckUtils]: 10: Hoare triple {2411#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,895 INFO L273 TraceCheckUtils]: 12: Hoare triple {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,896 INFO L273 TraceCheckUtils]: 13: Hoare triple {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {2424#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2437#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:04:52,897 INFO L273 TraceCheckUtils]: 15: Hoare triple {2437#(= (_ bv2 32) main_~i~0)} assume true; {2437#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:04:52,897 INFO L273 TraceCheckUtils]: 16: Hoare triple {2437#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {2437#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:04:52,898 INFO L273 TraceCheckUtils]: 17: Hoare triple {2437#(= (_ bv2 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2437#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:04:52,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {2437#(= (_ bv2 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,899 INFO L273 TraceCheckUtils]: 19: Hoare triple {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,900 INFO L273 TraceCheckUtils]: 20: Hoare triple {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,909 INFO L273 TraceCheckUtils]: 21: Hoare triple {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,909 INFO L273 TraceCheckUtils]: 22: Hoare triple {2450#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2463#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:04:52,910 INFO L273 TraceCheckUtils]: 23: Hoare triple {2463#(= (_ bv4 32) main_~i~0)} assume true; {2463#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:04:52,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {2463#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {2463#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:04:52,910 INFO L273 TraceCheckUtils]: 25: Hoare triple {2463#(= (_ bv4 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2463#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:04:52,911 INFO L273 TraceCheckUtils]: 26: Hoare triple {2463#(= (_ bv4 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,911 INFO L273 TraceCheckUtils]: 27: Hoare triple {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,912 INFO L273 TraceCheckUtils]: 28: Hoare triple {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,912 INFO L273 TraceCheckUtils]: 29: Hoare triple {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:52,912 INFO L273 TraceCheckUtils]: 30: Hoare triple {2476#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2489#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:04:52,913 INFO L273 TraceCheckUtils]: 31: Hoare triple {2489#(= (_ bv6 32) main_~i~0)} assume true; {2489#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:04:52,913 INFO L273 TraceCheckUtils]: 32: Hoare triple {2489#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {2489#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:04:52,914 INFO L273 TraceCheckUtils]: 33: Hoare triple {2489#(= (_ bv6 32) main_~i~0)} assume ~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2389#false} is VALID [2018-11-14 16:04:52,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {2389#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2389#false} is VALID [2018-11-14 16:04:52,914 INFO L273 TraceCheckUtils]: 35: Hoare triple {2389#false} assume true; {2389#false} is VALID [2018-11-14 16:04:52,915 INFO L273 TraceCheckUtils]: 36: Hoare triple {2389#false} assume !~bvslt32(~i~0, ~SIZE~0); {2389#false} is VALID [2018-11-14 16:04:52,915 INFO L273 TraceCheckUtils]: 37: Hoare triple {2389#false} ~i~0 := 0bv32; {2389#false} is VALID [2018-11-14 16:04:52,915 INFO L273 TraceCheckUtils]: 38: Hoare triple {2389#false} assume true; {2389#false} is VALID [2018-11-14 16:04:52,916 INFO L273 TraceCheckUtils]: 39: Hoare triple {2389#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2389#false} is VALID [2018-11-14 16:04:52,916 INFO L256 TraceCheckUtils]: 40: Hoare triple {2389#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {2389#false} is VALID [2018-11-14 16:04:52,916 INFO L273 TraceCheckUtils]: 41: Hoare triple {2389#false} ~cond := #in~cond; {2389#false} is VALID [2018-11-14 16:04:52,916 INFO L273 TraceCheckUtils]: 42: Hoare triple {2389#false} assume ~cond == 0bv32; {2389#false} is VALID [2018-11-14 16:04:52,917 INFO L273 TraceCheckUtils]: 43: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2018-11-14 16:04:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:04:52,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:04:53,258 INFO L273 TraceCheckUtils]: 43: Hoare triple {2389#false} assume !false; {2389#false} is VALID [2018-11-14 16:04:53,259 INFO L273 TraceCheckUtils]: 42: Hoare triple {2389#false} assume ~cond == 0bv32; {2389#false} is VALID [2018-11-14 16:04:53,259 INFO L273 TraceCheckUtils]: 41: Hoare triple {2389#false} ~cond := #in~cond; {2389#false} is VALID [2018-11-14 16:04:53,259 INFO L256 TraceCheckUtils]: 40: Hoare triple {2389#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {2389#false} is VALID [2018-11-14 16:04:53,259 INFO L273 TraceCheckUtils]: 39: Hoare triple {2389#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2389#false} is VALID [2018-11-14 16:04:53,260 INFO L273 TraceCheckUtils]: 38: Hoare triple {2389#false} assume true; {2389#false} is VALID [2018-11-14 16:04:53,260 INFO L273 TraceCheckUtils]: 37: Hoare triple {2389#false} ~i~0 := 0bv32; {2389#false} is VALID [2018-11-14 16:04:53,260 INFO L273 TraceCheckUtils]: 36: Hoare triple {2389#false} assume !~bvslt32(~i~0, ~SIZE~0); {2389#false} is VALID [2018-11-14 16:04:53,261 INFO L273 TraceCheckUtils]: 35: Hoare triple {2389#false} assume true; {2389#false} is VALID [2018-11-14 16:04:53,261 INFO L273 TraceCheckUtils]: 34: Hoare triple {2389#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2389#false} is VALID [2018-11-14 16:04:53,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume ~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2389#false} is VALID [2018-11-14 16:04:53,266 INFO L273 TraceCheckUtils]: 32: Hoare triple {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,266 INFO L273 TraceCheckUtils]: 31: Hoare triple {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} assume true; {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,267 INFO L273 TraceCheckUtils]: 30: Hoare triple {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2559#(not (bvsgt (bvashr main_~i~0 (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,267 INFO L273 TraceCheckUtils]: 29: Hoare triple {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,268 INFO L273 TraceCheckUtils]: 28: Hoare triple {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2569#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv1 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2582#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv2 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,285 INFO L273 TraceCheckUtils]: 21: Hoare triple {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,292 INFO L273 TraceCheckUtils]: 20: Hoare triple {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,293 INFO L273 TraceCheckUtils]: 19: Hoare triple {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2595#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv3 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,300 INFO L273 TraceCheckUtils]: 16: Hoare triple {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,300 INFO L273 TraceCheckUtils]: 15: Hoare triple {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,319 INFO L273 TraceCheckUtils]: 14: Hoare triple {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2608#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv4 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2621#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv5 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} assume true; {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {2388#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {2634#(not (bvsgt (bvashr (bvadd main_~i~0 (_ bv6 32)) (_ bv16 32)) (_ bv250 32)))} is VALID [2018-11-14 16:04:53,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {2388#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2388#true} is VALID [2018-11-14 16:04:53,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {2388#true} call #t~ret5 := main(); {2388#true} is VALID [2018-11-14 16:04:53,330 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2388#true} {2388#true} #63#return; {2388#true} is VALID [2018-11-14 16:04:53,330 INFO L273 TraceCheckUtils]: 2: Hoare triple {2388#true} assume true; {2388#true} is VALID [2018-11-14 16:04:53,330 INFO L273 TraceCheckUtils]: 1: Hoare triple {2388#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2388#true} is VALID [2018-11-14 16:04:53,330 INFO L256 TraceCheckUtils]: 0: Hoare triple {2388#true} call ULTIMATE.init(); {2388#true} is VALID [2018-11-14 16:04:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 20 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:04:53,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:04:53,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-14 16:04:53,335 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-14 16:04:53,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:04:53,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:04:53,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:53,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:04:53,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:04:53,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:04:53,470 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 16 states. [2018-11-14 16:04:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:57,237 INFO L93 Difference]: Finished difference Result 193 states and 233 transitions. [2018-11-14 16:04:57,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:04:57,237 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-14 16:04:57,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:04:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:04:57,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 213 transitions. [2018-11-14 16:04:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:04:57,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 213 transitions. [2018-11-14 16:04:57,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 213 transitions. [2018-11-14 16:04:57,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:04:57,643 INFO L225 Difference]: With dead ends: 193 [2018-11-14 16:04:57,643 INFO L226 Difference]: Without dead ends: 177 [2018-11-14 16:04:57,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2018-11-14 16:04:57,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-14 16:04:57,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 95. [2018-11-14 16:04:57,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:04:57,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 95 states. [2018-11-14 16:04:57,824 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 95 states. [2018-11-14 16:04:57,825 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 95 states. [2018-11-14 16:04:57,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:57,833 INFO L93 Difference]: Finished difference Result 177 states and 207 transitions. [2018-11-14 16:04:57,833 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 207 transitions. [2018-11-14 16:04:57,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:57,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:57,835 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 177 states. [2018-11-14 16:04:57,835 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 177 states. [2018-11-14 16:04:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:04:57,844 INFO L93 Difference]: Finished difference Result 177 states and 207 transitions. [2018-11-14 16:04:57,844 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 207 transitions. [2018-11-14 16:04:57,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:04:57,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:04:57,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:04:57,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:04:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 16:04:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2018-11-14 16:04:57,849 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 44 [2018-11-14 16:04:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:04:57,849 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2018-11-14 16:04:57,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:04:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2018-11-14 16:04:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 16:04:57,851 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:04:57,851 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:04:57,852 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:04:57,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:04:57,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1593268614, now seen corresponding path program 2 times [2018-11-14 16:04:57,852 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:04:57,852 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 16:04:57,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 16:04:57,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:04:57,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:04:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:04:57,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:04:58,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 16:04:58,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:04:58,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:04:58,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:58,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:58,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-14 16:04:58,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 16:04:58,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-14 16:04:58,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:04:58,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:58,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:04:58,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-14 16:04:58,330 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:04:58,387 INFO L256 TraceCheckUtils]: 0: Hoare triple {3409#true} call ULTIMATE.init(); {3409#true} is VALID [2018-11-14 16:04:58,387 INFO L273 TraceCheckUtils]: 1: Hoare triple {3409#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3409#true} is VALID [2018-11-14 16:04:58,388 INFO L273 TraceCheckUtils]: 2: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-14 16:04:58,388 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3409#true} {3409#true} #63#return; {3409#true} is VALID [2018-11-14 16:04:58,388 INFO L256 TraceCheckUtils]: 4: Hoare triple {3409#true} call #t~ret5 := main(); {3409#true} is VALID [2018-11-14 16:04:58,388 INFO L273 TraceCheckUtils]: 5: Hoare triple {3409#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3409#true} is VALID [2018-11-14 16:04:58,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {3409#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {3432#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:58,389 INFO L273 TraceCheckUtils]: 7: Hoare triple {3432#(= main_~i~0 (_ bv0 32))} assume true; {3432#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:58,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {3432#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {3432#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:58,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {3432#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3432#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:04:58,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {3432#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:58,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:58,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:58,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:58,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3458#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:04:58,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {3458#(= (_ bv2 32) main_~i~0)} assume true; {3458#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:04:58,392 INFO L273 TraceCheckUtils]: 16: Hoare triple {3458#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {3458#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:04:58,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {3458#(= (_ bv2 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-14 16:04:58,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-14 16:04:58,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} assume true; {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-14 16:04:58,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} assume !~bvslt32(~i~0, ~SIZE~0); {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-14 16:04:58,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} ~i~0 := 0bv32; {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:58,397 INFO L273 TraceCheckUtils]: 22: Hoare triple {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} assume true; {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:58,397 INFO L273 TraceCheckUtils]: 23: Hoare triple {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:58,399 INFO L256 TraceCheckUtils]: 24: Hoare triple {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-14 16:04:58,400 INFO L273 TraceCheckUtils]: 25: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} ~cond := #in~cond; {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-14 16:04:58,401 INFO L273 TraceCheckUtils]: 26: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} assume !(~cond == 0bv32); {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-14 16:04:58,401 INFO L273 TraceCheckUtils]: 27: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} assume true; {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-14 16:04:58,402 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} #67#return; {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:58,403 INFO L273 TraceCheckUtils]: 29: Hoare triple {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} havoc #t~mem4; {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:04:58,404 INFO L273 TraceCheckUtils]: 30: Hoare triple {3481#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:58,405 INFO L273 TraceCheckUtils]: 31: Hoare triple {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:58,406 INFO L273 TraceCheckUtils]: 32: Hoare triple {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:58,408 INFO L256 TraceCheckUtils]: 33: Hoare triple {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-14 16:04:58,412 INFO L273 TraceCheckUtils]: 34: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} ~cond := #in~cond; {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-14 16:04:58,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} assume !(~cond == 0bv32); {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-14 16:04:58,417 INFO L273 TraceCheckUtils]: 36: Hoare triple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} assume true; {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} is VALID [2018-11-14 16:04:58,421 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3491#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_1| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_1| (_ bv8 32)))))} {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:58,422 INFO L273 TraceCheckUtils]: 38: Hoare triple {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:04:58,422 INFO L273 TraceCheckUtils]: 39: Hoare triple {3510#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3538#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:04:58,423 INFO L273 TraceCheckUtils]: 40: Hoare triple {3538#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv2 32) main_~i~0))} assume true; {3538#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:04:58,424 INFO L273 TraceCheckUtils]: 41: Hoare triple {3538#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3545#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-14 16:04:58,426 INFO L256 TraceCheckUtils]: 42: Hoare triple {3545#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {3549#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:58,427 INFO L273 TraceCheckUtils]: 43: Hoare triple {3549#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3553#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:04:58,427 INFO L273 TraceCheckUtils]: 44: Hoare triple {3553#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {3410#false} is VALID [2018-11-14 16:04:58,427 INFO L273 TraceCheckUtils]: 45: Hoare triple {3410#false} assume !false; {3410#false} is VALID [2018-11-14 16:04:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:04:58,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:05:04,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-14 16:05:04,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-14 16:05:04,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:04,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:04,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:04,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:5 [2018-11-14 16:05:04,912 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:05,162 INFO L273 TraceCheckUtils]: 45: Hoare triple {3410#false} assume !false; {3410#false} is VALID [2018-11-14 16:05:05,163 INFO L273 TraceCheckUtils]: 44: Hoare triple {3563#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {3410#false} is VALID [2018-11-14 16:05:05,164 INFO L273 TraceCheckUtils]: 43: Hoare triple {3567#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3563#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:05:05,165 INFO L256 TraceCheckUtils]: 42: Hoare triple {3545#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {3567#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:05:05,166 INFO L273 TraceCheckUtils]: 41: Hoare triple {3574#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3545#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-14 16:05:05,166 INFO L273 TraceCheckUtils]: 40: Hoare triple {3574#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume true; {3574#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-14 16:05:05,356 INFO L273 TraceCheckUtils]: 39: Hoare triple {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3574#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-14 16:05:05,374 INFO L273 TraceCheckUtils]: 38: Hoare triple {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} havoc #t~mem4; {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:05,389 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {3409#true} {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} #67#return; {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:05,389 INFO L273 TraceCheckUtils]: 36: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-14 16:05:05,389 INFO L273 TraceCheckUtils]: 35: Hoare triple {3409#true} assume !(~cond == 0bv32); {3409#true} is VALID [2018-11-14 16:05:05,390 INFO L273 TraceCheckUtils]: 34: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-14 16:05:05,390 INFO L256 TraceCheckUtils]: 33: Hoare triple {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {3409#true} is VALID [2018-11-14 16:05:05,404 INFO L273 TraceCheckUtils]: 32: Hoare triple {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:05,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} assume true; {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:05,716 INFO L273 TraceCheckUtils]: 30: Hoare triple {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3581#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:05,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} havoc #t~mem4; {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-14 16:05:05,718 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {3409#true} {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} #67#return; {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-14 16:05:05,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-14 16:05:05,718 INFO L273 TraceCheckUtils]: 26: Hoare triple {3409#true} assume !(~cond == 0bv32); {3409#true} is VALID [2018-11-14 16:05:05,718 INFO L273 TraceCheckUtils]: 25: Hoare triple {3409#true} ~cond := #in~cond; {3409#true} is VALID [2018-11-14 16:05:05,718 INFO L256 TraceCheckUtils]: 24: Hoare triple {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {3409#true} is VALID [2018-11-14 16:05:05,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-14 16:05:05,719 INFO L273 TraceCheckUtils]: 22: Hoare triple {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} assume true; {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-14 16:05:05,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} ~i~0 := 0bv32; {3609#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-14 16:05:05,720 INFO L273 TraceCheckUtils]: 20: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} assume !~bvslt32(~i~0, ~SIZE~0); {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-14 16:05:05,720 INFO L273 TraceCheckUtils]: 19: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} assume true; {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-14 16:05:05,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-14 16:05:05,722 INFO L273 TraceCheckUtils]: 17: Hoare triple {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3468#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))} is VALID [2018-11-14 16:05:05,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3649#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3659#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,729 INFO L273 TraceCheckUtils]: 9: Hoare triple {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {3409#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {3672#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:05,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {3409#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3409#true} is VALID [2018-11-14 16:05:05,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {3409#true} call #t~ret5 := main(); {3409#true} is VALID [2018-11-14 16:05:05,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3409#true} {3409#true} #63#return; {3409#true} is VALID [2018-11-14 16:05:05,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {3409#true} assume true; {3409#true} is VALID [2018-11-14 16:05:05,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {3409#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3409#true} is VALID [2018-11-14 16:05:05,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {3409#true} call ULTIMATE.init(); {3409#true} is VALID [2018-11-14 16:05:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 16:05:05,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:05:05,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2018-11-14 16:05:05,739 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-11-14 16:05:05,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:05,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 16:05:06,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:05:06,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 16:05:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 16:05:06,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=357, Unknown=3, NotChecked=0, Total=420 [2018-11-14 16:05:06,694 INFO L87 Difference]: Start difference. First operand 95 states and 111 transitions. Second operand 21 states. [2018-11-14 16:05:39,900 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-14 16:05:41,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:41,968 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2018-11-14 16:05:41,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 16:05:41,968 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-11-14 16:05:41,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:05:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:05:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 97 transitions. [2018-11-14 16:05:41,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 16:05:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 97 transitions. [2018-11-14 16:05:41,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 97 transitions. [2018-11-14 16:05:42,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:05:42,164 INFO L225 Difference]: With dead ends: 135 [2018-11-14 16:05:42,164 INFO L226 Difference]: Without dead ends: 133 [2018-11-14 16:05:42,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=104, Invalid=647, Unknown=5, NotChecked=0, Total=756 [2018-11-14 16:05:42,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-14 16:05:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2018-11-14 16:05:42,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:05:42,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 104 states. [2018-11-14 16:05:42,409 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 104 states. [2018-11-14 16:05:42,409 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 104 states. [2018-11-14 16:05:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:42,417 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-11-14 16:05:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-11-14 16:05:42,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:42,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:42,418 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 133 states. [2018-11-14 16:05:42,418 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 133 states. [2018-11-14 16:05:42,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:42,423 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-11-14 16:05:42,423 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2018-11-14 16:05:42,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:42,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:42,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:05:42,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:05:42,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 16:05:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2018-11-14 16:05:42,428 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 46 [2018-11-14 16:05:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:05:42,428 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2018-11-14 16:05:42,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 16:05:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2018-11-14 16:05:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 16:05:42,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:42,430 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:05:42,430 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:42,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash 319969027, now seen corresponding path program 3 times [2018-11-14 16:05:42,430 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:42,431 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:05:42,460 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:05:42,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 16:05:42,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:05:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:42,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:43,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {4295#true} call ULTIMATE.init(); {4295#true} is VALID [2018-11-14 16:05:43,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {4295#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {4295#true} is VALID [2018-11-14 16:05:43,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {4295#true} assume true; {4295#true} is VALID [2018-11-14 16:05:43,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4295#true} {4295#true} #63#return; {4295#true} is VALID [2018-11-14 16:05:43,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {4295#true} call #t~ret5 := main(); {4295#true} is VALID [2018-11-14 16:05:43,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {4295#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4295#true} is VALID [2018-11-14 16:05:43,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {4295#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,111 INFO L273 TraceCheckUtils]: 10: Hoare triple {4318#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:43,111 INFO L273 TraceCheckUtils]: 11: Hoare triple {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:43,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0); {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:43,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:43,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {4331#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:43,114 INFO L273 TraceCheckUtils]: 15: Hoare triple {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume true; {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:43,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:43,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:43,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {4344#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4357#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,117 INFO L273 TraceCheckUtils]: 19: Hoare triple {4357#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4357#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,120 INFO L273 TraceCheckUtils]: 20: Hoare triple {4357#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,121 INFO L273 TraceCheckUtils]: 21: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~i~0 := 0bv32; {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,122 INFO L273 TraceCheckUtils]: 23: Hoare triple {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,122 INFO L256 TraceCheckUtils]: 24: Hoare triple {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,123 INFO L273 TraceCheckUtils]: 26: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(~cond == 0bv32); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,124 INFO L273 TraceCheckUtils]: 27: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,124 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #67#return; {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,125 INFO L273 TraceCheckUtils]: 29: Hoare triple {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} havoc #t~mem4; {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,125 INFO L273 TraceCheckUtils]: 30: Hoare triple {4368#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:43,126 INFO L273 TraceCheckUtils]: 31: Hoare triple {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:43,127 INFO L273 TraceCheckUtils]: 32: Hoare triple {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:43,128 INFO L256 TraceCheckUtils]: 33: Hoare triple {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,129 INFO L273 TraceCheckUtils]: 34: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(~cond == 0bv32); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,135 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:43,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:43,136 INFO L273 TraceCheckUtils]: 39: Hoare triple {4396#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:43,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume true; {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:43,137 INFO L273 TraceCheckUtils]: 41: Hoare triple {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:43,138 INFO L256 TraceCheckUtils]: 42: Hoare triple {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,139 INFO L273 TraceCheckUtils]: 43: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~cond := #in~cond; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !(~cond == 0bv32); {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,141 INFO L273 TraceCheckUtils]: 45: Hoare triple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,141 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4364#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} #67#return; {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:43,142 INFO L273 TraceCheckUtils]: 47: Hoare triple {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} havoc #t~mem4; {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:43,144 INFO L273 TraceCheckUtils]: 48: Hoare triple {4424#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4452#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,144 INFO L273 TraceCheckUtils]: 49: Hoare triple {4452#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume true; {4452#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-14 16:05:43,145 INFO L273 TraceCheckUtils]: 50: Hoare triple {4452#(and (not (bvslt (_ bv3 32) ~SIZE~0)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4296#false} is VALID [2018-11-14 16:05:43,146 INFO L256 TraceCheckUtils]: 51: Hoare triple {4296#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {4296#false} is VALID [2018-11-14 16:05:43,146 INFO L273 TraceCheckUtils]: 52: Hoare triple {4296#false} ~cond := #in~cond; {4296#false} is VALID [2018-11-14 16:05:43,146 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#false} assume ~cond == 0bv32; {4296#false} is VALID [2018-11-14 16:05:43,146 INFO L273 TraceCheckUtils]: 54: Hoare triple {4296#false} assume !false; {4296#false} is VALID [2018-11-14 16:05:43,156 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:05:43,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:05:43,684 INFO L273 TraceCheckUtils]: 54: Hoare triple {4296#false} assume !false; {4296#false} is VALID [2018-11-14 16:05:43,684 INFO L273 TraceCheckUtils]: 53: Hoare triple {4296#false} assume ~cond == 0bv32; {4296#false} is VALID [2018-11-14 16:05:43,684 INFO L273 TraceCheckUtils]: 52: Hoare triple {4296#false} ~cond := #in~cond; {4296#false} is VALID [2018-11-14 16:05:43,684 INFO L256 TraceCheckUtils]: 51: Hoare triple {4296#false} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {4296#false} is VALID [2018-11-14 16:05:43,685 INFO L273 TraceCheckUtils]: 50: Hoare triple {4483#(not (bvslt main_~i~0 ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4296#false} is VALID [2018-11-14 16:05:43,685 INFO L273 TraceCheckUtils]: 49: Hoare triple {4483#(not (bvslt main_~i~0 ~SIZE~0))} assume true; {4483#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-14 16:05:43,686 INFO L273 TraceCheckUtils]: 48: Hoare triple {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4483#(not (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-14 16:05:43,687 INFO L273 TraceCheckUtils]: 47: Hoare triple {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} havoc #t~mem4; {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,687 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4295#true} {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #67#return; {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,687 INFO L273 TraceCheckUtils]: 45: Hoare triple {4295#true} assume true; {4295#true} is VALID [2018-11-14 16:05:43,688 INFO L273 TraceCheckUtils]: 44: Hoare triple {4295#true} assume !(~cond == 0bv32); {4295#true} is VALID [2018-11-14 16:05:43,688 INFO L273 TraceCheckUtils]: 43: Hoare triple {4295#true} ~cond := #in~cond; {4295#true} is VALID [2018-11-14 16:05:43,688 INFO L256 TraceCheckUtils]: 42: Hoare triple {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {4295#true} is VALID [2018-11-14 16:05:43,688 INFO L273 TraceCheckUtils]: 41: Hoare triple {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,688 INFO L273 TraceCheckUtils]: 40: Hoare triple {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,713 INFO L273 TraceCheckUtils]: 39: Hoare triple {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4490#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,714 INFO L273 TraceCheckUtils]: 38: Hoare triple {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} havoc #t~mem4; {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,714 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {4295#true} {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #67#return; {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {4295#true} assume true; {4295#true} is VALID [2018-11-14 16:05:43,715 INFO L273 TraceCheckUtils]: 35: Hoare triple {4295#true} assume !(~cond == 0bv32); {4295#true} is VALID [2018-11-14 16:05:43,715 INFO L273 TraceCheckUtils]: 34: Hoare triple {4295#true} ~cond := #in~cond; {4295#true} is VALID [2018-11-14 16:05:43,715 INFO L256 TraceCheckUtils]: 33: Hoare triple {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {4295#true} is VALID [2018-11-14 16:05:43,731 INFO L273 TraceCheckUtils]: 32: Hoare triple {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,732 INFO L273 TraceCheckUtils]: 31: Hoare triple {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume true; {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,756 INFO L273 TraceCheckUtils]: 30: Hoare triple {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4518#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,756 INFO L273 TraceCheckUtils]: 29: Hoare triple {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} havoc #t~mem4; {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,757 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {4295#true} {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} #67#return; {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,757 INFO L273 TraceCheckUtils]: 27: Hoare triple {4295#true} assume true; {4295#true} is VALID [2018-11-14 16:05:43,757 INFO L273 TraceCheckUtils]: 26: Hoare triple {4295#true} assume !(~cond == 0bv32); {4295#true} is VALID [2018-11-14 16:05:43,757 INFO L273 TraceCheckUtils]: 25: Hoare triple {4295#true} ~cond := #in~cond; {4295#true} is VALID [2018-11-14 16:05:43,758 INFO L256 TraceCheckUtils]: 24: Hoare triple {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {4295#true} is VALID [2018-11-14 16:05:43,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume true; {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,759 INFO L273 TraceCheckUtils]: 21: Hoare triple {4574#(not (bvslt (_ bv3 32) ~SIZE~0))} ~i~0 := 0bv32; {4546#(not (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,759 INFO L273 TraceCheckUtils]: 20: Hoare triple {4578#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} assume !~bvslt32(~i~0, ~SIZE~0); {4574#(not (bvslt (_ bv3 32) ~SIZE~0))} is VALID [2018-11-14 16:05:43,759 INFO L273 TraceCheckUtils]: 19: Hoare triple {4578#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} assume true; {4578#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-14 16:05:43,760 INFO L273 TraceCheckUtils]: 18: Hoare triple {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4578#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-14 16:05:43,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,761 INFO L273 TraceCheckUtils]: 16: Hoare triple {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,762 INFO L273 TraceCheckUtils]: 15: Hoare triple {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume true; {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4585#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,791 INFO L273 TraceCheckUtils]: 11: Hoare triple {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} assume true; {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4598#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,830 INFO L273 TraceCheckUtils]: 9: Hoare triple {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,830 INFO L273 TraceCheckUtils]: 7: Hoare triple {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} assume true; {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {4295#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {4611#(or (not (bvslt (_ bv3 32) ~SIZE~0)) (bvslt (bvadd main_~i~0 (_ bv3 32)) ~SIZE~0))} is VALID [2018-11-14 16:05:43,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {4295#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4295#true} is VALID [2018-11-14 16:05:43,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {4295#true} call #t~ret5 := main(); {4295#true} is VALID [2018-11-14 16:05:43,832 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4295#true} {4295#true} #63#return; {4295#true} is VALID [2018-11-14 16:05:43,832 INFO L273 TraceCheckUtils]: 2: Hoare triple {4295#true} assume true; {4295#true} is VALID [2018-11-14 16:05:43,832 INFO L273 TraceCheckUtils]: 1: Hoare triple {4295#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {4295#true} is VALID [2018-11-14 16:05:43,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {4295#true} call ULTIMATE.init(); {4295#true} is VALID [2018-11-14 16:05:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 9 proven. 39 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:05:43,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:05:43,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-14 16:05:43,839 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-14 16:05:43,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:43,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 16:05:44,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:05:44,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 16:05:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 16:05:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2018-11-14 16:05:44,086 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 20 states. [2018-11-14 16:05:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:47,492 INFO L93 Difference]: Finished difference Result 158 states and 178 transitions. [2018-11-14 16:05:47,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 16:05:47,493 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-14 16:05:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:05:47,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:05:47,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions. [2018-11-14 16:05:47,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:05:47,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions. [2018-11-14 16:05:47,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 97 transitions. [2018-11-14 16:05:48,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:05:48,418 INFO L225 Difference]: With dead ends: 158 [2018-11-14 16:05:48,418 INFO L226 Difference]: Without dead ends: 121 [2018-11-14 16:05:48,419 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:05:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-14 16:05:48,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2018-11-14 16:05:48,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:05:48,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 104 states. [2018-11-14 16:05:48,592 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 104 states. [2018-11-14 16:05:48,592 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 104 states. [2018-11-14 16:05:48,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:48,597 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2018-11-14 16:05:48,598 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2018-11-14 16:05:48,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:48,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:48,599 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 121 states. [2018-11-14 16:05:48,599 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 121 states. [2018-11-14 16:05:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:05:48,603 INFO L93 Difference]: Finished difference Result 121 states and 139 transitions. [2018-11-14 16:05:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2018-11-14 16:05:48,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:05:48,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:05:48,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:05:48,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:05:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 16:05:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2018-11-14 16:05:48,608 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 55 [2018-11-14 16:05:48,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:05:48,608 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2018-11-14 16:05:48,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 16:05:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2018-11-14 16:05:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-14 16:05:48,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:05:48,609 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:05:48,610 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:05:48,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:05:48,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1009564918, now seen corresponding path program 4 times [2018-11-14 16:05:48,611 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:05:48,611 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:05:48,639 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:05:48,719 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:05:48,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:05:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:05:48,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:05:48,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-14 16:05:48,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-14 16:05:48,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:48,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:48,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:48,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-14 16:05:49,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-14 16:05:49,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-14 16:05:49,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:49,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:49,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:49,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-14 16:05:49,527 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:49,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {5235#true} call ULTIMATE.init(); {5235#true} is VALID [2018-11-14 16:05:49,604 INFO L273 TraceCheckUtils]: 1: Hoare triple {5235#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {5235#true} is VALID [2018-11-14 16:05:49,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-14 16:05:49,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5235#true} {5235#true} #63#return; {5235#true} is VALID [2018-11-14 16:05:49,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {5235#true} call #t~ret5 := main(); {5235#true} is VALID [2018-11-14 16:05:49,605 INFO L273 TraceCheckUtils]: 5: Hoare triple {5235#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {5235#true} is VALID [2018-11-14 16:05:49,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {5235#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {5258#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:05:49,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {5258#(= main_~i~0 (_ bv0 32))} assume true; {5258#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:05:49,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {5258#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {5258#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:05:49,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {5258#(= main_~i~0 (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5258#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:05:49,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {5258#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:49,607 INFO L273 TraceCheckUtils]: 11: Hoare triple {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:49,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:49,608 INFO L273 TraceCheckUtils]: 13: Hoare triple {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:49,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {5271#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5284#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:05:49,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {5284#(= (_ bv2 32) main_~i~0)} assume true; {5284#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:05:49,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {5284#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, ~SIZE~0); {5284#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:05:49,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {5284#(= (_ bv2 32) main_~i~0)} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5284#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:05:49,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {5284#(= (_ bv2 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:49,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:49,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0); {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:49,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {5297#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-14 16:05:49,613 INFO L273 TraceCheckUtils]: 22: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-14 16:05:49,613 INFO L273 TraceCheckUtils]: 23: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} assume true; {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-14 16:05:49,614 INFO L273 TraceCheckUtils]: 24: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} assume !~bvslt32(~i~0, ~SIZE~0); {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-14 16:05:49,615 INFO L273 TraceCheckUtils]: 25: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} ~i~0 := 0bv32; {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:05:49,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} assume true; {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:05:49,616 INFO L273 TraceCheckUtils]: 27: Hoare triple {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:05:49,617 INFO L256 TraceCheckUtils]: 28: Hoare triple {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,618 INFO L273 TraceCheckUtils]: 29: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} ~cond := #in~cond; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume !(~cond == 0bv32); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,619 INFO L273 TraceCheckUtils]: 31: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume true; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,619 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} #67#return; {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:05:49,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} havoc #t~mem4; {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 16:05:49,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {5320#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= main_~i~0 (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:49,622 INFO L273 TraceCheckUtils]: 35: Hoare triple {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:49,623 INFO L273 TraceCheckUtils]: 36: Hoare triple {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:49,625 INFO L256 TraceCheckUtils]: 37: Hoare triple {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,626 INFO L273 TraceCheckUtils]: 38: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} ~cond := #in~cond; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,626 INFO L273 TraceCheckUtils]: 39: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume !(~cond == 0bv32); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,627 INFO L273 TraceCheckUtils]: 40: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume true; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,628 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #67#return; {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:49,629 INFO L273 TraceCheckUtils]: 42: Hoare triple {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem4; {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:49,629 INFO L273 TraceCheckUtils]: 43: Hoare triple {5349#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:49,629 INFO L273 TraceCheckUtils]: 44: Hoare triple {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} assume true; {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:49,630 INFO L273 TraceCheckUtils]: 45: Hoare triple {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:49,632 INFO L256 TraceCheckUtils]: 46: Hoare triple {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,633 INFO L273 TraceCheckUtils]: 47: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} ~cond := #in~cond; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,633 INFO L273 TraceCheckUtils]: 48: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume !(~cond == 0bv32); {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,634 INFO L273 TraceCheckUtils]: 49: Hoare triple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} assume true; {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} is VALID [2018-11-14 16:05:49,635 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5330#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32)) (|v_main_~#a~0.offset_BEFORE_CALL_5| (_ BitVec 32))) (= (_ bv0 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (bvadd |v_main_~#a~0.offset_BEFORE_CALL_5| (_ bv12 32)))))} {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} #67#return; {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:49,636 INFO L273 TraceCheckUtils]: 51: Hoare triple {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} havoc #t~mem4; {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-14 16:05:49,637 INFO L273 TraceCheckUtils]: 52: Hoare triple {5377#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) main_~i~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5405#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:49,638 INFO L273 TraceCheckUtils]: 53: Hoare triple {5405#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {5405#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:05:49,639 INFO L273 TraceCheckUtils]: 54: Hoare triple {5405#(and (= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5412#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-14 16:05:49,640 INFO L256 TraceCheckUtils]: 55: Hoare triple {5412#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {5416#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:49,641 INFO L273 TraceCheckUtils]: 56: Hoare triple {5416#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {5420#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:05:49,641 INFO L273 TraceCheckUtils]: 57: Hoare triple {5420#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {5236#false} is VALID [2018-11-14 16:05:49,642 INFO L273 TraceCheckUtils]: 58: Hoare triple {5236#false} assume !false; {5236#false} is VALID [2018-11-14 16:05:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:05:49,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:05:58,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-14 16:05:58,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-14 16:05:58,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:05:58,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:58,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:05:58,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:5 [2018-11-14 16:05:58,220 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:05:58,508 INFO L273 TraceCheckUtils]: 58: Hoare triple {5236#false} assume !false; {5236#false} is VALID [2018-11-14 16:05:58,508 INFO L273 TraceCheckUtils]: 57: Hoare triple {5430#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {5236#false} is VALID [2018-11-14 16:05:58,509 INFO L273 TraceCheckUtils]: 56: Hoare triple {5434#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {5430#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:05:58,510 INFO L256 TraceCheckUtils]: 55: Hoare triple {5412#(= (_ bv0 32) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {5434#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:05:58,511 INFO L273 TraceCheckUtils]: 54: Hoare triple {5441#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5412#(= (_ bv0 32) |main_#t~mem4|)} is VALID [2018-11-14 16:05:58,511 INFO L273 TraceCheckUtils]: 53: Hoare triple {5441#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume true; {5441#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-14 16:05:58,720 INFO L273 TraceCheckUtils]: 52: Hoare triple {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5441#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-14 16:05:58,721 INFO L273 TraceCheckUtils]: 51: Hoare triple {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} havoc #t~mem4; {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:58,722 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5235#true} {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} #67#return; {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:58,722 INFO L273 TraceCheckUtils]: 49: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-14 16:05:58,722 INFO L273 TraceCheckUtils]: 48: Hoare triple {5235#true} assume !(~cond == 0bv32); {5235#true} is VALID [2018-11-14 16:05:58,722 INFO L273 TraceCheckUtils]: 47: Hoare triple {5235#true} ~cond := #in~cond; {5235#true} is VALID [2018-11-14 16:05:58,722 INFO L256 TraceCheckUtils]: 46: Hoare triple {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {5235#true} is VALID [2018-11-14 16:05:58,722 INFO L273 TraceCheckUtils]: 45: Hoare triple {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:58,723 INFO L273 TraceCheckUtils]: 44: Hoare triple {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} assume true; {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:59,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5448#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:59,053 INFO L273 TraceCheckUtils]: 42: Hoare triple {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} havoc #t~mem4; {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-14 16:05:59,054 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5235#true} {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} #67#return; {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-14 16:05:59,054 INFO L273 TraceCheckUtils]: 40: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-14 16:05:59,054 INFO L273 TraceCheckUtils]: 39: Hoare triple {5235#true} assume !(~cond == 0bv32); {5235#true} is VALID [2018-11-14 16:05:59,054 INFO L273 TraceCheckUtils]: 38: Hoare triple {5235#true} ~cond := #in~cond; {5235#true} is VALID [2018-11-14 16:05:59,054 INFO L256 TraceCheckUtils]: 37: Hoare triple {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {5235#true} is VALID [2018-11-14 16:05:59,055 INFO L273 TraceCheckUtils]: 36: Hoare triple {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-14 16:05:59,055 INFO L273 TraceCheckUtils]: 35: Hoare triple {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} assume true; {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-14 16:05:59,382 INFO L273 TraceCheckUtils]: 34: Hoare triple {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {5476#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32))))} is VALID [2018-11-14 16:05:59,382 INFO L273 TraceCheckUtils]: 33: Hoare triple {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} havoc #t~mem4; {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:59,383 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {5235#true} {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} #67#return; {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:59,383 INFO L273 TraceCheckUtils]: 31: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-14 16:05:59,383 INFO L273 TraceCheckUtils]: 30: Hoare triple {5235#true} assume !(~cond == 0bv32); {5235#true} is VALID [2018-11-14 16:05:59,384 INFO L273 TraceCheckUtils]: 29: Hoare triple {5235#true} ~cond := #in~cond; {5235#true} is VALID [2018-11-14 16:05:59,384 INFO L256 TraceCheckUtils]: 28: Hoare triple {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} call __VERIFIER_assert((if #t~mem4 == 0bv32 then 1bv32 else 0bv32)); {5235#true} is VALID [2018-11-14 16:05:59,384 INFO L273 TraceCheckUtils]: 27: Hoare triple {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:59,385 INFO L273 TraceCheckUtils]: 26: Hoare triple {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} assume true; {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:59,386 INFO L273 TraceCheckUtils]: 25: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} ~i~0 := 0bv32; {5504#(= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv12 32))) (_ bv0 32))} is VALID [2018-11-14 16:05:59,387 INFO L273 TraceCheckUtils]: 24: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} assume !~bvslt32(~i~0, ~SIZE~0); {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-14 16:05:59,387 INFO L273 TraceCheckUtils]: 23: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} assume true; {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-14 16:05:59,388 INFO L273 TraceCheckUtils]: 22: Hoare triple {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-14 16:05:59,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5307#(= (_ bv0 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32))))} is VALID [2018-11-14 16:05:59,391 INFO L273 TraceCheckUtils]: 20: Hoare triple {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,391 INFO L273 TraceCheckUtils]: 19: Hoare triple {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5544#(= (_ bv12 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,395 INFO L273 TraceCheckUtils]: 15: Hoare triple {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5554#(= (_ bv8 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,400 INFO L273 TraceCheckUtils]: 10: Hoare triple {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {5567#(= (_ bv4 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume !~bvsgt32(~bvashr32(~i~0, 16bv32), 250bv32);call write~intINTTYPE4(0bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,400 INFO L273 TraceCheckUtils]: 8: Hoare triple {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0); {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,419 INFO L273 TraceCheckUtils]: 7: Hoare triple {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} assume true; {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {5235#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~i~0 := 0bv32; {5580#(= (_ bv0 32) (bvmul (_ bv4 32) main_~i~0))} is VALID [2018-11-14 16:05:59,425 INFO L273 TraceCheckUtils]: 5: Hoare triple {5235#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {5235#true} is VALID [2018-11-14 16:05:59,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {5235#true} call #t~ret5 := main(); {5235#true} is VALID [2018-11-14 16:05:59,426 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5235#true} {5235#true} #63#return; {5235#true} is VALID [2018-11-14 16:05:59,426 INFO L273 TraceCheckUtils]: 2: Hoare triple {5235#true} assume true; {5235#true} is VALID [2018-11-14 16:05:59,426 INFO L273 TraceCheckUtils]: 1: Hoare triple {5235#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {5235#true} is VALID [2018-11-14 16:05:59,426 INFO L256 TraceCheckUtils]: 0: Hoare triple {5235#true} call ULTIMATE.init(); {5235#true} is VALID [2018-11-14 16:05:59,431 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-14 16:05:59,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:05:59,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2018-11-14 16:05:59,435 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 59 [2018-11-14 16:05:59,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:05:59,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 16:06:00,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:06:00,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 16:06:00,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 16:06:00,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=522, Unknown=4, NotChecked=0, Total=600 [2018-11-14 16:06:00,552 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand 25 states.