java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init3_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:06:19,177 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:06:19,182 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:06:19,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:06:19,199 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:06:19,200 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:06:19,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:06:19,204 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:06:19,206 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:06:19,207 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:06:19,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:06:19,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:06:19,209 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:06:19,210 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:06:19,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:06:19,213 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:06:19,213 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:06:19,216 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:06:19,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:06:19,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:06:19,221 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:06:19,222 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:06:19,228 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:06:19,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:06:19,229 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:06:19,232 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:06:19,233 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:06:19,234 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:06:19,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:06:19,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:06:19,243 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:06:19,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:06:19,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:06:19,245 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:06:19,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:06:19,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:06:19,247 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-23 10:06:19,269 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:06:19,270 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:06:19,274 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:06:19,274 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:06:19,275 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:06:19,275 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:06:19,275 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:06:19,276 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:06:19,277 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:06:19,277 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:06:19,277 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:06:19,277 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:06:19,277 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:06:19,277 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:06:19,278 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:06:19,278 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:06:19,278 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:06:19,278 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:06:19,278 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:06:19,279 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:06:19,279 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:06:19,279 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:06:19,279 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:06:19,279 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:06:19,281 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:06:19,282 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:06:19,282 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:06:19,282 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:06:19,282 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:06:19,282 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:06:19,283 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:06:19,283 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:06:19,284 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:06:19,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:06:19,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:06:19,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:06:19,364 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:06:19,365 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:06:19,366 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init3_true-unreach-call_ground.i [2018-11-23 10:06:19,424 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec42ade1/9038764032c64213b07268a8dea0c768/FLAGceba3c383 [2018-11-23 10:06:19,925 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:06:19,926 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init3_true-unreach-call_ground.i [2018-11-23 10:06:19,933 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec42ade1/9038764032c64213b07268a8dea0c768/FLAGceba3c383 [2018-11-23 10:06:20,245 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec42ade1/9038764032c64213b07268a8dea0c768 [2018-11-23 10:06:20,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:06:20,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:06:20,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:06:20,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:06:20,262 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:06:20,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630ba0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20, skipping insertion in model container [2018-11-23 10:06:20,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:06:20,305 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:06:20,554 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:06:20,558 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:06:20,583 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:06:20,607 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:06:20,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20 WrapperNode [2018-11-23 10:06:20,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:06:20,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:06:20,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:06:20,609 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:06:20,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,630 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:06:20,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:06:20,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:06:20,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:06:20,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (1/1) ... [2018-11-23 10:06:20,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:06:20,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:06:20,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:06:20,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:06:20,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:06:20,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:06:20,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:06:20,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:06:20,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:06:20,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:06:20,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:06:20,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:06:20,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:06:20,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:06:20,812 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:06:20,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:06:20,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:06:21,394 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:06:21,395 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 10:06:21,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:21 BoogieIcfgContainer [2018-11-23 10:06:21,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:06:21,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:06:21,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:06:21,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:06:21,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:20" (1/3) ... [2018-11-23 10:06:21,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437ac5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:21, skipping insertion in model container [2018-11-23 10:06:21,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:20" (2/3) ... [2018-11-23 10:06:21,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@437ac5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:21, skipping insertion in model container [2018-11-23 10:06:21,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:21" (3/3) ... [2018-11-23 10:06:21,404 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init3_true-unreach-call_ground.i [2018-11-23 10:06:21,415 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:06:21,422 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:06:21,442 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:06:21,477 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:06:21,478 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:06:21,479 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:06:21,479 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:06:21,480 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:06:21,480 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:06:21,480 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:06:21,481 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:06:21,481 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:06:21,500 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 10:06:21,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:06:21,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:21,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:21,511 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:21,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:21,519 INFO L82 PathProgramCache]: Analyzing trace with hash 578824766, now seen corresponding path program 1 times [2018-11-23 10:06:21,524 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:21,525 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-23 10:06:21,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:21,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:21,701 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 10:06:21,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {30#true} is VALID [2018-11-23 10:06:21,707 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 10:06:21,707 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #74#return; {30#true} is VALID [2018-11-23 10:06:21,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret2 := main(); {30#true} is VALID [2018-11-23 10:06:21,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {30#true} is VALID [2018-11-23 10:06:21,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 10:06:21,709 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~i~0 := 0bv32; {31#false} is VALID [2018-11-23 10:06:21,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !~bvslt32(~i~0, 100000bv32); {31#false} is VALID [2018-11-23 10:06:21,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} ~i~0 := 0bv32; {31#false} is VALID [2018-11-23 10:06:21,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {31#false} assume !~bvslt32(~i~0, 100000bv32); {31#false} is VALID [2018-11-23 10:06:21,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} havoc ~x~0;~x~0 := 0bv32; {31#false} is VALID [2018-11-23 10:06:21,710 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {31#false} is VALID [2018-11-23 10:06:21,711 INFO L256 TraceCheckUtils]: 13: Hoare triple {31#false} call __VERIFIER_assert((if 44bv32 == #t~mem1 then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-23 10:06:21,711 INFO L273 TraceCheckUtils]: 14: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 10:06:21,711 INFO L273 TraceCheckUtils]: 15: Hoare triple {31#false} assume 0bv32 == ~cond; {31#false} is VALID [2018-11-23 10:06:21,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 10:06:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:06:21,718 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:06:21,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:06:21,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:06:21,732 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 10:06:21,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:21,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:06:21,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:21,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:06:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:06:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:06:21,926 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 10:06:22,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:22,193 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2018-11-23 10:06:22,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:06:22,193 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 10:06:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:22,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:06:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-23 10:06:22,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:06:22,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2018-11-23 10:06:22,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2018-11-23 10:06:22,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:22,504 INFO L225 Difference]: With dead ends: 47 [2018-11-23 10:06:22,505 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 10:06:22,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:06:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 10:06:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 10:06:22,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:22,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 10:06:22,571 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:06:22,571 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:06:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:22,575 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 10:06:22,576 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 10:06:22,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:22,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:22,577 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 10:06:22,577 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 10:06:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:22,581 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 10:06:22,581 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 10:06:22,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:22,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:22,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:22,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 10:06:22,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 10:06:22,588 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-11-23 10:06:22,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:22,588 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 10:06:22,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:06:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 10:06:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:06:22,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:22,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:22,590 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:22,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:22,591 INFO L82 PathProgramCache]: Analyzing trace with hash -823304390, now seen corresponding path program 1 times [2018-11-23 10:06:22,591 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:22,592 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-23 10:06:22,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:22,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:22,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {220#true} call ULTIMATE.init(); {220#true} is VALID [2018-11-23 10:06:22,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {220#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {220#true} is VALID [2018-11-23 10:06:22,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {220#true} assume true; {220#true} is VALID [2018-11-23 10:06:22,985 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {220#true} {220#true} #74#return; {220#true} is VALID [2018-11-23 10:06:22,986 INFO L256 TraceCheckUtils]: 4: Hoare triple {220#true} call #t~ret2 := main(); {220#true} is VALID [2018-11-23 10:06:22,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {220#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {240#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:23,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {240#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {221#false} is VALID [2018-11-23 10:06:23,009 INFO L273 TraceCheckUtils]: 7: Hoare triple {221#false} ~i~0 := 0bv32; {221#false} is VALID [2018-11-23 10:06:23,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {221#false} assume !~bvslt32(~i~0, 100000bv32); {221#false} is VALID [2018-11-23 10:06:23,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {221#false} ~i~0 := 0bv32; {221#false} is VALID [2018-11-23 10:06:23,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {221#false} assume !~bvslt32(~i~0, 100000bv32); {221#false} is VALID [2018-11-23 10:06:23,010 INFO L273 TraceCheckUtils]: 11: Hoare triple {221#false} havoc ~x~0;~x~0 := 0bv32; {221#false} is VALID [2018-11-23 10:06:23,010 INFO L273 TraceCheckUtils]: 12: Hoare triple {221#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {221#false} is VALID [2018-11-23 10:06:23,011 INFO L256 TraceCheckUtils]: 13: Hoare triple {221#false} call __VERIFIER_assert((if 44bv32 == #t~mem1 then 1bv32 else 0bv32)); {221#false} is VALID [2018-11-23 10:06:23,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {221#false} ~cond := #in~cond; {221#false} is VALID [2018-11-23 10:06:23,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {221#false} assume 0bv32 == ~cond; {221#false} is VALID [2018-11-23 10:06:23,012 INFO L273 TraceCheckUtils]: 16: Hoare triple {221#false} assume !false; {221#false} is VALID [2018-11-23 10:06:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:06:23,014 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:06:23,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:06:23,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:06:23,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:06:23,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:23,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:06:23,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:23,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:06:23,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:06:23,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:06:23,062 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 3 states. [2018-11-23 10:06:23,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:23,513 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 10:06:23,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:06:23,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:06:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:06:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 10:06:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:06:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2018-11-23 10:06:23,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2018-11-23 10:06:23,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:23,644 INFO L225 Difference]: With dead ends: 40 [2018-11-23 10:06:23,644 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 10:06:23,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:06:23,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 10:06:23,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 10:06:23,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:23,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 10:06:23,679 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:06:23,679 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:06:23,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:23,682 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 10:06:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:06:23,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:23,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:23,683 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:06:23,683 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:06:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:23,686 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-23 10:06:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:06:23,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:23,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:23,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:23,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:06:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 10:06:23,690 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2018-11-23 10:06:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:23,691 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 10:06:23,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:06:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 10:06:23,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:06:23,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:23,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:23,692 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:23,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:23,693 INFO L82 PathProgramCache]: Analyzing trace with hash 3753729, now seen corresponding path program 1 times [2018-11-23 10:06:23,693 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:23,694 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-23 10:06:23,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:23,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:23,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:23,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-23 10:06:23,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-23 10:06:23,838 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 10:06:23,838 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #74#return; {419#true} is VALID [2018-11-23 10:06:23,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret2 := main(); {419#true} is VALID [2018-11-23 10:06:23,839 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {439#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:23,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {439#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {443#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:23,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {443#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 10:06:23,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {420#false} ~i~0 := 0bv32; {420#false} is VALID [2018-11-23 10:06:23,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {420#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {420#false} is VALID [2018-11-23 10:06:23,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {420#false} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 10:06:23,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {420#false} ~i~0 := 0bv32; {420#false} is VALID [2018-11-23 10:06:23,844 INFO L273 TraceCheckUtils]: 12: Hoare triple {420#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {420#false} is VALID [2018-11-23 10:06:23,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {420#false} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 10:06:23,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {420#false} havoc ~x~0;~x~0 := 0bv32; {420#false} is VALID [2018-11-23 10:06:23,845 INFO L273 TraceCheckUtils]: 15: Hoare triple {420#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {420#false} is VALID [2018-11-23 10:06:23,846 INFO L256 TraceCheckUtils]: 16: Hoare triple {420#false} call __VERIFIER_assert((if 44bv32 == #t~mem1 then 1bv32 else 0bv32)); {420#false} is VALID [2018-11-23 10:06:23,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {420#false} ~cond := #in~cond; {420#false} is VALID [2018-11-23 10:06:23,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {420#false} assume 0bv32 == ~cond; {420#false} is VALID [2018-11-23 10:06:23,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-23 10:06:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 10:06:23,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:23,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-23 10:06:23,949 INFO L273 TraceCheckUtils]: 18: Hoare triple {420#false} assume 0bv32 == ~cond; {420#false} is VALID [2018-11-23 10:06:23,949 INFO L273 TraceCheckUtils]: 17: Hoare triple {420#false} ~cond := #in~cond; {420#false} is VALID [2018-11-23 10:06:23,950 INFO L256 TraceCheckUtils]: 16: Hoare triple {420#false} call __VERIFIER_assert((if 44bv32 == #t~mem1 then 1bv32 else 0bv32)); {420#false} is VALID [2018-11-23 10:06:23,950 INFO L273 TraceCheckUtils]: 15: Hoare triple {420#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {420#false} is VALID [2018-11-23 10:06:23,951 INFO L273 TraceCheckUtils]: 14: Hoare triple {420#false} havoc ~x~0;~x~0 := 0bv32; {420#false} is VALID [2018-11-23 10:06:23,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {420#false} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 10:06:23,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {420#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {420#false} is VALID [2018-11-23 10:06:23,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {420#false} ~i~0 := 0bv32; {420#false} is VALID [2018-11-23 10:06:23,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {420#false} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 10:06:23,953 INFO L273 TraceCheckUtils]: 9: Hoare triple {420#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {420#false} is VALID [2018-11-23 10:06:23,953 INFO L273 TraceCheckUtils]: 8: Hoare triple {420#false} ~i~0 := 0bv32; {420#false} is VALID [2018-11-23 10:06:23,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {519#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {420#false} is VALID [2018-11-23 10:06:23,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {523#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {519#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:23,961 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {523#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret2 := main(); {419#true} is VALID [2018-11-23 10:06:23,961 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #74#return; {419#true} is VALID [2018-11-23 10:06:23,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 10:06:23,962 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-23 10:06:23,962 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-23 10:06:23,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 10:06:23,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:23,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:06:23,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 10:06:23,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:23,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:06:24,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:24,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:06:24,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:06:24,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:06:24,113 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2018-11-23 10:06:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:24,710 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2018-11-23 10:06:24,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:06:24,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 10:06:24,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:06:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 10:06:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:06:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2018-11-23 10:06:24,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2018-11-23 10:06:24,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:24,857 INFO L225 Difference]: With dead ends: 51 [2018-11-23 10:06:24,857 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 10:06:24,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:06:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 10:06:24,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 10:06:24,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:24,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 10:06:24,882 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 10:06:24,883 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 10:06:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:24,885 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 10:06:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 10:06:24,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:24,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:24,887 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 10:06:24,887 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 10:06:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:24,890 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-23 10:06:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 10:06:24,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:24,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:24,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:24,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:24,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 10:06:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 10:06:24,893 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 20 [2018-11-23 10:06:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:24,894 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 10:06:24,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:06:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 10:06:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:06:24,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:24,895 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:24,896 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:24,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1002382458, now seen corresponding path program 2 times [2018-11-23 10:06:24,897 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:24,897 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-23 10:06:24,919 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:06:24,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:06:24,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:25,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:25,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {750#true} is VALID [2018-11-23 10:06:25,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {750#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {750#true} is VALID [2018-11-23 10:06:25,127 INFO L273 TraceCheckUtils]: 2: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-23 10:06:25,127 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {750#true} {750#true} #74#return; {750#true} is VALID [2018-11-23 10:06:25,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {750#true} call #t~ret2 := main(); {750#true} is VALID [2018-11-23 10:06:25,127 INFO L273 TraceCheckUtils]: 5: Hoare triple {750#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {750#true} is VALID [2018-11-23 10:06:25,128 INFO L273 TraceCheckUtils]: 6: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,128 INFO L273 TraceCheckUtils]: 7: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,128 INFO L273 TraceCheckUtils]: 10: Hoare triple {750#true} assume !~bvslt32(~i~0, 100000bv32); {750#true} is VALID [2018-11-23 10:06:25,129 INFO L273 TraceCheckUtils]: 11: Hoare triple {750#true} ~i~0 := 0bv32; {750#true} is VALID [2018-11-23 10:06:25,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {750#true} assume !~bvslt32(~i~0, 100000bv32); {750#true} is VALID [2018-11-23 10:06:25,131 INFO L273 TraceCheckUtils]: 17: Hoare triple {750#true} ~i~0 := 0bv32; {806#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:25,132 INFO L273 TraceCheckUtils]: 18: Hoare triple {806#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {810#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:25,132 INFO L273 TraceCheckUtils]: 19: Hoare triple {810#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {814#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:25,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {814#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {818#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:25,134 INFO L273 TraceCheckUtils]: 21: Hoare triple {818#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {822#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:06:25,135 INFO L273 TraceCheckUtils]: 22: Hoare triple {822#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {751#false} is VALID [2018-11-23 10:06:25,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {751#false} havoc ~x~0;~x~0 := 0bv32; {751#false} is VALID [2018-11-23 10:06:25,136 INFO L273 TraceCheckUtils]: 24: Hoare triple {751#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {751#false} is VALID [2018-11-23 10:06:25,136 INFO L256 TraceCheckUtils]: 25: Hoare triple {751#false} call __VERIFIER_assert((if 44bv32 == #t~mem1 then 1bv32 else 0bv32)); {751#false} is VALID [2018-11-23 10:06:25,137 INFO L273 TraceCheckUtils]: 26: Hoare triple {751#false} ~cond := #in~cond; {751#false} is VALID [2018-11-23 10:06:25,137 INFO L273 TraceCheckUtils]: 27: Hoare triple {751#false} assume 0bv32 == ~cond; {751#false} is VALID [2018-11-23 10:06:25,138 INFO L273 TraceCheckUtils]: 28: Hoare triple {751#false} assume !false; {751#false} is VALID [2018-11-23 10:06:25,140 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 10:06:25,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:25,323 INFO L273 TraceCheckUtils]: 28: Hoare triple {751#false} assume !false; {751#false} is VALID [2018-11-23 10:06:25,324 INFO L273 TraceCheckUtils]: 27: Hoare triple {751#false} assume 0bv32 == ~cond; {751#false} is VALID [2018-11-23 10:06:25,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {751#false} ~cond := #in~cond; {751#false} is VALID [2018-11-23 10:06:25,324 INFO L256 TraceCheckUtils]: 25: Hoare triple {751#false} call __VERIFIER_assert((if 44bv32 == #t~mem1 then 1bv32 else 0bv32)); {751#false} is VALID [2018-11-23 10:06:25,325 INFO L273 TraceCheckUtils]: 24: Hoare triple {751#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {751#false} is VALID [2018-11-23 10:06:25,325 INFO L273 TraceCheckUtils]: 23: Hoare triple {751#false} havoc ~x~0;~x~0 := 0bv32; {751#false} is VALID [2018-11-23 10:06:25,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {862#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {751#false} is VALID [2018-11-23 10:06:25,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {866#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {862#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:25,341 INFO L273 TraceCheckUtils]: 20: Hoare triple {870#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {866#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:25,347 INFO L273 TraceCheckUtils]: 19: Hoare triple {874#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {870#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:25,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {878#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {874#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:25,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {750#true} ~i~0 := 0bv32; {878#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:25,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {750#true} assume !~bvslt32(~i~0, 100000bv32); {750#true} is VALID [2018-11-23 10:06:25,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,354 INFO L273 TraceCheckUtils]: 12: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,354 INFO L273 TraceCheckUtils]: 11: Hoare triple {750#true} ~i~0 := 0bv32; {750#true} is VALID [2018-11-23 10:06:25,355 INFO L273 TraceCheckUtils]: 10: Hoare triple {750#true} assume !~bvslt32(~i~0, 100000bv32); {750#true} is VALID [2018-11-23 10:06:25,355 INFO L273 TraceCheckUtils]: 9: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,355 INFO L273 TraceCheckUtils]: 7: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {750#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {750#true} is VALID [2018-11-23 10:06:25,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {750#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {750#true} is VALID [2018-11-23 10:06:25,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {750#true} call #t~ret2 := main(); {750#true} is VALID [2018-11-23 10:06:25,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {750#true} {750#true} #74#return; {750#true} is VALID [2018-11-23 10:06:25,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {750#true} assume true; {750#true} is VALID [2018-11-23 10:06:25,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {750#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {750#true} is VALID [2018-11-23 10:06:25,358 INFO L256 TraceCheckUtils]: 0: Hoare triple {750#true} call ULTIMATE.init(); {750#true} is VALID [2018-11-23 10:06:25,360 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 10:06:25,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:25,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:06:25,363 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 10:06:25,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:25,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:06:25,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:25,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:06:25,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:06:25,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:06:25,422 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 12 states. [2018-11-23 10:06:27,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:27,017 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2018-11-23 10:06:27,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:06:27,017 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 10:06:27,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:27,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:06:27,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2018-11-23 10:06:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:06:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2018-11-23 10:06:27,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 90 transitions. [2018-11-23 10:06:27,255 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:27,257 INFO L225 Difference]: With dead ends: 75 [2018-11-23 10:06:27,257 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 10:06:27,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:06:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 10:06:27,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 10:06:27,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:27,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 10:06:27,306 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 10:06:27,306 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 10:06:27,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:27,310 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 10:06:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 10:06:27,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:27,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:27,312 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 10:06:27,312 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 10:06:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:27,315 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 10:06:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 10:06:27,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:27,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:27,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:27,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 10:06:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-11-23 10:06:27,319 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 29 [2018-11-23 10:06:27,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:27,319 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-11-23 10:06:27,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:06:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-11-23 10:06:27,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 10:06:27,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:27,322 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:27,322 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:27,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1397676122, now seen corresponding path program 3 times [2018-11-23 10:06:27,323 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:27,323 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-23 10:06:27,350 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:06:28,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 10:06:28,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:28,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:28,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {1271#true} call ULTIMATE.init(); {1271#true} is VALID [2018-11-23 10:06:28,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {1271#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1271#true} is VALID [2018-11-23 10:06:28,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {1271#true} assume true; {1271#true} is VALID [2018-11-23 10:06:28,560 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1271#true} {1271#true} #74#return; {1271#true} is VALID [2018-11-23 10:06:28,561 INFO L256 TraceCheckUtils]: 4: Hoare triple {1271#true} call #t~ret2 := main(); {1271#true} is VALID [2018-11-23 10:06:28,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {1271#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1271#true} is VALID [2018-11-23 10:06:28,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,562 INFO L273 TraceCheckUtils]: 8: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,562 INFO L273 TraceCheckUtils]: 9: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,562 INFO L273 TraceCheckUtils]: 10: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,563 INFO L273 TraceCheckUtils]: 11: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,563 INFO L273 TraceCheckUtils]: 12: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,563 INFO L273 TraceCheckUtils]: 13: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,563 INFO L273 TraceCheckUtils]: 14: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,563 INFO L273 TraceCheckUtils]: 15: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,564 INFO L273 TraceCheckUtils]: 16: Hoare triple {1271#true} assume !~bvslt32(~i~0, 100000bv32); {1271#true} is VALID [2018-11-23 10:06:28,564 INFO L273 TraceCheckUtils]: 17: Hoare triple {1271#true} ~i~0 := 0bv32; {1271#true} is VALID [2018-11-23 10:06:28,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,564 INFO L273 TraceCheckUtils]: 19: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,565 INFO L273 TraceCheckUtils]: 21: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,565 INFO L273 TraceCheckUtils]: 22: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,566 INFO L273 TraceCheckUtils]: 26: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,566 INFO L273 TraceCheckUtils]: 27: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:28,566 INFO L273 TraceCheckUtils]: 28: Hoare triple {1271#true} assume !~bvslt32(~i~0, 100000bv32); {1271#true} is VALID [2018-11-23 10:06:28,567 INFO L273 TraceCheckUtils]: 29: Hoare triple {1271#true} ~i~0 := 0bv32; {1363#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:28,567 INFO L273 TraceCheckUtils]: 30: Hoare triple {1363#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:28,568 INFO L273 TraceCheckUtils]: 31: Hoare triple {1367#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1371#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:06:28,569 INFO L273 TraceCheckUtils]: 32: Hoare triple {1371#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1375#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:28,569 INFO L273 TraceCheckUtils]: 33: Hoare triple {1375#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1379#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:28,570 INFO L273 TraceCheckUtils]: 34: Hoare triple {1379#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1383#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:28,571 INFO L273 TraceCheckUtils]: 35: Hoare triple {1383#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1387#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:28,572 INFO L273 TraceCheckUtils]: 36: Hoare triple {1387#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1391#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-23 10:06:28,573 INFO L273 TraceCheckUtils]: 37: Hoare triple {1391#(= (_ bv7 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1395#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:28,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {1395#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1399#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:06:28,575 INFO L273 TraceCheckUtils]: 39: Hoare triple {1399#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1403#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:28,576 INFO L273 TraceCheckUtils]: 40: Hoare triple {1403#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1272#false} is VALID [2018-11-23 10:06:28,577 INFO L273 TraceCheckUtils]: 41: Hoare triple {1272#false} havoc ~x~0;~x~0 := 0bv32; {1272#false} is VALID [2018-11-23 10:06:28,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {1272#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1272#false} is VALID [2018-11-23 10:06:28,577 INFO L256 TraceCheckUtils]: 43: Hoare triple {1272#false} call __VERIFIER_assert((if 44bv32 == #t~mem1 then 1bv32 else 0bv32)); {1272#false} is VALID [2018-11-23 10:06:28,578 INFO L273 TraceCheckUtils]: 44: Hoare triple {1272#false} ~cond := #in~cond; {1272#false} is VALID [2018-11-23 10:06:28,578 INFO L273 TraceCheckUtils]: 45: Hoare triple {1272#false} assume 0bv32 == ~cond; {1272#false} is VALID [2018-11-23 10:06:28,578 INFO L273 TraceCheckUtils]: 46: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2018-11-23 10:06:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 10:06:28,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:29,151 INFO L273 TraceCheckUtils]: 46: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2018-11-23 10:06:29,152 INFO L273 TraceCheckUtils]: 45: Hoare triple {1272#false} assume 0bv32 == ~cond; {1272#false} is VALID [2018-11-23 10:06:29,152 INFO L273 TraceCheckUtils]: 44: Hoare triple {1272#false} ~cond := #in~cond; {1272#false} is VALID [2018-11-23 10:06:29,153 INFO L256 TraceCheckUtils]: 43: Hoare triple {1272#false} call __VERIFIER_assert((if 44bv32 == #t~mem1 then 1bv32 else 0bv32)); {1272#false} is VALID [2018-11-23 10:06:29,153 INFO L273 TraceCheckUtils]: 42: Hoare triple {1272#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1272#false} is VALID [2018-11-23 10:06:29,153 INFO L273 TraceCheckUtils]: 41: Hoare triple {1272#false} havoc ~x~0;~x~0 := 0bv32; {1272#false} is VALID [2018-11-23 10:06:29,154 INFO L273 TraceCheckUtils]: 40: Hoare triple {1443#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1272#false} is VALID [2018-11-23 10:06:29,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {1447#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1443#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:29,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {1451#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1447#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {1455#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1451#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,172 INFO L273 TraceCheckUtils]: 36: Hoare triple {1459#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1455#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,176 INFO L273 TraceCheckUtils]: 35: Hoare triple {1463#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1459#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,181 INFO L273 TraceCheckUtils]: 34: Hoare triple {1467#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1463#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,191 INFO L273 TraceCheckUtils]: 33: Hoare triple {1471#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1467#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,195 INFO L273 TraceCheckUtils]: 32: Hoare triple {1475#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1471#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,199 INFO L273 TraceCheckUtils]: 31: Hoare triple {1479#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1475#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,206 INFO L273 TraceCheckUtils]: 30: Hoare triple {1483#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1479#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,207 INFO L273 TraceCheckUtils]: 29: Hoare triple {1271#true} ~i~0 := 0bv32; {1483#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:29,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {1271#true} assume !~bvslt32(~i~0, 100000bv32); {1271#true} is VALID [2018-11-23 10:06:29,208 INFO L273 TraceCheckUtils]: 27: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,208 INFO L273 TraceCheckUtils]: 26: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,208 INFO L273 TraceCheckUtils]: 25: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,208 INFO L273 TraceCheckUtils]: 24: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,208 INFO L273 TraceCheckUtils]: 23: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,208 INFO L273 TraceCheckUtils]: 22: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,209 INFO L273 TraceCheckUtils]: 20: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,209 INFO L273 TraceCheckUtils]: 19: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,209 INFO L273 TraceCheckUtils]: 18: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {1271#true} ~i~0 := 0bv32; {1271#true} is VALID [2018-11-23 10:06:29,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {1271#true} assume !~bvslt32(~i~0, 100000bv32); {1271#true} is VALID [2018-11-23 10:06:29,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,211 INFO L273 TraceCheckUtils]: 12: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,211 INFO L273 TraceCheckUtils]: 11: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,211 INFO L273 TraceCheckUtils]: 10: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {1271#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1271#true} is VALID [2018-11-23 10:06:29,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {1271#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1271#true} is VALID [2018-11-23 10:06:29,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {1271#true} call #t~ret2 := main(); {1271#true} is VALID [2018-11-23 10:06:29,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1271#true} {1271#true} #74#return; {1271#true} is VALID [2018-11-23 10:06:29,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {1271#true} assume true; {1271#true} is VALID [2018-11-23 10:06:29,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {1271#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1271#true} is VALID [2018-11-23 10:06:29,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {1271#true} call ULTIMATE.init(); {1271#true} is VALID [2018-11-23 10:06:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-11-23 10:06:29,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:29,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:06:29,219 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-11-23 10:06:29,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:29,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:06:29,299 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-23 10:06:29,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:06:29,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:06:29,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:06:29,300 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 24 states. [2018-11-23 10:06:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:35,757 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2018-11-23 10:06:35,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:06:35,757 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 47 [2018-11-23 10:06:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:06:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 144 transitions. [2018-11-23 10:06:35,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:06:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 144 transitions. [2018-11-23 10:06:35,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 144 transitions. [2018-11-23 10:06:36,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:36,152 INFO L225 Difference]: With dead ends: 123 [2018-11-23 10:06:36,153 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 10:06:36,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:06:36,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 10:06:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-23 10:06:36,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:36,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-23 10:06:36,343 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 10:06:36,343 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 10:06:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:36,347 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-23 10:06:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 10:06:36,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:36,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:36,348 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-23 10:06:36,348 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-23 10:06:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:36,352 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-23 10:06:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 10:06:36,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:36,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:36,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:36,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:36,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 10:06:36,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2018-11-23 10:06:36,357 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 47 [2018-11-23 10:06:36,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:36,357 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2018-11-23 10:06:36,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:06:36,357 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-23 10:06:36,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 10:06:36,360 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:36,360 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:36,360 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:36,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:36,360 INFO L82 PathProgramCache]: Analyzing trace with hash 473114, now seen corresponding path program 4 times [2018-11-23 10:06:36,361 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:36,361 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-23 10:06:36,385 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:06:36,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:06:36,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:36,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:37,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {2170#true} call ULTIMATE.init(); {2170#true} is VALID [2018-11-23 10:06:37,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {2170#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2170#true} is VALID [2018-11-23 10:06:37,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {2170#true} assume true; {2170#true} is VALID [2018-11-23 10:06:37,396 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2170#true} {2170#true} #74#return; {2170#true} is VALID [2018-11-23 10:06:37,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {2170#true} call #t~ret2 := main(); {2170#true} is VALID [2018-11-23 10:06:37,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {2170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2190#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:37,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {2190#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2194#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {2194#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2198#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:06:37,399 INFO L273 TraceCheckUtils]: 8: Hoare triple {2198#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2202#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,400 INFO L273 TraceCheckUtils]: 9: Hoare triple {2202#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2206#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:06:37,401 INFO L273 TraceCheckUtils]: 10: Hoare triple {2206#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2210#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,401 INFO L273 TraceCheckUtils]: 11: Hoare triple {2210#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2214#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,403 INFO L273 TraceCheckUtils]: 12: Hoare triple {2214#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2218#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {2218#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2222#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:06:37,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {2222#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2226#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,406 INFO L273 TraceCheckUtils]: 15: Hoare triple {2226#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2230#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {2230#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2234#(= (_ bv11 32) main_~i~0)} is VALID [2018-11-23 10:06:37,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {2234#(= (_ bv11 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2238#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {2238#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2242#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 10:06:37,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {2242#(= (_ bv13 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2246#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {2246#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2250#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {2250#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2254#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:06:37,413 INFO L273 TraceCheckUtils]: 22: Hoare triple {2254#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2258#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {2258#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2262#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:06:37,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {2262#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2266#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,417 INFO L273 TraceCheckUtils]: 25: Hoare triple {2266#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2270#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:06:37,418 INFO L273 TraceCheckUtils]: 26: Hoare triple {2270#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2274#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,420 INFO L273 TraceCheckUtils]: 27: Hoare triple {2274#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2278#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:37,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {2278#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 10:06:37,433 INFO L273 TraceCheckUtils]: 29: Hoare triple {2171#false} ~i~0 := 0bv32; {2171#false} is VALID [2018-11-23 10:06:37,433 INFO L273 TraceCheckUtils]: 30: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,433 INFO L273 TraceCheckUtils]: 31: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,433 INFO L273 TraceCheckUtils]: 32: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,434 INFO L273 TraceCheckUtils]: 34: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,434 INFO L273 TraceCheckUtils]: 35: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,434 INFO L273 TraceCheckUtils]: 36: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,434 INFO L273 TraceCheckUtils]: 37: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,435 INFO L273 TraceCheckUtils]: 38: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,435 INFO L273 TraceCheckUtils]: 39: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,435 INFO L273 TraceCheckUtils]: 40: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,435 INFO L273 TraceCheckUtils]: 41: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,436 INFO L273 TraceCheckUtils]: 42: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,436 INFO L273 TraceCheckUtils]: 43: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,436 INFO L273 TraceCheckUtils]: 44: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,436 INFO L273 TraceCheckUtils]: 45: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,437 INFO L273 TraceCheckUtils]: 46: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,437 INFO L273 TraceCheckUtils]: 47: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,437 INFO L273 TraceCheckUtils]: 48: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,437 INFO L273 TraceCheckUtils]: 49: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,438 INFO L273 TraceCheckUtils]: 50: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,438 INFO L273 TraceCheckUtils]: 51: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,438 INFO L273 TraceCheckUtils]: 52: Hoare triple {2171#false} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 10:06:37,438 INFO L273 TraceCheckUtils]: 53: Hoare triple {2171#false} ~i~0 := 0bv32; {2171#false} is VALID [2018-11-23 10:06:37,438 INFO L273 TraceCheckUtils]: 54: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,439 INFO L273 TraceCheckUtils]: 55: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,439 INFO L273 TraceCheckUtils]: 56: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,439 INFO L273 TraceCheckUtils]: 57: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,439 INFO L273 TraceCheckUtils]: 58: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,440 INFO L273 TraceCheckUtils]: 59: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,440 INFO L273 TraceCheckUtils]: 60: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,440 INFO L273 TraceCheckUtils]: 61: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,440 INFO L273 TraceCheckUtils]: 62: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,440 INFO L273 TraceCheckUtils]: 63: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,441 INFO L273 TraceCheckUtils]: 64: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,441 INFO L273 TraceCheckUtils]: 65: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,441 INFO L273 TraceCheckUtils]: 66: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,441 INFO L273 TraceCheckUtils]: 67: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,441 INFO L273 TraceCheckUtils]: 68: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,442 INFO L273 TraceCheckUtils]: 69: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,442 INFO L273 TraceCheckUtils]: 70: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,442 INFO L273 TraceCheckUtils]: 71: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,442 INFO L273 TraceCheckUtils]: 72: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,442 INFO L273 TraceCheckUtils]: 73: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,443 INFO L273 TraceCheckUtils]: 74: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,443 INFO L273 TraceCheckUtils]: 75: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:37,443 INFO L273 TraceCheckUtils]: 76: Hoare triple {2171#false} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 10:06:37,443 INFO L273 TraceCheckUtils]: 77: Hoare triple {2171#false} havoc ~x~0;~x~0 := 0bv32; {2171#false} is VALID [2018-11-23 10:06:37,444 INFO L273 TraceCheckUtils]: 78: Hoare triple {2171#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2171#false} is VALID [2018-11-23 10:06:37,444 INFO L256 TraceCheckUtils]: 79: Hoare triple {2171#false} call __VERIFIER_assert((if 44bv32 == #t~mem1 then 1bv32 else 0bv32)); {2171#false} is VALID [2018-11-23 10:06:37,444 INFO L273 TraceCheckUtils]: 80: Hoare triple {2171#false} ~cond := #in~cond; {2171#false} is VALID [2018-11-23 10:06:37,444 INFO L273 TraceCheckUtils]: 81: Hoare triple {2171#false} assume 0bv32 == ~cond; {2171#false} is VALID [2018-11-23 10:06:37,444 INFO L273 TraceCheckUtils]: 82: Hoare triple {2171#false} assume !false; {2171#false} is VALID [2018-11-23 10:06:37,451 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-23 10:06:37,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:39,148 INFO L273 TraceCheckUtils]: 82: Hoare triple {2171#false} assume !false; {2171#false} is VALID [2018-11-23 10:06:39,148 INFO L273 TraceCheckUtils]: 81: Hoare triple {2171#false} assume 0bv32 == ~cond; {2171#false} is VALID [2018-11-23 10:06:39,149 INFO L273 TraceCheckUtils]: 80: Hoare triple {2171#false} ~cond := #in~cond; {2171#false} is VALID [2018-11-23 10:06:39,149 INFO L256 TraceCheckUtils]: 79: Hoare triple {2171#false} call __VERIFIER_assert((if 44bv32 == #t~mem1 then 1bv32 else 0bv32)); {2171#false} is VALID [2018-11-23 10:06:39,149 INFO L273 TraceCheckUtils]: 78: Hoare triple {2171#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2171#false} is VALID [2018-11-23 10:06:39,149 INFO L273 TraceCheckUtils]: 77: Hoare triple {2171#false} havoc ~x~0;~x~0 := 0bv32; {2171#false} is VALID [2018-11-23 10:06:39,149 INFO L273 TraceCheckUtils]: 76: Hoare triple {2171#false} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 10:06:39,149 INFO L273 TraceCheckUtils]: 75: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,150 INFO L273 TraceCheckUtils]: 74: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,150 INFO L273 TraceCheckUtils]: 73: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,150 INFO L273 TraceCheckUtils]: 72: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,150 INFO L273 TraceCheckUtils]: 71: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,150 INFO L273 TraceCheckUtils]: 70: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,150 INFO L273 TraceCheckUtils]: 69: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,150 INFO L273 TraceCheckUtils]: 68: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,151 INFO L273 TraceCheckUtils]: 67: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,151 INFO L273 TraceCheckUtils]: 66: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,151 INFO L273 TraceCheckUtils]: 65: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,151 INFO L273 TraceCheckUtils]: 64: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,151 INFO L273 TraceCheckUtils]: 63: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,151 INFO L273 TraceCheckUtils]: 62: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,151 INFO L273 TraceCheckUtils]: 61: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,152 INFO L273 TraceCheckUtils]: 60: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,152 INFO L273 TraceCheckUtils]: 59: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,152 INFO L273 TraceCheckUtils]: 58: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,152 INFO L273 TraceCheckUtils]: 57: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,152 INFO L273 TraceCheckUtils]: 56: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,152 INFO L273 TraceCheckUtils]: 55: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,152 INFO L273 TraceCheckUtils]: 54: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,153 INFO L273 TraceCheckUtils]: 53: Hoare triple {2171#false} ~i~0 := 0bv32; {2171#false} is VALID [2018-11-23 10:06:39,153 INFO L273 TraceCheckUtils]: 52: Hoare triple {2171#false} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 10:06:39,153 INFO L273 TraceCheckUtils]: 51: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,153 INFO L273 TraceCheckUtils]: 50: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,153 INFO L273 TraceCheckUtils]: 49: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,153 INFO L273 TraceCheckUtils]: 48: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,153 INFO L273 TraceCheckUtils]: 47: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,154 INFO L273 TraceCheckUtils]: 46: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,154 INFO L273 TraceCheckUtils]: 45: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,154 INFO L273 TraceCheckUtils]: 44: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,154 INFO L273 TraceCheckUtils]: 43: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,154 INFO L273 TraceCheckUtils]: 42: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,155 INFO L273 TraceCheckUtils]: 41: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,155 INFO L273 TraceCheckUtils]: 40: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,155 INFO L273 TraceCheckUtils]: 39: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,155 INFO L273 TraceCheckUtils]: 38: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,155 INFO L273 TraceCheckUtils]: 37: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,156 INFO L273 TraceCheckUtils]: 36: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,156 INFO L273 TraceCheckUtils]: 35: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,156 INFO L273 TraceCheckUtils]: 34: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,156 INFO L273 TraceCheckUtils]: 33: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,156 INFO L273 TraceCheckUtils]: 32: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,157 INFO L273 TraceCheckUtils]: 31: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,157 INFO L273 TraceCheckUtils]: 30: Hoare triple {2171#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2171#false} is VALID [2018-11-23 10:06:39,157 INFO L273 TraceCheckUtils]: 29: Hoare triple {2171#false} ~i~0 := 0bv32; {2171#false} is VALID [2018-11-23 10:06:39,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {2606#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2171#false} is VALID [2018-11-23 10:06:39,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {2610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2606#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:39,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {2614#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,170 INFO L273 TraceCheckUtils]: 25: Hoare triple {2618#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2614#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,175 INFO L273 TraceCheckUtils]: 24: Hoare triple {2622#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2618#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {2626#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2622#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {2630#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2626#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,190 INFO L273 TraceCheckUtils]: 21: Hoare triple {2634#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2630#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,195 INFO L273 TraceCheckUtils]: 20: Hoare triple {2638#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2634#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {2642#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2638#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {2646#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2642#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,209 INFO L273 TraceCheckUtils]: 17: Hoare triple {2650#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2646#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {2654#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2650#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,218 INFO L273 TraceCheckUtils]: 15: Hoare triple {2658#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2654#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {2662#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2658#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,228 INFO L273 TraceCheckUtils]: 13: Hoare triple {2666#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2662#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {2670#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2666#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,237 INFO L273 TraceCheckUtils]: 11: Hoare triple {2674#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2670#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {2678#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2674#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {2682#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2678#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {2686#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2682#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,263 INFO L273 TraceCheckUtils]: 7: Hoare triple {2690#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2686#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,268 INFO L273 TraceCheckUtils]: 6: Hoare triple {2694#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2690#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {2170#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2694#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:39,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {2170#true} call #t~ret2 := main(); {2170#true} is VALID [2018-11-23 10:06:39,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2170#true} {2170#true} #74#return; {2170#true} is VALID [2018-11-23 10:06:39,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {2170#true} assume true; {2170#true} is VALID [2018-11-23 10:06:39,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {2170#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2170#true} is VALID [2018-11-23 10:06:39,270 INFO L256 TraceCheckUtils]: 0: Hoare triple {2170#true} call ULTIMATE.init(); {2170#true} is VALID [2018-11-23 10:06:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-11-23 10:06:39,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:39,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:06:39,283 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 83 [2018-11-23 10:06:39,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:39,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:06:39,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:39,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:06:39,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:06:39,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:06:39,419 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand 48 states. [2018-11-23 10:06:43,122 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:06:43,598 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:06:44,155 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:06:44,709 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:06:45,265 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:06:45,845 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:06:46,387 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:06:46,956 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:07:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:07:06,521 INFO L93 Difference]: Finished difference Result 219 states and 296 transitions. [2018-11-23 10:07:06,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:07:06,521 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 83 [2018-11-23 10:07:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:07:06,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:07:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 252 transitions. [2018-11-23 10:07:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:07:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 252 transitions. [2018-11-23 10:07:06,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 252 transitions. [2018-11-23 10:07:07,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:07:07,217 INFO L225 Difference]: With dead ends: 219 [2018-11-23 10:07:07,218 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 10:07:07,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:07:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 10:07:07,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-11-23 10:07:07,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:07:07,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 160 states. [2018-11-23 10:07:07,608 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-23 10:07:07,608 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-23 10:07:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:07:07,614 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-11-23 10:07:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-11-23 10:07:07,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:07:07,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:07:07,615 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 160 states. [2018-11-23 10:07:07,616 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 160 states. [2018-11-23 10:07:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:07:07,621 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-11-23 10:07:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-11-23 10:07:07,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:07:07,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:07:07,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:07:07,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:07:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 10:07:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 163 transitions. [2018-11-23 10:07:07,628 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 163 transitions. Word has length 83 [2018-11-23 10:07:07,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:07:07,628 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 163 transitions. [2018-11-23 10:07:07,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:07:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-11-23 10:07:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 10:07:07,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:07:07,631 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:07:07,631 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:07:07,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:07:07,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1443637350, now seen corresponding path program 5 times [2018-11-23 10:07:07,632 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:07:07,632 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-23 10:07:07,655 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1