java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy4_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 20:34:48,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 20:34:48,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 20:34:48,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 20:34:48,917 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 20:34:48,918 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 20:34:48,920 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 20:34:48,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 20:34:48,924 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 20:34:48,925 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 20:34:48,926 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 20:34:48,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 20:34:48,927 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 20:34:48,928 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 20:34:48,929 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 20:34:48,930 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 20:34:48,931 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 20:34:48,933 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 20:34:48,936 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 20:34:48,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 20:34:48,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 20:34:48,940 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 20:34:48,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 20:34:48,944 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 20:34:48,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 20:34:48,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 20:34:48,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 20:34:48,947 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 20:34:48,948 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 20:34:48,949 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 20:34:48,950 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 20:34:48,950 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 20:34:48,951 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 20:34:48,951 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 20:34:48,952 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 20:34:48,953 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 20:34:48,954 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-18 20:34:48,973 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 20:34:48,975 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 20:34:48,976 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 20:34:48,976 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 20:34:48,978 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 20:34:48,978 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 20:34:48,979 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 20:34:48,979 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 20:34:48,979 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 20:34:48,979 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 20:34:48,979 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 20:34:48,980 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 20:34:48,980 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 20:34:48,981 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 20:34:48,981 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 20:34:48,981 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 20:34:48,982 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 20:34:48,982 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 20:34:48,982 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 20:34:48,983 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 20:34:48,983 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 20:34:48,983 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 20:34:48,983 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 20:34:48,983 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 20:34:48,984 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 20:34:48,984 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 20:34:48,984 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 20:34:48,984 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 20:34:48,984 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 20:34:48,985 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 20:34:48,986 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 20:34:48,986 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 20:34:48,986 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 20:34:49,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 20:34:49,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 20:34:49,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 20:34:49,100 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 20:34:49,101 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 20:34:49,102 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_false-unreach-call_ground.i [2018-11-18 20:34:49,170 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cb8b059b/36ef4de1199049eaaf7fdae130bf770a/FLAG7c14f1afb [2018-11-18 20:34:49,656 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 20:34:49,657 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_false-unreach-call_ground.i [2018-11-18 20:34:49,663 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cb8b059b/36ef4de1199049eaaf7fdae130bf770a/FLAG7c14f1afb [2018-11-18 20:34:50,012 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cb8b059b/36ef4de1199049eaaf7fdae130bf770a [2018-11-18 20:34:50,023 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 20:34:50,025 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 20:34:50,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 20:34:50,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 20:34:50,031 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 20:34:50,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:50" (1/1) ... [2018-11-18 20:34:50,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcc5684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50, skipping insertion in model container [2018-11-18 20:34:50,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:50" (1/1) ... [2018-11-18 20:34:50,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 20:34:50,079 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 20:34:50,315 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 20:34:50,324 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 20:34:50,379 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 20:34:50,404 INFO L195 MainTranslator]: Completed translation [2018-11-18 20:34:50,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50 WrapperNode [2018-11-18 20:34:50,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 20:34:50,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 20:34:50,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 20:34:50,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 20:34:50,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 20:34:50,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 20:34:50,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 20:34:50,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 20:34:50,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 20:34:50,461 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 20:34:50,463 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (1/1) ... [2018-11-18 20:34:50,466 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 20:34:50,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 20:34:50,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 20:34:50,467 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 20:34:50,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (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-18 20:34:50,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 20:34:50,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 20:34:50,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 20:34:50,611 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 20:34:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 20:34:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 20:34:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 20:34:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 20:34:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 20:34:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 20:34:50,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 20:34:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 20:34:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 20:34:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 20:34:50,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 20:34:51,470 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 20:34:51,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:51 BoogieIcfgContainer [2018-11-18 20:34:51,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 20:34:51,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 20:34:51,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 20:34:51,476 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 20:34:51,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:34:50" (1/3) ... [2018-11-18 20:34:51,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@913926e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:51, skipping insertion in model container [2018-11-18 20:34:51,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:50" (2/3) ... [2018-11-18 20:34:51,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@913926e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:34:51, skipping insertion in model container [2018-11-18 20:34:51,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:51" (3/3) ... [2018-11-18 20:34:51,480 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy4_false-unreach-call_ground.i [2018-11-18 20:34:51,489 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 20:34:51,497 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 20:34:51,512 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 20:34:51,544 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 20:34:51,544 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 20:34:51,545 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 20:34:51,545 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 20:34:51,545 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 20:34:51,545 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 20:34:51,545 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 20:34:51,546 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 20:34:51,546 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 20:34:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-18 20:34:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 20:34:51,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:34:51,576 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:34:51,579 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:34:51,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:34:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1721942648, now seen corresponding path program 1 times [2018-11-18 20:34:51,590 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:34:51,590 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-18 20:34:51,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:34:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:34:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:34:51,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:34:51,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-18 20:34:51,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-18 20:34:51,894 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-18 20:34:51,894 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #111#return; {45#true} is VALID [2018-11-18 20:34:51,895 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret14 := main(); {45#true} is VALID [2018-11-18 20:34:51,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {45#true} is VALID [2018-11-18 20:34:51,907 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-18 20:34:51,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} havoc ~i~0;~i~0 := 0bv32; {46#false} is VALID [2018-11-18 20:34:51,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-18 20:34:51,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-18 20:34:51,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-18 20:34:51,909 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-18 20:34:51,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-18 20:34:51,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-18 20:34:51,910 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-18 20:34:51,910 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} havoc ~x~0;~x~0 := 0bv32; {46#false} is VALID [2018-11-18 20:34:51,910 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-18 20:34:51,911 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {46#false} is VALID [2018-11-18 20:34:51,911 INFO L256 TraceCheckUtils]: 18: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {46#false} is VALID [2018-11-18 20:34:51,912 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-18 20:34:51,912 INFO L273 TraceCheckUtils]: 20: Hoare triple {46#false} assume 0bv32 == ~cond; {46#false} is VALID [2018-11-18 20:34:51,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-18 20:34:51,916 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-18 20:34:51,917 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 20:34:51,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 20:34:51,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 20:34:51,927 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-18 20:34:51,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:34:51,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 20:34:52,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:34:52,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 20:34:52,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 20:34:52,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 20:34:52,051 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-18 20:34:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:52,295 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2018-11-18 20:34:52,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 20:34:52,295 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-18 20:34:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:34:52,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 20:34:52,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-18 20:34:52,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 20:34:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-18 20:34:52,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2018-11-18 20:34:52,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:34:52,709 INFO L225 Difference]: With dead ends: 75 [2018-11-18 20:34:52,710 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 20:34:52,717 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-18 20:34:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 20:34:52,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-18 20:34:52,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:34:52,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-18 20:34:52,921 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 20:34:52,922 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 20:34:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:52,931 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-18 20:34:52,931 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-18 20:34:52,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:34:52,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:34:52,937 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 20:34:52,937 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 20:34:52,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:52,951 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-18 20:34:52,951 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-18 20:34:52,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:34:52,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:34:52,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:34:52,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:34:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 20:34:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-18 20:34:52,967 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 22 [2018-11-18 20:34:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:34:52,968 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-18 20:34:52,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 20:34:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-18 20:34:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 20:34:52,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:34:52,970 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:34:52,970 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:34:52,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:34:52,972 INFO L82 PathProgramCache]: Analyzing trace with hash 20971825, now seen corresponding path program 1 times [2018-11-18 20:34:52,973 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:34:52,973 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-18 20:34:53,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:34:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:34:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:34:53,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:34:53,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {329#true} call ULTIMATE.init(); {329#true} is VALID [2018-11-18 20:34:53,263 INFO L273 TraceCheckUtils]: 1: Hoare triple {329#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {329#true} is VALID [2018-11-18 20:34:53,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {329#true} assume true; {329#true} is VALID [2018-11-18 20:34:53,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {329#true} {329#true} #111#return; {329#true} is VALID [2018-11-18 20:34:53,263 INFO L256 TraceCheckUtils]: 4: Hoare triple {329#true} call #t~ret14 := main(); {329#true} is VALID [2018-11-18 20:34:53,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {329#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {349#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:53,283 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#(= main_~a~0 (_ bv0 32))} assume true; {349#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:53,283 INFO L273 TraceCheckUtils]: 7: Hoare triple {349#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {330#false} is VALID [2018-11-18 20:34:53,284 INFO L273 TraceCheckUtils]: 8: Hoare triple {330#false} havoc ~i~0;~i~0 := 0bv32; {330#false} is VALID [2018-11-18 20:34:53,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-18 20:34:53,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {330#false} assume !~bvslt32(~i~0, 100000bv32); {330#false} is VALID [2018-11-18 20:34:53,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {330#false} ~i~0 := 0bv32; {330#false} is VALID [2018-11-18 20:34:53,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-18 20:34:53,285 INFO L273 TraceCheckUtils]: 13: Hoare triple {330#false} assume !~bvslt32(~i~0, 100000bv32); {330#false} is VALID [2018-11-18 20:34:53,286 INFO L273 TraceCheckUtils]: 14: Hoare triple {330#false} ~i~0 := 0bv32; {330#false} is VALID [2018-11-18 20:34:53,286 INFO L273 TraceCheckUtils]: 15: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-18 20:34:53,286 INFO L273 TraceCheckUtils]: 16: Hoare triple {330#false} assume !~bvslt32(~i~0, 100000bv32); {330#false} is VALID [2018-11-18 20:34:53,287 INFO L273 TraceCheckUtils]: 17: Hoare triple {330#false} ~i~0 := 0bv32; {330#false} is VALID [2018-11-18 20:34:53,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-18 20:34:53,287 INFO L273 TraceCheckUtils]: 19: Hoare triple {330#false} assume !~bvslt32(~i~0, 100000bv32); {330#false} is VALID [2018-11-18 20:34:53,287 INFO L273 TraceCheckUtils]: 20: Hoare triple {330#false} havoc ~x~0;~x~0 := 0bv32; {330#false} is VALID [2018-11-18 20:34:53,288 INFO L273 TraceCheckUtils]: 21: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-18 20:34:53,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {330#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {330#false} is VALID [2018-11-18 20:34:53,288 INFO L256 TraceCheckUtils]: 23: Hoare triple {330#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {330#false} is VALID [2018-11-18 20:34:53,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {330#false} ~cond := #in~cond; {330#false} is VALID [2018-11-18 20:34:53,289 INFO L273 TraceCheckUtils]: 25: Hoare triple {330#false} assume 0bv32 == ~cond; {330#false} is VALID [2018-11-18 20:34:53,289 INFO L273 TraceCheckUtils]: 26: Hoare triple {330#false} assume !false; {330#false} is VALID [2018-11-18 20:34:53,292 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-18 20:34:53,292 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 20:34:53,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 20:34:53,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 20:34:53,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 20:34:53,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:34:53,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 20:34:53,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:34:53,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 20:34:53,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 20:34:53,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 20:34:53,458 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 3 states. [2018-11-18 20:34:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:53,694 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-11-18 20:34:53,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 20:34:53,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 20:34:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:34:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 20:34:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-18 20:34:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 20:34:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-18 20:34:53,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-18 20:34:53,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:34:53,914 INFO L225 Difference]: With dead ends: 68 [2018-11-18 20:34:53,914 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 20:34:53,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-18 20:34:53,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 20:34:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-18 20:34:53,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:34:53,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-18 20:34:53,974 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-18 20:34:53,974 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-18 20:34:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:53,978 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-18 20:34:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-18 20:34:53,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:34:53,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:34:53,979 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-18 20:34:53,979 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-18 20:34:53,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:53,982 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-18 20:34:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-18 20:34:53,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:34:53,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:34:53,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:34:53,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:34:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 20:34:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-18 20:34:53,986 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2018-11-18 20:34:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:34:53,987 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-18 20:34:53,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 20:34:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 20:34:53,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 20:34:53,988 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:34:53,989 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:34:53,989 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:34:53,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:34:53,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1906612018, now seen corresponding path program 1 times [2018-11-18 20:34:53,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:34:53,990 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-18 20:34:54,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:34:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:34:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:34:54,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:34:54,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-18 20:34:54,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {632#true} is VALID [2018-11-18 20:34:54,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-18 20:34:54,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #111#return; {632#true} is VALID [2018-11-18 20:34:54,200 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret14 := main(); {632#true} is VALID [2018-11-18 20:34:54,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {652#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:54,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {652#(= main_~a~0 (_ bv0 32))} assume true; {652#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:54,204 INFO L273 TraceCheckUtils]: 7: Hoare triple {652#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {652#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:54,205 INFO L273 TraceCheckUtils]: 8: Hoare triple {652#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {662#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:34:54,206 INFO L273 TraceCheckUtils]: 9: Hoare triple {662#(= (_ bv1 32) main_~a~0)} assume true; {662#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:34:54,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {633#false} is VALID [2018-11-18 20:34:54,208 INFO L273 TraceCheckUtils]: 11: Hoare triple {633#false} havoc ~i~0;~i~0 := 0bv32; {633#false} is VALID [2018-11-18 20:34:54,209 INFO L273 TraceCheckUtils]: 12: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-18 20:34:54,209 INFO L273 TraceCheckUtils]: 13: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-18 20:34:54,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-18 20:34:54,210 INFO L273 TraceCheckUtils]: 15: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-18 20:34:54,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-18 20:34:54,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-18 20:34:54,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-18 20:34:54,211 INFO L273 TraceCheckUtils]: 19: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-18 20:34:54,211 INFO L273 TraceCheckUtils]: 20: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-18 20:34:54,212 INFO L273 TraceCheckUtils]: 21: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-18 20:34:54,212 INFO L273 TraceCheckUtils]: 22: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-18 20:34:54,212 INFO L273 TraceCheckUtils]: 23: Hoare triple {633#false} havoc ~x~0;~x~0 := 0bv32; {633#false} is VALID [2018-11-18 20:34:54,213 INFO L273 TraceCheckUtils]: 24: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-18 20:34:54,213 INFO L273 TraceCheckUtils]: 25: Hoare triple {633#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {633#false} is VALID [2018-11-18 20:34:54,213 INFO L256 TraceCheckUtils]: 26: Hoare triple {633#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {633#false} is VALID [2018-11-18 20:34:54,214 INFO L273 TraceCheckUtils]: 27: Hoare triple {633#false} ~cond := #in~cond; {633#false} is VALID [2018-11-18 20:34:54,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {633#false} assume 0bv32 == ~cond; {633#false} is VALID [2018-11-18 20:34:54,214 INFO L273 TraceCheckUtils]: 29: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-18 20:34:54,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 20:34:54,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:34:54,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-18 20:34:54,412 INFO L273 TraceCheckUtils]: 28: Hoare triple {633#false} assume 0bv32 == ~cond; {633#false} is VALID [2018-11-18 20:34:54,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {633#false} ~cond := #in~cond; {633#false} is VALID [2018-11-18 20:34:54,413 INFO L256 TraceCheckUtils]: 26: Hoare triple {633#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {633#false} is VALID [2018-11-18 20:34:54,413 INFO L273 TraceCheckUtils]: 25: Hoare triple {633#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {633#false} is VALID [2018-11-18 20:34:54,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-18 20:34:54,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {633#false} havoc ~x~0;~x~0 := 0bv32; {633#false} is VALID [2018-11-18 20:34:54,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-18 20:34:54,414 INFO L273 TraceCheckUtils]: 21: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-18 20:34:54,414 INFO L273 TraceCheckUtils]: 20: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-18 20:34:54,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-18 20:34:54,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-18 20:34:54,415 INFO L273 TraceCheckUtils]: 17: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-18 20:34:54,416 INFO L273 TraceCheckUtils]: 16: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-18 20:34:54,416 INFO L273 TraceCheckUtils]: 15: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-18 20:34:54,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-18 20:34:54,416 INFO L273 TraceCheckUtils]: 13: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-18 20:34:54,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-18 20:34:54,417 INFO L273 TraceCheckUtils]: 11: Hoare triple {633#false} havoc ~i~0;~i~0 := 0bv32; {633#false} is VALID [2018-11-18 20:34:54,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {783#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {633#false} is VALID [2018-11-18 20:34:54,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {783#(bvslt main_~a~0 (_ bv100000 32))} assume true; {783#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-18 20:34:54,426 INFO L273 TraceCheckUtils]: 8: Hoare triple {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {783#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-18 20:34:54,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:54,427 INFO L273 TraceCheckUtils]: 6: Hoare triple {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:54,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:54,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret14 := main(); {632#true} is VALID [2018-11-18 20:34:54,429 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #111#return; {632#true} is VALID [2018-11-18 20:34:54,429 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-18 20:34:54,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {632#true} is VALID [2018-11-18 20:34:54,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-18 20:34:54,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 20:34:54,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:34:54,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 20:34:54,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-18 20:34:54,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:34:54,436 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 20:34:54,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:34:54,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 20:34:54,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 20:34:54,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 20:34:54,628 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 6 states. [2018-11-18 20:34:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:55,033 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-18 20:34:55,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 20:34:55,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-18 20:34:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:34:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 20:34:55,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2018-11-18 20:34:55,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 20:34:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2018-11-18 20:34:55,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2018-11-18 20:34:55,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:34:55,206 INFO L225 Difference]: With dead ends: 76 [2018-11-18 20:34:55,207 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 20:34:55,207 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 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-18 20:34:55,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 20:34:55,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-18 20:34:55,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:34:55,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-18 20:34:55,227 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-18 20:34:55,227 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-18 20:34:55,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:55,231 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-18 20:34:55,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-18 20:34:55,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:34:55,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:34:55,232 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-18 20:34:55,232 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-18 20:34:55,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:55,235 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-18 20:34:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-18 20:34:55,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:34:55,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:34:55,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:34:55,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:34:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 20:34:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-18 20:34:55,239 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 30 [2018-11-18 20:34:55,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:34:55,240 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-18 20:34:55,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 20:34:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-18 20:34:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 20:34:55,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:34:55,242 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:34:55,242 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:34:55,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:34:55,242 INFO L82 PathProgramCache]: Analyzing trace with hash 681615857, now seen corresponding path program 2 times [2018-11-18 20:34:55,243 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:34:55,243 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-18 20:34:55,264 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 20:34:55,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 20:34:55,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 20:34:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:34:55,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:34:55,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {1078#true} call ULTIMATE.init(); {1078#true} is VALID [2018-11-18 20:34:55,423 INFO L273 TraceCheckUtils]: 1: Hoare triple {1078#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1078#true} is VALID [2018-11-18 20:34:55,423 INFO L273 TraceCheckUtils]: 2: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-18 20:34:55,424 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1078#true} {1078#true} #111#return; {1078#true} is VALID [2018-11-18 20:34:55,424 INFO L256 TraceCheckUtils]: 4: Hoare triple {1078#true} call #t~ret14 := main(); {1078#true} is VALID [2018-11-18 20:34:55,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {1078#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1078#true} is VALID [2018-11-18 20:34:55,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-18 20:34:55,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {1078#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1078#true} is VALID [2018-11-18 20:34:55,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {1078#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1078#true} is VALID [2018-11-18 20:34:55,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-18 20:34:55,425 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1078#true} is VALID [2018-11-18 20:34:55,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {1078#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1078#true} is VALID [2018-11-18 20:34:55,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-18 20:34:55,426 INFO L273 TraceCheckUtils]: 13: Hoare triple {1078#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1078#true} is VALID [2018-11-18 20:34:55,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {1078#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1078#true} is VALID [2018-11-18 20:34:55,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-18 20:34:55,427 INFO L273 TraceCheckUtils]: 16: Hoare triple {1078#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1078#true} is VALID [2018-11-18 20:34:55,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {1078#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1078#true} is VALID [2018-11-18 20:34:55,428 INFO L273 TraceCheckUtils]: 18: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-18 20:34:55,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {1078#true} assume !~bvslt32(~a~0, 100000bv32); {1078#true} is VALID [2018-11-18 20:34:55,443 INFO L273 TraceCheckUtils]: 20: Hoare triple {1078#true} havoc ~i~0;~i~0 := 0bv32; {1143#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:34:55,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {1143#(= main_~i~0 (_ bv0 32))} assume true; {1143#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:34:55,445 INFO L273 TraceCheckUtils]: 22: Hoare triple {1143#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1079#false} is VALID [2018-11-18 20:34:55,445 INFO L273 TraceCheckUtils]: 23: Hoare triple {1079#false} ~i~0 := 0bv32; {1079#false} is VALID [2018-11-18 20:34:55,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {1079#false} assume true; {1079#false} is VALID [2018-11-18 20:34:55,445 INFO L273 TraceCheckUtils]: 25: Hoare triple {1079#false} assume !~bvslt32(~i~0, 100000bv32); {1079#false} is VALID [2018-11-18 20:34:55,445 INFO L273 TraceCheckUtils]: 26: Hoare triple {1079#false} ~i~0 := 0bv32; {1079#false} is VALID [2018-11-18 20:34:55,446 INFO L273 TraceCheckUtils]: 27: Hoare triple {1079#false} assume true; {1079#false} is VALID [2018-11-18 20:34:55,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {1079#false} assume !~bvslt32(~i~0, 100000bv32); {1079#false} is VALID [2018-11-18 20:34:55,446 INFO L273 TraceCheckUtils]: 29: Hoare triple {1079#false} ~i~0 := 0bv32; {1079#false} is VALID [2018-11-18 20:34:55,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {1079#false} assume true; {1079#false} is VALID [2018-11-18 20:34:55,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {1079#false} assume !~bvslt32(~i~0, 100000bv32); {1079#false} is VALID [2018-11-18 20:34:55,447 INFO L273 TraceCheckUtils]: 32: Hoare triple {1079#false} havoc ~x~0;~x~0 := 0bv32; {1079#false} is VALID [2018-11-18 20:34:55,448 INFO L273 TraceCheckUtils]: 33: Hoare triple {1079#false} assume true; {1079#false} is VALID [2018-11-18 20:34:55,448 INFO L273 TraceCheckUtils]: 34: Hoare triple {1079#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1079#false} is VALID [2018-11-18 20:34:55,448 INFO L256 TraceCheckUtils]: 35: Hoare triple {1079#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {1079#false} is VALID [2018-11-18 20:34:55,448 INFO L273 TraceCheckUtils]: 36: Hoare triple {1079#false} ~cond := #in~cond; {1079#false} is VALID [2018-11-18 20:34:55,449 INFO L273 TraceCheckUtils]: 37: Hoare triple {1079#false} assume 0bv32 == ~cond; {1079#false} is VALID [2018-11-18 20:34:55,449 INFO L273 TraceCheckUtils]: 38: Hoare triple {1079#false} assume !false; {1079#false} is VALID [2018-11-18 20:34:55,451 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-18 20:34:55,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 20:34:55,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 20:34:55,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 20:34:55,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 20:34:55,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:34:55,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 20:34:55,510 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-18 20:34:55,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 20:34:55,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 20:34:55,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 20:34:55,511 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-11-18 20:34:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:55,747 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-18 20:34:55,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 20:34:55,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-18 20:34:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:34:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 20:34:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-18 20:34:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 20:34:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-18 20:34:55,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2018-11-18 20:34:55,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:34:55,943 INFO L225 Difference]: With dead ends: 84 [2018-11-18 20:34:55,943 INFO L226 Difference]: Without dead ends: 60 [2018-11-18 20:34:55,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-18 20:34:55,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-18 20:34:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-11-18 20:34:55,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:34:55,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 56 states. [2018-11-18 20:34:55,996 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 56 states. [2018-11-18 20:34:55,997 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 56 states. [2018-11-18 20:34:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:56,001 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-18 20:34:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-18 20:34:56,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:34:56,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:34:56,002 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 60 states. [2018-11-18 20:34:56,003 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 60 states. [2018-11-18 20:34:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:56,006 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-18 20:34:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-18 20:34:56,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:34:56,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:34:56,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:34:56,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:34:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-18 20:34:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-18 20:34:56,010 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 39 [2018-11-18 20:34:56,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:34:56,011 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-18 20:34:56,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 20:34:56,011 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-18 20:34:56,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 20:34:56,013 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:34:56,013 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:34:56,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:34:56,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:34:56,014 INFO L82 PathProgramCache]: Analyzing trace with hash 737548907, now seen corresponding path program 1 times [2018-11-18 20:34:56,014 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:34:56,015 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-18 20:34:56,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 20:34:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:34:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:34:56,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:34:56,256 INFO L256 TraceCheckUtils]: 0: Hoare triple {1503#true} call ULTIMATE.init(); {1503#true} is VALID [2018-11-18 20:34:56,257 INFO L273 TraceCheckUtils]: 1: Hoare triple {1503#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1503#true} is VALID [2018-11-18 20:34:56,257 INFO L273 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2018-11-18 20:34:56,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} #111#return; {1503#true} is VALID [2018-11-18 20:34:56,257 INFO L256 TraceCheckUtils]: 4: Hoare triple {1503#true} call #t~ret14 := main(); {1503#true} is VALID [2018-11-18 20:34:56,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {1503#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1523#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:56,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {1523#(= main_~a~0 (_ bv0 32))} assume true; {1523#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:56,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {1523#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1523#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:56,259 INFO L273 TraceCheckUtils]: 8: Hoare triple {1523#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1533#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:34:56,260 INFO L273 TraceCheckUtils]: 9: Hoare triple {1533#(= (_ bv1 32) main_~a~0)} assume true; {1533#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:34:56,262 INFO L273 TraceCheckUtils]: 10: Hoare triple {1533#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1533#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:34:56,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {1533#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1543#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-18 20:34:56,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {1543#(= (_ bv2 32) main_~a~0)} assume true; {1543#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-18 20:34:56,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {1543#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1543#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-18 20:34:56,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {1543#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1553#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-18 20:34:56,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {1553#(= (_ bv3 32) main_~a~0)} assume true; {1553#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-18 20:34:56,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {1553#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1553#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-18 20:34:56,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {1553#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1563#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-18 20:34:56,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {1563#(= (_ bv4 32) main_~a~0)} assume true; {1563#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-18 20:34:56,268 INFO L273 TraceCheckUtils]: 19: Hoare triple {1563#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1504#false} is VALID [2018-11-18 20:34:56,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {1504#false} havoc ~i~0;~i~0 := 0bv32; {1504#false} is VALID [2018-11-18 20:34:56,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1504#false} is VALID [2018-11-18 20:34:56,269 INFO L273 TraceCheckUtils]: 23: Hoare triple {1504#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1504#false} is VALID [2018-11-18 20:34:56,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,270 INFO L273 TraceCheckUtils]: 25: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-18 20:34:56,270 INFO L273 TraceCheckUtils]: 26: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-18 20:34:56,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1504#false} is VALID [2018-11-18 20:34:56,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {1504#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1504#false} is VALID [2018-11-18 20:34:56,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-18 20:34:56,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-18 20:34:56,272 INFO L273 TraceCheckUtils]: 33: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1504#false} is VALID [2018-11-18 20:34:56,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {1504#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1504#false} is VALID [2018-11-18 20:34:56,272 INFO L273 TraceCheckUtils]: 36: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,273 INFO L273 TraceCheckUtils]: 37: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-18 20:34:56,273 INFO L273 TraceCheckUtils]: 38: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-18 20:34:56,273 INFO L273 TraceCheckUtils]: 39: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,273 INFO L273 TraceCheckUtils]: 40: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {1504#false} is VALID [2018-11-18 20:34:56,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {1504#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1504#false} is VALID [2018-11-18 20:34:56,274 INFO L273 TraceCheckUtils]: 42: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,274 INFO L273 TraceCheckUtils]: 43: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-18 20:34:56,274 INFO L273 TraceCheckUtils]: 44: Hoare triple {1504#false} havoc ~x~0;~x~0 := 0bv32; {1504#false} is VALID [2018-11-18 20:34:56,275 INFO L273 TraceCheckUtils]: 45: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,275 INFO L273 TraceCheckUtils]: 46: Hoare triple {1504#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1504#false} is VALID [2018-11-18 20:34:56,275 INFO L256 TraceCheckUtils]: 47: Hoare triple {1504#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {1504#false} is VALID [2018-11-18 20:34:56,276 INFO L273 TraceCheckUtils]: 48: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2018-11-18 20:34:56,276 INFO L273 TraceCheckUtils]: 49: Hoare triple {1504#false} assume 0bv32 == ~cond; {1504#false} is VALID [2018-11-18 20:34:56,276 INFO L273 TraceCheckUtils]: 50: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2018-11-18 20:34:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 20:34:56,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:34:56,535 INFO L273 TraceCheckUtils]: 50: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2018-11-18 20:34:56,536 INFO L273 TraceCheckUtils]: 49: Hoare triple {1504#false} assume 0bv32 == ~cond; {1504#false} is VALID [2018-11-18 20:34:56,536 INFO L273 TraceCheckUtils]: 48: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2018-11-18 20:34:56,537 INFO L256 TraceCheckUtils]: 47: Hoare triple {1504#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {1504#false} is VALID [2018-11-18 20:34:56,537 INFO L273 TraceCheckUtils]: 46: Hoare triple {1504#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1504#false} is VALID [2018-11-18 20:34:56,538 INFO L273 TraceCheckUtils]: 45: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,538 INFO L273 TraceCheckUtils]: 44: Hoare triple {1504#false} havoc ~x~0;~x~0 := 0bv32; {1504#false} is VALID [2018-11-18 20:34:56,538 INFO L273 TraceCheckUtils]: 43: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-18 20:34:56,538 INFO L273 TraceCheckUtils]: 42: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,539 INFO L273 TraceCheckUtils]: 41: Hoare triple {1504#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1504#false} is VALID [2018-11-18 20:34:56,539 INFO L273 TraceCheckUtils]: 40: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {1504#false} is VALID [2018-11-18 20:34:56,539 INFO L273 TraceCheckUtils]: 39: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,540 INFO L273 TraceCheckUtils]: 38: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-18 20:34:56,540 INFO L273 TraceCheckUtils]: 37: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-18 20:34:56,540 INFO L273 TraceCheckUtils]: 36: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,540 INFO L273 TraceCheckUtils]: 35: Hoare triple {1504#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1504#false} is VALID [2018-11-18 20:34:56,541 INFO L273 TraceCheckUtils]: 34: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {1504#false} is VALID [2018-11-18 20:34:56,541 INFO L273 TraceCheckUtils]: 33: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,541 INFO L273 TraceCheckUtils]: 32: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-18 20:34:56,541 INFO L273 TraceCheckUtils]: 31: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-18 20:34:56,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,542 INFO L273 TraceCheckUtils]: 29: Hoare triple {1504#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1504#false} is VALID [2018-11-18 20:34:56,542 INFO L273 TraceCheckUtils]: 28: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {1504#false} is VALID [2018-11-18 20:34:56,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,543 INFO L273 TraceCheckUtils]: 26: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-18 20:34:56,543 INFO L273 TraceCheckUtils]: 25: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-18 20:34:56,543 INFO L273 TraceCheckUtils]: 24: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {1504#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1504#false} is VALID [2018-11-18 20:34:56,544 INFO L273 TraceCheckUtils]: 22: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {1504#false} is VALID [2018-11-18 20:34:56,544 INFO L273 TraceCheckUtils]: 21: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-18 20:34:56,544 INFO L273 TraceCheckUtils]: 20: Hoare triple {1504#false} havoc ~i~0;~i~0 := 0bv32; {1504#false} is VALID [2018-11-18 20:34:56,546 INFO L273 TraceCheckUtils]: 19: Hoare triple {1756#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1504#false} is VALID [2018-11-18 20:34:56,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {1756#(bvslt main_~a~0 (_ bv100000 32))} assume true; {1756#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-18 20:34:56,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1756#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-18 20:34:56,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,556 INFO L273 TraceCheckUtils]: 15: Hoare triple {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,567 INFO L273 TraceCheckUtils]: 10: Hoare triple {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {1503#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:56,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {1503#true} call #t~ret14 := main(); {1503#true} is VALID [2018-11-18 20:34:56,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} #111#return; {1503#true} is VALID [2018-11-18 20:34:56,576 INFO L273 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2018-11-18 20:34:56,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {1503#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1503#true} is VALID [2018-11-18 20:34:56,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {1503#true} call ULTIMATE.init(); {1503#true} is VALID [2018-11-18 20:34:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 20:34:56,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:34:56,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 20:34:56,595 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-18 20:34:56,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:34:56,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 20:34:56,726 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-18 20:34:56,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 20:34:56,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 20:34:56,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-18 20:34:56,727 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 12 states. [2018-11-18 20:34:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:57,956 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2018-11-18 20:34:57,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 20:34:57,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-18 20:34:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:34:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 20:34:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-18 20:34:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 20:34:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-18 20:34:57,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2018-11-18 20:34:58,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:34:58,199 INFO L225 Difference]: With dead ends: 110 [2018-11-18 20:34:58,200 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 20:34:58,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-18 20:34:58,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 20:34:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-18 20:34:58,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:34:58,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-18 20:34:58,234 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-18 20:34:58,235 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-18 20:34:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:58,239 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-18 20:34:58,239 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-18 20:34:58,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:34:58,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:34:58,240 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-18 20:34:58,240 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-18 20:34:58,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:34:58,243 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-18 20:34:58,244 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-18 20:34:58,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:34:58,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:34:58,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:34:58,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:34:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-18 20:34:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-11-18 20:34:58,248 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 51 [2018-11-18 20:34:58,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:34:58,248 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-11-18 20:34:58,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 20:34:58,249 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-18 20:34:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-18 20:34:58,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:34:58,251 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:34:58,251 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:34:58,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:34:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1996062837, now seen corresponding path program 2 times [2018-11-18 20:34:58,252 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:34:58,252 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-18 20:34:58,280 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 20:34:58,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 20:34:58,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 20:34:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:34:58,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:34:58,752 INFO L256 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2018-11-18 20:34:58,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {2223#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2223#true} is VALID [2018-11-18 20:34:58,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2018-11-18 20:34:58,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #111#return; {2223#true} is VALID [2018-11-18 20:34:58,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret14 := main(); {2223#true} is VALID [2018-11-18 20:34:58,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {2223#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2243#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:58,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {2243#(= main_~a~0 (_ bv0 32))} assume true; {2243#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:58,759 INFO L273 TraceCheckUtils]: 7: Hoare triple {2243#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2243#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:34:58,760 INFO L273 TraceCheckUtils]: 8: Hoare triple {2243#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2253#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:34:58,760 INFO L273 TraceCheckUtils]: 9: Hoare triple {2253#(= (_ bv1 32) main_~a~0)} assume true; {2253#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:34:58,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {2253#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2253#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:34:58,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {2253#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2263#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-18 20:34:58,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {2263#(= (_ bv2 32) main_~a~0)} assume true; {2263#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-18 20:34:58,762 INFO L273 TraceCheckUtils]: 13: Hoare triple {2263#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2263#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-18 20:34:58,762 INFO L273 TraceCheckUtils]: 14: Hoare triple {2263#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2273#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-18 20:34:58,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {2273#(= (_ bv3 32) main_~a~0)} assume true; {2273#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-18 20:34:58,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {2273#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2273#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-18 20:34:58,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {2273#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2283#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-18 20:34:58,765 INFO L273 TraceCheckUtils]: 18: Hoare triple {2283#(= (_ bv4 32) main_~a~0)} assume true; {2283#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-18 20:34:58,766 INFO L273 TraceCheckUtils]: 19: Hoare triple {2283#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2283#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-18 20:34:58,767 INFO L273 TraceCheckUtils]: 20: Hoare triple {2283#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2293#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-18 20:34:58,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {2293#(= (_ bv5 32) main_~a~0)} assume true; {2293#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-18 20:34:58,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {2293#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2293#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-18 20:34:58,769 INFO L273 TraceCheckUtils]: 23: Hoare triple {2293#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2303#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-18 20:34:58,770 INFO L273 TraceCheckUtils]: 24: Hoare triple {2303#(= (_ bv6 32) main_~a~0)} assume true; {2303#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-18 20:34:58,771 INFO L273 TraceCheckUtils]: 25: Hoare triple {2303#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2303#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-18 20:34:58,772 INFO L273 TraceCheckUtils]: 26: Hoare triple {2303#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2313#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-18 20:34:58,772 INFO L273 TraceCheckUtils]: 27: Hoare triple {2313#(= (_ bv7 32) main_~a~0)} assume true; {2313#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-18 20:34:58,773 INFO L273 TraceCheckUtils]: 28: Hoare triple {2313#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2313#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-18 20:34:58,773 INFO L273 TraceCheckUtils]: 29: Hoare triple {2313#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2323#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-18 20:34:58,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {2323#(= (_ bv8 32) main_~a~0)} assume true; {2323#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-18 20:34:58,774 INFO L273 TraceCheckUtils]: 31: Hoare triple {2323#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2323#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-18 20:34:58,775 INFO L273 TraceCheckUtils]: 32: Hoare triple {2323#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-18 20:34:58,776 INFO L273 TraceCheckUtils]: 33: Hoare triple {2333#(= (_ bv9 32) main_~a~0)} assume true; {2333#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-18 20:34:58,776 INFO L273 TraceCheckUtils]: 34: Hoare triple {2333#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2333#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-18 20:34:58,777 INFO L273 TraceCheckUtils]: 35: Hoare triple {2333#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2343#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-18 20:34:58,778 INFO L273 TraceCheckUtils]: 36: Hoare triple {2343#(= (_ bv10 32) main_~a~0)} assume true; {2343#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-18 20:34:58,781 INFO L273 TraceCheckUtils]: 37: Hoare triple {2343#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {2224#false} is VALID [2018-11-18 20:34:58,781 INFO L273 TraceCheckUtils]: 38: Hoare triple {2224#false} havoc ~i~0;~i~0 := 0bv32; {2224#false} is VALID [2018-11-18 20:34:58,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:58,782 INFO L273 TraceCheckUtils]: 40: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2224#false} is VALID [2018-11-18 20:34:58,782 INFO L273 TraceCheckUtils]: 41: Hoare triple {2224#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2224#false} is VALID [2018-11-18 20:34:58,783 INFO L273 TraceCheckUtils]: 42: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:58,783 INFO L273 TraceCheckUtils]: 43: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-18 20:34:58,783 INFO L273 TraceCheckUtils]: 44: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-18 20:34:58,783 INFO L273 TraceCheckUtils]: 45: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:58,784 INFO L273 TraceCheckUtils]: 46: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2224#false} is VALID [2018-11-18 20:34:58,784 INFO L273 TraceCheckUtils]: 47: Hoare triple {2224#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2224#false} is VALID [2018-11-18 20:34:58,784 INFO L273 TraceCheckUtils]: 48: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:58,784 INFO L273 TraceCheckUtils]: 49: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-18 20:34:58,785 INFO L273 TraceCheckUtils]: 50: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-18 20:34:58,785 INFO L273 TraceCheckUtils]: 51: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:58,785 INFO L273 TraceCheckUtils]: 52: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {2224#false} is VALID [2018-11-18 20:34:58,785 INFO L273 TraceCheckUtils]: 53: Hoare triple {2224#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2224#false} is VALID [2018-11-18 20:34:58,786 INFO L273 TraceCheckUtils]: 54: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:58,786 INFO L273 TraceCheckUtils]: 55: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-18 20:34:58,786 INFO L273 TraceCheckUtils]: 56: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-18 20:34:58,786 INFO L273 TraceCheckUtils]: 57: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:58,787 INFO L273 TraceCheckUtils]: 58: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {2224#false} is VALID [2018-11-18 20:34:58,787 INFO L273 TraceCheckUtils]: 59: Hoare triple {2224#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2224#false} is VALID [2018-11-18 20:34:58,787 INFO L273 TraceCheckUtils]: 60: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:58,787 INFO L273 TraceCheckUtils]: 61: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-18 20:34:58,788 INFO L273 TraceCheckUtils]: 62: Hoare triple {2224#false} havoc ~x~0;~x~0 := 0bv32; {2224#false} is VALID [2018-11-18 20:34:58,788 INFO L273 TraceCheckUtils]: 63: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:58,788 INFO L273 TraceCheckUtils]: 64: Hoare triple {2224#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2224#false} is VALID [2018-11-18 20:34:58,789 INFO L256 TraceCheckUtils]: 65: Hoare triple {2224#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {2224#false} is VALID [2018-11-18 20:34:58,789 INFO L273 TraceCheckUtils]: 66: Hoare triple {2224#false} ~cond := #in~cond; {2224#false} is VALID [2018-11-18 20:34:58,789 INFO L273 TraceCheckUtils]: 67: Hoare triple {2224#false} assume 0bv32 == ~cond; {2224#false} is VALID [2018-11-18 20:34:58,789 INFO L273 TraceCheckUtils]: 68: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2018-11-18 20:34:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 20:34:58,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:34:59,639 INFO L273 TraceCheckUtils]: 68: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2018-11-18 20:34:59,639 INFO L273 TraceCheckUtils]: 67: Hoare triple {2224#false} assume 0bv32 == ~cond; {2224#false} is VALID [2018-11-18 20:34:59,639 INFO L273 TraceCheckUtils]: 66: Hoare triple {2224#false} ~cond := #in~cond; {2224#false} is VALID [2018-11-18 20:34:59,640 INFO L256 TraceCheckUtils]: 65: Hoare triple {2224#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {2224#false} is VALID [2018-11-18 20:34:59,640 INFO L273 TraceCheckUtils]: 64: Hoare triple {2224#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2224#false} is VALID [2018-11-18 20:34:59,640 INFO L273 TraceCheckUtils]: 63: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:59,640 INFO L273 TraceCheckUtils]: 62: Hoare triple {2224#false} havoc ~x~0;~x~0 := 0bv32; {2224#false} is VALID [2018-11-18 20:34:59,640 INFO L273 TraceCheckUtils]: 61: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-18 20:34:59,640 INFO L273 TraceCheckUtils]: 60: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:59,641 INFO L273 TraceCheckUtils]: 59: Hoare triple {2224#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2224#false} is VALID [2018-11-18 20:34:59,641 INFO L273 TraceCheckUtils]: 58: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {2224#false} is VALID [2018-11-18 20:34:59,641 INFO L273 TraceCheckUtils]: 57: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:59,641 INFO L273 TraceCheckUtils]: 56: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-18 20:34:59,641 INFO L273 TraceCheckUtils]: 55: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-18 20:34:59,641 INFO L273 TraceCheckUtils]: 54: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:59,641 INFO L273 TraceCheckUtils]: 53: Hoare triple {2224#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2224#false} is VALID [2018-11-18 20:34:59,642 INFO L273 TraceCheckUtils]: 52: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {2224#false} is VALID [2018-11-18 20:34:59,642 INFO L273 TraceCheckUtils]: 51: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:59,642 INFO L273 TraceCheckUtils]: 50: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-18 20:34:59,642 INFO L273 TraceCheckUtils]: 49: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-18 20:34:59,642 INFO L273 TraceCheckUtils]: 48: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:59,642 INFO L273 TraceCheckUtils]: 47: Hoare triple {2224#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2224#false} is VALID [2018-11-18 20:34:59,643 INFO L273 TraceCheckUtils]: 46: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {2224#false} is VALID [2018-11-18 20:34:59,643 INFO L273 TraceCheckUtils]: 45: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:59,643 INFO L273 TraceCheckUtils]: 44: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-18 20:34:59,643 INFO L273 TraceCheckUtils]: 43: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-18 20:34:59,643 INFO L273 TraceCheckUtils]: 42: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:59,643 INFO L273 TraceCheckUtils]: 41: Hoare triple {2224#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2224#false} is VALID [2018-11-18 20:34:59,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {2224#false} is VALID [2018-11-18 20:34:59,644 INFO L273 TraceCheckUtils]: 39: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-18 20:34:59,644 INFO L273 TraceCheckUtils]: 38: Hoare triple {2224#false} havoc ~i~0;~i~0 := 0bv32; {2224#false} is VALID [2018-11-18 20:34:59,645 INFO L273 TraceCheckUtils]: 37: Hoare triple {2536#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {2224#false} is VALID [2018-11-18 20:34:59,647 INFO L273 TraceCheckUtils]: 36: Hoare triple {2536#(bvslt main_~a~0 (_ bv100000 32))} assume true; {2536#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-18 20:34:59,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2536#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-18 20:34:59,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,659 INFO L273 TraceCheckUtils]: 33: Hoare triple {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,663 INFO L273 TraceCheckUtils]: 32: Hoare triple {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,664 INFO L273 TraceCheckUtils]: 31: Hoare triple {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,664 INFO L273 TraceCheckUtils]: 30: Hoare triple {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,670 INFO L273 TraceCheckUtils]: 29: Hoare triple {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,672 INFO L273 TraceCheckUtils]: 28: Hoare triple {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,672 INFO L273 TraceCheckUtils]: 27: Hoare triple {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,681 INFO L273 TraceCheckUtils]: 24: Hoare triple {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,690 INFO L273 TraceCheckUtils]: 21: Hoare triple {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume true; {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,695 INFO L273 TraceCheckUtils]: 20: Hoare triple {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,696 INFO L273 TraceCheckUtils]: 19: Hoare triple {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume true; {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,704 INFO L273 TraceCheckUtils]: 17: Hoare triple {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,705 INFO L273 TraceCheckUtils]: 15: Hoare triple {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume true; {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,711 INFO L273 TraceCheckUtils]: 13: Hoare triple {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume true; {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume true; {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume true; {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,733 INFO L273 TraceCheckUtils]: 5: Hoare triple {2223#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:34:59,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret14 := main(); {2223#true} is VALID [2018-11-18 20:34:59,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #111#return; {2223#true} is VALID [2018-11-18 20:34:59,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2018-11-18 20:34:59,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {2223#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2223#true} is VALID [2018-11-18 20:34:59,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2018-11-18 20:34:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 20:34:59,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:34:59,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-18 20:34:59,744 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2018-11-18 20:34:59,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:34:59,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 20:34:59,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:34:59,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 20:34:59,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 20:34:59,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-18 20:34:59,942 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 24 states. [2018-11-18 20:35:04,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:35:04,503 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2018-11-18 20:35:04,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 20:35:04,503 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2018-11-18 20:35:04,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:35:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 20:35:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 151 transitions. [2018-11-18 20:35:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 20:35:04,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 151 transitions. [2018-11-18 20:35:04,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 151 transitions. [2018-11-18 20:35:04,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:35:04,879 INFO L225 Difference]: With dead ends: 146 [2018-11-18 20:35:04,879 INFO L226 Difference]: Without dead ends: 110 [2018-11-18 20:35:04,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 115 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-18 20:35:04,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-18 20:35:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-18 20:35:04,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:35:04,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 110 states. [2018-11-18 20:35:04,944 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-18 20:35:04,944 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-18 20:35:04,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:35:04,948 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-11-18 20:35:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-11-18 20:35:04,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:35:04,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:35:04,949 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-18 20:35:04,949 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-18 20:35:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:35:04,953 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-11-18 20:35:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-11-18 20:35:04,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:35:04,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:35:04,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:35:04,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:35:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-18 20:35:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2018-11-18 20:35:04,958 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 69 [2018-11-18 20:35:04,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:35:04,958 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2018-11-18 20:35:04,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 20:35:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-11-18 20:35:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 20:35:04,960 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:35:04,960 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:35:04,961 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:35:04,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:35:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1886400971, now seen corresponding path program 3 times [2018-11-18 20:35:04,961 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:35:04,961 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-18 20:35:04,989 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 20:35:05,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 20:35:05,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 20:35:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:35:05,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:35:05,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {3243#true} call ULTIMATE.init(); {3243#true} is VALID [2018-11-18 20:35:05,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {3243#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3243#true} is VALID [2018-11-18 20:35:05,240 INFO L273 TraceCheckUtils]: 2: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3243#true} {3243#true} #111#return; {3243#true} is VALID [2018-11-18 20:35:05,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {3243#true} call #t~ret14 := main(); {3243#true} is VALID [2018-11-18 20:35:05,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {3243#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3243#true} is VALID [2018-11-18 20:35:05,241 INFO L273 TraceCheckUtils]: 6: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,241 INFO L273 TraceCheckUtils]: 7: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,242 INFO L273 TraceCheckUtils]: 8: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,242 INFO L273 TraceCheckUtils]: 9: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,242 INFO L273 TraceCheckUtils]: 11: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,242 INFO L273 TraceCheckUtils]: 12: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,242 INFO L273 TraceCheckUtils]: 14: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,243 INFO L273 TraceCheckUtils]: 20: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,243 INFO L273 TraceCheckUtils]: 21: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,243 INFO L273 TraceCheckUtils]: 22: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,244 INFO L273 TraceCheckUtils]: 23: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,244 INFO L273 TraceCheckUtils]: 25: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,244 INFO L273 TraceCheckUtils]: 26: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,244 INFO L273 TraceCheckUtils]: 27: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,244 INFO L273 TraceCheckUtils]: 29: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,245 INFO L273 TraceCheckUtils]: 30: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,245 INFO L273 TraceCheckUtils]: 31: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,245 INFO L273 TraceCheckUtils]: 33: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,245 INFO L273 TraceCheckUtils]: 34: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,245 INFO L273 TraceCheckUtils]: 35: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,245 INFO L273 TraceCheckUtils]: 36: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,246 INFO L273 TraceCheckUtils]: 37: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,246 INFO L273 TraceCheckUtils]: 38: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,246 INFO L273 TraceCheckUtils]: 39: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,246 INFO L273 TraceCheckUtils]: 40: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,246 INFO L273 TraceCheckUtils]: 41: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,247 INFO L273 TraceCheckUtils]: 42: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,247 INFO L273 TraceCheckUtils]: 43: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,247 INFO L273 TraceCheckUtils]: 44: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,247 INFO L273 TraceCheckUtils]: 45: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,247 INFO L273 TraceCheckUtils]: 46: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,248 INFO L273 TraceCheckUtils]: 50: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,248 INFO L273 TraceCheckUtils]: 51: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,248 INFO L273 TraceCheckUtils]: 52: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,249 INFO L273 TraceCheckUtils]: 53: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,249 INFO L273 TraceCheckUtils]: 54: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,249 INFO L273 TraceCheckUtils]: 55: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,249 INFO L273 TraceCheckUtils]: 56: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,249 INFO L273 TraceCheckUtils]: 57: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,250 INFO L273 TraceCheckUtils]: 58: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,250 INFO L273 TraceCheckUtils]: 59: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,250 INFO L273 TraceCheckUtils]: 60: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,250 INFO L273 TraceCheckUtils]: 61: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,250 INFO L273 TraceCheckUtils]: 62: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,250 INFO L273 TraceCheckUtils]: 63: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,251 INFO L273 TraceCheckUtils]: 64: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,251 INFO L273 TraceCheckUtils]: 65: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,251 INFO L273 TraceCheckUtils]: 66: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,251 INFO L273 TraceCheckUtils]: 67: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,251 INFO L273 TraceCheckUtils]: 68: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,252 INFO L273 TraceCheckUtils]: 69: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,252 INFO L273 TraceCheckUtils]: 70: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,252 INFO L273 TraceCheckUtils]: 71: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,252 INFO L273 TraceCheckUtils]: 72: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,252 INFO L273 TraceCheckUtils]: 73: Hoare triple {3243#true} assume !~bvslt32(~a~0, 100000bv32); {3243#true} is VALID [2018-11-18 20:35:05,253 INFO L273 TraceCheckUtils]: 74: Hoare triple {3243#true} havoc ~i~0;~i~0 := 0bv32; {3470#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:35:05,253 INFO L273 TraceCheckUtils]: 75: Hoare triple {3470#(= main_~i~0 (_ bv0 32))} assume true; {3470#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:35:05,256 INFO L273 TraceCheckUtils]: 76: Hoare triple {3470#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3470#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:35:05,256 INFO L273 TraceCheckUtils]: 77: Hoare triple {3470#(= main_~i~0 (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3480#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:35:05,259 INFO L273 TraceCheckUtils]: 78: Hoare triple {3480#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3480#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:35:05,259 INFO L273 TraceCheckUtils]: 79: Hoare triple {3480#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-18 20:35:05,259 INFO L273 TraceCheckUtils]: 80: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-18 20:35:05,259 INFO L273 TraceCheckUtils]: 81: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,259 INFO L273 TraceCheckUtils]: 82: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3244#false} is VALID [2018-11-18 20:35:05,260 INFO L273 TraceCheckUtils]: 83: Hoare triple {3244#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3244#false} is VALID [2018-11-18 20:35:05,260 INFO L273 TraceCheckUtils]: 84: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,260 INFO L273 TraceCheckUtils]: 85: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-18 20:35:05,260 INFO L273 TraceCheckUtils]: 86: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-18 20:35:05,260 INFO L273 TraceCheckUtils]: 87: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,260 INFO L273 TraceCheckUtils]: 88: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3244#false} is VALID [2018-11-18 20:35:05,260 INFO L273 TraceCheckUtils]: 89: Hoare triple {3244#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3244#false} is VALID [2018-11-18 20:35:05,261 INFO L273 TraceCheckUtils]: 90: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,261 INFO L273 TraceCheckUtils]: 91: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-18 20:35:05,261 INFO L273 TraceCheckUtils]: 92: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-18 20:35:05,261 INFO L273 TraceCheckUtils]: 93: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,261 INFO L273 TraceCheckUtils]: 94: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3244#false} is VALID [2018-11-18 20:35:05,262 INFO L273 TraceCheckUtils]: 95: Hoare triple {3244#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3244#false} is VALID [2018-11-18 20:35:05,262 INFO L273 TraceCheckUtils]: 96: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,262 INFO L273 TraceCheckUtils]: 97: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-18 20:35:05,262 INFO L273 TraceCheckUtils]: 98: Hoare triple {3244#false} havoc ~x~0;~x~0 := 0bv32; {3244#false} is VALID [2018-11-18 20:35:05,262 INFO L273 TraceCheckUtils]: 99: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,262 INFO L273 TraceCheckUtils]: 100: Hoare triple {3244#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3244#false} is VALID [2018-11-18 20:35:05,262 INFO L256 TraceCheckUtils]: 101: Hoare triple {3244#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {3244#false} is VALID [2018-11-18 20:35:05,263 INFO L273 TraceCheckUtils]: 102: Hoare triple {3244#false} ~cond := #in~cond; {3244#false} is VALID [2018-11-18 20:35:05,263 INFO L273 TraceCheckUtils]: 103: Hoare triple {3244#false} assume 0bv32 == ~cond; {3244#false} is VALID [2018-11-18 20:35:05,263 INFO L273 TraceCheckUtils]: 104: Hoare triple {3244#false} assume !false; {3244#false} is VALID [2018-11-18 20:35:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-11-18 20:35:05,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:35:05,396 INFO L273 TraceCheckUtils]: 104: Hoare triple {3244#false} assume !false; {3244#false} is VALID [2018-11-18 20:35:05,397 INFO L273 TraceCheckUtils]: 103: Hoare triple {3244#false} assume 0bv32 == ~cond; {3244#false} is VALID [2018-11-18 20:35:05,397 INFO L273 TraceCheckUtils]: 102: Hoare triple {3244#false} ~cond := #in~cond; {3244#false} is VALID [2018-11-18 20:35:05,397 INFO L256 TraceCheckUtils]: 101: Hoare triple {3244#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {3244#false} is VALID [2018-11-18 20:35:05,398 INFO L273 TraceCheckUtils]: 100: Hoare triple {3244#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3244#false} is VALID [2018-11-18 20:35:05,398 INFO L273 TraceCheckUtils]: 99: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,398 INFO L273 TraceCheckUtils]: 98: Hoare triple {3244#false} havoc ~x~0;~x~0 := 0bv32; {3244#false} is VALID [2018-11-18 20:35:05,398 INFO L273 TraceCheckUtils]: 97: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-18 20:35:05,398 INFO L273 TraceCheckUtils]: 96: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,399 INFO L273 TraceCheckUtils]: 95: Hoare triple {3244#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3244#false} is VALID [2018-11-18 20:35:05,399 INFO L273 TraceCheckUtils]: 94: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {3244#false} is VALID [2018-11-18 20:35:05,399 INFO L273 TraceCheckUtils]: 93: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,399 INFO L273 TraceCheckUtils]: 92: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-18 20:35:05,399 INFO L273 TraceCheckUtils]: 91: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-18 20:35:05,399 INFO L273 TraceCheckUtils]: 90: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,399 INFO L273 TraceCheckUtils]: 89: Hoare triple {3244#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3244#false} is VALID [2018-11-18 20:35:05,399 INFO L273 TraceCheckUtils]: 88: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {3244#false} is VALID [2018-11-18 20:35:05,400 INFO L273 TraceCheckUtils]: 87: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,400 INFO L273 TraceCheckUtils]: 86: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-18 20:35:05,400 INFO L273 TraceCheckUtils]: 85: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-18 20:35:05,400 INFO L273 TraceCheckUtils]: 84: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,400 INFO L273 TraceCheckUtils]: 83: Hoare triple {3244#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3244#false} is VALID [2018-11-18 20:35:05,401 INFO L273 TraceCheckUtils]: 82: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {3244#false} is VALID [2018-11-18 20:35:05,401 INFO L273 TraceCheckUtils]: 81: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-18 20:35:05,401 INFO L273 TraceCheckUtils]: 80: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-18 20:35:05,416 INFO L273 TraceCheckUtils]: 79: Hoare triple {3637#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-18 20:35:05,416 INFO L273 TraceCheckUtils]: 78: Hoare triple {3637#(bvslt main_~i~0 (_ bv100000 32))} assume true; {3637#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-18 20:35:05,417 INFO L273 TraceCheckUtils]: 77: Hoare triple {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3637#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-18 20:35:05,417 INFO L273 TraceCheckUtils]: 76: Hoare triple {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:05,418 INFO L273 TraceCheckUtils]: 75: Hoare triple {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:05,418 INFO L273 TraceCheckUtils]: 74: Hoare triple {3243#true} havoc ~i~0;~i~0 := 0bv32; {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:05,418 INFO L273 TraceCheckUtils]: 73: Hoare triple {3243#true} assume !~bvslt32(~a~0, 100000bv32); {3243#true} is VALID [2018-11-18 20:35:05,418 INFO L273 TraceCheckUtils]: 72: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,419 INFO L273 TraceCheckUtils]: 71: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,419 INFO L273 TraceCheckUtils]: 70: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,419 INFO L273 TraceCheckUtils]: 69: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,419 INFO L273 TraceCheckUtils]: 68: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,419 INFO L273 TraceCheckUtils]: 67: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,420 INFO L273 TraceCheckUtils]: 66: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,420 INFO L273 TraceCheckUtils]: 65: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,420 INFO L273 TraceCheckUtils]: 64: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,420 INFO L273 TraceCheckUtils]: 63: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,420 INFO L273 TraceCheckUtils]: 62: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,421 INFO L273 TraceCheckUtils]: 60: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,421 INFO L273 TraceCheckUtils]: 59: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,421 INFO L273 TraceCheckUtils]: 58: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,421 INFO L273 TraceCheckUtils]: 57: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,421 INFO L273 TraceCheckUtils]: 56: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,422 INFO L273 TraceCheckUtils]: 54: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,422 INFO L273 TraceCheckUtils]: 53: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,422 INFO L273 TraceCheckUtils]: 52: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,422 INFO L273 TraceCheckUtils]: 51: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,422 INFO L273 TraceCheckUtils]: 50: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,423 INFO L273 TraceCheckUtils]: 49: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,423 INFO L273 TraceCheckUtils]: 48: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,423 INFO L273 TraceCheckUtils]: 47: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,423 INFO L273 TraceCheckUtils]: 46: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,423 INFO L273 TraceCheckUtils]: 45: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,423 INFO L273 TraceCheckUtils]: 44: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,424 INFO L273 TraceCheckUtils]: 43: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,424 INFO L273 TraceCheckUtils]: 42: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,424 INFO L273 TraceCheckUtils]: 41: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,424 INFO L273 TraceCheckUtils]: 40: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,424 INFO L273 TraceCheckUtils]: 39: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,424 INFO L273 TraceCheckUtils]: 38: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,425 INFO L273 TraceCheckUtils]: 37: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,425 INFO L273 TraceCheckUtils]: 36: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,425 INFO L273 TraceCheckUtils]: 35: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,425 INFO L273 TraceCheckUtils]: 34: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,425 INFO L273 TraceCheckUtils]: 33: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,425 INFO L273 TraceCheckUtils]: 32: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,426 INFO L273 TraceCheckUtils]: 31: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,426 INFO L273 TraceCheckUtils]: 30: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,426 INFO L273 TraceCheckUtils]: 29: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,426 INFO L273 TraceCheckUtils]: 28: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,427 INFO L273 TraceCheckUtils]: 24: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,427 INFO L273 TraceCheckUtils]: 23: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,427 INFO L273 TraceCheckUtils]: 22: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,427 INFO L273 TraceCheckUtils]: 21: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,428 INFO L273 TraceCheckUtils]: 19: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,428 INFO L273 TraceCheckUtils]: 18: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,428 INFO L273 TraceCheckUtils]: 17: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,428 INFO L273 TraceCheckUtils]: 16: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,428 INFO L273 TraceCheckUtils]: 15: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,429 INFO L273 TraceCheckUtils]: 14: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,429 INFO L273 TraceCheckUtils]: 10: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-18 20:35:05,430 INFO L273 TraceCheckUtils]: 7: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {3243#true} is VALID [2018-11-18 20:35:05,430 INFO L273 TraceCheckUtils]: 6: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,430 INFO L273 TraceCheckUtils]: 5: Hoare triple {3243#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3243#true} is VALID [2018-11-18 20:35:05,430 INFO L256 TraceCheckUtils]: 4: Hoare triple {3243#true} call #t~ret14 := main(); {3243#true} is VALID [2018-11-18 20:35:05,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3243#true} {3243#true} #111#return; {3243#true} is VALID [2018-11-18 20:35:05,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-18 20:35:05,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {3243#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3243#true} is VALID [2018-11-18 20:35:05,431 INFO L256 TraceCheckUtils]: 0: Hoare triple {3243#true} call ULTIMATE.init(); {3243#true} is VALID [2018-11-18 20:35:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-11-18 20:35:05,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:35:05,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 20:35:05,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-18 20:35:05,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:35:05,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 20:35:05,497 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:35:05,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 20:35:05,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 20:35:05,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 20:35:05,499 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 6 states. [2018-11-18 20:35:06,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:35:06,111 INFO L93 Difference]: Finished difference Result 176 states and 196 transitions. [2018-11-18 20:35:06,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 20:35:06,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-18 20:35:06,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:35:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 20:35:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2018-11-18 20:35:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 20:35:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2018-11-18 20:35:06,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 125 transitions. [2018-11-18 20:35:06,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:35:06,310 INFO L225 Difference]: With dead ends: 176 [2018-11-18 20:35:06,310 INFO L226 Difference]: Without dead ends: 146 [2018-11-18 20:35:06,311 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 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-18 20:35:06,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-18 20:35:06,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-18 20:35:06,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:35:06,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 146 states. [2018-11-18 20:35:06,376 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 146 states. [2018-11-18 20:35:06,376 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 146 states. [2018-11-18 20:35:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:35:06,381 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-11-18 20:35:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2018-11-18 20:35:06,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:35:06,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:35:06,382 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 146 states. [2018-11-18 20:35:06,382 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 146 states. [2018-11-18 20:35:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:35:06,387 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-11-18 20:35:06,387 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2018-11-18 20:35:06,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:35:06,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:35:06,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:35:06,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:35:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-18 20:35:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 151 transitions. [2018-11-18 20:35:06,393 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 151 transitions. Word has length 105 [2018-11-18 20:35:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:35:06,393 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 151 transitions. [2018-11-18 20:35:06,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 20:35:06,393 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2018-11-18 20:35:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-18 20:35:06,395 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:35:06,395 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:35:06,395 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:35:06,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:35:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1873047343, now seen corresponding path program 4 times [2018-11-18 20:35:06,396 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:35:06,396 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 20:35:06,417 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 20:35:06,557 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 20:35:06,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 20:35:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:35:06,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:35:07,170 INFO L256 TraceCheckUtils]: 0: Hoare triple {4603#true} call ULTIMATE.init(); {4603#true} is VALID [2018-11-18 20:35:07,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {4603#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4603#true} is VALID [2018-11-18 20:35:07,171 INFO L273 TraceCheckUtils]: 2: Hoare triple {4603#true} assume true; {4603#true} is VALID [2018-11-18 20:35:07,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4603#true} {4603#true} #111#return; {4603#true} is VALID [2018-11-18 20:35:07,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {4603#true} call #t~ret14 := main(); {4603#true} is VALID [2018-11-18 20:35:07,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {4603#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {4623#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:35:07,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {4623#(= main_~a~0 (_ bv0 32))} assume true; {4623#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:35:07,173 INFO L273 TraceCheckUtils]: 7: Hoare triple {4623#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4623#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-18 20:35:07,174 INFO L273 TraceCheckUtils]: 8: Hoare triple {4623#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4633#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:35:07,174 INFO L273 TraceCheckUtils]: 9: Hoare triple {4633#(= (_ bv1 32) main_~a~0)} assume true; {4633#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:35:07,175 INFO L273 TraceCheckUtils]: 10: Hoare triple {4633#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4633#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-18 20:35:07,175 INFO L273 TraceCheckUtils]: 11: Hoare triple {4633#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4643#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-18 20:35:07,176 INFO L273 TraceCheckUtils]: 12: Hoare triple {4643#(= (_ bv2 32) main_~a~0)} assume true; {4643#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-18 20:35:07,176 INFO L273 TraceCheckUtils]: 13: Hoare triple {4643#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4643#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-18 20:35:07,177 INFO L273 TraceCheckUtils]: 14: Hoare triple {4643#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4653#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-18 20:35:07,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {4653#(= (_ bv3 32) main_~a~0)} assume true; {4653#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-18 20:35:07,178 INFO L273 TraceCheckUtils]: 16: Hoare triple {4653#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4653#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-18 20:35:07,179 INFO L273 TraceCheckUtils]: 17: Hoare triple {4653#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4663#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-18 20:35:07,180 INFO L273 TraceCheckUtils]: 18: Hoare triple {4663#(= (_ bv4 32) main_~a~0)} assume true; {4663#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-18 20:35:07,180 INFO L273 TraceCheckUtils]: 19: Hoare triple {4663#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4663#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-18 20:35:07,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {4663#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4673#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-18 20:35:07,181 INFO L273 TraceCheckUtils]: 21: Hoare triple {4673#(= (_ bv5 32) main_~a~0)} assume true; {4673#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-18 20:35:07,182 INFO L273 TraceCheckUtils]: 22: Hoare triple {4673#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4673#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-18 20:35:07,183 INFO L273 TraceCheckUtils]: 23: Hoare triple {4673#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4683#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-18 20:35:07,183 INFO L273 TraceCheckUtils]: 24: Hoare triple {4683#(= (_ bv6 32) main_~a~0)} assume true; {4683#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-18 20:35:07,184 INFO L273 TraceCheckUtils]: 25: Hoare triple {4683#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4683#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-18 20:35:07,184 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4693#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-18 20:35:07,185 INFO L273 TraceCheckUtils]: 27: Hoare triple {4693#(= (_ bv7 32) main_~a~0)} assume true; {4693#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-18 20:35:07,185 INFO L273 TraceCheckUtils]: 28: Hoare triple {4693#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4693#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-18 20:35:07,186 INFO L273 TraceCheckUtils]: 29: Hoare triple {4693#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4703#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-18 20:35:07,187 INFO L273 TraceCheckUtils]: 30: Hoare triple {4703#(= (_ bv8 32) main_~a~0)} assume true; {4703#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-18 20:35:07,187 INFO L273 TraceCheckUtils]: 31: Hoare triple {4703#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4703#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-18 20:35:07,188 INFO L273 TraceCheckUtils]: 32: Hoare triple {4703#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4713#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-18 20:35:07,188 INFO L273 TraceCheckUtils]: 33: Hoare triple {4713#(= (_ bv9 32) main_~a~0)} assume true; {4713#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-18 20:35:07,189 INFO L273 TraceCheckUtils]: 34: Hoare triple {4713#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4713#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-18 20:35:07,190 INFO L273 TraceCheckUtils]: 35: Hoare triple {4713#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4723#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-18 20:35:07,190 INFO L273 TraceCheckUtils]: 36: Hoare triple {4723#(= (_ bv10 32) main_~a~0)} assume true; {4723#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-18 20:35:07,191 INFO L273 TraceCheckUtils]: 37: Hoare triple {4723#(= (_ bv10 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4723#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-18 20:35:07,191 INFO L273 TraceCheckUtils]: 38: Hoare triple {4723#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4733#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-18 20:35:07,192 INFO L273 TraceCheckUtils]: 39: Hoare triple {4733#(= (_ bv11 32) main_~a~0)} assume true; {4733#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-18 20:35:07,192 INFO L273 TraceCheckUtils]: 40: Hoare triple {4733#(= (_ bv11 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4733#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-18 20:35:07,193 INFO L273 TraceCheckUtils]: 41: Hoare triple {4733#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4743#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-18 20:35:07,194 INFO L273 TraceCheckUtils]: 42: Hoare triple {4743#(= (_ bv12 32) main_~a~0)} assume true; {4743#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-18 20:35:07,194 INFO L273 TraceCheckUtils]: 43: Hoare triple {4743#(= (_ bv12 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4743#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-18 20:35:07,195 INFO L273 TraceCheckUtils]: 44: Hoare triple {4743#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4753#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-18 20:35:07,195 INFO L273 TraceCheckUtils]: 45: Hoare triple {4753#(= (_ bv13 32) main_~a~0)} assume true; {4753#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-18 20:35:07,196 INFO L273 TraceCheckUtils]: 46: Hoare triple {4753#(= (_ bv13 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4753#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-18 20:35:07,197 INFO L273 TraceCheckUtils]: 47: Hoare triple {4753#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4763#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-18 20:35:07,197 INFO L273 TraceCheckUtils]: 48: Hoare triple {4763#(= (_ bv14 32) main_~a~0)} assume true; {4763#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-18 20:35:07,198 INFO L273 TraceCheckUtils]: 49: Hoare triple {4763#(= (_ bv14 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4763#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-18 20:35:07,198 INFO L273 TraceCheckUtils]: 50: Hoare triple {4763#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4773#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-18 20:35:07,199 INFO L273 TraceCheckUtils]: 51: Hoare triple {4773#(= (_ bv15 32) main_~a~0)} assume true; {4773#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-18 20:35:07,199 INFO L273 TraceCheckUtils]: 52: Hoare triple {4773#(= (_ bv15 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4773#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-18 20:35:07,200 INFO L273 TraceCheckUtils]: 53: Hoare triple {4773#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4783#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-18 20:35:07,201 INFO L273 TraceCheckUtils]: 54: Hoare triple {4783#(= (_ bv16 32) main_~a~0)} assume true; {4783#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-18 20:35:07,201 INFO L273 TraceCheckUtils]: 55: Hoare triple {4783#(= (_ bv16 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4783#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-18 20:35:07,202 INFO L273 TraceCheckUtils]: 56: Hoare triple {4783#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4793#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-18 20:35:07,202 INFO L273 TraceCheckUtils]: 57: Hoare triple {4793#(= (_ bv17 32) main_~a~0)} assume true; {4793#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-18 20:35:07,203 INFO L273 TraceCheckUtils]: 58: Hoare triple {4793#(= (_ bv17 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4793#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-18 20:35:07,204 INFO L273 TraceCheckUtils]: 59: Hoare triple {4793#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4803#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-18 20:35:07,204 INFO L273 TraceCheckUtils]: 60: Hoare triple {4803#(= (_ bv18 32) main_~a~0)} assume true; {4803#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-18 20:35:07,205 INFO L273 TraceCheckUtils]: 61: Hoare triple {4803#(= (_ bv18 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4803#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-18 20:35:07,205 INFO L273 TraceCheckUtils]: 62: Hoare triple {4803#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4813#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-18 20:35:07,206 INFO L273 TraceCheckUtils]: 63: Hoare triple {4813#(= (_ bv19 32) main_~a~0)} assume true; {4813#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-18 20:35:07,206 INFO L273 TraceCheckUtils]: 64: Hoare triple {4813#(= (_ bv19 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4813#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-18 20:35:07,207 INFO L273 TraceCheckUtils]: 65: Hoare triple {4813#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4823#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-18 20:35:07,226 INFO L273 TraceCheckUtils]: 66: Hoare triple {4823#(= (_ bv20 32) main_~a~0)} assume true; {4823#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-18 20:35:07,231 INFO L273 TraceCheckUtils]: 67: Hoare triple {4823#(= (_ bv20 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4823#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-18 20:35:07,231 INFO L273 TraceCheckUtils]: 68: Hoare triple {4823#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4833#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-18 20:35:07,232 INFO L273 TraceCheckUtils]: 69: Hoare triple {4833#(= (_ bv21 32) main_~a~0)} assume true; {4833#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-18 20:35:07,232 INFO L273 TraceCheckUtils]: 70: Hoare triple {4833#(= (_ bv21 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {4833#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-18 20:35:07,232 INFO L273 TraceCheckUtils]: 71: Hoare triple {4833#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4843#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-18 20:35:07,233 INFO L273 TraceCheckUtils]: 72: Hoare triple {4843#(= (_ bv22 32) main_~a~0)} assume true; {4843#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-18 20:35:07,233 INFO L273 TraceCheckUtils]: 73: Hoare triple {4843#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {4604#false} is VALID [2018-11-18 20:35:07,233 INFO L273 TraceCheckUtils]: 74: Hoare triple {4604#false} havoc ~i~0;~i~0 := 0bv32; {4604#false} is VALID [2018-11-18 20:35:07,233 INFO L273 TraceCheckUtils]: 75: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,233 INFO L273 TraceCheckUtils]: 76: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {4604#false} is VALID [2018-11-18 20:35:07,234 INFO L273 TraceCheckUtils]: 77: Hoare triple {4604#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4604#false} is VALID [2018-11-18 20:35:07,234 INFO L273 TraceCheckUtils]: 78: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,234 INFO L273 TraceCheckUtils]: 79: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {4604#false} is VALID [2018-11-18 20:35:07,234 INFO L273 TraceCheckUtils]: 80: Hoare triple {4604#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4604#false} is VALID [2018-11-18 20:35:07,234 INFO L273 TraceCheckUtils]: 81: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,234 INFO L273 TraceCheckUtils]: 82: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {4604#false} is VALID [2018-11-18 20:35:07,235 INFO L273 TraceCheckUtils]: 83: Hoare triple {4604#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4604#false} is VALID [2018-11-18 20:35:07,235 INFO L273 TraceCheckUtils]: 84: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,235 INFO L273 TraceCheckUtils]: 85: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {4604#false} is VALID [2018-11-18 20:35:07,235 INFO L273 TraceCheckUtils]: 86: Hoare triple {4604#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4604#false} is VALID [2018-11-18 20:35:07,236 INFO L273 TraceCheckUtils]: 87: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,236 INFO L273 TraceCheckUtils]: 88: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-18 20:35:07,236 INFO L273 TraceCheckUtils]: 89: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-18 20:35:07,237 INFO L273 TraceCheckUtils]: 90: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,237 INFO L273 TraceCheckUtils]: 91: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {4604#false} is VALID [2018-11-18 20:35:07,237 INFO L273 TraceCheckUtils]: 92: Hoare triple {4604#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4604#false} is VALID [2018-11-18 20:35:07,237 INFO L273 TraceCheckUtils]: 93: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,237 INFO L273 TraceCheckUtils]: 94: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {4604#false} is VALID [2018-11-18 20:35:07,238 INFO L273 TraceCheckUtils]: 95: Hoare triple {4604#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4604#false} is VALID [2018-11-18 20:35:07,238 INFO L273 TraceCheckUtils]: 96: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,238 INFO L273 TraceCheckUtils]: 97: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {4604#false} is VALID [2018-11-18 20:35:07,238 INFO L273 TraceCheckUtils]: 98: Hoare triple {4604#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4604#false} is VALID [2018-11-18 20:35:07,238 INFO L273 TraceCheckUtils]: 99: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,238 INFO L273 TraceCheckUtils]: 100: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {4604#false} is VALID [2018-11-18 20:35:07,239 INFO L273 TraceCheckUtils]: 101: Hoare triple {4604#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4604#false} is VALID [2018-11-18 20:35:07,239 INFO L273 TraceCheckUtils]: 102: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,239 INFO L273 TraceCheckUtils]: 103: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-18 20:35:07,239 INFO L273 TraceCheckUtils]: 104: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-18 20:35:07,239 INFO L273 TraceCheckUtils]: 105: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,239 INFO L273 TraceCheckUtils]: 106: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {4604#false} is VALID [2018-11-18 20:35:07,240 INFO L273 TraceCheckUtils]: 107: Hoare triple {4604#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4604#false} is VALID [2018-11-18 20:35:07,240 INFO L273 TraceCheckUtils]: 108: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,240 INFO L273 TraceCheckUtils]: 109: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {4604#false} is VALID [2018-11-18 20:35:07,240 INFO L273 TraceCheckUtils]: 110: Hoare triple {4604#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4604#false} is VALID [2018-11-18 20:35:07,240 INFO L273 TraceCheckUtils]: 111: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,240 INFO L273 TraceCheckUtils]: 112: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {4604#false} is VALID [2018-11-18 20:35:07,241 INFO L273 TraceCheckUtils]: 113: Hoare triple {4604#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4604#false} is VALID [2018-11-18 20:35:07,241 INFO L273 TraceCheckUtils]: 114: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,241 INFO L273 TraceCheckUtils]: 115: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {4604#false} is VALID [2018-11-18 20:35:07,241 INFO L273 TraceCheckUtils]: 116: Hoare triple {4604#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4604#false} is VALID [2018-11-18 20:35:07,241 INFO L273 TraceCheckUtils]: 117: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,241 INFO L273 TraceCheckUtils]: 118: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-18 20:35:07,242 INFO L273 TraceCheckUtils]: 119: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-18 20:35:07,242 INFO L273 TraceCheckUtils]: 120: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,242 INFO L273 TraceCheckUtils]: 121: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {4604#false} is VALID [2018-11-18 20:35:07,242 INFO L273 TraceCheckUtils]: 122: Hoare triple {4604#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {4604#false} is VALID [2018-11-18 20:35:07,242 INFO L273 TraceCheckUtils]: 123: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,243 INFO L273 TraceCheckUtils]: 124: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {4604#false} is VALID [2018-11-18 20:35:07,243 INFO L273 TraceCheckUtils]: 125: Hoare triple {4604#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {4604#false} is VALID [2018-11-18 20:35:07,243 INFO L273 TraceCheckUtils]: 126: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,243 INFO L273 TraceCheckUtils]: 127: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {4604#false} is VALID [2018-11-18 20:35:07,243 INFO L273 TraceCheckUtils]: 128: Hoare triple {4604#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {4604#false} is VALID [2018-11-18 20:35:07,243 INFO L273 TraceCheckUtils]: 129: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,244 INFO L273 TraceCheckUtils]: 130: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {4604#false} is VALID [2018-11-18 20:35:07,244 INFO L273 TraceCheckUtils]: 131: Hoare triple {4604#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {4604#false} is VALID [2018-11-18 20:35:07,244 INFO L273 TraceCheckUtils]: 132: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,244 INFO L273 TraceCheckUtils]: 133: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-18 20:35:07,244 INFO L273 TraceCheckUtils]: 134: Hoare triple {4604#false} havoc ~x~0;~x~0 := 0bv32; {4604#false} is VALID [2018-11-18 20:35:07,244 INFO L273 TraceCheckUtils]: 135: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:07,245 INFO L273 TraceCheckUtils]: 136: Hoare triple {4604#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {4604#false} is VALID [2018-11-18 20:35:07,245 INFO L256 TraceCheckUtils]: 137: Hoare triple {4604#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {4604#false} is VALID [2018-11-18 20:35:07,245 INFO L273 TraceCheckUtils]: 138: Hoare triple {4604#false} ~cond := #in~cond; {4604#false} is VALID [2018-11-18 20:35:07,245 INFO L273 TraceCheckUtils]: 139: Hoare triple {4604#false} assume 0bv32 == ~cond; {4604#false} is VALID [2018-11-18 20:35:07,245 INFO L273 TraceCheckUtils]: 140: Hoare triple {4604#false} assume !false; {4604#false} is VALID [2018-11-18 20:35:07,260 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-18 20:35:07,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:35:09,820 INFO L273 TraceCheckUtils]: 140: Hoare triple {4604#false} assume !false; {4604#false} is VALID [2018-11-18 20:35:09,820 INFO L273 TraceCheckUtils]: 139: Hoare triple {4604#false} assume 0bv32 == ~cond; {4604#false} is VALID [2018-11-18 20:35:09,820 INFO L273 TraceCheckUtils]: 138: Hoare triple {4604#false} ~cond := #in~cond; {4604#false} is VALID [2018-11-18 20:35:09,820 INFO L256 TraceCheckUtils]: 137: Hoare triple {4604#false} call __VERIFIER_assert((if #t~mem12 == #t~mem13 then 1bv32 else 0bv32)); {4604#false} is VALID [2018-11-18 20:35:09,820 INFO L273 TraceCheckUtils]: 136: Hoare triple {4604#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem12 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem13 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {4604#false} is VALID [2018-11-18 20:35:09,821 INFO L273 TraceCheckUtils]: 135: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,821 INFO L273 TraceCheckUtils]: 134: Hoare triple {4604#false} havoc ~x~0;~x~0 := 0bv32; {4604#false} is VALID [2018-11-18 20:35:09,821 INFO L273 TraceCheckUtils]: 133: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-18 20:35:09,821 INFO L273 TraceCheckUtils]: 132: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,821 INFO L273 TraceCheckUtils]: 131: Hoare triple {4604#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {4604#false} is VALID [2018-11-18 20:35:09,821 INFO L273 TraceCheckUtils]: 130: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {4604#false} is VALID [2018-11-18 20:35:09,821 INFO L273 TraceCheckUtils]: 129: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,821 INFO L273 TraceCheckUtils]: 128: Hoare triple {4604#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {4604#false} is VALID [2018-11-18 20:35:09,822 INFO L273 TraceCheckUtils]: 127: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {4604#false} is VALID [2018-11-18 20:35:09,822 INFO L273 TraceCheckUtils]: 126: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,822 INFO L273 TraceCheckUtils]: 125: Hoare triple {4604#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {4604#false} is VALID [2018-11-18 20:35:09,822 INFO L273 TraceCheckUtils]: 124: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {4604#false} is VALID [2018-11-18 20:35:09,822 INFO L273 TraceCheckUtils]: 123: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,822 INFO L273 TraceCheckUtils]: 122: Hoare triple {4604#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {4604#false} is VALID [2018-11-18 20:35:09,822 INFO L273 TraceCheckUtils]: 121: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem10 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem10, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem10; {4604#false} is VALID [2018-11-18 20:35:09,822 INFO L273 TraceCheckUtils]: 120: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,823 INFO L273 TraceCheckUtils]: 119: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-18 20:35:09,823 INFO L273 TraceCheckUtils]: 118: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-18 20:35:09,823 INFO L273 TraceCheckUtils]: 117: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,823 INFO L273 TraceCheckUtils]: 116: Hoare triple {4604#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4604#false} is VALID [2018-11-18 20:35:09,823 INFO L273 TraceCheckUtils]: 115: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {4604#false} is VALID [2018-11-18 20:35:09,823 INFO L273 TraceCheckUtils]: 114: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,823 INFO L273 TraceCheckUtils]: 113: Hoare triple {4604#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4604#false} is VALID [2018-11-18 20:35:09,823 INFO L273 TraceCheckUtils]: 112: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {4604#false} is VALID [2018-11-18 20:35:09,824 INFO L273 TraceCheckUtils]: 111: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,824 INFO L273 TraceCheckUtils]: 110: Hoare triple {4604#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4604#false} is VALID [2018-11-18 20:35:09,824 INFO L273 TraceCheckUtils]: 109: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {4604#false} is VALID [2018-11-18 20:35:09,824 INFO L273 TraceCheckUtils]: 108: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,824 INFO L273 TraceCheckUtils]: 107: Hoare triple {4604#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {4604#false} is VALID [2018-11-18 20:35:09,824 INFO L273 TraceCheckUtils]: 106: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem8, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem8; {4604#false} is VALID [2018-11-18 20:35:09,824 INFO L273 TraceCheckUtils]: 105: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,825 INFO L273 TraceCheckUtils]: 104: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-18 20:35:09,825 INFO L273 TraceCheckUtils]: 103: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-18 20:35:09,825 INFO L273 TraceCheckUtils]: 102: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,825 INFO L273 TraceCheckUtils]: 101: Hoare triple {4604#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4604#false} is VALID [2018-11-18 20:35:09,825 INFO L273 TraceCheckUtils]: 100: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {4604#false} is VALID [2018-11-18 20:35:09,825 INFO L273 TraceCheckUtils]: 99: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,826 INFO L273 TraceCheckUtils]: 98: Hoare triple {4604#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4604#false} is VALID [2018-11-18 20:35:09,826 INFO L273 TraceCheckUtils]: 97: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {4604#false} is VALID [2018-11-18 20:35:09,826 INFO L273 TraceCheckUtils]: 96: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,826 INFO L273 TraceCheckUtils]: 95: Hoare triple {4604#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4604#false} is VALID [2018-11-18 20:35:09,826 INFO L273 TraceCheckUtils]: 94: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {4604#false} is VALID [2018-11-18 20:35:09,826 INFO L273 TraceCheckUtils]: 93: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,827 INFO L273 TraceCheckUtils]: 92: Hoare triple {4604#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {4604#false} is VALID [2018-11-18 20:35:09,827 INFO L273 TraceCheckUtils]: 91: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem6 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem6, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem6; {4604#false} is VALID [2018-11-18 20:35:09,827 INFO L273 TraceCheckUtils]: 90: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,827 INFO L273 TraceCheckUtils]: 89: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-18 20:35:09,827 INFO L273 TraceCheckUtils]: 88: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-18 20:35:09,828 INFO L273 TraceCheckUtils]: 87: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,828 INFO L273 TraceCheckUtils]: 86: Hoare triple {4604#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4604#false} is VALID [2018-11-18 20:35:09,828 INFO L273 TraceCheckUtils]: 85: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {4604#false} is VALID [2018-11-18 20:35:09,828 INFO L273 TraceCheckUtils]: 84: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,828 INFO L273 TraceCheckUtils]: 83: Hoare triple {4604#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4604#false} is VALID [2018-11-18 20:35:09,828 INFO L273 TraceCheckUtils]: 82: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {4604#false} is VALID [2018-11-18 20:35:09,829 INFO L273 TraceCheckUtils]: 81: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,829 INFO L273 TraceCheckUtils]: 80: Hoare triple {4604#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4604#false} is VALID [2018-11-18 20:35:09,829 INFO L273 TraceCheckUtils]: 79: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {4604#false} is VALID [2018-11-18 20:35:09,829 INFO L273 TraceCheckUtils]: 78: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,829 INFO L273 TraceCheckUtils]: 77: Hoare triple {4604#false} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {4604#false} is VALID [2018-11-18 20:35:09,829 INFO L273 TraceCheckUtils]: 76: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem4; {4604#false} is VALID [2018-11-18 20:35:09,830 INFO L273 TraceCheckUtils]: 75: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-18 20:35:09,830 INFO L273 TraceCheckUtils]: 74: Hoare triple {4604#false} havoc ~i~0;~i~0 := 0bv32; {4604#false} is VALID [2018-11-18 20:35:09,844 INFO L273 TraceCheckUtils]: 73: Hoare triple {5252#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {4604#false} is VALID [2018-11-18 20:35:09,856 INFO L273 TraceCheckUtils]: 72: Hoare triple {5252#(bvslt main_~a~0 (_ bv100000 32))} assume true; {5252#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-18 20:35:09,869 INFO L273 TraceCheckUtils]: 71: Hoare triple {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5252#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-18 20:35:09,882 INFO L273 TraceCheckUtils]: 70: Hoare triple {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,894 INFO L273 TraceCheckUtils]: 69: Hoare triple {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,907 INFO L273 TraceCheckUtils]: 68: Hoare triple {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,914 INFO L273 TraceCheckUtils]: 67: Hoare triple {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,920 INFO L273 TraceCheckUtils]: 66: Hoare triple {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,924 INFO L273 TraceCheckUtils]: 65: Hoare triple {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,925 INFO L273 TraceCheckUtils]: 64: Hoare triple {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,925 INFO L273 TraceCheckUtils]: 63: Hoare triple {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,929 INFO L273 TraceCheckUtils]: 62: Hoare triple {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,929 INFO L273 TraceCheckUtils]: 61: Hoare triple {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,933 INFO L273 TraceCheckUtils]: 60: Hoare triple {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,940 INFO L273 TraceCheckUtils]: 59: Hoare triple {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,945 INFO L273 TraceCheckUtils]: 58: Hoare triple {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,947 INFO L273 TraceCheckUtils]: 57: Hoare triple {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume true; {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,951 INFO L273 TraceCheckUtils]: 56: Hoare triple {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,953 INFO L273 TraceCheckUtils]: 55: Hoare triple {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,953 INFO L273 TraceCheckUtils]: 54: Hoare triple {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume true; {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,959 INFO L273 TraceCheckUtils]: 53: Hoare triple {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,959 INFO L273 TraceCheckUtils]: 52: Hoare triple {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,963 INFO L273 TraceCheckUtils]: 51: Hoare triple {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume true; {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,968 INFO L273 TraceCheckUtils]: 50: Hoare triple {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,969 INFO L273 TraceCheckUtils]: 49: Hoare triple {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,970 INFO L273 TraceCheckUtils]: 48: Hoare triple {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume true; {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,975 INFO L273 TraceCheckUtils]: 47: Hoare triple {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,976 INFO L273 TraceCheckUtils]: 46: Hoare triple {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,976 INFO L273 TraceCheckUtils]: 45: Hoare triple {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume true; {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,983 INFO L273 TraceCheckUtils]: 44: Hoare triple {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,984 INFO L273 TraceCheckUtils]: 43: Hoare triple {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,984 INFO L273 TraceCheckUtils]: 42: Hoare triple {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume true; {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,989 INFO L273 TraceCheckUtils]: 41: Hoare triple {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,989 INFO L273 TraceCheckUtils]: 40: Hoare triple {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:09,994 INFO L273 TraceCheckUtils]: 39: Hoare triple {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume true; {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,000 INFO L273 TraceCheckUtils]: 38: Hoare triple {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,001 INFO L273 TraceCheckUtils]: 37: Hoare triple {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,001 INFO L273 TraceCheckUtils]: 36: Hoare triple {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume true; {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,009 INFO L273 TraceCheckUtils]: 35: Hoare triple {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,009 INFO L273 TraceCheckUtils]: 34: Hoare triple {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,009 INFO L273 TraceCheckUtils]: 33: Hoare triple {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume true; {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,017 INFO L273 TraceCheckUtils]: 32: Hoare triple {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,017 INFO L273 TraceCheckUtils]: 31: Hoare triple {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume true; {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,024 INFO L273 TraceCheckUtils]: 29: Hoare triple {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,024 INFO L273 TraceCheckUtils]: 27: Hoare triple {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume true; {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,030 INFO L273 TraceCheckUtils]: 26: Hoare triple {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,030 INFO L273 TraceCheckUtils]: 25: Hoare triple {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume true; {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,035 INFO L273 TraceCheckUtils]: 23: Hoare triple {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,036 INFO L273 TraceCheckUtils]: 22: Hoare triple {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,036 INFO L273 TraceCheckUtils]: 21: Hoare triple {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume true; {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,044 INFO L273 TraceCheckUtils]: 18: Hoare triple {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume true; {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,050 INFO L273 TraceCheckUtils]: 17: Hoare triple {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,051 INFO L273 TraceCheckUtils]: 15: Hoare triple {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume true; {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,059 INFO L273 TraceCheckUtils]: 13: Hoare triple {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume true; {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,067 INFO L273 TraceCheckUtils]: 11: Hoare triple {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,067 INFO L273 TraceCheckUtils]: 10: Hoare triple {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,068 INFO L273 TraceCheckUtils]: 9: Hoare triple {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume true; {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,077 INFO L273 TraceCheckUtils]: 8: Hoare triple {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1;call write~intINTTYPE4(#t~nondet2, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet2; {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume true; {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {4603#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-18 20:35:10,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {4603#true} call #t~ret14 := main(); {4603#true} is VALID [2018-11-18 20:35:10,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4603#true} {4603#true} #111#return; {4603#true} is VALID [2018-11-18 20:35:10,080 INFO L273 TraceCheckUtils]: 2: Hoare triple {4603#true} assume true; {4603#true} is VALID [2018-11-18 20:35:10,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {4603#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4603#true} is VALID [2018-11-18 20:35:10,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {4603#true} call ULTIMATE.init(); {4603#true} is VALID [2018-11-18 20:35:10,099 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-18 20:35:10,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:35:10,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-18 20:35:10,101 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 141 [2018-11-18 20:35:10,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:35:10,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-18 20:35:10,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:35:10,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-18 20:35:10,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-18 20:35:10,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 20:35:10,460 INFO L87 Difference]: Start difference. First operand 146 states and 151 transitions. Second operand 48 states. [2018-11-18 20:35:18,966 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-18 20:35:19,441 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-18 20:35:19,960 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-18 20:35:20,511 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-18 20:35:21,076 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-18 20:35:21,921 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-18 20:35:30,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:35:30,473 INFO L93 Difference]: Finished difference Result 290 states and 323 transitions. [2018-11-18 20:35:30,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-18 20:35:30,473 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 141 [2018-11-18 20:35:30,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:35:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 20:35:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 235 transitions. [2018-11-18 20:35:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 20:35:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 235 transitions. [2018-11-18 20:35:30,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 235 transitions. [2018-11-18 20:35:31,021 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:35:31,027 INFO L225 Difference]: With dead ends: 290 [2018-11-18 20:35:31,027 INFO L226 Difference]: Without dead ends: 218 [2018-11-18 20:35:31,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-18 20:35:31,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-18 20:35:31,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-11-18 20:35:31,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:35:31,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand 218 states. [2018-11-18 20:35:31,595 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 218 states. [2018-11-18 20:35:31,595 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 218 states. [2018-11-18 20:35:31,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:35:31,601 INFO L93 Difference]: Finished difference Result 218 states and 223 transitions. [2018-11-18 20:35:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-11-18 20:35:31,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:35:31,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:35:31,603 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 218 states. [2018-11-18 20:35:31,603 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 218 states. [2018-11-18 20:35:31,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:35:31,610 INFO L93 Difference]: Finished difference Result 218 states and 223 transitions. [2018-11-18 20:35:31,610 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-11-18 20:35:31,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:35:31,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:35:31,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:35:31,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:35:31,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-18 20:35:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 223 transitions. [2018-11-18 20:35:31,617 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 223 transitions. Word has length 141 [2018-11-18 20:35:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:35:31,618 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 223 transitions. [2018-11-18 20:35:31,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-18 20:35:31,618 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-11-18 20:35:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-18 20:35:31,621 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:35:31,621 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:35:31,621 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:35:31,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:35:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1778537809, now seen corresponding path program 5 times [2018-11-18 20:35:31,622 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:35:31,623 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 20:35:31,651 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1