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-industry-pattern/array_of_struct_single_elem_init_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 20:57:22,508 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 20:57:22,510 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 20:57:22,524 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 20:57:22,525 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 20:57:22,526 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 20:57:22,527 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 20:57:22,529 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 20:57:22,530 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 20:57:22,531 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 20:57:22,532 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 20:57:22,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 20:57:22,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 20:57:22,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 20:57:22,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 20:57:22,537 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 20:57:22,538 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 20:57:22,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 20:57:22,542 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 20:57:22,543 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 20:57:22,545 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 20:57:22,546 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 20:57:22,550 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 20:57:22,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 20:57:22,551 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 20:57:22,552 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 20:57:22,553 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 20:57:22,557 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 20:57:22,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 20:57:22,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 20:57:22,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 20:57:22,562 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 20:57:22,562 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 20:57:22,562 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 20:57:22,564 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 20:57:22,564 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 20:57:22,566 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:57:22,595 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 20:57:22,595 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 20:57:22,597 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 20:57:22,597 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 20:57:22,600 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 20:57:22,600 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 20:57:22,601 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 20:57:22,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 20:57:22,602 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 20:57:22,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 20:57:22,602 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 20:57:22,602 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 20:57:22,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 20:57:22,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 20:57:22,603 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 20:57:22,603 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 20:57:22,603 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 20:57:22,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 20:57:22,604 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 20:57:22,605 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 20:57:22,605 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 20:57:22,605 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 20:57:22,605 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 20:57:22,605 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 20:57:22,606 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 20:57:22,606 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 20:57:22,606 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 20:57:22,607 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 20:57:22,607 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 20:57:22,607 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 20:57:22,607 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 20:57:22,607 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 20:57:22,608 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 20:57:22,674 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 20:57:22,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 20:57:22,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 20:57:22,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 20:57:22,697 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 20:57:22,697 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_single_elem_init_true-unreach-call.i [2018-11-18 20:57:22,764 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9599df74f/fae1d6aae330434ba2843c8b531b42b6/FLAG1e3e79b30 [2018-11-18 20:57:23,264 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 20:57:23,266 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_single_elem_init_true-unreach-call.i [2018-11-18 20:57:23,275 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9599df74f/fae1d6aae330434ba2843c8b531b42b6/FLAG1e3e79b30 [2018-11-18 20:57:23,573 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9599df74f/fae1d6aae330434ba2843c8b531b42b6 [2018-11-18 20:57:23,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 20:57:23,586 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 20:57:23,587 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 20:57:23,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 20:57:23,591 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 20:57:23,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:57:23" (1/1) ... [2018-11-18 20:57:23,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@97976da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:23, skipping insertion in model container [2018-11-18 20:57:23,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:57:23" (1/1) ... [2018-11-18 20:57:23,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 20:57:23,632 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 20:57:23,881 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 20:57:26,028 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 20:57:26,059 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 20:57:26,091 INFO L195 MainTranslator]: Completed translation [2018-11-18 20:57:26,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:26 WrapperNode [2018-11-18 20:57:26,092 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 20:57:26,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 20:57:26,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 20:57:26,093 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 20:57:26,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:26" (1/1) ... [2018-11-18 20:57:26,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:26" (1/1) ... [2018-11-18 20:57:26,125 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:26" (1/1) ... [2018-11-18 20:57:26,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:26" (1/1) ... [2018-11-18 20:57:26,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:26" (1/1) ... [2018-11-18 20:57:26,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:26" (1/1) ... [2018-11-18 20:57:26,242 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:26" (1/1) ... [2018-11-18 20:57:26,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 20:57:26,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 20:57:26,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 20:57:26,249 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 20:57:26,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:26" (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:57:26,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 20:57:26,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 20:57:26,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 20:57:26,329 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 20:57:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 20:57:26,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 20:57:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 20:57:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 20:57:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 20:57:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 20:57:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 20:57:26,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 20:57:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 20:57:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 20:57:26,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 20:57:26,994 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 20:57:26,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:57:26 BoogieIcfgContainer [2018-11-18 20:57:26,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 20:57:26,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 20:57:26,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 20:57:27,000 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 20:57:27,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:57:23" (1/3) ... [2018-11-18 20:57:27,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260b353e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:57:27, skipping insertion in model container [2018-11-18 20:57:27,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:57:26" (2/3) ... [2018-11-18 20:57:27,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@260b353e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:57:27, skipping insertion in model container [2018-11-18 20:57:27,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:57:26" (3/3) ... [2018-11-18 20:57:27,003 INFO L112 eAbstractionObserver]: Analyzing ICFG array_of_struct_single_elem_init_true-unreach-call.i [2018-11-18 20:57:27,012 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 20:57:27,021 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 20:57:27,038 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 20:57:27,071 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 20:57:27,072 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 20:57:27,072 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 20:57:27,072 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 20:57:27,073 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 20:57:27,073 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 20:57:27,073 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 20:57:27,073 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 20:57:27,073 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 20:57:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-18 20:57:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 20:57:27,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:57:27,100 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:57:27,103 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:57:27,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:57:27,109 INFO L82 PathProgramCache]: Analyzing trace with hash 835931328, now seen corresponding path program 1 times [2018-11-18 20:57:27,115 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:57:27,115 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:57:27,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:57:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:57:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:57:27,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:57:27,513 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-18 20:57:27,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(800000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {33#true} is VALID [2018-11-18 20:57:27,519 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-18 20:57:27,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #69#return; {33#true} is VALID [2018-11-18 20:57:27,520 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret11 := main(); {33#true} is VALID [2018-11-18 20:57:27,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;~i~0 := 0bv32; {33#true} is VALID [2018-11-18 20:57:27,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-18 20:57:27,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} call write~intINTTYPE4(30bv32, ~#a~0.base, ~bvadd32(24bv32, ~#a~0.offset), 4bv32);call write~intINTTYPE4(40bv32, ~#a~0.base, ~bvadd32(28bv32, ~#a~0.offset), 4bv32);~i~0 := 0bv32; {34#false} is VALID [2018-11-18 20:57:27,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-18 20:57:27,529 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} assume !!~bvslt32(~i~0, 100000bv32);call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);call write~unchecked~intINTTYPE4(#t~mem6, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~mem7, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);havoc #t~mem6;havoc #t~mem7;#t~short9 := 3bv32 != ~i~0; {34#false} is VALID [2018-11-18 20:57:27,529 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);#t~short9 := 0bv32 == #t~mem8; {34#false} is VALID [2018-11-18 20:57:27,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume #t~short9;havoc #t~mem8;havoc #t~short9;call #t~mem10 := read~intINTTYPE4(~#s1~0.base, ~#s1~0.offset, 4bv32); {34#false} is VALID [2018-11-18 20:57:27,530 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if 10bv32 == #t~mem10 then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-18 20:57:27,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-18 20:57:27,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume 0bv32 == ~cond; {34#false} is VALID [2018-11-18 20:57:27,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-18 20:57:27,534 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:57:27,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 20:57:27,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 20:57:27,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 20:57:27,547 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 20:57:27,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:57:27,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 20:57:27,757 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:57:27,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 20:57:27,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 20:57:27,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 20:57:27,771 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-18 20:57:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:27,919 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2018-11-18 20:57:27,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 20:57:27,920 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 20:57:27,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:57:27,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 20:57:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-18 20:57:27,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 20:57:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-18 20:57:27,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2018-11-18 20:57:28,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:57:28,254 INFO L225 Difference]: With dead ends: 49 [2018-11-18 20:57:28,255 INFO L226 Difference]: Without dead ends: 25 [2018-11-18 20:57:28,258 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 20:57:28,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-18 20:57:28,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-18 20:57:28,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:57:28,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-18 20:57:28,297 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-18 20:57:28,297 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-18 20:57:28,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:28,302 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-18 20:57:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-18 20:57:28,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:57:28,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:57:28,303 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-18 20:57:28,303 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-18 20:57:28,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:28,308 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2018-11-18 20:57:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-18 20:57:28,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:57:28,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:57:28,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:57:28,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:57:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 20:57:28,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-18 20:57:28,314 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2018-11-18 20:57:28,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:57:28,315 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-18 20:57:28,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 20:57:28,315 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-18 20:57:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 20:57:28,316 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:57:28,316 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:57:28,317 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:57:28,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:57:28,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1730177078, now seen corresponding path program 1 times [2018-11-18 20:57:28,318 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:57:28,318 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:57:28,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:57:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:57:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:57:28,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:57:28,480 INFO L256 TraceCheckUtils]: 0: Hoare triple {225#true} call ULTIMATE.init(); {225#true} is VALID [2018-11-18 20:57:28,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {225#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(800000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {225#true} is VALID [2018-11-18 20:57:28,481 INFO L273 TraceCheckUtils]: 2: Hoare triple {225#true} assume true; {225#true} is VALID [2018-11-18 20:57:28,481 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {225#true} {225#true} #69#return; {225#true} is VALID [2018-11-18 20:57:28,481 INFO L256 TraceCheckUtils]: 4: Hoare triple {225#true} call #t~ret11 := main(); {225#true} is VALID [2018-11-18 20:57:28,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {225#true} havoc ~i~0;~i~0 := 0bv32; {245#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:28,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {245#(= main_~i~0 (_ bv0 32))} assume true; {245#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:28,489 INFO L273 TraceCheckUtils]: 7: Hoare triple {245#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {226#false} is VALID [2018-11-18 20:57:28,489 INFO L273 TraceCheckUtils]: 8: Hoare triple {226#false} call write~intINTTYPE4(30bv32, ~#a~0.base, ~bvadd32(24bv32, ~#a~0.offset), 4bv32);call write~intINTTYPE4(40bv32, ~#a~0.base, ~bvadd32(28bv32, ~#a~0.offset), 4bv32);~i~0 := 0bv32; {226#false} is VALID [2018-11-18 20:57:28,489 INFO L273 TraceCheckUtils]: 9: Hoare triple {226#false} assume true; {226#false} is VALID [2018-11-18 20:57:28,490 INFO L273 TraceCheckUtils]: 10: Hoare triple {226#false} assume !!~bvslt32(~i~0, 100000bv32);call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);call write~unchecked~intINTTYPE4(#t~mem6, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~mem7, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);havoc #t~mem6;havoc #t~mem7;#t~short9 := 3bv32 != ~i~0; {226#false} is VALID [2018-11-18 20:57:28,490 INFO L273 TraceCheckUtils]: 11: Hoare triple {226#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);#t~short9 := 0bv32 == #t~mem8; {226#false} is VALID [2018-11-18 20:57:28,490 INFO L273 TraceCheckUtils]: 12: Hoare triple {226#false} assume #t~short9;havoc #t~mem8;havoc #t~short9;call #t~mem10 := read~intINTTYPE4(~#s1~0.base, ~#s1~0.offset, 4bv32); {226#false} is VALID [2018-11-18 20:57:28,490 INFO L256 TraceCheckUtils]: 13: Hoare triple {226#false} call __VERIFIER_assert((if 10bv32 == #t~mem10 then 1bv32 else 0bv32)); {226#false} is VALID [2018-11-18 20:57:28,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {226#false} ~cond := #in~cond; {226#false} is VALID [2018-11-18 20:57:28,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {226#false} assume 0bv32 == ~cond; {226#false} is VALID [2018-11-18 20:57:28,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {226#false} assume !false; {226#false} is VALID [2018-11-18 20:57:28,493 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:57:28,493 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 20:57:28,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 20:57:28,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 20:57:28,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 20:57:28,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:57:28,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 20:57:28,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:57:28,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 20:57:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 20:57:28,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 20:57:28,677 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 3 states. [2018-11-18 20:57:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:29,047 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-18 20:57:29,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 20:57:29,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 20:57:29,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:57:29,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 20:57:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-18 20:57:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 20:57:29,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-18 20:57:29,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-18 20:57:29,600 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:57:29,603 INFO L225 Difference]: With dead ends: 51 [2018-11-18 20:57:29,603 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 20:57:29,604 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 20:57:29,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 20:57:29,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2018-11-18 20:57:29,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:57:29,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 27 states. [2018-11-18 20:57:29,688 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 27 states. [2018-11-18 20:57:29,688 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 27 states. [2018-11-18 20:57:29,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:29,692 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-18 20:57:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-18 20:57:29,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:57:29,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:57:29,694 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 37 states. [2018-11-18 20:57:29,694 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 37 states. [2018-11-18 20:57:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:29,698 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-18 20:57:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-18 20:57:29,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:57:29,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:57:29,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:57:29,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:57:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 20:57:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-18 20:57:29,702 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2018-11-18 20:57:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:57:29,702 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-18 20:57:29,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 20:57:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-18 20:57:29,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 20:57:29,703 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:57:29,703 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] [2018-11-18 20:57:29,704 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:57:29,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:57:29,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1703654152, now seen corresponding path program 1 times [2018-11-18 20:57:29,705 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:57:29,705 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:57:29,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 20:57:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:57:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:57:29,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:57:29,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2018-11-18 20:57:29,926 INFO L273 TraceCheckUtils]: 1: Hoare triple {453#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(800000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {453#true} is VALID [2018-11-18 20:57:29,926 INFO L273 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2018-11-18 20:57:29,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #69#return; {453#true} is VALID [2018-11-18 20:57:29,927 INFO L256 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret11 := main(); {453#true} is VALID [2018-11-18 20:57:29,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {453#true} havoc ~i~0;~i~0 := 0bv32; {473#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:29,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {473#(= main_~i~0 (_ bv0 32))} assume true; {473#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:29,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {473#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {473#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:29,931 INFO L273 TraceCheckUtils]: 8: Hoare triple {473#(= main_~i~0 (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {473#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:29,932 INFO L273 TraceCheckUtils]: 9: Hoare triple {473#(= main_~i~0 (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {473#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:29,936 INFO L273 TraceCheckUtils]: 10: Hoare triple {473#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {489#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:29,937 INFO L273 TraceCheckUtils]: 11: Hoare triple {489#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {489#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:29,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {489#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {454#false} is VALID [2018-11-18 20:57:29,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {454#false} call write~intINTTYPE4(30bv32, ~#a~0.base, ~bvadd32(24bv32, ~#a~0.offset), 4bv32);call write~intINTTYPE4(40bv32, ~#a~0.base, ~bvadd32(28bv32, ~#a~0.offset), 4bv32);~i~0 := 0bv32; {454#false} is VALID [2018-11-18 20:57:29,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {454#false} assume true; {454#false} is VALID [2018-11-18 20:57:29,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {454#false} assume !!~bvslt32(~i~0, 100000bv32);call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);call write~unchecked~intINTTYPE4(#t~mem6, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~mem7, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);havoc #t~mem6;havoc #t~mem7;#t~short9 := 3bv32 != ~i~0; {454#false} is VALID [2018-11-18 20:57:29,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {454#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);#t~short9 := 0bv32 == #t~mem8; {454#false} is VALID [2018-11-18 20:57:29,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {454#false} assume #t~short9;havoc #t~mem8;havoc #t~short9;call #t~mem10 := read~intINTTYPE4(~#s1~0.base, ~#s1~0.offset, 4bv32); {454#false} is VALID [2018-11-18 20:57:29,939 INFO L256 TraceCheckUtils]: 18: Hoare triple {454#false} call __VERIFIER_assert((if 10bv32 == #t~mem10 then 1bv32 else 0bv32)); {454#false} is VALID [2018-11-18 20:57:29,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2018-11-18 20:57:29,940 INFO L273 TraceCheckUtils]: 20: Hoare triple {454#false} assume 0bv32 == ~cond; {454#false} is VALID [2018-11-18 20:57:29,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {454#false} assume !false; {454#false} is VALID [2018-11-18 20:57:29,941 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:57:29,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:57:30,210 INFO L273 TraceCheckUtils]: 21: Hoare triple {454#false} assume !false; {454#false} is VALID [2018-11-18 20:57:30,210 INFO L273 TraceCheckUtils]: 20: Hoare triple {454#false} assume 0bv32 == ~cond; {454#false} is VALID [2018-11-18 20:57:30,210 INFO L273 TraceCheckUtils]: 19: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2018-11-18 20:57:30,211 INFO L256 TraceCheckUtils]: 18: Hoare triple {454#false} call __VERIFIER_assert((if 10bv32 == #t~mem10 then 1bv32 else 0bv32)); {454#false} is VALID [2018-11-18 20:57:30,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {454#false} assume #t~short9;havoc #t~mem8;havoc #t~short9;call #t~mem10 := read~intINTTYPE4(~#s1~0.base, ~#s1~0.offset, 4bv32); {454#false} is VALID [2018-11-18 20:57:30,211 INFO L273 TraceCheckUtils]: 16: Hoare triple {454#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);#t~short9 := 0bv32 == #t~mem8; {454#false} is VALID [2018-11-18 20:57:30,212 INFO L273 TraceCheckUtils]: 15: Hoare triple {454#false} assume !!~bvslt32(~i~0, 100000bv32);call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);call write~unchecked~intINTTYPE4(#t~mem6, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~mem7, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);havoc #t~mem6;havoc #t~mem7;#t~short9 := 3bv32 != ~i~0; {454#false} is VALID [2018-11-18 20:57:30,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {454#false} assume true; {454#false} is VALID [2018-11-18 20:57:30,212 INFO L273 TraceCheckUtils]: 13: Hoare triple {454#false} call write~intINTTYPE4(30bv32, ~#a~0.base, ~bvadd32(24bv32, ~#a~0.offset), 4bv32);call write~intINTTYPE4(40bv32, ~#a~0.base, ~bvadd32(28bv32, ~#a~0.offset), 4bv32);~i~0 := 0bv32; {454#false} is VALID [2018-11-18 20:57:30,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {550#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {454#false} is VALID [2018-11-18 20:57:30,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {550#(bvslt main_~i~0 (_ bv100000 32))} assume true; {550#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-18 20:57:30,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {550#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-18 20:57:30,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:30,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:30,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:30,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:30,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {453#true} havoc ~i~0;~i~0 := 0bv32; {557#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:30,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret11 := main(); {453#true} is VALID [2018-11-18 20:57:30,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #69#return; {453#true} is VALID [2018-11-18 20:57:30,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2018-11-18 20:57:30,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {453#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(800000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {453#true} is VALID [2018-11-18 20:57:30,318 INFO L256 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2018-11-18 20:57:30,319 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:57:30,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:57:30,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 20:57:30,322 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-18 20:57:30,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:57:30,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 20:57:30,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:57:30,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 20:57:30,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 20:57:30,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 20:57:30,442 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 6 states. [2018-11-18 20:57:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:31,201 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2018-11-18 20:57:31,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 20:57:31,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-18 20:57:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:57:31,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 20:57:31,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2018-11-18 20:57:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 20:57:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2018-11-18 20:57:31,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 100 transitions. [2018-11-18 20:57:31,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:57:31,406 INFO L225 Difference]: With dead ends: 79 [2018-11-18 20:57:31,407 INFO L226 Difference]: Without dead ends: 65 [2018-11-18 20:57:31,407 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 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:57:31,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-18 20:57:31,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 42. [2018-11-18 20:57:31,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:57:31,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 42 states. [2018-11-18 20:57:31,442 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 42 states. [2018-11-18 20:57:31,442 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 42 states. [2018-11-18 20:57:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:31,447 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2018-11-18 20:57:31,447 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2018-11-18 20:57:31,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:57:31,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:57:31,449 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 65 states. [2018-11-18 20:57:31,449 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 65 states. [2018-11-18 20:57:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:31,454 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2018-11-18 20:57:31,454 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 81 transitions. [2018-11-18 20:57:31,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:57:31,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:57:31,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:57:31,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:57:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-18 20:57:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-18 20:57:31,458 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 22 [2018-11-18 20:57:31,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:57:31,458 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-18 20:57:31,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 20:57:31,458 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-18 20:57:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-18 20:57:31,460 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:57:31,460 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:57:31,460 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:57:31,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:57:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash 82394806, now seen corresponding path program 2 times [2018-11-18 20:57:31,461 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:57:31,461 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:57:31,482 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 20:57:31,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 20:57:31,573 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 20:57:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:57:31,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:57:31,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2018-11-18 20:57:31,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {877#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(800000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {877#true} is VALID [2018-11-18 20:57:31,704 INFO L273 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2018-11-18 20:57:31,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #69#return; {877#true} is VALID [2018-11-18 20:57:31,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret11 := main(); {877#true} is VALID [2018-11-18 20:57:31,705 INFO L273 TraceCheckUtils]: 5: Hoare triple {877#true} havoc ~i~0;~i~0 := 0bv32; {897#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:31,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {897#(= main_~i~0 (_ bv0 32))} assume true; {897#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:31,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {897#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {897#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:31,707 INFO L273 TraceCheckUtils]: 8: Hoare triple {897#(= main_~i~0 (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {897#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:31,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {897#(= main_~i~0 (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {897#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:31,712 INFO L273 TraceCheckUtils]: 10: Hoare triple {897#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {913#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:31,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {913#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {913#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:31,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {913#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {913#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:31,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {913#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {913#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:31,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {913#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {913#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:31,724 INFO L273 TraceCheckUtils]: 15: Hoare triple {913#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {929#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:31,725 INFO L273 TraceCheckUtils]: 16: Hoare triple {929#(= (_ bv2 32) main_~i~0)} assume true; {929#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:31,725 INFO L273 TraceCheckUtils]: 17: Hoare triple {929#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {929#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:31,725 INFO L273 TraceCheckUtils]: 18: Hoare triple {929#(= (_ bv2 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {929#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:31,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {929#(= (_ bv2 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {929#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:31,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {929#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {945#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:31,727 INFO L273 TraceCheckUtils]: 21: Hoare triple {945#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {945#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:31,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {945#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {945#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:31,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {945#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {945#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:31,729 INFO L273 TraceCheckUtils]: 24: Hoare triple {945#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {945#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:31,733 INFO L273 TraceCheckUtils]: 25: Hoare triple {945#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {961#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:31,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {961#(= (_ bv4 32) main_~i~0)} assume true; {961#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:31,734 INFO L273 TraceCheckUtils]: 27: Hoare triple {961#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {878#false} is VALID [2018-11-18 20:57:31,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {878#false} call write~intINTTYPE4(30bv32, ~#a~0.base, ~bvadd32(24bv32, ~#a~0.offset), 4bv32);call write~intINTTYPE4(40bv32, ~#a~0.base, ~bvadd32(28bv32, ~#a~0.offset), 4bv32);~i~0 := 0bv32; {878#false} is VALID [2018-11-18 20:57:31,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {878#false} assume true; {878#false} is VALID [2018-11-18 20:57:31,735 INFO L273 TraceCheckUtils]: 30: Hoare triple {878#false} assume !!~bvslt32(~i~0, 100000bv32);call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);call write~unchecked~intINTTYPE4(#t~mem6, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~mem7, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);havoc #t~mem6;havoc #t~mem7;#t~short9 := 3bv32 != ~i~0; {878#false} is VALID [2018-11-18 20:57:31,735 INFO L273 TraceCheckUtils]: 31: Hoare triple {878#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);#t~short9 := 0bv32 == #t~mem8; {878#false} is VALID [2018-11-18 20:57:31,735 INFO L273 TraceCheckUtils]: 32: Hoare triple {878#false} assume #t~short9;havoc #t~mem8;havoc #t~short9;call #t~mem10 := read~intINTTYPE4(~#s1~0.base, ~#s1~0.offset, 4bv32); {878#false} is VALID [2018-11-18 20:57:31,735 INFO L256 TraceCheckUtils]: 33: Hoare triple {878#false} call __VERIFIER_assert((if 10bv32 == #t~mem10 then 1bv32 else 0bv32)); {878#false} is VALID [2018-11-18 20:57:31,736 INFO L273 TraceCheckUtils]: 34: Hoare triple {878#false} ~cond := #in~cond; {878#false} is VALID [2018-11-18 20:57:31,736 INFO L273 TraceCheckUtils]: 35: Hoare triple {878#false} assume 0bv32 == ~cond; {878#false} is VALID [2018-11-18 20:57:31,737 INFO L273 TraceCheckUtils]: 36: Hoare triple {878#false} assume !false; {878#false} is VALID [2018-11-18 20:57:31,739 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 20:57:31,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:57:31,978 INFO L273 TraceCheckUtils]: 36: Hoare triple {878#false} assume !false; {878#false} is VALID [2018-11-18 20:57:31,978 INFO L273 TraceCheckUtils]: 35: Hoare triple {878#false} assume 0bv32 == ~cond; {878#false} is VALID [2018-11-18 20:57:31,978 INFO L273 TraceCheckUtils]: 34: Hoare triple {878#false} ~cond := #in~cond; {878#false} is VALID [2018-11-18 20:57:31,978 INFO L256 TraceCheckUtils]: 33: Hoare triple {878#false} call __VERIFIER_assert((if 10bv32 == #t~mem10 then 1bv32 else 0bv32)); {878#false} is VALID [2018-11-18 20:57:31,979 INFO L273 TraceCheckUtils]: 32: Hoare triple {878#false} assume #t~short9;havoc #t~mem8;havoc #t~short9;call #t~mem10 := read~intINTTYPE4(~#s1~0.base, ~#s1~0.offset, 4bv32); {878#false} is VALID [2018-11-18 20:57:31,979 INFO L273 TraceCheckUtils]: 31: Hoare triple {878#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);#t~short9 := 0bv32 == #t~mem8; {878#false} is VALID [2018-11-18 20:57:31,979 INFO L273 TraceCheckUtils]: 30: Hoare triple {878#false} assume !!~bvslt32(~i~0, 100000bv32);call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);call write~unchecked~intINTTYPE4(#t~mem6, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~mem7, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);havoc #t~mem6;havoc #t~mem7;#t~short9 := 3bv32 != ~i~0; {878#false} is VALID [2018-11-18 20:57:31,979 INFO L273 TraceCheckUtils]: 29: Hoare triple {878#false} assume true; {878#false} is VALID [2018-11-18 20:57:31,979 INFO L273 TraceCheckUtils]: 28: Hoare triple {878#false} call write~intINTTYPE4(30bv32, ~#a~0.base, ~bvadd32(24bv32, ~#a~0.offset), 4bv32);call write~intINTTYPE4(40bv32, ~#a~0.base, ~bvadd32(28bv32, ~#a~0.offset), 4bv32);~i~0 := 0bv32; {878#false} is VALID [2018-11-18 20:57:31,995 INFO L273 TraceCheckUtils]: 27: Hoare triple {1022#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {878#false} is VALID [2018-11-18 20:57:31,996 INFO L273 TraceCheckUtils]: 26: Hoare triple {1022#(bvslt main_~i~0 (_ bv100000 32))} assume true; {1022#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-18 20:57:31,997 INFO L273 TraceCheckUtils]: 25: Hoare triple {1029#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1022#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-18 20:57:31,998 INFO L273 TraceCheckUtils]: 24: Hoare triple {1029#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1029#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:31,998 INFO L273 TraceCheckUtils]: 23: Hoare triple {1029#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1029#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {1029#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1029#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,004 INFO L273 TraceCheckUtils]: 21: Hoare triple {1029#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1029#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1029#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,010 INFO L273 TraceCheckUtils]: 17: Hoare triple {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,017 INFO L273 TraceCheckUtils]: 15: Hoare triple {1061#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1045#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,018 INFO L273 TraceCheckUtils]: 14: Hoare triple {1061#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1061#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,021 INFO L273 TraceCheckUtils]: 13: Hoare triple {1061#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1061#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {1061#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1061#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {1061#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1061#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,029 INFO L273 TraceCheckUtils]: 10: Hoare triple {1077#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1061#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,030 INFO L273 TraceCheckUtils]: 9: Hoare triple {1077#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1077#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {1077#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1077#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {1077#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1077#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {1077#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1077#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,032 INFO L273 TraceCheckUtils]: 5: Hoare triple {877#true} havoc ~i~0;~i~0 := 0bv32; {1077#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:32,032 INFO L256 TraceCheckUtils]: 4: Hoare triple {877#true} call #t~ret11 := main(); {877#true} is VALID [2018-11-18 20:57:32,032 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {877#true} {877#true} #69#return; {877#true} is VALID [2018-11-18 20:57:32,032 INFO L273 TraceCheckUtils]: 2: Hoare triple {877#true} assume true; {877#true} is VALID [2018-11-18 20:57:32,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {877#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(800000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {877#true} is VALID [2018-11-18 20:57:32,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {877#true} call ULTIMATE.init(); {877#true} is VALID [2018-11-18 20:57:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 20:57:32,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:57:32,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 20:57:32,040 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-18 20:57:32,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:57:32,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 20:57:32,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:57:32,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 20:57:32,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 20:57:32,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-18 20:57:32,255 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 12 states. [2018-11-18 20:57:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:35,439 INFO L93 Difference]: Finished difference Result 151 states and 199 transitions. [2018-11-18 20:57:35,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 20:57:35,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-18 20:57:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:57:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 20:57:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2018-11-18 20:57:35,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 20:57:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 199 transitions. [2018-11-18 20:57:35,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 199 transitions. [2018-11-18 20:57:35,992 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:57:35,998 INFO L225 Difference]: With dead ends: 151 [2018-11-18 20:57:35,998 INFO L226 Difference]: Without dead ends: 137 [2018-11-18 20:57:35,999 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 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:57:36,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-18 20:57:36,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 72. [2018-11-18 20:57:36,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:57:36,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 72 states. [2018-11-18 20:57:36,071 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 72 states. [2018-11-18 20:57:36,071 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 72 states. [2018-11-18 20:57:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:36,080 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2018-11-18 20:57:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 177 transitions. [2018-11-18 20:57:36,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:57:36,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:57:36,083 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 137 states. [2018-11-18 20:57:36,083 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 137 states. [2018-11-18 20:57:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:36,092 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2018-11-18 20:57:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 177 transitions. [2018-11-18 20:57:36,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:57:36,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:57:36,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:57:36,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:57:36,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-18 20:57:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2018-11-18 20:57:36,098 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 37 [2018-11-18 20:57:36,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:57:36,098 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2018-11-18 20:57:36,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 20:57:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2018-11-18 20:57:36,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-18 20:57:36,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:57:36,101 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:57:36,104 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:57:36,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:57:36,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1578731638, now seen corresponding path program 3 times [2018-11-18 20:57:36,105 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:57:36,105 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:57:36,132 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 20:57:40,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-18 20:57:40,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 20:57:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:57:40,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:57:41,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {1673#true} call ULTIMATE.init(); {1673#true} is VALID [2018-11-18 20:57:41,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {1673#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(800000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {1673#true} is VALID [2018-11-18 20:57:41,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {1673#true} assume true; {1673#true} is VALID [2018-11-18 20:57:41,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1673#true} {1673#true} #69#return; {1673#true} is VALID [2018-11-18 20:57:41,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {1673#true} call #t~ret11 := main(); {1673#true} is VALID [2018-11-18 20:57:41,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {1673#true} havoc ~i~0;~i~0 := 0bv32; {1693#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:41,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {1693#(= main_~i~0 (_ bv0 32))} assume true; {1693#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:41,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {1693#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1693#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:41,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {1693#(= main_~i~0 (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1693#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:41,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {1693#(= main_~i~0 (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1693#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:41,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {1693#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,299 INFO L273 TraceCheckUtils]: 12: Hoare triple {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {1709#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1725#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:41,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {1725#(= (_ bv2 32) main_~i~0)} assume true; {1725#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:41,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {1725#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1725#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:41,304 INFO L273 TraceCheckUtils]: 18: Hoare triple {1725#(= (_ bv2 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1725#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:41,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {1725#(= (_ bv2 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1725#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:41,306 INFO L273 TraceCheckUtils]: 20: Hoare triple {1725#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,306 INFO L273 TraceCheckUtils]: 21: Hoare triple {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,307 INFO L273 TraceCheckUtils]: 22: Hoare triple {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,308 INFO L273 TraceCheckUtils]: 23: Hoare triple {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,309 INFO L273 TraceCheckUtils]: 24: Hoare triple {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,310 INFO L273 TraceCheckUtils]: 25: Hoare triple {1741#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1757#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:41,311 INFO L273 TraceCheckUtils]: 26: Hoare triple {1757#(= (_ bv4 32) main_~i~0)} assume true; {1757#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:41,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {1757#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1757#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:41,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {1757#(= (_ bv4 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1757#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:41,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {1757#(= (_ bv4 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1757#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:41,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {1757#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {1773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,336 INFO L273 TraceCheckUtils]: 32: Hoare triple {1773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {1773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,337 INFO L273 TraceCheckUtils]: 34: Hoare triple {1773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,338 INFO L273 TraceCheckUtils]: 35: Hoare triple {1773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1789#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:57:41,339 INFO L273 TraceCheckUtils]: 36: Hoare triple {1789#(= (_ bv6 32) main_~i~0)} assume true; {1789#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:57:41,340 INFO L273 TraceCheckUtils]: 37: Hoare triple {1789#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1789#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:57:41,340 INFO L273 TraceCheckUtils]: 38: Hoare triple {1789#(= (_ bv6 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1789#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:57:41,341 INFO L273 TraceCheckUtils]: 39: Hoare triple {1789#(= (_ bv6 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1789#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:57:41,342 INFO L273 TraceCheckUtils]: 40: Hoare triple {1789#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1805#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,344 INFO L273 TraceCheckUtils]: 41: Hoare triple {1805#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {1805#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,345 INFO L273 TraceCheckUtils]: 42: Hoare triple {1805#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1805#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,345 INFO L273 TraceCheckUtils]: 43: Hoare triple {1805#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1805#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,346 INFO L273 TraceCheckUtils]: 44: Hoare triple {1805#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1805#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,347 INFO L273 TraceCheckUtils]: 45: Hoare triple {1805#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1821#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:57:41,347 INFO L273 TraceCheckUtils]: 46: Hoare triple {1821#(= (_ bv8 32) main_~i~0)} assume true; {1821#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:57:41,348 INFO L273 TraceCheckUtils]: 47: Hoare triple {1821#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1821#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:57:41,348 INFO L273 TraceCheckUtils]: 48: Hoare triple {1821#(= (_ bv8 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1821#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:57:41,348 INFO L273 TraceCheckUtils]: 49: Hoare triple {1821#(= (_ bv8 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1821#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:57:41,349 INFO L273 TraceCheckUtils]: 50: Hoare triple {1821#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1837#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,350 INFO L273 TraceCheckUtils]: 51: Hoare triple {1837#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {1837#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,351 INFO L273 TraceCheckUtils]: 52: Hoare triple {1837#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1837#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,358 INFO L273 TraceCheckUtils]: 53: Hoare triple {1837#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1837#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,359 INFO L273 TraceCheckUtils]: 54: Hoare triple {1837#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1837#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:41,359 INFO L273 TraceCheckUtils]: 55: Hoare triple {1837#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1853#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 20:57:41,360 INFO L273 TraceCheckUtils]: 56: Hoare triple {1853#(= (_ bv10 32) main_~i~0)} assume true; {1853#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 20:57:41,360 INFO L273 TraceCheckUtils]: 57: Hoare triple {1853#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1674#false} is VALID [2018-11-18 20:57:41,361 INFO L273 TraceCheckUtils]: 58: Hoare triple {1674#false} call write~intINTTYPE4(30bv32, ~#a~0.base, ~bvadd32(24bv32, ~#a~0.offset), 4bv32);call write~intINTTYPE4(40bv32, ~#a~0.base, ~bvadd32(28bv32, ~#a~0.offset), 4bv32);~i~0 := 0bv32; {1674#false} is VALID [2018-11-18 20:57:41,361 INFO L273 TraceCheckUtils]: 59: Hoare triple {1674#false} assume true; {1674#false} is VALID [2018-11-18 20:57:41,361 INFO L273 TraceCheckUtils]: 60: Hoare triple {1674#false} assume !!~bvslt32(~i~0, 100000bv32);call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);call write~unchecked~intINTTYPE4(#t~mem6, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~mem7, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);havoc #t~mem6;havoc #t~mem7;#t~short9 := 3bv32 != ~i~0; {1674#false} is VALID [2018-11-18 20:57:41,361 INFO L273 TraceCheckUtils]: 61: Hoare triple {1674#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);#t~short9 := 0bv32 == #t~mem8; {1674#false} is VALID [2018-11-18 20:57:41,361 INFO L273 TraceCheckUtils]: 62: Hoare triple {1674#false} assume #t~short9;havoc #t~mem8;havoc #t~short9;call #t~mem10 := read~intINTTYPE4(~#s1~0.base, ~#s1~0.offset, 4bv32); {1674#false} is VALID [2018-11-18 20:57:41,362 INFO L256 TraceCheckUtils]: 63: Hoare triple {1674#false} call __VERIFIER_assert((if 10bv32 == #t~mem10 then 1bv32 else 0bv32)); {1674#false} is VALID [2018-11-18 20:57:41,362 INFO L273 TraceCheckUtils]: 64: Hoare triple {1674#false} ~cond := #in~cond; {1674#false} is VALID [2018-11-18 20:57:41,363 INFO L273 TraceCheckUtils]: 65: Hoare triple {1674#false} assume 0bv32 == ~cond; {1674#false} is VALID [2018-11-18 20:57:41,363 INFO L273 TraceCheckUtils]: 66: Hoare triple {1674#false} assume !false; {1674#false} is VALID [2018-11-18 20:57:41,374 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 20:57:41,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:57:42,081 INFO L273 TraceCheckUtils]: 66: Hoare triple {1674#false} assume !false; {1674#false} is VALID [2018-11-18 20:57:42,081 INFO L273 TraceCheckUtils]: 65: Hoare triple {1674#false} assume 0bv32 == ~cond; {1674#false} is VALID [2018-11-18 20:57:42,081 INFO L273 TraceCheckUtils]: 64: Hoare triple {1674#false} ~cond := #in~cond; {1674#false} is VALID [2018-11-18 20:57:42,082 INFO L256 TraceCheckUtils]: 63: Hoare triple {1674#false} call __VERIFIER_assert((if 10bv32 == #t~mem10 then 1bv32 else 0bv32)); {1674#false} is VALID [2018-11-18 20:57:42,082 INFO L273 TraceCheckUtils]: 62: Hoare triple {1674#false} assume #t~short9;havoc #t~mem8;havoc #t~short9;call #t~mem10 := read~intINTTYPE4(~#s1~0.base, ~#s1~0.offset, 4bv32); {1674#false} is VALID [2018-11-18 20:57:42,082 INFO L273 TraceCheckUtils]: 61: Hoare triple {1674#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);#t~short9 := 0bv32 == #t~mem8; {1674#false} is VALID [2018-11-18 20:57:42,082 INFO L273 TraceCheckUtils]: 60: Hoare triple {1674#false} assume !!~bvslt32(~i~0, 100000bv32);call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);call write~unchecked~intINTTYPE4(#t~mem6, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~mem7, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);havoc #t~mem6;havoc #t~mem7;#t~short9 := 3bv32 != ~i~0; {1674#false} is VALID [2018-11-18 20:57:42,083 INFO L273 TraceCheckUtils]: 59: Hoare triple {1674#false} assume true; {1674#false} is VALID [2018-11-18 20:57:42,083 INFO L273 TraceCheckUtils]: 58: Hoare triple {1674#false} call write~intINTTYPE4(30bv32, ~#a~0.base, ~bvadd32(24bv32, ~#a~0.offset), 4bv32);call write~intINTTYPE4(40bv32, ~#a~0.base, ~bvadd32(28bv32, ~#a~0.offset), 4bv32);~i~0 := 0bv32; {1674#false} is VALID [2018-11-18 20:57:42,084 INFO L273 TraceCheckUtils]: 57: Hoare triple {1914#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1674#false} is VALID [2018-11-18 20:57:42,085 INFO L273 TraceCheckUtils]: 56: Hoare triple {1914#(bvslt main_~i~0 (_ bv100000 32))} assume true; {1914#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-18 20:57:42,086 INFO L273 TraceCheckUtils]: 55: Hoare triple {1921#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1914#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-18 20:57:42,087 INFO L273 TraceCheckUtils]: 54: Hoare triple {1921#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1921#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,088 INFO L273 TraceCheckUtils]: 53: Hoare triple {1921#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1921#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,088 INFO L273 TraceCheckUtils]: 52: Hoare triple {1921#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1921#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,090 INFO L273 TraceCheckUtils]: 51: Hoare triple {1921#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1921#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,094 INFO L273 TraceCheckUtils]: 50: Hoare triple {1937#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1921#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,095 INFO L273 TraceCheckUtils]: 49: Hoare triple {1937#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1937#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,113 INFO L273 TraceCheckUtils]: 48: Hoare triple {1937#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1937#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,114 INFO L273 TraceCheckUtils]: 47: Hoare triple {1937#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1937#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,115 INFO L273 TraceCheckUtils]: 46: Hoare triple {1937#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1937#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,121 INFO L273 TraceCheckUtils]: 45: Hoare triple {1953#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1937#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,122 INFO L273 TraceCheckUtils]: 44: Hoare triple {1953#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1953#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,122 INFO L273 TraceCheckUtils]: 43: Hoare triple {1953#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1953#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,123 INFO L273 TraceCheckUtils]: 42: Hoare triple {1953#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1953#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,123 INFO L273 TraceCheckUtils]: 41: Hoare triple {1953#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1953#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {1969#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1953#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,131 INFO L273 TraceCheckUtils]: 39: Hoare triple {1969#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1969#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,131 INFO L273 TraceCheckUtils]: 38: Hoare triple {1969#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1969#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,132 INFO L273 TraceCheckUtils]: 37: Hoare triple {1969#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1969#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,132 INFO L273 TraceCheckUtils]: 36: Hoare triple {1969#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1969#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,136 INFO L273 TraceCheckUtils]: 35: Hoare triple {1985#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1969#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,137 INFO L273 TraceCheckUtils]: 34: Hoare triple {1985#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {1985#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,140 INFO L273 TraceCheckUtils]: 33: Hoare triple {1985#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1985#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,140 INFO L273 TraceCheckUtils]: 32: Hoare triple {1985#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {1985#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {1985#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {1985#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,147 INFO L273 TraceCheckUtils]: 30: Hoare triple {2001#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {1985#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,153 INFO L273 TraceCheckUtils]: 29: Hoare triple {2001#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {2001#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,155 INFO L273 TraceCheckUtils]: 28: Hoare triple {2001#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {2001#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {2001#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {2001#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,156 INFO L273 TraceCheckUtils]: 26: Hoare triple {2001#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {2001#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {2017#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {2001#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,167 INFO L273 TraceCheckUtils]: 24: Hoare triple {2017#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {2017#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,168 INFO L273 TraceCheckUtils]: 23: Hoare triple {2017#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {2017#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {2017#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {2017#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,169 INFO L273 TraceCheckUtils]: 21: Hoare triple {2017#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {2017#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,175 INFO L273 TraceCheckUtils]: 20: Hoare triple {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {2017#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,175 INFO L273 TraceCheckUtils]: 19: Hoare triple {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,176 INFO L273 TraceCheckUtils]: 17: Hoare triple {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,183 INFO L273 TraceCheckUtils]: 15: Hoare triple {2049#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {2033#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {2049#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {2049#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {2049#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {2049#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {2049#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {2049#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,185 INFO L273 TraceCheckUtils]: 11: Hoare triple {2049#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {2049#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,190 INFO L273 TraceCheckUtils]: 10: Hoare triple {2065#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {2049#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,190 INFO L273 TraceCheckUtils]: 9: Hoare triple {2065#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {2065#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {2065#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {2065#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {2065#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {2065#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {2065#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {2065#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {1673#true} havoc ~i~0;~i~0 := 0bv32; {2065#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:57:42,192 INFO L256 TraceCheckUtils]: 4: Hoare triple {1673#true} call #t~ret11 := main(); {1673#true} is VALID [2018-11-18 20:57:42,192 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1673#true} {1673#true} #69#return; {1673#true} is VALID [2018-11-18 20:57:42,193 INFO L273 TraceCheckUtils]: 2: Hoare triple {1673#true} assume true; {1673#true} is VALID [2018-11-18 20:57:42,193 INFO L273 TraceCheckUtils]: 1: Hoare triple {1673#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(800000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {1673#true} is VALID [2018-11-18 20:57:42,193 INFO L256 TraceCheckUtils]: 0: Hoare triple {1673#true} call ULTIMATE.init(); {1673#true} is VALID [2018-11-18 20:57:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 20:57:42,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:57:42,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-18 20:57:42,217 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-11-18 20:57:42,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:57:42,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 20:57:42,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:57:42,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 20:57:42,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 20:57:42,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-18 20:57:42,494 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 24 states. [2018-11-18 20:57:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:56,273 INFO L93 Difference]: Finished difference Result 295 states and 397 transitions. [2018-11-18 20:57:56,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 20:57:56,273 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-11-18 20:57:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:57:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 20:57:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 397 transitions. [2018-11-18 20:57:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 20:57:56,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 397 transitions. [2018-11-18 20:57:56,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 397 transitions. [2018-11-18 20:57:56,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:57:56,995 INFO L225 Difference]: With dead ends: 295 [2018-11-18 20:57:56,995 INFO L226 Difference]: Without dead ends: 281 [2018-11-18 20:57:56,997 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 111 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:57:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-18 20:57:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 132. [2018-11-18 20:57:57,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:57:57,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand 132 states. [2018-11-18 20:57:57,091 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 132 states. [2018-11-18 20:57:57,091 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 132 states. [2018-11-18 20:57:57,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:57,106 INFO L93 Difference]: Finished difference Result 281 states and 369 transitions. [2018-11-18 20:57:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 369 transitions. [2018-11-18 20:57:57,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:57:57,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:57:57,108 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 281 states. [2018-11-18 20:57:57,108 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 281 states. [2018-11-18 20:57:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:57:57,122 INFO L93 Difference]: Finished difference Result 281 states and 369 transitions. [2018-11-18 20:57:57,122 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 369 transitions. [2018-11-18 20:57:57,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:57:57,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:57:57,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:57:57,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:57:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-18 20:57:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 157 transitions. [2018-11-18 20:57:57,129 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 157 transitions. Word has length 67 [2018-11-18 20:57:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:57:57,129 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 157 transitions. [2018-11-18 20:57:57,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 20:57:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 157 transitions. [2018-11-18 20:57:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-18 20:57:57,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:57:57,131 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:57:57,131 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:57:57,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:57:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash -416846858, now seen corresponding path program 4 times [2018-11-18 20:57:57,132 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:57:57,133 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:57:57,156 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 20:57:57,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 20:57:57,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 20:57:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 20:57:57,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 20:57:58,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {3213#true} call ULTIMATE.init(); {3213#true} is VALID [2018-11-18 20:57:58,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {3213#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(800000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {3213#true} is VALID [2018-11-18 20:57:58,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {3213#true} assume true; {3213#true} is VALID [2018-11-18 20:57:58,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3213#true} {3213#true} #69#return; {3213#true} is VALID [2018-11-18 20:57:58,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {3213#true} call #t~ret11 := main(); {3213#true} is VALID [2018-11-18 20:57:58,144 INFO L273 TraceCheckUtils]: 5: Hoare triple {3213#true} havoc ~i~0;~i~0 := 0bv32; {3233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:58,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {3233#(= main_~i~0 (_ bv0 32))} assume true; {3233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:58,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {3233#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:58,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {3233#(= main_~i~0 (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:58,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {3233#(= main_~i~0 (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3233#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-18 20:57:58,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {3233#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3249#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {3249#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3249#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {3249#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3249#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {3249#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3249#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,154 INFO L273 TraceCheckUtils]: 14: Hoare triple {3249#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3249#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {3249#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3265#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:58,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {3265#(= (_ bv2 32) main_~i~0)} assume true; {3265#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:58,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {3265#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3265#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:58,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {3265#(= (_ bv2 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3265#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:58,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {3265#(= (_ bv2 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3265#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-18 20:57:58,161 INFO L273 TraceCheckUtils]: 20: Hoare triple {3265#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3281#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {3281#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3281#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {3281#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3281#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,167 INFO L273 TraceCheckUtils]: 23: Hoare triple {3281#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3281#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,170 INFO L273 TraceCheckUtils]: 24: Hoare triple {3281#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3281#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,172 INFO L273 TraceCheckUtils]: 25: Hoare triple {3281#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3297#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:58,172 INFO L273 TraceCheckUtils]: 26: Hoare triple {3297#(= (_ bv4 32) main_~i~0)} assume true; {3297#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:58,174 INFO L273 TraceCheckUtils]: 27: Hoare triple {3297#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3297#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:58,174 INFO L273 TraceCheckUtils]: 28: Hoare triple {3297#(= (_ bv4 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3297#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:58,177 INFO L273 TraceCheckUtils]: 29: Hoare triple {3297#(= (_ bv4 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3297#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-18 20:57:58,177 INFO L273 TraceCheckUtils]: 30: Hoare triple {3297#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3313#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,180 INFO L273 TraceCheckUtils]: 31: Hoare triple {3313#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3313#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,180 INFO L273 TraceCheckUtils]: 32: Hoare triple {3313#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3313#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {3313#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3313#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,182 INFO L273 TraceCheckUtils]: 34: Hoare triple {3313#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3313#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,184 INFO L273 TraceCheckUtils]: 35: Hoare triple {3313#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3329#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:57:58,184 INFO L273 TraceCheckUtils]: 36: Hoare triple {3329#(= (_ bv6 32) main_~i~0)} assume true; {3329#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:57:58,186 INFO L273 TraceCheckUtils]: 37: Hoare triple {3329#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3329#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:57:58,186 INFO L273 TraceCheckUtils]: 38: Hoare triple {3329#(= (_ bv6 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3329#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:57:58,188 INFO L273 TraceCheckUtils]: 39: Hoare triple {3329#(= (_ bv6 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3329#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-18 20:57:58,188 INFO L273 TraceCheckUtils]: 40: Hoare triple {3329#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3345#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,191 INFO L273 TraceCheckUtils]: 41: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {3345#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,191 INFO L273 TraceCheckUtils]: 42: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3345#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,192 INFO L273 TraceCheckUtils]: 43: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3345#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,193 INFO L273 TraceCheckUtils]: 44: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3345#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,193 INFO L273 TraceCheckUtils]: 45: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3361#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:57:58,196 INFO L273 TraceCheckUtils]: 46: Hoare triple {3361#(= (_ bv8 32) main_~i~0)} assume true; {3361#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:57:58,196 INFO L273 TraceCheckUtils]: 47: Hoare triple {3361#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3361#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:57:58,198 INFO L273 TraceCheckUtils]: 48: Hoare triple {3361#(= (_ bv8 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3361#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:57:58,198 INFO L273 TraceCheckUtils]: 49: Hoare triple {3361#(= (_ bv8 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3361#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-18 20:57:58,201 INFO L273 TraceCheckUtils]: 50: Hoare triple {3361#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3377#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,201 INFO L273 TraceCheckUtils]: 51: Hoare triple {3377#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {3377#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,204 INFO L273 TraceCheckUtils]: 52: Hoare triple {3377#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3377#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,204 INFO L273 TraceCheckUtils]: 53: Hoare triple {3377#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3377#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,207 INFO L273 TraceCheckUtils]: 54: Hoare triple {3377#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3377#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,207 INFO L273 TraceCheckUtils]: 55: Hoare triple {3377#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3393#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 20:57:58,210 INFO L273 TraceCheckUtils]: 56: Hoare triple {3393#(= (_ bv10 32) main_~i~0)} assume true; {3393#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 20:57:58,210 INFO L273 TraceCheckUtils]: 57: Hoare triple {3393#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3393#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 20:57:58,212 INFO L273 TraceCheckUtils]: 58: Hoare triple {3393#(= (_ bv10 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3393#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 20:57:58,212 INFO L273 TraceCheckUtils]: 59: Hoare triple {3393#(= (_ bv10 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3393#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-18 20:57:58,214 INFO L273 TraceCheckUtils]: 60: Hoare triple {3393#(= (_ bv10 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3409#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,214 INFO L273 TraceCheckUtils]: 61: Hoare triple {3409#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume true; {3409#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,217 INFO L273 TraceCheckUtils]: 62: Hoare triple {3409#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3409#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,217 INFO L273 TraceCheckUtils]: 63: Hoare triple {3409#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3409#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,222 INFO L273 TraceCheckUtils]: 64: Hoare triple {3409#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3409#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,222 INFO L273 TraceCheckUtils]: 65: Hoare triple {3409#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3425#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-18 20:57:58,229 INFO L273 TraceCheckUtils]: 66: Hoare triple {3425#(= (_ bv12 32) main_~i~0)} assume true; {3425#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-18 20:57:58,229 INFO L273 TraceCheckUtils]: 67: Hoare triple {3425#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3425#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-18 20:57:58,229 INFO L273 TraceCheckUtils]: 68: Hoare triple {3425#(= (_ bv12 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3425#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-18 20:57:58,232 INFO L273 TraceCheckUtils]: 69: Hoare triple {3425#(= (_ bv12 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3425#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-18 20:57:58,232 INFO L273 TraceCheckUtils]: 70: Hoare triple {3425#(= (_ bv12 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3441#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,235 INFO L273 TraceCheckUtils]: 71: Hoare triple {3441#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {3441#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,235 INFO L273 TraceCheckUtils]: 72: Hoare triple {3441#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3441#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,238 INFO L273 TraceCheckUtils]: 73: Hoare triple {3441#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3441#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,238 INFO L273 TraceCheckUtils]: 74: Hoare triple {3441#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3441#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,240 INFO L273 TraceCheckUtils]: 75: Hoare triple {3441#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3457#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-18 20:57:58,240 INFO L273 TraceCheckUtils]: 76: Hoare triple {3457#(= (_ bv14 32) main_~i~0)} assume true; {3457#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-18 20:57:58,243 INFO L273 TraceCheckUtils]: 77: Hoare triple {3457#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3457#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-18 20:57:58,243 INFO L273 TraceCheckUtils]: 78: Hoare triple {3457#(= (_ bv14 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3457#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-18 20:57:58,246 INFO L273 TraceCheckUtils]: 79: Hoare triple {3457#(= (_ bv14 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3457#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-18 20:57:58,246 INFO L273 TraceCheckUtils]: 80: Hoare triple {3457#(= (_ bv14 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3473#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,248 INFO L273 TraceCheckUtils]: 81: Hoare triple {3473#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume true; {3473#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,248 INFO L273 TraceCheckUtils]: 82: Hoare triple {3473#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3473#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,251 INFO L273 TraceCheckUtils]: 83: Hoare triple {3473#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3473#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,251 INFO L273 TraceCheckUtils]: 84: Hoare triple {3473#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3473#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,254 INFO L273 TraceCheckUtils]: 85: Hoare triple {3473#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3489#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-18 20:57:58,254 INFO L273 TraceCheckUtils]: 86: Hoare triple {3489#(= (_ bv16 32) main_~i~0)} assume true; {3489#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-18 20:57:58,257 INFO L273 TraceCheckUtils]: 87: Hoare triple {3489#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3489#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-18 20:57:58,257 INFO L273 TraceCheckUtils]: 88: Hoare triple {3489#(= (_ bv16 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3489#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-18 20:57:58,260 INFO L273 TraceCheckUtils]: 89: Hoare triple {3489#(= (_ bv16 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3489#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-18 20:57:58,260 INFO L273 TraceCheckUtils]: 90: Hoare triple {3489#(= (_ bv16 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3505#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,263 INFO L273 TraceCheckUtils]: 91: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume true; {3505#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,263 INFO L273 TraceCheckUtils]: 92: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3505#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,265 INFO L273 TraceCheckUtils]: 93: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3505#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,267 INFO L273 TraceCheckUtils]: 94: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3505#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,267 INFO L273 TraceCheckUtils]: 95: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3521#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-18 20:57:58,269 INFO L273 TraceCheckUtils]: 96: Hoare triple {3521#(= (_ bv18 32) main_~i~0)} assume true; {3521#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-18 20:57:58,272 INFO L273 TraceCheckUtils]: 97: Hoare triple {3521#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3521#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-18 20:57:58,272 INFO L273 TraceCheckUtils]: 98: Hoare triple {3521#(= (_ bv18 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3521#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-18 20:57:58,278 INFO L273 TraceCheckUtils]: 99: Hoare triple {3521#(= (_ bv18 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3521#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-18 20:57:58,280 INFO L273 TraceCheckUtils]: 100: Hoare triple {3521#(= (_ bv18 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3537#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,280 INFO L273 TraceCheckUtils]: 101: Hoare triple {3537#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume true; {3537#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,282 INFO L273 TraceCheckUtils]: 102: Hoare triple {3537#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3537#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,282 INFO L273 TraceCheckUtils]: 103: Hoare triple {3537#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3537#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,284 INFO L273 TraceCheckUtils]: 104: Hoare triple {3537#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3537#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,284 INFO L273 TraceCheckUtils]: 105: Hoare triple {3537#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3553#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-18 20:57:58,287 INFO L273 TraceCheckUtils]: 106: Hoare triple {3553#(= (_ bv20 32) main_~i~0)} assume true; {3553#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-18 20:57:58,287 INFO L273 TraceCheckUtils]: 107: Hoare triple {3553#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3553#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-18 20:57:58,289 INFO L273 TraceCheckUtils]: 108: Hoare triple {3553#(= (_ bv20 32) main_~i~0)} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3553#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-18 20:57:58,289 INFO L273 TraceCheckUtils]: 109: Hoare triple {3553#(= (_ bv20 32) main_~i~0)} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3553#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-18 20:57:58,291 INFO L273 TraceCheckUtils]: 110: Hoare triple {3553#(= (_ bv20 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3569#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,291 INFO L273 TraceCheckUtils]: 111: Hoare triple {3569#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume true; {3569#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,292 INFO L273 TraceCheckUtils]: 112: Hoare triple {3569#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3569#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,293 INFO L273 TraceCheckUtils]: 113: Hoare triple {3569#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3569#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,293 INFO L273 TraceCheckUtils]: 114: Hoare triple {3569#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3569#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,295 INFO L273 TraceCheckUtils]: 115: Hoare triple {3569#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3585#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,295 INFO L273 TraceCheckUtils]: 116: Hoare triple {3585#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {3585#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-18 20:57:58,297 INFO L273 TraceCheckUtils]: 117: Hoare triple {3585#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3214#false} is VALID [2018-11-18 20:57:58,297 INFO L273 TraceCheckUtils]: 118: Hoare triple {3214#false} call write~intINTTYPE4(30bv32, ~#a~0.base, ~bvadd32(24bv32, ~#a~0.offset), 4bv32);call write~intINTTYPE4(40bv32, ~#a~0.base, ~bvadd32(28bv32, ~#a~0.offset), 4bv32);~i~0 := 0bv32; {3214#false} is VALID [2018-11-18 20:57:58,297 INFO L273 TraceCheckUtils]: 119: Hoare triple {3214#false} assume true; {3214#false} is VALID [2018-11-18 20:57:58,297 INFO L273 TraceCheckUtils]: 120: Hoare triple {3214#false} assume !!~bvslt32(~i~0, 100000bv32);call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);call write~unchecked~intINTTYPE4(#t~mem6, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~mem7, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);havoc #t~mem6;havoc #t~mem7;#t~short9 := 3bv32 != ~i~0; {3214#false} is VALID [2018-11-18 20:57:58,297 INFO L273 TraceCheckUtils]: 121: Hoare triple {3214#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);#t~short9 := 0bv32 == #t~mem8; {3214#false} is VALID [2018-11-18 20:57:58,297 INFO L273 TraceCheckUtils]: 122: Hoare triple {3214#false} assume #t~short9;havoc #t~mem8;havoc #t~short9;call #t~mem10 := read~intINTTYPE4(~#s1~0.base, ~#s1~0.offset, 4bv32); {3214#false} is VALID [2018-11-18 20:57:58,297 INFO L256 TraceCheckUtils]: 123: Hoare triple {3214#false} call __VERIFIER_assert((if 10bv32 == #t~mem10 then 1bv32 else 0bv32)); {3214#false} is VALID [2018-11-18 20:57:58,298 INFO L273 TraceCheckUtils]: 124: Hoare triple {3214#false} ~cond := #in~cond; {3214#false} is VALID [2018-11-18 20:57:58,298 INFO L273 TraceCheckUtils]: 125: Hoare triple {3214#false} assume 0bv32 == ~cond; {3214#false} is VALID [2018-11-18 20:57:58,298 INFO L273 TraceCheckUtils]: 126: Hoare triple {3214#false} assume !false; {3214#false} is VALID [2018-11-18 20:57:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 20:57:58,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 20:58:00,595 INFO L273 TraceCheckUtils]: 126: Hoare triple {3214#false} assume !false; {3214#false} is VALID [2018-11-18 20:58:00,595 INFO L273 TraceCheckUtils]: 125: Hoare triple {3214#false} assume 0bv32 == ~cond; {3214#false} is VALID [2018-11-18 20:58:00,596 INFO L273 TraceCheckUtils]: 124: Hoare triple {3214#false} ~cond := #in~cond; {3214#false} is VALID [2018-11-18 20:58:00,596 INFO L256 TraceCheckUtils]: 123: Hoare triple {3214#false} call __VERIFIER_assert((if 10bv32 == #t~mem10 then 1bv32 else 0bv32)); {3214#false} is VALID [2018-11-18 20:58:00,596 INFO L273 TraceCheckUtils]: 122: Hoare triple {3214#false} assume #t~short9;havoc #t~mem8;havoc #t~short9;call #t~mem10 := read~intINTTYPE4(~#s1~0.base, ~#s1~0.offset, 4bv32); {3214#false} is VALID [2018-11-18 20:58:00,596 INFO L273 TraceCheckUtils]: 121: Hoare triple {3214#false} assume #t~short9;call #t~mem8 := read~intINTTYPE4(~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);#t~short9 := 0bv32 == #t~mem8; {3214#false} is VALID [2018-11-18 20:58:00,596 INFO L273 TraceCheckUtils]: 120: Hoare triple {3214#false} assume !!~bvslt32(~i~0, 100000bv32);call ~#s1~0.base, ~#s1~0.offset := #Ultimate.alloc(8bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(0bv32, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);call write~unchecked~intINTTYPE4(#t~mem6, ~#s1~0.base, ~#s1~0.offset, 4bv32);call write~unchecked~intINTTYPE4(#t~mem7, ~#s1~0.base, ~bvadd32(4bv32, ~#s1~0.offset), 4bv32);havoc #t~mem6;havoc #t~mem7;#t~short9 := 3bv32 != ~i~0; {3214#false} is VALID [2018-11-18 20:58:00,596 INFO L273 TraceCheckUtils]: 119: Hoare triple {3214#false} assume true; {3214#false} is VALID [2018-11-18 20:58:00,596 INFO L273 TraceCheckUtils]: 118: Hoare triple {3214#false} call write~intINTTYPE4(30bv32, ~#a~0.base, ~bvadd32(24bv32, ~#a~0.offset), 4bv32);call write~intINTTYPE4(40bv32, ~#a~0.base, ~bvadd32(28bv32, ~#a~0.offset), 4bv32);~i~0 := 0bv32; {3214#false} is VALID [2018-11-18 20:58:00,601 INFO L273 TraceCheckUtils]: 117: Hoare triple {3646#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3214#false} is VALID [2018-11-18 20:58:00,603 INFO L273 TraceCheckUtils]: 116: Hoare triple {3646#(bvslt main_~i~0 (_ bv100000 32))} assume true; {3646#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-18 20:58:00,604 INFO L273 TraceCheckUtils]: 115: Hoare triple {3653#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3646#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-18 20:58:00,604 INFO L273 TraceCheckUtils]: 114: Hoare triple {3653#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3653#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,604 INFO L273 TraceCheckUtils]: 113: Hoare triple {3653#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3653#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,605 INFO L273 TraceCheckUtils]: 112: Hoare triple {3653#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3653#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,605 INFO L273 TraceCheckUtils]: 111: Hoare triple {3653#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {3653#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,611 INFO L273 TraceCheckUtils]: 110: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3653#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,611 INFO L273 TraceCheckUtils]: 109: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3669#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,612 INFO L273 TraceCheckUtils]: 108: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3669#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,612 INFO L273 TraceCheckUtils]: 107: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3669#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,612 INFO L273 TraceCheckUtils]: 106: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {3669#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,618 INFO L273 TraceCheckUtils]: 105: Hoare triple {3685#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3669#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,618 INFO L273 TraceCheckUtils]: 104: Hoare triple {3685#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3685#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,618 INFO L273 TraceCheckUtils]: 103: Hoare triple {3685#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3685#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,619 INFO L273 TraceCheckUtils]: 102: Hoare triple {3685#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3685#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,619 INFO L273 TraceCheckUtils]: 101: Hoare triple {3685#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {3685#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,625 INFO L273 TraceCheckUtils]: 100: Hoare triple {3701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3685#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,626 INFO L273 TraceCheckUtils]: 99: Hoare triple {3701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,626 INFO L273 TraceCheckUtils]: 98: Hoare triple {3701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,626 INFO L273 TraceCheckUtils]: 97: Hoare triple {3701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,627 INFO L273 TraceCheckUtils]: 96: Hoare triple {3701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {3701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,634 INFO L273 TraceCheckUtils]: 95: Hoare triple {3717#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3701#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,635 INFO L273 TraceCheckUtils]: 94: Hoare triple {3717#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3717#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,635 INFO L273 TraceCheckUtils]: 93: Hoare triple {3717#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3717#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,635 INFO L273 TraceCheckUtils]: 92: Hoare triple {3717#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3717#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,636 INFO L273 TraceCheckUtils]: 91: Hoare triple {3717#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {3717#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,641 INFO L273 TraceCheckUtils]: 90: Hoare triple {3733#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3717#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,641 INFO L273 TraceCheckUtils]: 89: Hoare triple {3733#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3733#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,641 INFO L273 TraceCheckUtils]: 88: Hoare triple {3733#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3733#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,642 INFO L273 TraceCheckUtils]: 87: Hoare triple {3733#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3733#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,642 INFO L273 TraceCheckUtils]: 86: Hoare triple {3733#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {3733#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,652 INFO L273 TraceCheckUtils]: 85: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3733#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,652 INFO L273 TraceCheckUtils]: 84: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3749#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,653 INFO L273 TraceCheckUtils]: 83: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3749#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,653 INFO L273 TraceCheckUtils]: 82: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3749#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,653 INFO L273 TraceCheckUtils]: 81: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {3749#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,658 INFO L273 TraceCheckUtils]: 80: Hoare triple {3765#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3749#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,658 INFO L273 TraceCheckUtils]: 79: Hoare triple {3765#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3765#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,659 INFO L273 TraceCheckUtils]: 78: Hoare triple {3765#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3765#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,659 INFO L273 TraceCheckUtils]: 77: Hoare triple {3765#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3765#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,659 INFO L273 TraceCheckUtils]: 76: Hoare triple {3765#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {3765#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,663 INFO L273 TraceCheckUtils]: 75: Hoare triple {3781#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3765#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,664 INFO L273 TraceCheckUtils]: 74: Hoare triple {3781#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3781#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,664 INFO L273 TraceCheckUtils]: 73: Hoare triple {3781#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3781#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,665 INFO L273 TraceCheckUtils]: 72: Hoare triple {3781#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3781#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,665 INFO L273 TraceCheckUtils]: 71: Hoare triple {3781#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {3781#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,673 INFO L273 TraceCheckUtils]: 70: Hoare triple {3797#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3781#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,673 INFO L273 TraceCheckUtils]: 69: Hoare triple {3797#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3797#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,674 INFO L273 TraceCheckUtils]: 68: Hoare triple {3797#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3797#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,674 INFO L273 TraceCheckUtils]: 67: Hoare triple {3797#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3797#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,674 INFO L273 TraceCheckUtils]: 66: Hoare triple {3797#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {3797#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,682 INFO L273 TraceCheckUtils]: 65: Hoare triple {3813#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3797#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,683 INFO L273 TraceCheckUtils]: 64: Hoare triple {3813#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3813#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,683 INFO L273 TraceCheckUtils]: 63: Hoare triple {3813#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3813#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,683 INFO L273 TraceCheckUtils]: 62: Hoare triple {3813#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3813#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,684 INFO L273 TraceCheckUtils]: 61: Hoare triple {3813#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume true; {3813#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,689 INFO L273 TraceCheckUtils]: 60: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3813#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,690 INFO L273 TraceCheckUtils]: 59: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3829#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,690 INFO L273 TraceCheckUtils]: 58: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3829#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,690 INFO L273 TraceCheckUtils]: 57: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3829#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,691 INFO L273 TraceCheckUtils]: 56: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume true; {3829#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,697 INFO L273 TraceCheckUtils]: 55: Hoare triple {3845#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3829#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,698 INFO L273 TraceCheckUtils]: 54: Hoare triple {3845#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3845#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,698 INFO L273 TraceCheckUtils]: 53: Hoare triple {3845#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3845#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {3845#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3845#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,699 INFO L273 TraceCheckUtils]: 51: Hoare triple {3845#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume true; {3845#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,705 INFO L273 TraceCheckUtils]: 50: Hoare triple {3861#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3845#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,706 INFO L273 TraceCheckUtils]: 49: Hoare triple {3861#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3861#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,706 INFO L273 TraceCheckUtils]: 48: Hoare triple {3861#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3861#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,708 INFO L273 TraceCheckUtils]: 47: Hoare triple {3861#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3861#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,709 INFO L273 TraceCheckUtils]: 46: Hoare triple {3861#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume true; {3861#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,715 INFO L273 TraceCheckUtils]: 45: Hoare triple {3877#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3861#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,715 INFO L273 TraceCheckUtils]: 44: Hoare triple {3877#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3877#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,716 INFO L273 TraceCheckUtils]: 43: Hoare triple {3877#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3877#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,716 INFO L273 TraceCheckUtils]: 42: Hoare triple {3877#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3877#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,717 INFO L273 TraceCheckUtils]: 41: Hoare triple {3877#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume true; {3877#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,724 INFO L273 TraceCheckUtils]: 40: Hoare triple {3893#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3877#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,725 INFO L273 TraceCheckUtils]: 39: Hoare triple {3893#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3893#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,725 INFO L273 TraceCheckUtils]: 38: Hoare triple {3893#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3893#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,726 INFO L273 TraceCheckUtils]: 37: Hoare triple {3893#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3893#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,726 INFO L273 TraceCheckUtils]: 36: Hoare triple {3893#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume true; {3893#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,732 INFO L273 TraceCheckUtils]: 35: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3893#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,732 INFO L273 TraceCheckUtils]: 34: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3909#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,733 INFO L273 TraceCheckUtils]: 33: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3909#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,733 INFO L273 TraceCheckUtils]: 32: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3909#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,733 INFO L273 TraceCheckUtils]: 31: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume true; {3909#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,742 INFO L273 TraceCheckUtils]: 30: Hoare triple {3925#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3909#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,742 INFO L273 TraceCheckUtils]: 29: Hoare triple {3925#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3925#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,743 INFO L273 TraceCheckUtils]: 28: Hoare triple {3925#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3925#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,743 INFO L273 TraceCheckUtils]: 27: Hoare triple {3925#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3925#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,757 INFO L273 TraceCheckUtils]: 26: Hoare triple {3925#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume true; {3925#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {3941#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3925#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {3941#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3941#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,765 INFO L273 TraceCheckUtils]: 23: Hoare triple {3941#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3941#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,766 INFO L273 TraceCheckUtils]: 22: Hoare triple {3941#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3941#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,766 INFO L273 TraceCheckUtils]: 21: Hoare triple {3941#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume true; {3941#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {3957#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3941#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {3957#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3957#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,773 INFO L273 TraceCheckUtils]: 18: Hoare triple {3957#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3957#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,773 INFO L273 TraceCheckUtils]: 17: Hoare triple {3957#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3957#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,773 INFO L273 TraceCheckUtils]: 16: Hoare triple {3957#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume true; {3957#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {3973#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3957#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,781 INFO L273 TraceCheckUtils]: 14: Hoare triple {3973#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3973#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {3973#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3973#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {3973#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3973#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,783 INFO L273 TraceCheckUtils]: 11: Hoare triple {3973#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume true; {3973#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,789 INFO L273 TraceCheckUtils]: 10: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0;call ULTIMATE.dealloc(~#s~0.base, ~#s~0.offset);havoc ~#s~0.base, ~#s~0.offset; {3973#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,790 INFO L273 TraceCheckUtils]: 9: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} call #t~mem3 := read~intINTTYPE4(~#s~0.base, ~#s~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem4, ~#a~0.base, ~bvadd32(4bv32, ~bvadd32(~#a~0.offset, ~bvmul32(8bv32, ~i~0))), 4bv32);havoc #t~mem3;havoc #t~mem4; {3989#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume 0bv32 == #t~mem2;havoc #t~mem2;call write~intINTTYPE4(10bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {3989#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~q~0 := #t~nondet1;havoc #t~nondet1;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(8bv32);call #t~mem2 := read~intINTTYPE4(~#s~0.base, ~bvadd32(4bv32, ~#s~0.offset), 4bv32); {3989#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume true; {3989#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,791 INFO L273 TraceCheckUtils]: 5: Hoare triple {3213#true} havoc ~i~0;~i~0 := 0bv32; {3989#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-18 20:58:00,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {3213#true} call #t~ret11 := main(); {3213#true} is VALID [2018-11-18 20:58:00,792 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3213#true} {3213#true} #69#return; {3213#true} is VALID [2018-11-18 20:58:00,792 INFO L273 TraceCheckUtils]: 2: Hoare triple {3213#true} assume true; {3213#true} is VALID [2018-11-18 20:58:00,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {3213#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(800000bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {3213#true} is VALID [2018-11-18 20:58:00,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {3213#true} call ULTIMATE.init(); {3213#true} is VALID [2018-11-18 20:58:00,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 0 proven. 1199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 20:58:00,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 20:58:00,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-18 20:58:00,824 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-11-18 20:58:00,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 20:58:00,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-18 20:58:01,349 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:58:01,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-18 20:58:01,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-18 20:58:01,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-18 20:58:01,351 INFO L87 Difference]: Start difference. First operand 132 states and 157 transitions. Second operand 48 states. [2018-11-18 20:58:14,127 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-18 20:58:14,668 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-18 20:58:15,265 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-18 20:58:15,915 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-18 20:58:16,560 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-18 20:58:17,192 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-18 20:58:17,828 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-18 20:58:18,479 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-18 20:59:01,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:59:01,780 INFO L93 Difference]: Finished difference Result 583 states and 793 transitions. [2018-11-18 20:59:01,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-18 20:59:01,780 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-11-18 20:59:01,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 20:59:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 20:59:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 793 transitions. [2018-11-18 20:59:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 20:59:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 793 transitions. [2018-11-18 20:59:01,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 793 transitions. [2018-11-18 20:59:03,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 793 edges. 793 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 20:59:03,434 INFO L225 Difference]: With dead ends: 583 [2018-11-18 20:59:03,435 INFO L226 Difference]: Without dead ends: 569 [2018-11-18 20:59:03,437 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-18 20:59:03,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-11-18 20:59:04,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 252. [2018-11-18 20:59:04,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 20:59:04,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 569 states. Second operand 252 states. [2018-11-18 20:59:04,094 INFO L74 IsIncluded]: Start isIncluded. First operand 569 states. Second operand 252 states. [2018-11-18 20:59:04,095 INFO L87 Difference]: Start difference. First operand 569 states. Second operand 252 states. [2018-11-18 20:59:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:59:04,131 INFO L93 Difference]: Finished difference Result 569 states and 753 transitions. [2018-11-18 20:59:04,131 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 753 transitions. [2018-11-18 20:59:04,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:59:04,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:59:04,135 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 569 states. [2018-11-18 20:59:04,135 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 569 states. [2018-11-18 20:59:04,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 20:59:04,170 INFO L93 Difference]: Finished difference Result 569 states and 753 transitions. [2018-11-18 20:59:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 753 transitions. [2018-11-18 20:59:04,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 20:59:04,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 20:59:04,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 20:59:04,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 20:59:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-18 20:59:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 301 transitions. [2018-11-18 20:59:04,184 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 301 transitions. Word has length 127 [2018-11-18 20:59:04,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 20:59:04,185 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 301 transitions. [2018-11-18 20:59:04,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-18 20:59:04,185 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 301 transitions. [2018-11-18 20:59:04,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-18 20:59:04,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 20:59:04,192 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 20:59:04,192 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 20:59:04,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 20:59:04,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1375177994, now seen corresponding path program 5 times [2018-11-18 20:59:04,196 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 20:59:04,196 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:59:04,222 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1