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_copyInit_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:06:05,541 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:06:05,543 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:06:05,559 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:06:05,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:06:05,561 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:06:05,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:06:05,564 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:06:05,566 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:06:05,567 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:06:05,568 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:06:05,568 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:06:05,569 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:06:05,570 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:06:05,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:06:05,572 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:06:05,573 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:06:05,575 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:06:05,577 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:06:05,579 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:06:05,580 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:06:05,582 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:06:05,585 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:06:05,585 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:06:05,585 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:06:05,586 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:06:05,587 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:06:05,588 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:06:05,589 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:06:05,590 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:06:05,591 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:06:05,591 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:06:05,592 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:06:05,592 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:06:05,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:06:05,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:06:05,594 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:06:05,617 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:06:05,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:06:05,619 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:06:05,619 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:06:05,619 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:06:05,620 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:06:05,620 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:06:05,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:06:05,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:06:05,621 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:06:05,621 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:06:05,621 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:06:05,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:06:05,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:06:05,621 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:06:05,622 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:06:05,622 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:06:05,622 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:06:05,622 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:06:05,623 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:06:05,623 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:06:05,623 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:06:05,623 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:06:05,623 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:06:05,624 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:06:05,624 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:06:05,624 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:06:05,624 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:06:05,624 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:06:05,625 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:06:05,625 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:06:05,625 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:06:05,625 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:06:05,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:06:05,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:06:05,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:06:05,699 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:06:05,700 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:06:05,701 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInit_true-unreach-call_ground.i [2018-11-23 10:06:05,762 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a450a4ef/f2b3767145944f6ba0dcfb03fb413542/FLAG103a9a612 [2018-11-23 10:06:06,218 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:06:06,219 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInit_true-unreach-call_ground.i [2018-11-23 10:06:06,227 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a450a4ef/f2b3767145944f6ba0dcfb03fb413542/FLAG103a9a612 [2018-11-23 10:06:06,538 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a450a4ef/f2b3767145944f6ba0dcfb03fb413542 [2018-11-23 10:06:06,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:06:06,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:06:06,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:06:06,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:06:06,557 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:06:06,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8d527e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06, skipping insertion in model container [2018-11-23 10:06:06,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:06:06,595 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:06:06,799 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:06:06,804 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:06:06,831 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:06:06,853 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:06:06,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06 WrapperNode [2018-11-23 10:06:06,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:06:06,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:06:06,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:06:06,855 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:06:06,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:06:06,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:06:06,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:06:06,883 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:06:06,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (1/1) ... [2018-11-23 10:06:06,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:06:06,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:06:06,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:06:06,925 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:06:06,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:06:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:06:07,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:06:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:06:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:06:07,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:06:07,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:06:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:06:07,051 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:06:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:06:07,051 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:06:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:06:07,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:06:07,578 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:06:07,579 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:06:07,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:07 BoogieIcfgContainer [2018-11-23 10:06:07,580 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:06:07,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:06:07,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:06:07,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:06:07,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:06" (1/3) ... [2018-11-23 10:06:07,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2f34c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:07, skipping insertion in model container [2018-11-23 10:06:07,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:06" (2/3) ... [2018-11-23 10:06:07,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d2f34c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:07, skipping insertion in model container [2018-11-23 10:06:07,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:07" (3/3) ... [2018-11-23 10:06:07,589 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInit_true-unreach-call_ground.i [2018-11-23 10:06:07,599 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:06:07,608 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:06:07,625 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:06:07,658 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:06:07,659 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:06:07,659 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:06:07,660 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:06:07,660 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:06:07,660 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:06:07,660 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:06:07,660 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:06:07,661 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:06:07,678 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 10:06:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:06:07,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:07,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:07,689 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:07,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1085876810, now seen corresponding path program 1 times [2018-11-23 10:06:07,699 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:07,700 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:06:07,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:07,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:07,913 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 10:06:07,917 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {29#true} is VALID [2018-11-23 10:06:07,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 10:06:07,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #62#return; {29#true} is VALID [2018-11-23 10:06:07,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2018-11-23 10:06:07,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {29#true} is VALID [2018-11-23 10:06:07,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 10:06:07,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {30#false} ~i~0 := 0bv32; {30#false} is VALID [2018-11-23 10:06:07,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {30#false} assume !~bvslt32(~i~0, 100000bv32); {30#false} is VALID [2018-11-23 10:06:07,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} havoc ~x~0;~x~0 := 0bv32; {30#false} is VALID [2018-11-23 10:06:07,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {30#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {30#false} is VALID [2018-11-23 10:06:07,935 INFO L256 TraceCheckUtils]: 11: Hoare triple {30#false} call __VERIFIER_assert((if 42bv32 == #t~mem3 then 1bv32 else 0bv32)); {30#false} is VALID [2018-11-23 10:06:07,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2018-11-23 10:06:07,935 INFO L273 TraceCheckUtils]: 13: Hoare triple {30#false} assume 0bv32 == ~cond; {30#false} is VALID [2018-11-23 10:06:07,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 10:06:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:06:07,939 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:06:07,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:06:07,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:06:07,955 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:06:07,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:07,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:06:08,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:08,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:06:08,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:06:08,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:06:08,068 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 10:06:08,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:08,340 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 10:06:08,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:06:08,341 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:06:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:06:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-23 10:06:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:06:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2018-11-23 10:06:08,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 56 transitions. [2018-11-23 10:06:08,670 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:06:08,681 INFO L225 Difference]: With dead ends: 45 [2018-11-23 10:06:08,682 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 10:06:08,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:06:08,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 10:06:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 10:06:08,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:08,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 10:06:08,728 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 10:06:08,728 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 10:06:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:08,733 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 10:06:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 10:06:08,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:08,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:08,734 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 10:06:08,734 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 10:06:08,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:08,738 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 10:06:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 10:06:08,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:08,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:08,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:08,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:06:08,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 10:06:08,744 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 15 [2018-11-23 10:06:08,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:08,745 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 10:06:08,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:06:08,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 10:06:08,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:06:08,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:08,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:08,747 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:08,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:08,747 INFO L82 PathProgramCache]: Analyzing trace with hash -274239930, now seen corresponding path program 1 times [2018-11-23 10:06:08,748 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:08,748 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:06:08,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:08,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:09,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {205#true} call ULTIMATE.init(); {205#true} is VALID [2018-11-23 10:06:09,067 INFO L273 TraceCheckUtils]: 1: Hoare triple {205#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {205#true} is VALID [2018-11-23 10:06:09,067 INFO L273 TraceCheckUtils]: 2: Hoare triple {205#true} assume true; {205#true} is VALID [2018-11-23 10:06:09,067 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {205#true} {205#true} #62#return; {205#true} is VALID [2018-11-23 10:06:09,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {205#true} call #t~ret4 := main(); {205#true} is VALID [2018-11-23 10:06:09,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {205#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {225#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:09,095 INFO L273 TraceCheckUtils]: 6: Hoare triple {225#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {206#false} is VALID [2018-11-23 10:06:09,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {206#false} ~i~0 := 0bv32; {206#false} is VALID [2018-11-23 10:06:09,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {206#false} assume !~bvslt32(~i~0, 100000bv32); {206#false} is VALID [2018-11-23 10:06:09,096 INFO L273 TraceCheckUtils]: 9: Hoare triple {206#false} havoc ~x~0;~x~0 := 0bv32; {206#false} is VALID [2018-11-23 10:06:09,097 INFO L273 TraceCheckUtils]: 10: Hoare triple {206#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {206#false} is VALID [2018-11-23 10:06:09,097 INFO L256 TraceCheckUtils]: 11: Hoare triple {206#false} call __VERIFIER_assert((if 42bv32 == #t~mem3 then 1bv32 else 0bv32)); {206#false} is VALID [2018-11-23 10:06:09,097 INFO L273 TraceCheckUtils]: 12: Hoare triple {206#false} ~cond := #in~cond; {206#false} is VALID [2018-11-23 10:06:09,098 INFO L273 TraceCheckUtils]: 13: Hoare triple {206#false} assume 0bv32 == ~cond; {206#false} is VALID [2018-11-23 10:06:09,098 INFO L273 TraceCheckUtils]: 14: Hoare triple {206#false} assume !false; {206#false} is VALID [2018-11-23 10:06:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:06:09,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:06:09,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:06:09,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:06:09,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:06:09,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:09,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:06:09,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:09,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:06:09,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:06:09,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:06:09,257 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2018-11-23 10:06:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:09,500 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-11-23 10:06:09,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:06:09,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:06:09,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:06:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-23 10:06:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:06:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2018-11-23 10:06:09,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2018-11-23 10:06:09,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:09,780 INFO L225 Difference]: With dead ends: 38 [2018-11-23 10:06:09,780 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 10:06:09,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:06:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 10:06:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 10:06:09,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:09,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 10:06:09,799 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 10:06:09,799 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 10:06:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:09,801 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 10:06:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 10:06:09,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:09,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:09,803 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 10:06:09,803 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 10:06:09,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:09,805 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 10:06:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 10:06:09,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:09,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:09,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:09,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 10:06:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 10:06:09,809 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2018-11-23 10:06:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:09,809 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 10:06:09,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:06:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 10:06:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:06:09,810 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:09,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:09,811 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:09,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:09,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1258895644, now seen corresponding path program 1 times [2018-11-23 10:06:09,812 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:09,812 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:06:09,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:06:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:09,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:10,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {387#true} call ULTIMATE.init(); {387#true} is VALID [2018-11-23 10:06:10,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {387#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {387#true} is VALID [2018-11-23 10:06:10,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {387#true} assume true; {387#true} is VALID [2018-11-23 10:06:10,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {387#true} {387#true} #62#return; {387#true} is VALID [2018-11-23 10:06:10,026 INFO L256 TraceCheckUtils]: 4: Hoare triple {387#true} call #t~ret4 := main(); {387#true} is VALID [2018-11-23 10:06:10,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {387#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {407#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:10,038 INFO L273 TraceCheckUtils]: 6: Hoare triple {407#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {411#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:10,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {388#false} is VALID [2018-11-23 10:06:10,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {388#false} ~i~0 := 0bv32; {388#false} is VALID [2018-11-23 10:06:10,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {388#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {388#false} is VALID [2018-11-23 10:06:10,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {388#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {388#false} is VALID [2018-11-23 10:06:10,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {388#false} assume !~bvslt32(~i~0, 100000bv32); {388#false} is VALID [2018-11-23 10:06:10,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {388#false} havoc ~x~0;~x~0 := 0bv32; {388#false} is VALID [2018-11-23 10:06:10,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {388#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {388#false} is VALID [2018-11-23 10:06:10,041 INFO L256 TraceCheckUtils]: 14: Hoare triple {388#false} call __VERIFIER_assert((if 42bv32 == #t~mem3 then 1bv32 else 0bv32)); {388#false} is VALID [2018-11-23 10:06:10,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {388#false} ~cond := #in~cond; {388#false} is VALID [2018-11-23 10:06:10,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {388#false} assume 0bv32 == ~cond; {388#false} is VALID [2018-11-23 10:06:10,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {388#false} assume !false; {388#false} is VALID [2018-11-23 10:06:10,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:06:10,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:10,112 INFO L273 TraceCheckUtils]: 17: Hoare triple {388#false} assume !false; {388#false} is VALID [2018-11-23 10:06:10,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {388#false} assume 0bv32 == ~cond; {388#false} is VALID [2018-11-23 10:06:10,113 INFO L273 TraceCheckUtils]: 15: Hoare triple {388#false} ~cond := #in~cond; {388#false} is VALID [2018-11-23 10:06:10,114 INFO L256 TraceCheckUtils]: 14: Hoare triple {388#false} call __VERIFIER_assert((if 42bv32 == #t~mem3 then 1bv32 else 0bv32)); {388#false} is VALID [2018-11-23 10:06:10,114 INFO L273 TraceCheckUtils]: 13: Hoare triple {388#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {388#false} is VALID [2018-11-23 10:06:10,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {388#false} havoc ~x~0;~x~0 := 0bv32; {388#false} is VALID [2018-11-23 10:06:10,115 INFO L273 TraceCheckUtils]: 11: Hoare triple {388#false} assume !~bvslt32(~i~0, 100000bv32); {388#false} is VALID [2018-11-23 10:06:10,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {388#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {388#false} is VALID [2018-11-23 10:06:10,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {388#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {388#false} is VALID [2018-11-23 10:06:10,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {388#false} ~i~0 := 0bv32; {388#false} is VALID [2018-11-23 10:06:10,119 INFO L273 TraceCheckUtils]: 7: Hoare triple {475#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {388#false} is VALID [2018-11-23 10:06:10,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {479#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {475#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:10,121 INFO L273 TraceCheckUtils]: 5: Hoare triple {387#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {479#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:10,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {387#true} call #t~ret4 := main(); {387#true} is VALID [2018-11-23 10:06:10,122 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {387#true} {387#true} #62#return; {387#true} is VALID [2018-11-23 10:06:10,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {387#true} assume true; {387#true} is VALID [2018-11-23 10:06:10,123 INFO L273 TraceCheckUtils]: 1: Hoare triple {387#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {387#true} is VALID [2018-11-23 10:06:10,123 INFO L256 TraceCheckUtils]: 0: Hoare triple {387#true} call ULTIMATE.init(); {387#true} is VALID [2018-11-23 10:06:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:06:10,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:10,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:06:10,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 10:06:10,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:10,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:06:10,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:10,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:06:10,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:06:10,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:06:10,243 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-11-23 10:06:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:10,681 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2018-11-23 10:06:10,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:06:10,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 10:06:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:06:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 10:06:10,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:06:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 10:06:10,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2018-11-23 10:06:10,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:10,895 INFO L225 Difference]: With dead ends: 47 [2018-11-23 10:06:10,895 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 10:06:10,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:06:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 10:06:10,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 10:06:10,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:10,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 10:06:10,917 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 10:06:10,917 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 10:06:10,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:10,920 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 10:06:10,920 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 10:06:10,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:10,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:10,921 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 10:06:10,922 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 10:06:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:10,925 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 10:06:10,925 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 10:06:10,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:10,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:10,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:10,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 10:06:10,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-23 10:06:10,928 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 18 [2018-11-23 10:06:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:10,929 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-23 10:06:10,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:06:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-23 10:06:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:06:10,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:10,930 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:10,931 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:10,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1574965310, now seen corresponding path program 2 times [2018-11-23 10:06:10,932 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:10,932 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:06:10,950 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:06:11,008 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:06:11,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:11,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:11,234 INFO L256 TraceCheckUtils]: 0: Hoare triple {684#true} call ULTIMATE.init(); {684#true} is VALID [2018-11-23 10:06:11,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {684#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {684#true} is VALID [2018-11-23 10:06:11,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {684#true} assume true; {684#true} is VALID [2018-11-23 10:06:11,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {684#true} {684#true} #62#return; {684#true} is VALID [2018-11-23 10:06:11,236 INFO L256 TraceCheckUtils]: 4: Hoare triple {684#true} call #t~ret4 := main(); {684#true} is VALID [2018-11-23 10:06:11,236 INFO L273 TraceCheckUtils]: 5: Hoare triple {684#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {704#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:11,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {704#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {708#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {708#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {712#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {712#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {716#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,239 INFO L273 TraceCheckUtils]: 9: Hoare triple {716#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {720#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:11,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {720#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {685#false} is VALID [2018-11-23 10:06:11,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {685#false} ~i~0 := 0bv32; {685#false} is VALID [2018-11-23 10:06:11,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {685#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {685#false} is VALID [2018-11-23 10:06:11,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {685#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {685#false} is VALID [2018-11-23 10:06:11,242 INFO L273 TraceCheckUtils]: 14: Hoare triple {685#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {685#false} is VALID [2018-11-23 10:06:11,242 INFO L273 TraceCheckUtils]: 15: Hoare triple {685#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {685#false} is VALID [2018-11-23 10:06:11,243 INFO L273 TraceCheckUtils]: 16: Hoare triple {685#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {685#false} is VALID [2018-11-23 10:06:11,243 INFO L273 TraceCheckUtils]: 17: Hoare triple {685#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {685#false} is VALID [2018-11-23 10:06:11,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {685#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {685#false} is VALID [2018-11-23 10:06:11,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {685#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {685#false} is VALID [2018-11-23 10:06:11,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {685#false} assume !~bvslt32(~i~0, 100000bv32); {685#false} is VALID [2018-11-23 10:06:11,245 INFO L273 TraceCheckUtils]: 21: Hoare triple {685#false} havoc ~x~0;~x~0 := 0bv32; {685#false} is VALID [2018-11-23 10:06:11,246 INFO L273 TraceCheckUtils]: 22: Hoare triple {685#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {685#false} is VALID [2018-11-23 10:06:11,246 INFO L256 TraceCheckUtils]: 23: Hoare triple {685#false} call __VERIFIER_assert((if 42bv32 == #t~mem3 then 1bv32 else 0bv32)); {685#false} is VALID [2018-11-23 10:06:11,246 INFO L273 TraceCheckUtils]: 24: Hoare triple {685#false} ~cond := #in~cond; {685#false} is VALID [2018-11-23 10:06:11,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {685#false} assume 0bv32 == ~cond; {685#false} is VALID [2018-11-23 10:06:11,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {685#false} assume !false; {685#false} is VALID [2018-11-23 10:06:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 10:06:11,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:11,432 INFO L273 TraceCheckUtils]: 26: Hoare triple {685#false} assume !false; {685#false} is VALID [2018-11-23 10:06:11,432 INFO L273 TraceCheckUtils]: 25: Hoare triple {685#false} assume 0bv32 == ~cond; {685#false} is VALID [2018-11-23 10:06:11,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {685#false} ~cond := #in~cond; {685#false} is VALID [2018-11-23 10:06:11,433 INFO L256 TraceCheckUtils]: 23: Hoare triple {685#false} call __VERIFIER_assert((if 42bv32 == #t~mem3 then 1bv32 else 0bv32)); {685#false} is VALID [2018-11-23 10:06:11,434 INFO L273 TraceCheckUtils]: 22: Hoare triple {685#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {685#false} is VALID [2018-11-23 10:06:11,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {685#false} havoc ~x~0;~x~0 := 0bv32; {685#false} is VALID [2018-11-23 10:06:11,435 INFO L273 TraceCheckUtils]: 20: Hoare triple {685#false} assume !~bvslt32(~i~0, 100000bv32); {685#false} is VALID [2018-11-23 10:06:11,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {685#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {685#false} is VALID [2018-11-23 10:06:11,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {685#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {685#false} is VALID [2018-11-23 10:06:11,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {685#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {685#false} is VALID [2018-11-23 10:06:11,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {685#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {685#false} is VALID [2018-11-23 10:06:11,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {685#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {685#false} is VALID [2018-11-23 10:06:11,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {685#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {685#false} is VALID [2018-11-23 10:06:11,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {685#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {685#false} is VALID [2018-11-23 10:06:11,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {685#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {685#false} is VALID [2018-11-23 10:06:11,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {685#false} ~i~0 := 0bv32; {685#false} is VALID [2018-11-23 10:06:11,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {820#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {685#false} is VALID [2018-11-23 10:06:11,442 INFO L273 TraceCheckUtils]: 9: Hoare triple {824#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {820#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:11,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {828#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {824#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {832#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {828#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,458 INFO L273 TraceCheckUtils]: 6: Hoare triple {836#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {832#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {684#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {836#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:11,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {684#true} call #t~ret4 := main(); {684#true} is VALID [2018-11-23 10:06:11,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {684#true} {684#true} #62#return; {684#true} is VALID [2018-11-23 10:06:11,460 INFO L273 TraceCheckUtils]: 2: Hoare triple {684#true} assume true; {684#true} is VALID [2018-11-23 10:06:11,461 INFO L273 TraceCheckUtils]: 1: Hoare triple {684#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {684#true} is VALID [2018-11-23 10:06:11,461 INFO L256 TraceCheckUtils]: 0: Hoare triple {684#true} call ULTIMATE.init(); {684#true} is VALID [2018-11-23 10:06:11,462 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 10:06:11,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:11,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:06:11,465 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 10:06:11,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:11,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:06:11,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:11,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:06:11,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:06:11,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:06:11,514 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 12 states. [2018-11-23 10:06:12,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:12,878 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-23 10:06:12,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:06:12,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 10:06:12,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:06:12,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2018-11-23 10:06:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:06:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 79 transitions. [2018-11-23 10:06:12,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 79 transitions. [2018-11-23 10:06:13,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:13,041 INFO L225 Difference]: With dead ends: 71 [2018-11-23 10:06:13,041 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 10:06:13,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:06:13,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 10:06:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 10:06:13,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:13,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 10:06:13,081 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 10:06:13,081 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 10:06:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:13,085 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 10:06:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 10:06:13,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:13,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:13,086 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 10:06:13,086 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 10:06:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:13,090 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 10:06:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 10:06:13,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:13,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:13,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:13,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 10:06:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-11-23 10:06:13,094 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 27 [2018-11-23 10:06:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:13,095 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-11-23 10:06:13,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:06:13,095 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-11-23 10:06:13,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 10:06:13,097 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:13,097 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:13,098 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:13,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash 527876658, now seen corresponding path program 3 times [2018-11-23 10:06:13,099 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:13,099 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:06:13,130 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:06:13,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 10:06:13,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:13,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:13,832 INFO L256 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2018-11-23 10:06:13,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {1152#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1152#true} is VALID [2018-11-23 10:06:13,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 10:06:13,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#true} {1152#true} #62#return; {1152#true} is VALID [2018-11-23 10:06:13,833 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#true} call #t~ret4 := main(); {1152#true} is VALID [2018-11-23 10:06:13,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {1152#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1172#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:13,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {1172#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1176#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:13,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {1176#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1180#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:06:13,854 INFO L273 TraceCheckUtils]: 8: Hoare triple {1180#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1184#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:13,855 INFO L273 TraceCheckUtils]: 9: Hoare triple {1184#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1188#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:13,855 INFO L273 TraceCheckUtils]: 10: Hoare triple {1188#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1192#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:13,856 INFO L273 TraceCheckUtils]: 11: Hoare triple {1192#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1196#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:13,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {1196#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1200#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-23 10:06:13,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {1200#(= (_ bv7 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1204#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:13,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {1204#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1208#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 10:06:13,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {1208#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1212#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:13,860 INFO L273 TraceCheckUtils]: 16: Hoare triple {1212#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1153#false} is VALID [2018-11-23 10:06:13,861 INFO L273 TraceCheckUtils]: 17: Hoare triple {1153#false} ~i~0 := 0bv32; {1153#false} is VALID [2018-11-23 10:06:13,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:13,861 INFO L273 TraceCheckUtils]: 19: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:13,862 INFO L273 TraceCheckUtils]: 20: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:13,862 INFO L273 TraceCheckUtils]: 21: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:13,862 INFO L273 TraceCheckUtils]: 22: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:13,863 INFO L273 TraceCheckUtils]: 23: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:13,863 INFO L273 TraceCheckUtils]: 24: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:13,863 INFO L273 TraceCheckUtils]: 25: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:13,864 INFO L273 TraceCheckUtils]: 26: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:13,864 INFO L273 TraceCheckUtils]: 27: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:13,865 INFO L273 TraceCheckUtils]: 28: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:13,865 INFO L273 TraceCheckUtils]: 29: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:13,865 INFO L273 TraceCheckUtils]: 30: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:13,865 INFO L273 TraceCheckUtils]: 31: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:13,865 INFO L273 TraceCheckUtils]: 32: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:13,866 INFO L273 TraceCheckUtils]: 33: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:13,866 INFO L273 TraceCheckUtils]: 34: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:13,866 INFO L273 TraceCheckUtils]: 35: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:13,866 INFO L273 TraceCheckUtils]: 36: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:13,866 INFO L273 TraceCheckUtils]: 37: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:13,867 INFO L273 TraceCheckUtils]: 38: Hoare triple {1153#false} assume !~bvslt32(~i~0, 100000bv32); {1153#false} is VALID [2018-11-23 10:06:13,867 INFO L273 TraceCheckUtils]: 39: Hoare triple {1153#false} havoc ~x~0;~x~0 := 0bv32; {1153#false} is VALID [2018-11-23 10:06:13,867 INFO L273 TraceCheckUtils]: 40: Hoare triple {1153#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1153#false} is VALID [2018-11-23 10:06:13,867 INFO L256 TraceCheckUtils]: 41: Hoare triple {1153#false} call __VERIFIER_assert((if 42bv32 == #t~mem3 then 1bv32 else 0bv32)); {1153#false} is VALID [2018-11-23 10:06:13,867 INFO L273 TraceCheckUtils]: 42: Hoare triple {1153#false} ~cond := #in~cond; {1153#false} is VALID [2018-11-23 10:06:13,868 INFO L273 TraceCheckUtils]: 43: Hoare triple {1153#false} assume 0bv32 == ~cond; {1153#false} is VALID [2018-11-23 10:06:13,868 INFO L273 TraceCheckUtils]: 44: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2018-11-23 10:06:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 10:06:13,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:14,532 INFO L273 TraceCheckUtils]: 44: Hoare triple {1153#false} assume !false; {1153#false} is VALID [2018-11-23 10:06:14,532 INFO L273 TraceCheckUtils]: 43: Hoare triple {1153#false} assume 0bv32 == ~cond; {1153#false} is VALID [2018-11-23 10:06:14,533 INFO L273 TraceCheckUtils]: 42: Hoare triple {1153#false} ~cond := #in~cond; {1153#false} is VALID [2018-11-23 10:06:14,533 INFO L256 TraceCheckUtils]: 41: Hoare triple {1153#false} call __VERIFIER_assert((if 42bv32 == #t~mem3 then 1bv32 else 0bv32)); {1153#false} is VALID [2018-11-23 10:06:14,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {1153#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1153#false} is VALID [2018-11-23 10:06:14,533 INFO L273 TraceCheckUtils]: 39: Hoare triple {1153#false} havoc ~x~0;~x~0 := 0bv32; {1153#false} is VALID [2018-11-23 10:06:14,534 INFO L273 TraceCheckUtils]: 38: Hoare triple {1153#false} assume !~bvslt32(~i~0, 100000bv32); {1153#false} is VALID [2018-11-23 10:06:14,534 INFO L273 TraceCheckUtils]: 37: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:14,534 INFO L273 TraceCheckUtils]: 36: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:14,534 INFO L273 TraceCheckUtils]: 35: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:14,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:14,535 INFO L273 TraceCheckUtils]: 33: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:14,535 INFO L273 TraceCheckUtils]: 32: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:14,536 INFO L273 TraceCheckUtils]: 31: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:14,536 INFO L273 TraceCheckUtils]: 30: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:14,536 INFO L273 TraceCheckUtils]: 29: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:14,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:14,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:14,537 INFO L273 TraceCheckUtils]: 26: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:14,537 INFO L273 TraceCheckUtils]: 25: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:14,537 INFO L273 TraceCheckUtils]: 24: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:14,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:14,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:14,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:14,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:14,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {1153#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1153#false} is VALID [2018-11-23 10:06:14,539 INFO L273 TraceCheckUtils]: 18: Hoare triple {1153#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1153#false} is VALID [2018-11-23 10:06:14,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {1153#false} ~i~0 := 0bv32; {1153#false} is VALID [2018-11-23 10:06:14,540 INFO L273 TraceCheckUtils]: 16: Hoare triple {1384#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1153#false} is VALID [2018-11-23 10:06:14,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {1388#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1384#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:14,546 INFO L273 TraceCheckUtils]: 14: Hoare triple {1392#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1388#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:14,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {1396#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1392#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:14,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {1400#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1396#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:14,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {1404#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1400#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:14,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {1408#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1404#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:14,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {1412#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1408#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:14,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {1416#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1412#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:14,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {1420#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1416#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:14,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {1424#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1420#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:14,595 INFO L273 TraceCheckUtils]: 5: Hoare triple {1152#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1424#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:14,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {1152#true} call #t~ret4 := main(); {1152#true} is VALID [2018-11-23 10:06:14,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1152#true} {1152#true} #62#return; {1152#true} is VALID [2018-11-23 10:06:14,596 INFO L273 TraceCheckUtils]: 2: Hoare triple {1152#true} assume true; {1152#true} is VALID [2018-11-23 10:06:14,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {1152#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1152#true} is VALID [2018-11-23 10:06:14,597 INFO L256 TraceCheckUtils]: 0: Hoare triple {1152#true} call ULTIMATE.init(); {1152#true} is VALID [2018-11-23 10:06:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 10:06:14,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:14,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:06:14,608 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-23 10:06:14,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:14,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:06:14,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:14,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:06:14,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:06:14,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:06:14,705 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 24 states. [2018-11-23 10:06:20,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:20,412 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2018-11-23 10:06:20,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:06:20,412 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-23 10:06:20,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:06:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 127 transitions. [2018-11-23 10:06:20,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:06:20,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 127 transitions. [2018-11-23 10:06:20,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 127 transitions. [2018-11-23 10:06:20,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:20,831 INFO L225 Difference]: With dead ends: 119 [2018-11-23 10:06:20,831 INFO L226 Difference]: Without dead ends: 86 [2018-11-23 10:06:20,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:06:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-23 10:06:20,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-23 10:06:20,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:20,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-23 10:06:20,887 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 10:06:20,887 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 10:06:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:20,890 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-23 10:06:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-11-23 10:06:20,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:20,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:20,892 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-23 10:06:20,892 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-23 10:06:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:20,896 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-23 10:06:20,896 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-11-23 10:06:20,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:20,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:20,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:20,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 10:06:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-11-23 10:06:20,901 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 45 [2018-11-23 10:06:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:20,901 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-11-23 10:06:20,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:06:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-11-23 10:06:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 10:06:20,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:20,904 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:20,904 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:20,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:20,905 INFO L82 PathProgramCache]: Analyzing trace with hash -2097923046, now seen corresponding path program 4 times [2018-11-23 10:06:20,905 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:20,906 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:06:20,933 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:06:21,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:06:21,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:06:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:06:21,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:06:21,928 INFO L256 TraceCheckUtils]: 0: Hoare triple {1962#true} call ULTIMATE.init(); {1962#true} is VALID [2018-11-23 10:06:21,928 INFO L273 TraceCheckUtils]: 1: Hoare triple {1962#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1962#true} is VALID [2018-11-23 10:06:21,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {1962#true} assume true; {1962#true} is VALID [2018-11-23 10:06:21,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1962#true} {1962#true} #62#return; {1962#true} is VALID [2018-11-23 10:06:21,929 INFO L256 TraceCheckUtils]: 4: Hoare triple {1962#true} call #t~ret4 := main(); {1962#true} is VALID [2018-11-23 10:06:21,930 INFO L273 TraceCheckUtils]: 5: Hoare triple {1962#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1982#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:06:21,931 INFO L273 TraceCheckUtils]: 6: Hoare triple {1982#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1986#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,931 INFO L273 TraceCheckUtils]: 7: Hoare triple {1986#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1990#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 10:06:21,932 INFO L273 TraceCheckUtils]: 8: Hoare triple {1990#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1994#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,933 INFO L273 TraceCheckUtils]: 9: Hoare triple {1994#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1998#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:06:21,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {1998#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2002#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {2002#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2006#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:06:21,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {2006#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2010#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {2010#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2014#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {2014#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2018#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,941 INFO L273 TraceCheckUtils]: 15: Hoare triple {2018#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2022#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:06:21,942 INFO L273 TraceCheckUtils]: 16: Hoare triple {2022#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2026#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {2026#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2030#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {2030#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2034#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,944 INFO L273 TraceCheckUtils]: 19: Hoare triple {2034#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2038#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {2038#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2042#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,946 INFO L273 TraceCheckUtils]: 21: Hoare triple {2042#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2046#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:06:21,947 INFO L273 TraceCheckUtils]: 22: Hoare triple {2046#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2050#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,948 INFO L273 TraceCheckUtils]: 23: Hoare triple {2050#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2054#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {2054#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2058#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 10:06:21,950 INFO L273 TraceCheckUtils]: 25: Hoare triple {2058#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2062#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,951 INFO L273 TraceCheckUtils]: 26: Hoare triple {2062#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2066#(= (_ bv21 32) main_~i~0)} is VALID [2018-11-23 10:06:21,952 INFO L273 TraceCheckUtils]: 27: Hoare triple {2066#(= (_ bv21 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2070#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:06:21,953 INFO L273 TraceCheckUtils]: 28: Hoare triple {2070#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1963#false} is VALID [2018-11-23 10:06:21,953 INFO L273 TraceCheckUtils]: 29: Hoare triple {1963#false} ~i~0 := 0bv32; {1963#false} is VALID [2018-11-23 10:06:21,954 INFO L273 TraceCheckUtils]: 30: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,954 INFO L273 TraceCheckUtils]: 31: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,954 INFO L273 TraceCheckUtils]: 32: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,954 INFO L273 TraceCheckUtils]: 33: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,955 INFO L273 TraceCheckUtils]: 34: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,955 INFO L273 TraceCheckUtils]: 35: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,955 INFO L273 TraceCheckUtils]: 37: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,956 INFO L273 TraceCheckUtils]: 38: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,956 INFO L273 TraceCheckUtils]: 39: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,956 INFO L273 TraceCheckUtils]: 40: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,956 INFO L273 TraceCheckUtils]: 41: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,956 INFO L273 TraceCheckUtils]: 42: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,957 INFO L273 TraceCheckUtils]: 43: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,957 INFO L273 TraceCheckUtils]: 44: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,957 INFO L273 TraceCheckUtils]: 45: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,957 INFO L273 TraceCheckUtils]: 46: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,958 INFO L273 TraceCheckUtils]: 47: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,958 INFO L273 TraceCheckUtils]: 48: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,958 INFO L273 TraceCheckUtils]: 49: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,958 INFO L273 TraceCheckUtils]: 50: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,959 INFO L273 TraceCheckUtils]: 51: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,959 INFO L273 TraceCheckUtils]: 52: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,959 INFO L273 TraceCheckUtils]: 53: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,959 INFO L273 TraceCheckUtils]: 54: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,959 INFO L273 TraceCheckUtils]: 55: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,960 INFO L273 TraceCheckUtils]: 56: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,960 INFO L273 TraceCheckUtils]: 57: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,960 INFO L273 TraceCheckUtils]: 58: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,960 INFO L273 TraceCheckUtils]: 59: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,960 INFO L273 TraceCheckUtils]: 60: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,960 INFO L273 TraceCheckUtils]: 61: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,961 INFO L273 TraceCheckUtils]: 62: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,961 INFO L273 TraceCheckUtils]: 63: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,961 INFO L273 TraceCheckUtils]: 64: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,961 INFO L273 TraceCheckUtils]: 65: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,961 INFO L273 TraceCheckUtils]: 66: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,962 INFO L273 TraceCheckUtils]: 67: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,962 INFO L273 TraceCheckUtils]: 68: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,962 INFO L273 TraceCheckUtils]: 69: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,962 INFO L273 TraceCheckUtils]: 70: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,962 INFO L273 TraceCheckUtils]: 71: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,962 INFO L273 TraceCheckUtils]: 72: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:21,962 INFO L273 TraceCheckUtils]: 73: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:21,963 INFO L273 TraceCheckUtils]: 74: Hoare triple {1963#false} assume !~bvslt32(~i~0, 100000bv32); {1963#false} is VALID [2018-11-23 10:06:21,963 INFO L273 TraceCheckUtils]: 75: Hoare triple {1963#false} havoc ~x~0;~x~0 := 0bv32; {1963#false} is VALID [2018-11-23 10:06:21,963 INFO L273 TraceCheckUtils]: 76: Hoare triple {1963#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1963#false} is VALID [2018-11-23 10:06:21,963 INFO L256 TraceCheckUtils]: 77: Hoare triple {1963#false} call __VERIFIER_assert((if 42bv32 == #t~mem3 then 1bv32 else 0bv32)); {1963#false} is VALID [2018-11-23 10:06:21,963 INFO L273 TraceCheckUtils]: 78: Hoare triple {1963#false} ~cond := #in~cond; {1963#false} is VALID [2018-11-23 10:06:21,963 INFO L273 TraceCheckUtils]: 79: Hoare triple {1963#false} assume 0bv32 == ~cond; {1963#false} is VALID [2018-11-23 10:06:21,964 INFO L273 TraceCheckUtils]: 80: Hoare triple {1963#false} assume !false; {1963#false} is VALID [2018-11-23 10:06:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-23 10:06:21,970 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:06:23,738 INFO L273 TraceCheckUtils]: 80: Hoare triple {1963#false} assume !false; {1963#false} is VALID [2018-11-23 10:06:23,738 INFO L273 TraceCheckUtils]: 79: Hoare triple {1963#false} assume 0bv32 == ~cond; {1963#false} is VALID [2018-11-23 10:06:23,739 INFO L273 TraceCheckUtils]: 78: Hoare triple {1963#false} ~cond := #in~cond; {1963#false} is VALID [2018-11-23 10:06:23,739 INFO L256 TraceCheckUtils]: 77: Hoare triple {1963#false} call __VERIFIER_assert((if 42bv32 == #t~mem3 then 1bv32 else 0bv32)); {1963#false} is VALID [2018-11-23 10:06:23,739 INFO L273 TraceCheckUtils]: 76: Hoare triple {1963#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1963#false} is VALID [2018-11-23 10:06:23,739 INFO L273 TraceCheckUtils]: 75: Hoare triple {1963#false} havoc ~x~0;~x~0 := 0bv32; {1963#false} is VALID [2018-11-23 10:06:23,739 INFO L273 TraceCheckUtils]: 74: Hoare triple {1963#false} assume !~bvslt32(~i~0, 100000bv32); {1963#false} is VALID [2018-11-23 10:06:23,740 INFO L273 TraceCheckUtils]: 73: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,740 INFO L273 TraceCheckUtils]: 72: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,740 INFO L273 TraceCheckUtils]: 71: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,740 INFO L273 TraceCheckUtils]: 70: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,740 INFO L273 TraceCheckUtils]: 69: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,741 INFO L273 TraceCheckUtils]: 68: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,741 INFO L273 TraceCheckUtils]: 67: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,741 INFO L273 TraceCheckUtils]: 66: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,741 INFO L273 TraceCheckUtils]: 65: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,741 INFO L273 TraceCheckUtils]: 64: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,741 INFO L273 TraceCheckUtils]: 63: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,742 INFO L273 TraceCheckUtils]: 62: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,742 INFO L273 TraceCheckUtils]: 61: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,742 INFO L273 TraceCheckUtils]: 60: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,742 INFO L273 TraceCheckUtils]: 59: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,742 INFO L273 TraceCheckUtils]: 58: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,743 INFO L273 TraceCheckUtils]: 57: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,743 INFO L273 TraceCheckUtils]: 56: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,743 INFO L273 TraceCheckUtils]: 55: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,743 INFO L273 TraceCheckUtils]: 54: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,743 INFO L273 TraceCheckUtils]: 53: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,743 INFO L273 TraceCheckUtils]: 52: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,744 INFO L273 TraceCheckUtils]: 51: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,744 INFO L273 TraceCheckUtils]: 50: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,744 INFO L273 TraceCheckUtils]: 49: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,744 INFO L273 TraceCheckUtils]: 48: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,744 INFO L273 TraceCheckUtils]: 47: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,744 INFO L273 TraceCheckUtils]: 46: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,744 INFO L273 TraceCheckUtils]: 45: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,745 INFO L273 TraceCheckUtils]: 44: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,745 INFO L273 TraceCheckUtils]: 43: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,745 INFO L273 TraceCheckUtils]: 41: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,745 INFO L273 TraceCheckUtils]: 40: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,745 INFO L273 TraceCheckUtils]: 39: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,746 INFO L273 TraceCheckUtils]: 37: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,746 INFO L273 TraceCheckUtils]: 36: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,746 INFO L273 TraceCheckUtils]: 35: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,746 INFO L273 TraceCheckUtils]: 34: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,746 INFO L273 TraceCheckUtils]: 33: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,746 INFO L273 TraceCheckUtils]: 32: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,746 INFO L273 TraceCheckUtils]: 31: Hoare triple {1963#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1963#false} is VALID [2018-11-23 10:06:23,747 INFO L273 TraceCheckUtils]: 30: Hoare triple {1963#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1963#false} is VALID [2018-11-23 10:06:23,747 INFO L273 TraceCheckUtils]: 29: Hoare triple {1963#false} ~i~0 := 0bv32; {1963#false} is VALID [2018-11-23 10:06:23,747 INFO L273 TraceCheckUtils]: 28: Hoare triple {2386#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1963#false} is VALID [2018-11-23 10:06:23,748 INFO L273 TraceCheckUtils]: 27: Hoare triple {2390#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2386#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:06:23,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {2394#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2390#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,757 INFO L273 TraceCheckUtils]: 25: Hoare triple {2398#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2394#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,762 INFO L273 TraceCheckUtils]: 24: Hoare triple {2402#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2398#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,767 INFO L273 TraceCheckUtils]: 23: Hoare triple {2406#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2402#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {2410#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2406#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,777 INFO L273 TraceCheckUtils]: 21: Hoare triple {2414#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2410#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {2418#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2414#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {2422#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2418#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,796 INFO L273 TraceCheckUtils]: 18: Hoare triple {2426#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2422#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {2430#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2426#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,806 INFO L273 TraceCheckUtils]: 16: Hoare triple {2434#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2430#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {2438#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2434#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {2442#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2438#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {2446#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2442#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,826 INFO L273 TraceCheckUtils]: 12: Hoare triple {2450#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2446#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,831 INFO L273 TraceCheckUtils]: 11: Hoare triple {2454#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2450#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,836 INFO L273 TraceCheckUtils]: 10: Hoare triple {2458#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2454#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {2462#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2458#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,845 INFO L273 TraceCheckUtils]: 8: Hoare triple {2466#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2462#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {2470#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2466#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {2474#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2470#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,854 INFO L273 TraceCheckUtils]: 5: Hoare triple {1962#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2474#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:06:23,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {1962#true} call #t~ret4 := main(); {1962#true} is VALID [2018-11-23 10:06:23,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1962#true} {1962#true} #62#return; {1962#true} is VALID [2018-11-23 10:06:23,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {1962#true} assume true; {1962#true} is VALID [2018-11-23 10:06:23,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {1962#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1962#true} is VALID [2018-11-23 10:06:23,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {1962#true} call ULTIMATE.init(); {1962#true} is VALID [2018-11-23 10:06:23,860 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2018-11-23 10:06:23,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:06:23,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:06:23,865 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 81 [2018-11-23 10:06:23,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:06:23,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:06:23,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:23,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:06:23,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:06:23,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:06:23,989 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 48 states. [2018-11-23 10:06:27,665 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:06:28,229 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:06:28,734 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:06:29,331 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:06:29,887 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:06:30,439 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:06:31,003 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:06:31,568 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:06:46,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:46,958 INFO L93 Difference]: Finished difference Result 215 states and 266 transitions. [2018-11-23 10:06:46,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:06:46,958 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 81 [2018-11-23 10:06:46,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:06:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:06:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 223 transitions. [2018-11-23 10:06:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:06:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 223 transitions. [2018-11-23 10:06:46,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 223 transitions. [2018-11-23 10:06:47,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:06:47,573 INFO L225 Difference]: With dead ends: 215 [2018-11-23 10:06:47,574 INFO L226 Difference]: Without dead ends: 158 [2018-11-23 10:06:47,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:06:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-23 10:06:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-11-23 10:06:47,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:06:47,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2018-11-23 10:06:47,705 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2018-11-23 10:06:47,705 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2018-11-23 10:06:47,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:47,712 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2018-11-23 10:06:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-11-23 10:06:47,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:47,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:47,714 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2018-11-23 10:06:47,714 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2018-11-23 10:06:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:06:47,719 INFO L93 Difference]: Finished difference Result 158 states and 160 transitions. [2018-11-23 10:06:47,719 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-11-23 10:06:47,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:06:47,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:06:47,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:06:47,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:06:47,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 10:06:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2018-11-23 10:06:47,726 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 81 [2018-11-23 10:06:47,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:06:47,726 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 160 transitions. [2018-11-23 10:06:47,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:06:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-11-23 10:06:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-23 10:06:47,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:06:47,731 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:06:47,731 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:06:47,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:06:47,732 INFO L82 PathProgramCache]: Analyzing trace with hash 674990058, now seen corresponding path program 5 times [2018-11-23 10:06:47,732 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:06:47,733 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:06:47,756 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1