java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_compareModified_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:26,327 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:26,329 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:26,344 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:26,344 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:26,345 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:26,346 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:26,348 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:26,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:26,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:26,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:26,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:26,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:26,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:26,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:26,356 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:26,357 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:26,359 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:26,361 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:26,362 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:26,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:26,364 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:26,369 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:26,369 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:26,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:26,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:26,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:26,373 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:26,374 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:26,375 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:26,376 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:26,377 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:26,377 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:26,377 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:26,380 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:26,382 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:26,382 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:02:26,410 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:26,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:26,411 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:26,413 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:26,413 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:26,414 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:26,414 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:26,414 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:26,415 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:26,415 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:26,415 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:26,415 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:26,415 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:26,416 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:26,416 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:26,416 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:26,416 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:26,416 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:26,416 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:26,418 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:26,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:26,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:26,419 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:26,419 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:26,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:26,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:26,419 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:26,420 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:26,421 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:26,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:26,421 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:26,421 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:26,421 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:26,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:26,510 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:26,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:26,516 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:26,517 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:26,518 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_compareModified_true-unreach-call_ground.i [2018-11-23 10:02:26,583 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2621f1d/0f6a850fd96546fd8dee7a9c644aa3bc/FLAG99f912547 [2018-11-23 10:02:27,050 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:27,051 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compareModified_true-unreach-call_ground.i [2018-11-23 10:02:27,056 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2621f1d/0f6a850fd96546fd8dee7a9c644aa3bc/FLAG99f912547 [2018-11-23 10:02:27,390 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d2621f1d/0f6a850fd96546fd8dee7a9c644aa3bc [2018-11-23 10:02:27,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:27,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:27,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:27,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:27,412 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:27,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42c5f6e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27, skipping insertion in model container [2018-11-23 10:02:27,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,429 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:27,452 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:27,738 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:27,744 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:27,776 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:27,814 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:27,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27 WrapperNode [2018-11-23 10:02:27,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:27,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:27,816 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:27,817 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:27,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,840 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,850 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:27,851 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:27,851 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:27,851 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:27,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (1/1) ... [2018-11-23 10:02:27,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:27,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:27,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:27,912 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:27,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:28,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:28,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:28,067 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:28,067 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:02:28,709 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:28,710 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:02:28,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:28 BoogieIcfgContainer [2018-11-23 10:02:28,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:28,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:28,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:28,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:28,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:27" (1/3) ... [2018-11-23 10:02:28,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b981a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:28, skipping insertion in model container [2018-11-23 10:02:28,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:27" (2/3) ... [2018-11-23 10:02:28,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b981a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:28, skipping insertion in model container [2018-11-23 10:02:28,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:28" (3/3) ... [2018-11-23 10:02:28,720 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_compareModified_true-unreach-call_ground.i [2018-11-23 10:02:28,730 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:28,738 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:28,758 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:28,792 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:28,792 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:28,793 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:28,793 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:28,794 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:28,794 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:28,794 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:28,794 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:28,794 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 10:02:28,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:02:28,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:28,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:28,824 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:28,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:28,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1032092789, now seen corresponding path program 1 times [2018-11-23 10:02:28,839 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:28,840 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:28,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:28,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:29,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 10:02:29,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {34#true} is VALID [2018-11-23 10:02:29,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 10:02:29,236 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #77#return; {34#true} is VALID [2018-11-23 10:02:29,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret9 := main(); {34#true} is VALID [2018-11-23 10:02:29,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {34#true} is VALID [2018-11-23 10:02:29,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 10:02:29,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#false} havoc ~x~0; {35#false} is VALID [2018-11-23 10:02:29,252 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#false} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {35#false} is VALID [2018-11-23 10:02:29,252 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {35#false} is VALID [2018-11-23 10:02:29,253 INFO L256 TraceCheckUtils]: 10: Hoare triple {35#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {35#false} is VALID [2018-11-23 10:02:29,253 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-23 10:02:29,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#false} assume 0bv32 == ~cond; {35#false} is VALID [2018-11-23 10:02:29,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 10:02:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:29,257 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:02:29,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:29,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:02:29,272 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:02:29,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:29,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:02:29,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:29,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:02:29,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:02:29,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:29,397 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 10:02:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:29,556 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2018-11-23 10:02:29,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:02:29,556 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:02:29,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:29,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 10:02:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2018-11-23 10:02:29,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2018-11-23 10:02:29,927 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:29,939 INFO L225 Difference]: With dead ends: 53 [2018-11-23 10:02:29,939 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 10:02:29,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 10:02:30,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 10:02:30,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:30,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 10:02:30,006 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:02:30,006 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:02:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:30,012 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 10:02:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 10:02:30,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:30,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:30,014 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:02:30,014 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:02:30,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:30,019 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 10:02:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 10:02:30,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:30,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:30,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:30,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:02:30,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 10:02:30,026 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 14 [2018-11-23 10:02:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:30,027 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 10:02:30,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:02:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 10:02:30,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:02:30,028 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:30,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:30,029 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:30,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash -958951712, now seen corresponding path program 1 times [2018-11-23 10:02:30,030 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:30,030 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:30,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:30,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:30,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {233#true} call ULTIMATE.init(); {233#true} is VALID [2018-11-23 10:02:30,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {233#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {233#true} is VALID [2018-11-23 10:02:30,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {233#true} assume true; {233#true} is VALID [2018-11-23 10:02:30,172 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {233#true} {233#true} #77#return; {233#true} is VALID [2018-11-23 10:02:30,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {233#true} call #t~ret9 := main(); {233#true} is VALID [2018-11-23 10:02:30,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {233#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {253#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:30,176 INFO L273 TraceCheckUtils]: 6: Hoare triple {253#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {234#false} is VALID [2018-11-23 10:02:30,176 INFO L273 TraceCheckUtils]: 7: Hoare triple {234#false} havoc ~x~0; {234#false} is VALID [2018-11-23 10:02:30,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {234#false} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {234#false} is VALID [2018-11-23 10:02:30,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {234#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {234#false} is VALID [2018-11-23 10:02:30,177 INFO L256 TraceCheckUtils]: 10: Hoare triple {234#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {234#false} is VALID [2018-11-23 10:02:30,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {234#false} ~cond := #in~cond; {234#false} is VALID [2018-11-23 10:02:30,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {234#false} assume 0bv32 == ~cond; {234#false} is VALID [2018-11-23 10:02:30,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {234#false} assume !false; {234#false} is VALID [2018-11-23 10:02:30,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:30,180 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:30,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:30,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:30,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:02:30,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:30,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:30,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:30,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:30,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:30,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:30,263 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2018-11-23 10:02:30,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:30,730 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 10:02:30,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:30,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:02:30,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 10:02:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-23 10:02:30,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-23 10:02:30,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:30,857 INFO L225 Difference]: With dead ends: 46 [2018-11-23 10:02:30,857 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:02:30,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:02:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 10:02:30,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:30,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 10:02:30,869 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 10:02:30,869 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 10:02:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:30,874 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 10:02:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 10:02:30,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:30,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:30,876 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 10:02:30,876 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 10:02:30,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:30,879 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 10:02:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2018-11-23 10:02:30,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:30,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:30,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:30,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:02:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 10:02:30,883 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 14 [2018-11-23 10:02:30,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:30,884 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 10:02:30,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:30,884 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 10:02:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:02:30,885 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:30,885 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:30,885 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:30,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1796820510, now seen corresponding path program 1 times [2018-11-23 10:02:30,887 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:30,887 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:30,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:30,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:31,068 INFO L256 TraceCheckUtils]: 0: Hoare triple {435#true} call ULTIMATE.init(); {435#true} is VALID [2018-11-23 10:02:31,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {435#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {435#true} is VALID [2018-11-23 10:02:31,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {435#true} assume true; {435#true} is VALID [2018-11-23 10:02:31,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {435#true} {435#true} #77#return; {435#true} is VALID [2018-11-23 10:02:31,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {435#true} call #t~ret9 := main(); {435#true} is VALID [2018-11-23 10:02:31,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {435#true} is VALID [2018-11-23 10:02:31,069 INFO L273 TraceCheckUtils]: 6: Hoare triple {435#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {435#true} is VALID [2018-11-23 10:02:31,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {435#true} assume #t~mem0 != #t~mem1;havoc #t~mem0;havoc #t~mem1;~rv~0 := 0bv32; {461#(= (_ bv0 32) main_~rv~0)} is VALID [2018-11-23 10:02:31,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {461#(= (_ bv0 32) main_~rv~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {461#(= (_ bv0 32) main_~rv~0)} is VALID [2018-11-23 10:02:31,071 INFO L273 TraceCheckUtils]: 9: Hoare triple {461#(= (_ bv0 32) main_~rv~0)} assume !~bvslt32(~i~0, 100000bv32); {461#(= (_ bv0 32) main_~rv~0)} is VALID [2018-11-23 10:02:31,072 INFO L273 TraceCheckUtils]: 10: Hoare triple {461#(= (_ bv0 32) main_~rv~0)} havoc ~x~0; {461#(= (_ bv0 32) main_~rv~0)} is VALID [2018-11-23 10:02:31,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {461#(= (_ bv0 32) main_~rv~0)} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {436#false} is VALID [2018-11-23 10:02:31,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {436#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {436#false} is VALID [2018-11-23 10:02:31,073 INFO L256 TraceCheckUtils]: 13: Hoare triple {436#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {436#false} is VALID [2018-11-23 10:02:31,073 INFO L273 TraceCheckUtils]: 14: Hoare triple {436#false} ~cond := #in~cond; {436#false} is VALID [2018-11-23 10:02:31,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {436#false} assume 0bv32 == ~cond; {436#false} is VALID [2018-11-23 10:02:31,074 INFO L273 TraceCheckUtils]: 16: Hoare triple {436#false} assume !false; {436#false} is VALID [2018-11-23 10:02:31,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:31,077 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:31,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:31,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:31,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:02:31,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:31,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:31,111 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:31,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:31,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:31,112 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2018-11-23 10:02:31,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:31,278 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2018-11-23 10:02:31,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:31,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 10:02:31,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 10:02:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-23 10:02:31,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-23 10:02:31,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:31,529 INFO L225 Difference]: With dead ends: 52 [2018-11-23 10:02:31,530 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:02:31,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:02:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-11-23 10:02:31,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:31,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 32 states. [2018-11-23 10:02:31,558 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 32 states. [2018-11-23 10:02:31,558 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 32 states. [2018-11-23 10:02:31,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:31,562 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 10:02:31,562 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 10:02:31,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:31,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:31,563 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 37 states. [2018-11-23 10:02:31,563 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 37 states. [2018-11-23 10:02:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:31,567 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 10:02:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-11-23 10:02:31,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:31,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:31,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:31,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 10:02:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2018-11-23 10:02:31,571 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 17 [2018-11-23 10:02:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:31,571 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2018-11-23 10:02:31,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2018-11-23 10:02:31,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 10:02:31,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:31,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:31,573 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:31,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:31,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2105119776, now seen corresponding path program 1 times [2018-11-23 10:02:31,574 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:31,574 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:31,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:31,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:31,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {677#true} is VALID [2018-11-23 10:02:31,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {677#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {677#true} is VALID [2018-11-23 10:02:31,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2018-11-23 10:02:31,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #77#return; {677#true} is VALID [2018-11-23 10:02:31,713 INFO L256 TraceCheckUtils]: 4: Hoare triple {677#true} call #t~ret9 := main(); {677#true} is VALID [2018-11-23 10:02:31,719 INFO L273 TraceCheckUtils]: 5: Hoare triple {677#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {697#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:31,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {697#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {697#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:31,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {697#(= main_~i~0 (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {697#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:31,724 INFO L273 TraceCheckUtils]: 8: Hoare triple {697#(= main_~i~0 (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {707#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:31,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {707#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {678#false} is VALID [2018-11-23 10:02:31,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {678#false} havoc ~x~0; {678#false} is VALID [2018-11-23 10:02:31,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {678#false} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {678#false} is VALID [2018-11-23 10:02:31,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {678#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {678#false} is VALID [2018-11-23 10:02:31,725 INFO L256 TraceCheckUtils]: 13: Hoare triple {678#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {678#false} is VALID [2018-11-23 10:02:31,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {678#false} ~cond := #in~cond; {678#false} is VALID [2018-11-23 10:02:31,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {678#false} assume 0bv32 == ~cond; {678#false} is VALID [2018-11-23 10:02:31,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {678#false} assume !false; {678#false} is VALID [2018-11-23 10:02:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:31,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:31,830 INFO L273 TraceCheckUtils]: 16: Hoare triple {678#false} assume !false; {678#false} is VALID [2018-11-23 10:02:31,830 INFO L273 TraceCheckUtils]: 15: Hoare triple {678#false} assume 0bv32 == ~cond; {678#false} is VALID [2018-11-23 10:02:31,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {678#false} ~cond := #in~cond; {678#false} is VALID [2018-11-23 10:02:31,831 INFO L256 TraceCheckUtils]: 13: Hoare triple {678#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {678#false} is VALID [2018-11-23 10:02:31,831 INFO L273 TraceCheckUtils]: 12: Hoare triple {678#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {678#false} is VALID [2018-11-23 10:02:31,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {678#false} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {678#false} is VALID [2018-11-23 10:02:31,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {678#false} havoc ~x~0; {678#false} is VALID [2018-11-23 10:02:31,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {753#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {678#false} is VALID [2018-11-23 10:02:31,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {757#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {753#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:31,835 INFO L273 TraceCheckUtils]: 7: Hoare triple {757#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {757#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:31,837 INFO L273 TraceCheckUtils]: 6: Hoare triple {757#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {757#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:31,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {677#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {757#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:31,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {677#true} call #t~ret9 := main(); {677#true} is VALID [2018-11-23 10:02:31,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {677#true} {677#true} #77#return; {677#true} is VALID [2018-11-23 10:02:31,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {677#true} assume true; {677#true} is VALID [2018-11-23 10:02:31,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {677#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {677#true} is VALID [2018-11-23 10:02:31,840 INFO L256 TraceCheckUtils]: 0: Hoare triple {677#true} call ULTIMATE.init(); {677#true} is VALID [2018-11-23 10:02:31,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:31,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:31,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:31,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 10:02:31,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:31,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:31,887 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:31,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:31,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:31,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:31,888 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 6 states. [2018-11-23 10:02:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,197 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2018-11-23 10:02:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:32,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 10:02:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 10:02:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:32,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2018-11-23 10:02:32,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 67 transitions. [2018-11-23 10:02:32,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:32,434 INFO L225 Difference]: With dead ends: 68 [2018-11-23 10:02:32,434 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 10:02:32,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:32,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 10:02:32,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 10:02:32,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:32,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-23 10:02:32,487 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 10:02:32,487 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 10:02:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,490 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2018-11-23 10:02:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 10:02:32,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:32,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:32,492 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 10:02:32,492 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 10:02:32,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:32,495 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2018-11-23 10:02:32,495 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 10:02:32,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:32,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:32,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:32,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 10:02:32,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2018-11-23 10:02:32,500 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 17 [2018-11-23 10:02:32,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:32,500 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2018-11-23 10:02:32,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:32,500 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2018-11-23 10:02:32,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:02:32,501 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:32,502 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:32,502 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:32,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:32,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1023639264, now seen corresponding path program 2 times [2018-11-23 10:02:32,503 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:32,503 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:32,530 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:32,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:02:32,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:32,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:32,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2018-11-23 10:02:32,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1042#true} is VALID [2018-11-23 10:02:32,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2018-11-23 10:02:32,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #77#return; {1042#true} is VALID [2018-11-23 10:02:32,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2018-11-23 10:02:32,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {1042#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {1062#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:32,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {1062#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1062#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:32,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {1062#(= main_~i~0 (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1062#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:32,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {1062#(= main_~i~0 (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1072#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:32,782 INFO L273 TraceCheckUtils]: 9: Hoare triple {1072#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1072#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:32,783 INFO L273 TraceCheckUtils]: 10: Hoare triple {1072#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1072#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:32,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {1072#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1082#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:32,785 INFO L273 TraceCheckUtils]: 12: Hoare triple {1082#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1082#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:32,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {1082#(= (_ bv2 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1082#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:32,787 INFO L273 TraceCheckUtils]: 14: Hoare triple {1082#(= (_ bv2 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1092#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:32,788 INFO L273 TraceCheckUtils]: 15: Hoare triple {1092#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1092#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:32,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {1092#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1092#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:32,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {1092#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1102#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:32,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {1102#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1043#false} is VALID [2018-11-23 10:02:32,791 INFO L273 TraceCheckUtils]: 19: Hoare triple {1043#false} havoc ~x~0; {1043#false} is VALID [2018-11-23 10:02:32,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {1043#false} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {1043#false} is VALID [2018-11-23 10:02:32,792 INFO L273 TraceCheckUtils]: 21: Hoare triple {1043#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1043#false} is VALID [2018-11-23 10:02:32,792 INFO L256 TraceCheckUtils]: 22: Hoare triple {1043#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {1043#false} is VALID [2018-11-23 10:02:32,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {1043#false} ~cond := #in~cond; {1043#false} is VALID [2018-11-23 10:02:32,793 INFO L273 TraceCheckUtils]: 24: Hoare triple {1043#false} assume 0bv32 == ~cond; {1043#false} is VALID [2018-11-23 10:02:32,793 INFO L273 TraceCheckUtils]: 25: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2018-11-23 10:02:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:32,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:32,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2018-11-23 10:02:32,936 INFO L273 TraceCheckUtils]: 24: Hoare triple {1043#false} assume 0bv32 == ~cond; {1043#false} is VALID [2018-11-23 10:02:32,936 INFO L273 TraceCheckUtils]: 23: Hoare triple {1043#false} ~cond := #in~cond; {1043#false} is VALID [2018-11-23 10:02:32,937 INFO L256 TraceCheckUtils]: 22: Hoare triple {1043#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {1043#false} is VALID [2018-11-23 10:02:32,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {1043#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1043#false} is VALID [2018-11-23 10:02:32,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {1043#false} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {1043#false} is VALID [2018-11-23 10:02:32,938 INFO L273 TraceCheckUtils]: 19: Hoare triple {1043#false} havoc ~x~0; {1043#false} is VALID [2018-11-23 10:02:32,942 INFO L273 TraceCheckUtils]: 18: Hoare triple {1148#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1043#false} is VALID [2018-11-23 10:02:32,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {1152#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1148#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:32,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {1152#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1152#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,944 INFO L273 TraceCheckUtils]: 15: Hoare triple {1152#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1152#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {1162#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1152#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,951 INFO L273 TraceCheckUtils]: 13: Hoare triple {1162#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1162#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,951 INFO L273 TraceCheckUtils]: 12: Hoare triple {1162#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1162#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,957 INFO L273 TraceCheckUtils]: 11: Hoare triple {1172#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1162#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {1172#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1172#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {1172#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1172#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {1182#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1172#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:32,993 INFO L273 TraceCheckUtils]: 7: Hoare triple {1182#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1182#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:33,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {1182#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1182#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:33,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {1042#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {1182#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:33,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2018-11-23 10:02:33,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #77#return; {1042#true} is VALID [2018-11-23 10:02:33,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2018-11-23 10:02:33,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {1042#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1042#true} is VALID [2018-11-23 10:02:33,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2018-11-23 10:02:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:33,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:33,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:02:33,020 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 10:02:33,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:33,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:02:33,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:33,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:02:33,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:02:33,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:02:33,178 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand 12 states. [2018-11-23 10:02:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,478 INFO L93 Difference]: Finished difference Result 104 states and 143 transitions. [2018-11-23 10:02:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:34,478 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-11-23 10:02:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:34,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2018-11-23 10:02:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2018-11-23 10:02:34,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 94 transitions. [2018-11-23 10:02:34,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,704 INFO L225 Difference]: With dead ends: 104 [2018-11-23 10:02:34,704 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 10:02:34,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 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-23 10:02:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 10:02:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-23 10:02:34,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:34,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 85 states. [2018-11-23 10:02:34,756 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-23 10:02:34,757 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-23 10:02:34,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,761 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2018-11-23 10:02:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-11-23 10:02:34,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,762 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-23 10:02:34,762 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-23 10:02:34,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,767 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2018-11-23 10:02:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-11-23 10:02:34,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:34,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:34,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:34,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 10:02:34,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 109 transitions. [2018-11-23 10:02:34,772 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 109 transitions. Word has length 26 [2018-11-23 10:02:34,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:34,773 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 109 transitions. [2018-11-23 10:02:34,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:34,773 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-11-23 10:02:34,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 10:02:34,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:34,775 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:34,775 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:34,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:34,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1937611040, now seen corresponding path program 3 times [2018-11-23 10:02:34,776 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:34,776 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:34,798 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:02:35,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 10:02:35,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:36,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2018-11-23 10:02:36,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {1641#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1641#true} is VALID [2018-11-23 10:02:36,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2018-11-23 10:02:36,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1641#true} #77#return; {1641#true} is VALID [2018-11-23 10:02:36,254 INFO L256 TraceCheckUtils]: 4: Hoare triple {1641#true} call #t~ret9 := main(); {1641#true} is VALID [2018-11-23 10:02:36,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {1641#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {1661#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:36,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {1661#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1661#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:36,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {1661#(= main_~i~0 (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1661#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:36,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {1661#(= main_~i~0 (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {1671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {1671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {1671#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1681#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:36,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {1681#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1681#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:36,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {1681#(= (_ bv2 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1681#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:36,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {1681#(= (_ bv2 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1691#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {1691#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1691#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,266 INFO L273 TraceCheckUtils]: 16: Hoare triple {1691#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1691#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,266 INFO L273 TraceCheckUtils]: 17: Hoare triple {1691#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1701#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,267 INFO L273 TraceCheckUtils]: 18: Hoare triple {1701#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1701#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,267 INFO L273 TraceCheckUtils]: 19: Hoare triple {1701#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1701#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,268 INFO L273 TraceCheckUtils]: 20: Hoare triple {1701#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1711#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {1711#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1711#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,269 INFO L273 TraceCheckUtils]: 22: Hoare triple {1711#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1711#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {1711#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1721#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:36,271 INFO L273 TraceCheckUtils]: 24: Hoare triple {1721#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1721#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:36,271 INFO L273 TraceCheckUtils]: 25: Hoare triple {1721#(= (_ bv6 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1721#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:36,272 INFO L273 TraceCheckUtils]: 26: Hoare triple {1721#(= (_ bv6 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1731#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,273 INFO L273 TraceCheckUtils]: 27: Hoare triple {1731#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1731#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,277 INFO L273 TraceCheckUtils]: 28: Hoare triple {1731#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1731#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,279 INFO L273 TraceCheckUtils]: 29: Hoare triple {1731#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1741#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,279 INFO L273 TraceCheckUtils]: 30: Hoare triple {1741#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1741#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,280 INFO L273 TraceCheckUtils]: 31: Hoare triple {1741#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1741#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,280 INFO L273 TraceCheckUtils]: 32: Hoare triple {1741#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1751#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:02:36,281 INFO L273 TraceCheckUtils]: 33: Hoare triple {1751#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1751#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:02:36,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {1751#(= (_ bv9 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1751#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:02:36,282 INFO L273 TraceCheckUtils]: 35: Hoare triple {1751#(= (_ bv9 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1761#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:36,283 INFO L273 TraceCheckUtils]: 36: Hoare triple {1761#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1642#false} is VALID [2018-11-23 10:02:36,284 INFO L273 TraceCheckUtils]: 37: Hoare triple {1642#false} havoc ~x~0; {1642#false} is VALID [2018-11-23 10:02:36,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {1642#false} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {1642#false} is VALID [2018-11-23 10:02:36,284 INFO L273 TraceCheckUtils]: 39: Hoare triple {1642#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1642#false} is VALID [2018-11-23 10:02:36,285 INFO L256 TraceCheckUtils]: 40: Hoare triple {1642#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {1642#false} is VALID [2018-11-23 10:02:36,285 INFO L273 TraceCheckUtils]: 41: Hoare triple {1642#false} ~cond := #in~cond; {1642#false} is VALID [2018-11-23 10:02:36,286 INFO L273 TraceCheckUtils]: 42: Hoare triple {1642#false} assume 0bv32 == ~cond; {1642#false} is VALID [2018-11-23 10:02:36,286 INFO L273 TraceCheckUtils]: 43: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2018-11-23 10:02:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:36,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:36,799 INFO L273 TraceCheckUtils]: 43: Hoare triple {1642#false} assume !false; {1642#false} is VALID [2018-11-23 10:02:36,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {1642#false} assume 0bv32 == ~cond; {1642#false} is VALID [2018-11-23 10:02:36,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {1642#false} ~cond := #in~cond; {1642#false} is VALID [2018-11-23 10:02:36,800 INFO L256 TraceCheckUtils]: 40: Hoare triple {1642#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {1642#false} is VALID [2018-11-23 10:02:36,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {1642#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1642#false} is VALID [2018-11-23 10:02:36,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {1642#false} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {1642#false} is VALID [2018-11-23 10:02:36,801 INFO L273 TraceCheckUtils]: 37: Hoare triple {1642#false} havoc ~x~0; {1642#false} is VALID [2018-11-23 10:02:36,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {1807#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1642#false} is VALID [2018-11-23 10:02:36,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {1811#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1807#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:36,803 INFO L273 TraceCheckUtils]: 34: Hoare triple {1811#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1811#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,803 INFO L273 TraceCheckUtils]: 33: Hoare triple {1811#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1811#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,810 INFO L273 TraceCheckUtils]: 32: Hoare triple {1821#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1811#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,811 INFO L273 TraceCheckUtils]: 31: Hoare triple {1821#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1821#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {1821#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1821#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,817 INFO L273 TraceCheckUtils]: 29: Hoare triple {1831#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1821#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,818 INFO L273 TraceCheckUtils]: 28: Hoare triple {1831#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1831#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,818 INFO L273 TraceCheckUtils]: 27: Hoare triple {1831#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1831#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,827 INFO L273 TraceCheckUtils]: 26: Hoare triple {1841#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1831#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,828 INFO L273 TraceCheckUtils]: 25: Hoare triple {1841#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1841#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,829 INFO L273 TraceCheckUtils]: 24: Hoare triple {1841#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1841#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,837 INFO L273 TraceCheckUtils]: 23: Hoare triple {1851#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1841#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {1851#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1851#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,839 INFO L273 TraceCheckUtils]: 21: Hoare triple {1851#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1851#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {1861#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1851#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,847 INFO L273 TraceCheckUtils]: 19: Hoare triple {1861#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1861#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {1861#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1861#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {1871#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1861#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {1871#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1871#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {1871#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1871#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {1881#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1871#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {1881#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1881#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {1881#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1881#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,877 INFO L273 TraceCheckUtils]: 11: Hoare triple {1891#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1881#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {1891#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1891#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,911 INFO L273 TraceCheckUtils]: 9: Hoare triple {1891#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1891#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {1901#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1891#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,920 INFO L273 TraceCheckUtils]: 7: Hoare triple {1901#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1901#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {1901#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1901#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,922 INFO L273 TraceCheckUtils]: 5: Hoare triple {1641#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {1901#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {1641#true} call #t~ret9 := main(); {1641#true} is VALID [2018-11-23 10:02:36,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1641#true} {1641#true} #77#return; {1641#true} is VALID [2018-11-23 10:02:36,922 INFO L273 TraceCheckUtils]: 2: Hoare triple {1641#true} assume true; {1641#true} is VALID [2018-11-23 10:02:36,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {1641#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1641#true} is VALID [2018-11-23 10:02:36,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {1641#true} call ULTIMATE.init(); {1641#true} is VALID [2018-11-23 10:02:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:36,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:36,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:02:36,932 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-11-23 10:02:36,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:36,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:02:37,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:02:37,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:02:37,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:02:37,190 INFO L87 Difference]: Start difference. First operand 85 states and 109 transitions. Second operand 24 states. [2018-11-23 10:02:41,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:41,994 INFO L93 Difference]: Finished difference Result 176 states and 251 transitions. [2018-11-23 10:02:41,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:02:41,994 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-11-23 10:02:41,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:41,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 148 transitions. [2018-11-23 10:02:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 148 transitions. [2018-11-23 10:02:42,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 148 transitions. [2018-11-23 10:02:42,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:42,273 INFO L225 Difference]: With dead ends: 176 [2018-11-23 10:02:42,274 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 10:02:42,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:02:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 10:02:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-11-23 10:02:42,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:42,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 157 states. [2018-11-23 10:02:42,377 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 157 states. [2018-11-23 10:02:42,377 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 157 states. [2018-11-23 10:02:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:42,384 INFO L93 Difference]: Finished difference Result 157 states and 205 transitions. [2018-11-23 10:02:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 205 transitions. [2018-11-23 10:02:42,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:42,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:42,385 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 157 states. [2018-11-23 10:02:42,386 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 157 states. [2018-11-23 10:02:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:42,392 INFO L93 Difference]: Finished difference Result 157 states and 205 transitions. [2018-11-23 10:02:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 205 transitions. [2018-11-23 10:02:42,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:42,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:42,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:42,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-23 10:02:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 205 transitions. [2018-11-23 10:02:42,399 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 205 transitions. Word has length 44 [2018-11-23 10:02:42,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:42,399 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 205 transitions. [2018-11-23 10:02:42,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:02:42,399 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 205 transitions. [2018-11-23 10:02:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-23 10:02:42,401 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:42,402 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:42,402 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:42,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:42,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1589496096, now seen corresponding path program 4 times [2018-11-23 10:02:42,403 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:42,403 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:42,430 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:02:42,575 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:02:42,576 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:42,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:43,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {2708#true} call ULTIMATE.init(); {2708#true} is VALID [2018-11-23 10:02:43,325 INFO L273 TraceCheckUtils]: 1: Hoare triple {2708#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2708#true} is VALID [2018-11-23 10:02:43,325 INFO L273 TraceCheckUtils]: 2: Hoare triple {2708#true} assume true; {2708#true} is VALID [2018-11-23 10:02:43,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2708#true} {2708#true} #77#return; {2708#true} is VALID [2018-11-23 10:02:43,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {2708#true} call #t~ret9 := main(); {2708#true} is VALID [2018-11-23 10:02:43,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {2708#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {2728#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:43,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {2728#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2728#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:43,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {2728#(= main_~i~0 (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2728#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:43,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {2728#(= main_~i~0 (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2738#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {2738#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2738#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {2738#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2738#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {2738#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2748#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:43,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {2748#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2748#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:43,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {2748#(= (_ bv2 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2748#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:02:43,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {2748#(= (_ bv2 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2758#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {2758#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2758#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {2758#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2758#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,333 INFO L273 TraceCheckUtils]: 17: Hoare triple {2758#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2768#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {2768#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2768#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,334 INFO L273 TraceCheckUtils]: 19: Hoare triple {2768#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2768#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {2768#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2778#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,336 INFO L273 TraceCheckUtils]: 21: Hoare triple {2778#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2778#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {2778#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2778#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {2778#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2788#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,338 INFO L273 TraceCheckUtils]: 24: Hoare triple {2788#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2788#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,338 INFO L273 TraceCheckUtils]: 25: Hoare triple {2788#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2788#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,339 INFO L273 TraceCheckUtils]: 26: Hoare triple {2788#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2798#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-23 10:02:43,340 INFO L273 TraceCheckUtils]: 27: Hoare triple {2798#(= (_ bv7 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2798#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-23 10:02:43,340 INFO L273 TraceCheckUtils]: 28: Hoare triple {2798#(= (_ bv7 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2798#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-23 10:02:43,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {2798#(= (_ bv7 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2808#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,343 INFO L273 TraceCheckUtils]: 30: Hoare triple {2808#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2808#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,344 INFO L273 TraceCheckUtils]: 31: Hoare triple {2808#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2808#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,345 INFO L273 TraceCheckUtils]: 32: Hoare triple {2808#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2818#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,345 INFO L273 TraceCheckUtils]: 33: Hoare triple {2818#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2818#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,346 INFO L273 TraceCheckUtils]: 34: Hoare triple {2818#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2818#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,349 INFO L273 TraceCheckUtils]: 35: Hoare triple {2818#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2828#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:43,352 INFO L273 TraceCheckUtils]: 36: Hoare triple {2828#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2828#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:43,354 INFO L273 TraceCheckUtils]: 37: Hoare triple {2828#(= (_ bv10 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2828#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:43,355 INFO L273 TraceCheckUtils]: 38: Hoare triple {2828#(= (_ bv10 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2838#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,355 INFO L273 TraceCheckUtils]: 39: Hoare triple {2838#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2838#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,355 INFO L273 TraceCheckUtils]: 40: Hoare triple {2838#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2838#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,356 INFO L273 TraceCheckUtils]: 41: Hoare triple {2838#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2848#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,356 INFO L273 TraceCheckUtils]: 42: Hoare triple {2848#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2848#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,357 INFO L273 TraceCheckUtils]: 43: Hoare triple {2848#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2848#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,357 INFO L273 TraceCheckUtils]: 44: Hoare triple {2848#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2858#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 10:02:43,358 INFO L273 TraceCheckUtils]: 45: Hoare triple {2858#(= (_ bv13 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2858#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 10:02:43,358 INFO L273 TraceCheckUtils]: 46: Hoare triple {2858#(= (_ bv13 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2858#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 10:02:43,360 INFO L273 TraceCheckUtils]: 47: Hoare triple {2858#(= (_ bv13 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2868#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,361 INFO L273 TraceCheckUtils]: 48: Hoare triple {2868#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2868#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,361 INFO L273 TraceCheckUtils]: 49: Hoare triple {2868#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2868#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,362 INFO L273 TraceCheckUtils]: 50: Hoare triple {2868#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2878#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,363 INFO L273 TraceCheckUtils]: 51: Hoare triple {2878#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2878#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,363 INFO L273 TraceCheckUtils]: 52: Hoare triple {2878#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2878#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,364 INFO L273 TraceCheckUtils]: 53: Hoare triple {2878#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2888#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:43,365 INFO L273 TraceCheckUtils]: 54: Hoare triple {2888#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2888#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:43,365 INFO L273 TraceCheckUtils]: 55: Hoare triple {2888#(= (_ bv16 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2888#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:43,367 INFO L273 TraceCheckUtils]: 56: Hoare triple {2888#(= (_ bv16 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2898#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,367 INFO L273 TraceCheckUtils]: 57: Hoare triple {2898#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2898#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,368 INFO L273 TraceCheckUtils]: 58: Hoare triple {2898#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2898#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,369 INFO L273 TraceCheckUtils]: 59: Hoare triple {2898#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2908#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,369 INFO L273 TraceCheckUtils]: 60: Hoare triple {2908#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2908#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,371 INFO L273 TraceCheckUtils]: 61: Hoare triple {2908#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2908#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,371 INFO L273 TraceCheckUtils]: 62: Hoare triple {2908#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2918#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 10:02:43,372 INFO L273 TraceCheckUtils]: 63: Hoare triple {2918#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2918#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 10:02:43,372 INFO L273 TraceCheckUtils]: 64: Hoare triple {2918#(= (_ bv19 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2918#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 10:02:43,373 INFO L273 TraceCheckUtils]: 65: Hoare triple {2918#(= (_ bv19 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2928#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,373 INFO L273 TraceCheckUtils]: 66: Hoare triple {2928#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2928#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,373 INFO L273 TraceCheckUtils]: 67: Hoare triple {2928#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2928#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,375 INFO L273 TraceCheckUtils]: 68: Hoare triple {2928#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2938#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,376 INFO L273 TraceCheckUtils]: 69: Hoare triple {2938#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2938#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,377 INFO L273 TraceCheckUtils]: 70: Hoare triple {2938#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2938#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,377 INFO L273 TraceCheckUtils]: 71: Hoare triple {2938#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2948#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:43,378 INFO L273 TraceCheckUtils]: 72: Hoare triple {2948#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2709#false} is VALID [2018-11-23 10:02:43,378 INFO L273 TraceCheckUtils]: 73: Hoare triple {2709#false} havoc ~x~0; {2709#false} is VALID [2018-11-23 10:02:43,379 INFO L273 TraceCheckUtils]: 74: Hoare triple {2709#false} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {2709#false} is VALID [2018-11-23 10:02:43,379 INFO L273 TraceCheckUtils]: 75: Hoare triple {2709#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2709#false} is VALID [2018-11-23 10:02:43,379 INFO L256 TraceCheckUtils]: 76: Hoare triple {2709#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {2709#false} is VALID [2018-11-23 10:02:43,380 INFO L273 TraceCheckUtils]: 77: Hoare triple {2709#false} ~cond := #in~cond; {2709#false} is VALID [2018-11-23 10:02:43,380 INFO L273 TraceCheckUtils]: 78: Hoare triple {2709#false} assume 0bv32 == ~cond; {2709#false} is VALID [2018-11-23 10:02:43,380 INFO L273 TraceCheckUtils]: 79: Hoare triple {2709#false} assume !false; {2709#false} is VALID [2018-11-23 10:02:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:43,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:45,466 INFO L273 TraceCheckUtils]: 79: Hoare triple {2709#false} assume !false; {2709#false} is VALID [2018-11-23 10:02:45,466 INFO L273 TraceCheckUtils]: 78: Hoare triple {2709#false} assume 0bv32 == ~cond; {2709#false} is VALID [2018-11-23 10:02:45,467 INFO L273 TraceCheckUtils]: 77: Hoare triple {2709#false} ~cond := #in~cond; {2709#false} is VALID [2018-11-23 10:02:45,467 INFO L256 TraceCheckUtils]: 76: Hoare triple {2709#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {2709#false} is VALID [2018-11-23 10:02:45,467 INFO L273 TraceCheckUtils]: 75: Hoare triple {2709#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2709#false} is VALID [2018-11-23 10:02:45,467 INFO L273 TraceCheckUtils]: 74: Hoare triple {2709#false} assume 0bv32 != ~rv~0;~x~0 := 0bv32; {2709#false} is VALID [2018-11-23 10:02:45,467 INFO L273 TraceCheckUtils]: 73: Hoare triple {2709#false} havoc ~x~0; {2709#false} is VALID [2018-11-23 10:02:45,468 INFO L273 TraceCheckUtils]: 72: Hoare triple {2994#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2709#false} is VALID [2018-11-23 10:02:45,469 INFO L273 TraceCheckUtils]: 71: Hoare triple {2998#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2994#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:45,469 INFO L273 TraceCheckUtils]: 70: Hoare triple {2998#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2998#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,471 INFO L273 TraceCheckUtils]: 69: Hoare triple {2998#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2998#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,477 INFO L273 TraceCheckUtils]: 68: Hoare triple {3008#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2998#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,477 INFO L273 TraceCheckUtils]: 67: Hoare triple {3008#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3008#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,478 INFO L273 TraceCheckUtils]: 66: Hoare triple {3008#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3008#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,486 INFO L273 TraceCheckUtils]: 65: Hoare triple {3018#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3008#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,486 INFO L273 TraceCheckUtils]: 64: Hoare triple {3018#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3018#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,487 INFO L273 TraceCheckUtils]: 63: Hoare triple {3018#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3018#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,493 INFO L273 TraceCheckUtils]: 62: Hoare triple {3028#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3018#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,493 INFO L273 TraceCheckUtils]: 61: Hoare triple {3028#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3028#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,493 INFO L273 TraceCheckUtils]: 60: Hoare triple {3028#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3028#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,502 INFO L273 TraceCheckUtils]: 59: Hoare triple {3038#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3028#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,502 INFO L273 TraceCheckUtils]: 58: Hoare triple {3038#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3038#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,503 INFO L273 TraceCheckUtils]: 57: Hoare triple {3038#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3038#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,509 INFO L273 TraceCheckUtils]: 56: Hoare triple {3048#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3038#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,509 INFO L273 TraceCheckUtils]: 55: Hoare triple {3048#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3048#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,510 INFO L273 TraceCheckUtils]: 54: Hoare triple {3048#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3048#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,517 INFO L273 TraceCheckUtils]: 53: Hoare triple {3058#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3048#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,517 INFO L273 TraceCheckUtils]: 52: Hoare triple {3058#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3058#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,518 INFO L273 TraceCheckUtils]: 51: Hoare triple {3058#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3058#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,526 INFO L273 TraceCheckUtils]: 50: Hoare triple {3068#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3058#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,526 INFO L273 TraceCheckUtils]: 49: Hoare triple {3068#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3068#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,527 INFO L273 TraceCheckUtils]: 48: Hoare triple {3068#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3068#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {3078#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3068#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,533 INFO L273 TraceCheckUtils]: 46: Hoare triple {3078#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3078#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,534 INFO L273 TraceCheckUtils]: 45: Hoare triple {3078#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3078#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,541 INFO L273 TraceCheckUtils]: 44: Hoare triple {3088#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3078#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,541 INFO L273 TraceCheckUtils]: 43: Hoare triple {3088#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3088#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,542 INFO L273 TraceCheckUtils]: 42: Hoare triple {3088#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3088#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,550 INFO L273 TraceCheckUtils]: 41: Hoare triple {3098#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3088#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,551 INFO L273 TraceCheckUtils]: 40: Hoare triple {3098#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3098#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,558 INFO L273 TraceCheckUtils]: 39: Hoare triple {3098#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3098#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,565 INFO L273 TraceCheckUtils]: 38: Hoare triple {3108#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3098#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,565 INFO L273 TraceCheckUtils]: 37: Hoare triple {3108#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3108#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,566 INFO L273 TraceCheckUtils]: 36: Hoare triple {3108#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3108#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {3118#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3108#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,574 INFO L273 TraceCheckUtils]: 34: Hoare triple {3118#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3118#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,575 INFO L273 TraceCheckUtils]: 33: Hoare triple {3118#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3118#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,581 INFO L273 TraceCheckUtils]: 32: Hoare triple {3128#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3118#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,581 INFO L273 TraceCheckUtils]: 31: Hoare triple {3128#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3128#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,581 INFO L273 TraceCheckUtils]: 30: Hoare triple {3128#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3128#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,592 INFO L273 TraceCheckUtils]: 29: Hoare triple {3138#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3128#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,594 INFO L273 TraceCheckUtils]: 28: Hoare triple {3138#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3138#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,595 INFO L273 TraceCheckUtils]: 27: Hoare triple {3138#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3138#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,602 INFO L273 TraceCheckUtils]: 26: Hoare triple {3148#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3138#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,603 INFO L273 TraceCheckUtils]: 25: Hoare triple {3148#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3148#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,604 INFO L273 TraceCheckUtils]: 24: Hoare triple {3148#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3148#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,610 INFO L273 TraceCheckUtils]: 23: Hoare triple {3158#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3148#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {3158#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3158#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {3158#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3158#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,619 INFO L273 TraceCheckUtils]: 20: Hoare triple {3168#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3158#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {3168#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3168#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,620 INFO L273 TraceCheckUtils]: 18: Hoare triple {3168#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3168#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,625 INFO L273 TraceCheckUtils]: 17: Hoare triple {3178#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3168#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,626 INFO L273 TraceCheckUtils]: 16: Hoare triple {3178#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3178#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {3178#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3178#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {3188#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3178#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {3188#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3188#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {3188#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3188#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {3198#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3188#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {3198#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3198#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,642 INFO L273 TraceCheckUtils]: 9: Hoare triple {3198#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3198#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {3208#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3198#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {3208#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3208#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {3208#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3208#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {2708#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {3208#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:45,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {2708#true} call #t~ret9 := main(); {2708#true} is VALID [2018-11-23 10:02:45,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2708#true} {2708#true} #77#return; {2708#true} is VALID [2018-11-23 10:02:45,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {2708#true} assume true; {2708#true} is VALID [2018-11-23 10:02:45,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {2708#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2708#true} is VALID [2018-11-23 10:02:45,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {2708#true} call ULTIMATE.init(); {2708#true} is VALID [2018-11-23 10:02:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:02:45,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:45,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:02:45,664 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 80 [2018-11-23 10:02:45,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:45,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:02:46,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:46,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:02:46,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:02:46,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:02:46,095 INFO L87 Difference]: Start difference. First operand 157 states and 205 transitions. Second operand 48 states. [2018-11-23 10:02:55,468 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:02:55,987 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:02:56,536 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:02:57,134 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:02:57,732 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:02:58,343 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:02:58,943 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:03:06,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:06,393 INFO L93 Difference]: Finished difference Result 320 states and 467 transitions. [2018-11-23 10:03:06,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:03:06,393 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 80 [2018-11-23 10:03:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:03:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 256 transitions. [2018-11-23 10:03:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:06,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 256 transitions. [2018-11-23 10:03:06,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 256 transitions. [2018-11-23 10:03:06,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:03:06,968 INFO L225 Difference]: With dead ends: 320 [2018-11-23 10:03:06,968 INFO L226 Difference]: Without dead ends: 301 [2018-11-23 10:03:06,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:03:06,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-11-23 10:03:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-11-23 10:03:07,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:03:07,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand 301 states. [2018-11-23 10:03:07,265 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand 301 states. [2018-11-23 10:03:07,265 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 301 states. [2018-11-23 10:03:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:07,278 INFO L93 Difference]: Finished difference Result 301 states and 397 transitions. [2018-11-23 10:03:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 397 transitions. [2018-11-23 10:03:07,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:07,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:07,280 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand 301 states. [2018-11-23 10:03:07,280 INFO L87 Difference]: Start difference. First operand 301 states. Second operand 301 states. [2018-11-23 10:03:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:07,293 INFO L93 Difference]: Finished difference Result 301 states and 397 transitions. [2018-11-23 10:03:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 397 transitions. [2018-11-23 10:03:07,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:07,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:07,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:03:07,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:03:07,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-11-23 10:03:07,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 397 transitions. [2018-11-23 10:03:07,307 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 397 transitions. Word has length 80 [2018-11-23 10:03:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:03:07,308 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 397 transitions. [2018-11-23 10:03:07,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:03:07,308 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 397 transitions. [2018-11-23 10:03:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-11-23 10:03:07,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:03:07,311 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:03:07,311 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:03:07,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:03:07,312 INFO L82 PathProgramCache]: Analyzing trace with hash -137767200, now seen corresponding path program 5 times [2018-11-23 10:03:07,313 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:03:07,313 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:03:07,340 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1