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/loop-invgen/string_concat-noarr_true-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:34:54,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:34:54,393 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:34:54,409 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:34:54,409 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:34:54,412 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:34:54,413 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:34:54,415 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:34:54,417 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:34:54,417 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:34:54,418 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:34:54,419 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:34:54,420 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:34:54,421 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:34:54,422 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:34:54,423 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:34:54,423 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:34:54,425 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:34:54,427 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:34:54,429 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:34:54,430 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:34:54,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:34:54,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:34:54,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:34:54,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:34:54,444 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:34:54,445 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:34:54,448 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:34:54,449 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:34:54,450 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:34:54,450 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:34:54,451 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:34:54,451 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:34:54,455 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:34:54,456 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:34:54,457 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:34:54,459 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 11:34:54,478 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:34:54,478 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:34:54,479 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:34:54,479 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:34:54,480 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:34:54,480 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:34:54,480 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:34:54,481 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:34:54,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:34:54,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:34:54,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:34:54,481 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:34:54,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:34:54,482 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:34:54,482 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:34:54,482 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:34:54,482 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:34:54,482 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:34:54,483 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:34:54,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:34:54,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:34:54,483 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:34:54,483 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:34:54,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:34:54,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:34:54,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:34:54,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:34:54,484 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:34:54,485 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:34:54,485 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:34:54,485 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:34:54,485 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:34:54,485 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:34:54,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:34:54,551 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:34:54,555 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:34:54,557 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:34:54,557 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:34:54,558 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_false-termination.i [2018-11-23 11:34:54,626 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42a3923e/cef8d2c85c1f48de8e5d04862b4eaca5/FLAG21df31917 [2018-11-23 11:34:55,080 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:34:55,082 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/string_concat-noarr_true-unreach-call_false-termination.i [2018-11-23 11:34:55,090 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42a3923e/cef8d2c85c1f48de8e5d04862b4eaca5/FLAG21df31917 [2018-11-23 11:34:55,410 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42a3923e/cef8d2c85c1f48de8e5d04862b4eaca5 [2018-11-23 11:34:55,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:34:55,423 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:34:55,424 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:34:55,424 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:34:55,430 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:34:55,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423b3e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55, skipping insertion in model container [2018-11-23 11:34:55,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,446 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:34:55,472 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:34:55,739 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:34:55,748 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:34:55,772 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:34:55,793 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:34:55,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55 WrapperNode [2018-11-23 11:34:55,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:34:55,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:34:55,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:34:55,795 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:34:55,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:34:55,823 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:34:55,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:34:55,823 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:34:55,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (1/1) ... [2018-11-23 11:34:55,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:34:55,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:34:55,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:34:55,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:34:55,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (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 11:34:56,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:34:56,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:34:56,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:34:56,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:34:56,005 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:34:56,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:34:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:34:56,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:34:56,493 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:34:56,494 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:34:56,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:34:56 BoogieIcfgContainer [2018-11-23 11:34:56,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:34:56,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:34:56,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:34:56,499 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:34:56,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:34:55" (1/3) ... [2018-11-23 11:34:56,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17496e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:34:56, skipping insertion in model container [2018-11-23 11:34:56,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:34:55" (2/3) ... [2018-11-23 11:34:56,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17496e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:34:56, skipping insertion in model container [2018-11-23 11:34:56,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:34:56" (3/3) ... [2018-11-23 11:34:56,503 INFO L112 eAbstractionObserver]: Analyzing ICFG string_concat-noarr_true-unreach-call_false-termination.i [2018-11-23 11:34:56,512 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:34:56,520 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:34:56,539 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:34:56,579 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:34:56,580 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:34:56,580 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:34:56,581 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:34:56,583 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:34:56,583 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:34:56,583 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:34:56,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:34:56,584 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:34:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 11:34:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:34:56,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:56,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:56,615 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:56,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash 395554539, now seen corresponding path program 1 times [2018-11-23 11:34:56,625 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:56,625 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 11:34:56,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:56,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:56,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 11:34:56,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 11:34:56,785 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #58#return; {26#true} is VALID [2018-11-23 11:34:56,786 INFO L256 TraceCheckUtils]: 3: Hoare triple {26#true} call #t~ret6 := main(); {26#true} is VALID [2018-11-23 11:34:56,786 INFO L273 TraceCheckUtils]: 4: Hoare triple {26#true} havoc ~i~0;havoc ~j~0; {26#true} is VALID [2018-11-23 11:34:56,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} ~i~0 := 0bv32; {26#true} is VALID [2018-11-23 11:34:56,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 11:34:56,793 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {27#false} is VALID [2018-11-23 11:34:56,793 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !true; {27#false} is VALID [2018-11-23 11:34:56,793 INFO L273 TraceCheckUtils]: 9: Hoare triple {27#false} assume !~bvsge32(~j~0, 100bv32); {27#false} is VALID [2018-11-23 11:34:56,794 INFO L256 TraceCheckUtils]: 10: Hoare triple {27#false} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {27#false} is VALID [2018-11-23 11:34:56,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-23 11:34:56,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {27#false} assume 0bv32 == ~cond; {27#false} is VALID [2018-11-23 11:34:56,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 11:34:56,797 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 11:34:56,798 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:34:56,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:34:56,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:34:56,809 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:34:56,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:56,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:34:56,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:56,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:34:56,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:34:56,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:34:56,895 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 11:34:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:57,081 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2018-11-23 11:34:57,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:34:57,082 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:34:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:57,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:34:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 11:34:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:34:57,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 11:34:57,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2018-11-23 11:34:57,457 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:57,467 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:34:57,467 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:34:57,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:34:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:34:57,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:34:57,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:57,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:34:57,509 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:34:57,509 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:34:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:57,513 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 11:34:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 11:34:57,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:57,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:57,514 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:34:57,514 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:34:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:57,517 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-11-23 11:34:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 11:34:57,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:57,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:57,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:57,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:34:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 11:34:57,521 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2018-11-23 11:34:57,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:57,521 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 11:34:57,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:34:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 11:34:57,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:34:57,522 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:57,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:57,523 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:57,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1899731187, now seen corresponding path program 1 times [2018-11-23 11:34:57,523 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:57,524 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 11:34:57,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:57,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:57,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {169#true} call ULTIMATE.init(); {169#true} is VALID [2018-11-23 11:34:57,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {169#true} assume true; {169#true} is VALID [2018-11-23 11:34:57,801 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {169#true} {169#true} #58#return; {169#true} is VALID [2018-11-23 11:34:57,801 INFO L256 TraceCheckUtils]: 3: Hoare triple {169#true} call #t~ret6 := main(); {169#true} is VALID [2018-11-23 11:34:57,802 INFO L273 TraceCheckUtils]: 4: Hoare triple {169#true} havoc ~i~0;havoc ~j~0; {169#true} is VALID [2018-11-23 11:34:57,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {169#true} ~i~0 := 0bv32; {189#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:34:57,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {189#(= main_~i~0 (_ bv0 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {189#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:34:57,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {189#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:34:57,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {189#(= main_~i~0 (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {189#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:34:57,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {189#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~j~0, 100bv32); {189#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:34:57,813 INFO L256 TraceCheckUtils]: 10: Hoare triple {189#(= main_~i~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {205#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:57,813 INFO L273 TraceCheckUtils]: 11: Hoare triple {205#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {209#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:57,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {209#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {170#false} is VALID [2018-11-23 11:34:57,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {170#false} assume !false; {170#false} is VALID [2018-11-23 11:34:57,817 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 11:34:57,817 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:34:57,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:34:57,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:34:57,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:34:57,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:57,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:34:57,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:57,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:34:57,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:34:57,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:34:57,852 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2018-11-23 11:34:58,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:58,299 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-11-23 11:34:58,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:34:58,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 11:34:58,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:34:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 11:34:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:34:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2018-11-23 11:34:58,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2018-11-23 11:34:58,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:58,466 INFO L225 Difference]: With dead ends: 24 [2018-11-23 11:34:58,467 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:34:58,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:34:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:34:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:34:58,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:58,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 11:34:58,477 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:34:58,477 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:34:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:58,480 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 11:34:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 11:34:58,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:58,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:58,481 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:34:58,481 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:34:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:58,483 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 11:34:58,483 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 11:34:58,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:58,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:58,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:58,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:34:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-23 11:34:58,486 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2018-11-23 11:34:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:58,487 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 11:34:58,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:34:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 11:34:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:34:58,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:58,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:58,488 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:58,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:58,489 INFO L82 PathProgramCache]: Analyzing trace with hash 232814056, now seen corresponding path program 1 times [2018-11-23 11:34:58,489 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:58,489 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 11:34:58,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:58,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:58,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {309#true} is VALID [2018-11-23 11:34:58,709 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2018-11-23 11:34:58,710 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #58#return; {309#true} is VALID [2018-11-23 11:34:58,710 INFO L256 TraceCheckUtils]: 3: Hoare triple {309#true} call #t~ret6 := main(); {309#true} is VALID [2018-11-23 11:34:58,710 INFO L273 TraceCheckUtils]: 4: Hoare triple {309#true} havoc ~i~0;havoc ~j~0; {309#true} is VALID [2018-11-23 11:34:58,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {309#true} ~i~0 := 0bv32; {329#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:34:58,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {329#(= main_~i~0 (_ bv0 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {329#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:34:58,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {329#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {329#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:34:58,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {329#(= main_~i~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {339#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:58,718 INFO L273 TraceCheckUtils]: 9: Hoare triple {339#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {339#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:58,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {339#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsge32(~j~0, 100bv32); {339#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:58,719 INFO L256 TraceCheckUtils]: 11: Hoare triple {339#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {349#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:58,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {349#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {353#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:58,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {353#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {310#false} is VALID [2018-11-23 11:34:58,721 INFO L273 TraceCheckUtils]: 14: Hoare triple {310#false} assume !false; {310#false} is VALID [2018-11-23 11:34:58,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:58,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:58,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {310#false} assume !false; {310#false} is VALID [2018-11-23 11:34:58,972 INFO L273 TraceCheckUtils]: 13: Hoare triple {363#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {310#false} is VALID [2018-11-23 11:34:58,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {367#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {363#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:34:58,980 INFO L256 TraceCheckUtils]: 11: Hoare triple {371#(bvslt main_~i~0 (_ bv200 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {367#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:34:58,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {371#(bvslt main_~i~0 (_ bv200 32))} assume !~bvsge32(~j~0, 100bv32); {371#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:34:58,983 INFO L273 TraceCheckUtils]: 9: Hoare triple {371#(bvslt main_~i~0 (_ bv200 32))} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {371#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:34:58,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {381#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {371#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:34:58,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {381#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {381#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} is VALID [2018-11-23 11:34:58,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {381#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {381#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} is VALID [2018-11-23 11:34:58,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {309#true} ~i~0 := 0bv32; {381#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} is VALID [2018-11-23 11:34:58,992 INFO L273 TraceCheckUtils]: 4: Hoare triple {309#true} havoc ~i~0;havoc ~j~0; {309#true} is VALID [2018-11-23 11:34:58,993 INFO L256 TraceCheckUtils]: 3: Hoare triple {309#true} call #t~ret6 := main(); {309#true} is VALID [2018-11-23 11:34:58,993 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #58#return; {309#true} is VALID [2018-11-23 11:34:58,993 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2018-11-23 11:34:58,994 INFO L256 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {309#true} is VALID [2018-11-23 11:34:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:58,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:58,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:34:58,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-23 11:34:58,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:58,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:34:59,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:59,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:34:59,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:34:59,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:34:59,060 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 10 states. [2018-11-23 11:34:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:59,746 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 11:34:59,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:34:59,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-23 11:34:59,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:59,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:34:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2018-11-23 11:34:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:34:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2018-11-23 11:34:59,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2018-11-23 11:34:59,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:59,894 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:34:59,894 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:34:59,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:34:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:34:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2018-11-23 11:34:59,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:59,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 23 states. [2018-11-23 11:34:59,902 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 23 states. [2018-11-23 11:34:59,902 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 23 states. [2018-11-23 11:34:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:59,905 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 11:34:59,905 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 11:34:59,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:59,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:59,906 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 27 states. [2018-11-23 11:34:59,907 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 27 states. [2018-11-23 11:34:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:59,909 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-11-23 11:34:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 11:34:59,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:59,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:59,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:59,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:34:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 11:34:59,912 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2018-11-23 11:34:59,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:59,913 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 11:34:59,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:34:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:34:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:34:59,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:59,914 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:59,914 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:59,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:59,915 INFO L82 PathProgramCache]: Analyzing trace with hash -502944205, now seen corresponding path program 2 times [2018-11-23 11:34:59,915 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:59,915 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 11:34:59,937 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:34:59,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:34:59,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:34:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:59,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:00,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2018-11-23 11:35:00,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {542#true} assume true; {542#true} is VALID [2018-11-23 11:35:00,129 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {542#true} {542#true} #58#return; {542#true} is VALID [2018-11-23 11:35:00,129 INFO L256 TraceCheckUtils]: 3: Hoare triple {542#true} call #t~ret6 := main(); {542#true} is VALID [2018-11-23 11:35:00,129 INFO L273 TraceCheckUtils]: 4: Hoare triple {542#true} havoc ~i~0;havoc ~j~0; {542#true} is VALID [2018-11-23 11:35:00,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {542#true} ~i~0 := 0bv32; {562#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:00,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {562#(= main_~i~0 (_ bv0 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {562#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:00,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {562#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {562#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:00,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {562#(= main_~i~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {572#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:00,134 INFO L273 TraceCheckUtils]: 9: Hoare triple {572#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {576#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:35:00,135 INFO L273 TraceCheckUtils]: 10: Hoare triple {576#(= (_ bv2 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {580#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:00,136 INFO L273 TraceCheckUtils]: 11: Hoare triple {580#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {584#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:35:00,136 INFO L273 TraceCheckUtils]: 12: Hoare triple {584#(= (_ bv4 32) main_~i~0)} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {584#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:35:00,137 INFO L273 TraceCheckUtils]: 13: Hoare triple {584#(= (_ bv4 32) main_~i~0)} assume !~bvsge32(~j~0, 100bv32); {584#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:35:00,139 INFO L256 TraceCheckUtils]: 14: Hoare triple {584#(= (_ bv4 32) main_~i~0)} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {594#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:00,140 INFO L273 TraceCheckUtils]: 15: Hoare triple {594#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {598#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:00,140 INFO L273 TraceCheckUtils]: 16: Hoare triple {598#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {543#false} is VALID [2018-11-23 11:35:00,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {543#false} assume !false; {543#false} is VALID [2018-11-23 11:35:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:00,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:00,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {543#false} assume !false; {543#false} is VALID [2018-11-23 11:35:00,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {608#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {543#false} is VALID [2018-11-23 11:35:00,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {612#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {608#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:00,502 INFO L256 TraceCheckUtils]: 14: Hoare triple {616#(bvslt main_~i~0 (_ bv200 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {612#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:00,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {616#(bvslt main_~i~0 (_ bv200 32))} assume !~bvsge32(~j~0, 100bv32); {616#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:00,503 INFO L273 TraceCheckUtils]: 12: Hoare triple {616#(bvslt main_~i~0 (_ bv200 32))} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {616#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:00,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {626#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {616#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:00,512 INFO L273 TraceCheckUtils]: 10: Hoare triple {630#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {626#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:00,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {634#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {630#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:00,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {638#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {634#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:00,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {638#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {638#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:00,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {638#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {638#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:00,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {542#true} ~i~0 := 0bv32; {638#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:00,528 INFO L273 TraceCheckUtils]: 4: Hoare triple {542#true} havoc ~i~0;havoc ~j~0; {542#true} is VALID [2018-11-23 11:35:00,528 INFO L256 TraceCheckUtils]: 3: Hoare triple {542#true} call #t~ret6 := main(); {542#true} is VALID [2018-11-23 11:35:00,529 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {542#true} {542#true} #58#return; {542#true} is VALID [2018-11-23 11:35:00,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {542#true} assume true; {542#true} is VALID [2018-11-23 11:35:00,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {542#true} is VALID [2018-11-23 11:35:00,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:00,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:00,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:35:00,532 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-11-23 11:35:00,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:00,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:35:00,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:00,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:35:00,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:35:00,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:35:00,587 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 16 states. [2018-11-23 11:35:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:02,295 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2018-11-23 11:35:02,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:35:02,296 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-11-23 11:35:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:02,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:35:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2018-11-23 11:35:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:35:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 77 transitions. [2018-11-23 11:35:02,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 77 transitions. [2018-11-23 11:35:02,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:02,479 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:35:02,479 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 11:35:02,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:35:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 11:35:02,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2018-11-23 11:35:02,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:02,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 35 states. [2018-11-23 11:35:02,486 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 35 states. [2018-11-23 11:35:02,486 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 35 states. [2018-11-23 11:35:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:02,489 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-23 11:35:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2018-11-23 11:35:02,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:02,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:02,491 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 51 states. [2018-11-23 11:35:02,491 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 51 states. [2018-11-23 11:35:02,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:02,494 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-23 11:35:02,495 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2018-11-23 11:35:02,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:02,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:02,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:02,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:02,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:35:02,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 11:35:02,498 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 18 [2018-11-23 11:35:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:02,499 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 11:35:02,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:35:02,499 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 11:35:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:35:02,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:02,500 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:02,501 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:02,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:02,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1171906029, now seen corresponding path program 3 times [2018-11-23 11:35:02,502 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:02,502 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 11:35:02,522 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:35:02,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:35:02,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:02,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:02,907 INFO L256 TraceCheckUtils]: 0: Hoare triple {898#true} call ULTIMATE.init(); {898#true} is VALID [2018-11-23 11:35:02,908 INFO L273 TraceCheckUtils]: 1: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:35:02,908 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {898#true} {898#true} #58#return; {898#true} is VALID [2018-11-23 11:35:02,909 INFO L256 TraceCheckUtils]: 3: Hoare triple {898#true} call #t~ret6 := main(); {898#true} is VALID [2018-11-23 11:35:02,909 INFO L273 TraceCheckUtils]: 4: Hoare triple {898#true} havoc ~i~0;havoc ~j~0; {898#true} is VALID [2018-11-23 11:35:02,909 INFO L273 TraceCheckUtils]: 5: Hoare triple {898#true} ~i~0 := 0bv32; {918#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {918#(= main_~i~0 (_ bv0 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {918#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {918#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {918#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:02,911 INFO L273 TraceCheckUtils]: 8: Hoare triple {918#(= main_~i~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {928#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,912 INFO L273 TraceCheckUtils]: 9: Hoare triple {928#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {932#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:35:02,912 INFO L273 TraceCheckUtils]: 10: Hoare triple {932#(= (_ bv2 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {936#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {936#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {940#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:35:02,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {940#(= (_ bv4 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {944#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {944#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {948#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:35:02,921 INFO L273 TraceCheckUtils]: 14: Hoare triple {948#(= (_ bv6 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {952#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {952#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {956#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:35:02,924 INFO L273 TraceCheckUtils]: 16: Hoare triple {956#(= (_ bv8 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {960#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,925 INFO L273 TraceCheckUtils]: 17: Hoare triple {960#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {964#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 11:35:02,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {964#(= (_ bv10 32) main_~i~0)} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {964#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 11:35:02,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {964#(= (_ bv10 32) main_~i~0)} assume !~bvsge32(~j~0, 100bv32); {964#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 11:35:02,928 INFO L256 TraceCheckUtils]: 20: Hoare triple {964#(= (_ bv10 32) main_~i~0)} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {974#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {974#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {978#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:02,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {978#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {899#false} is VALID [2018-11-23 11:35:02,931 INFO L273 TraceCheckUtils]: 23: Hoare triple {899#false} assume !false; {899#false} is VALID [2018-11-23 11:35:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:02,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:03,688 INFO L273 TraceCheckUtils]: 23: Hoare triple {899#false} assume !false; {899#false} is VALID [2018-11-23 11:35:03,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {988#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {899#false} is VALID [2018-11-23 11:35:03,690 INFO L273 TraceCheckUtils]: 21: Hoare triple {992#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {988#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:03,705 INFO L256 TraceCheckUtils]: 20: Hoare triple {996#(bvslt main_~i~0 (_ bv200 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {992#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:03,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {996#(bvslt main_~i~0 (_ bv200 32))} assume !~bvsge32(~j~0, 100bv32); {996#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:03,706 INFO L273 TraceCheckUtils]: 18: Hoare triple {996#(bvslt main_~i~0 (_ bv200 32))} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {996#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:03,708 INFO L273 TraceCheckUtils]: 17: Hoare triple {1006#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {996#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:03,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {1010#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1006#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {1014#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1010#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {1018#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1014#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {1022#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1018#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {1026#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1022#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {1030#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1026#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,741 INFO L273 TraceCheckUtils]: 10: Hoare triple {1034#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1030#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,745 INFO L273 TraceCheckUtils]: 9: Hoare triple {1038#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1034#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {1042#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1038#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {1042#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv200 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {1042#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {1042#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv200 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {1042#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {898#true} ~i~0 := 0bv32; {1042#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:03,751 INFO L273 TraceCheckUtils]: 4: Hoare triple {898#true} havoc ~i~0;havoc ~j~0; {898#true} is VALID [2018-11-23 11:35:03,751 INFO L256 TraceCheckUtils]: 3: Hoare triple {898#true} call #t~ret6 := main(); {898#true} is VALID [2018-11-23 11:35:03,751 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {898#true} {898#true} #58#return; {898#true} is VALID [2018-11-23 11:35:03,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:35:03,751 INFO L256 TraceCheckUtils]: 0: Hoare triple {898#true} call ULTIMATE.init(); {898#true} is VALID [2018-11-23 11:35:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:03,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:03,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:35:03,759 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2018-11-23 11:35:03,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:03,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:35:03,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:03,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:35:03,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:35:03,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:35:03,846 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 28 states. [2018-11-23 11:35:10,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:10,544 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2018-11-23 11:35:10,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:35:10,545 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 24 [2018-11-23 11:35:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:10,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:35:10,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 143 transitions. [2018-11-23 11:35:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:35:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 143 transitions. [2018-11-23 11:35:10,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 143 transitions. [2018-11-23 11:35:10,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:10,992 INFO L225 Difference]: With dead ends: 139 [2018-11-23 11:35:10,992 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 11:35:10,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=422, Invalid=1060, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:35:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 11:35:11,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 59. [2018-11-23 11:35:11,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:11,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand 59 states. [2018-11-23 11:35:11,068 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 59 states. [2018-11-23 11:35:11,068 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 59 states. [2018-11-23 11:35:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:11,074 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-11-23 11:35:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2018-11-23 11:35:11,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:11,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:11,076 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 111 states. [2018-11-23 11:35:11,076 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 111 states. [2018-11-23 11:35:11,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:11,081 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-11-23 11:35:11,081 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2018-11-23 11:35:11,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:11,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:11,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:11,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:11,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:35:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2018-11-23 11:35:11,086 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 24 [2018-11-23 11:35:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:11,086 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2018-11-23 11:35:11,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:35:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2018-11-23 11:35:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:35:11,088 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:11,088 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:11,088 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:11,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:11,089 INFO L82 PathProgramCache]: Analyzing trace with hash -418786861, now seen corresponding path program 4 times [2018-11-23 11:35:11,089 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:11,090 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 11:35:11,122 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:35:11,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:35:11,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:11,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:11,879 INFO L256 TraceCheckUtils]: 0: Hoare triple {1536#true} call ULTIMATE.init(); {1536#true} is VALID [2018-11-23 11:35:11,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {1536#true} assume true; {1536#true} is VALID [2018-11-23 11:35:11,880 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1536#true} {1536#true} #58#return; {1536#true} is VALID [2018-11-23 11:35:11,880 INFO L256 TraceCheckUtils]: 3: Hoare triple {1536#true} call #t~ret6 := main(); {1536#true} is VALID [2018-11-23 11:35:11,881 INFO L273 TraceCheckUtils]: 4: Hoare triple {1536#true} havoc ~i~0;havoc ~j~0; {1536#true} is VALID [2018-11-23 11:35:11,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {1536#true} ~i~0 := 0bv32; {1556#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:11,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {1556#(= main_~i~0 (_ bv0 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {1556#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:11,885 INFO L273 TraceCheckUtils]: 7: Hoare triple {1556#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {1556#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:11,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {1556#(= main_~i~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1566#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {1566#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1570#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:35:11,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {1570#(= (_ bv2 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1574#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {1574#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1578#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:35:11,889 INFO L273 TraceCheckUtils]: 12: Hoare triple {1578#(= (_ bv4 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1582#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,889 INFO L273 TraceCheckUtils]: 13: Hoare triple {1582#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1586#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:35:11,890 INFO L273 TraceCheckUtils]: 14: Hoare triple {1586#(= (_ bv6 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1590#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,892 INFO L273 TraceCheckUtils]: 15: Hoare triple {1590#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1594#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:35:11,893 INFO L273 TraceCheckUtils]: 16: Hoare triple {1594#(= (_ bv8 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1598#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,893 INFO L273 TraceCheckUtils]: 17: Hoare triple {1598#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1602#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 11:35:11,894 INFO L273 TraceCheckUtils]: 18: Hoare triple {1602#(= (_ bv10 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1606#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,895 INFO L273 TraceCheckUtils]: 19: Hoare triple {1606#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1610#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 11:35:11,896 INFO L273 TraceCheckUtils]: 20: Hoare triple {1610#(= (_ bv12 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1614#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,897 INFO L273 TraceCheckUtils]: 21: Hoare triple {1614#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1618#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 11:35:11,898 INFO L273 TraceCheckUtils]: 22: Hoare triple {1618#(= (_ bv14 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1622#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,898 INFO L273 TraceCheckUtils]: 23: Hoare triple {1622#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1626#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 11:35:11,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {1626#(= (_ bv16 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1630#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,901 INFO L273 TraceCheckUtils]: 25: Hoare triple {1630#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1634#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 11:35:11,902 INFO L273 TraceCheckUtils]: 26: Hoare triple {1634#(= (_ bv18 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1638#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {1638#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1642#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 11:35:11,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {1642#(= (_ bv20 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1646#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {1646#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1650#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,907 INFO L273 TraceCheckUtils]: 30: Hoare triple {1650#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {1650#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {1650#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvsge32(~j~0, 100bv32); {1650#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,908 INFO L256 TraceCheckUtils]: 32: Hoare triple {1650#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {1660#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,909 INFO L273 TraceCheckUtils]: 33: Hoare triple {1660#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1664#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:11,910 INFO L273 TraceCheckUtils]: 34: Hoare triple {1664#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1537#false} is VALID [2018-11-23 11:35:11,910 INFO L273 TraceCheckUtils]: 35: Hoare triple {1537#false} assume !false; {1537#false} is VALID [2018-11-23 11:35:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:11,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:14,100 INFO L273 TraceCheckUtils]: 35: Hoare triple {1537#false} assume !false; {1537#false} is VALID [2018-11-23 11:35:14,101 INFO L273 TraceCheckUtils]: 34: Hoare triple {1674#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1537#false} is VALID [2018-11-23 11:35:14,101 INFO L273 TraceCheckUtils]: 33: Hoare triple {1678#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1674#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:14,103 INFO L256 TraceCheckUtils]: 32: Hoare triple {1682#(bvslt main_~i~0 (_ bv200 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {1678#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:14,103 INFO L273 TraceCheckUtils]: 31: Hoare triple {1682#(bvslt main_~i~0 (_ bv200 32))} assume !~bvsge32(~j~0, 100bv32); {1682#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:14,104 INFO L273 TraceCheckUtils]: 30: Hoare triple {1682#(bvslt main_~i~0 (_ bv200 32))} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {1682#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:14,105 INFO L273 TraceCheckUtils]: 29: Hoare triple {1692#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1682#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:14,110 INFO L273 TraceCheckUtils]: 28: Hoare triple {1696#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1692#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {1700#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1696#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,119 INFO L273 TraceCheckUtils]: 26: Hoare triple {1704#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1700#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,123 INFO L273 TraceCheckUtils]: 25: Hoare triple {1708#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1704#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,127 INFO L273 TraceCheckUtils]: 24: Hoare triple {1712#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1708#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {1716#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1712#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,137 INFO L273 TraceCheckUtils]: 22: Hoare triple {1720#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1716#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,141 INFO L273 TraceCheckUtils]: 21: Hoare triple {1724#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1720#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,147 INFO L273 TraceCheckUtils]: 20: Hoare triple {1728#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1724#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,152 INFO L273 TraceCheckUtils]: 19: Hoare triple {1732#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1728#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,156 INFO L273 TraceCheckUtils]: 18: Hoare triple {1736#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1732#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {1740#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1736#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {1744#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1740#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {1748#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1744#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,173 INFO L273 TraceCheckUtils]: 14: Hoare triple {1752#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1748#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {1756#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1752#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {1760#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1756#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,190 INFO L273 TraceCheckUtils]: 11: Hoare triple {1764#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1760#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,199 INFO L273 TraceCheckUtils]: 10: Hoare triple {1768#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1764#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {1772#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1768#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,207 INFO L273 TraceCheckUtils]: 8: Hoare triple {1776#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1772#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,207 INFO L273 TraceCheckUtils]: 7: Hoare triple {1776#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv200 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {1776#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {1776#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv200 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {1776#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {1536#true} ~i~0 := 0bv32; {1776#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:14,208 INFO L273 TraceCheckUtils]: 4: Hoare triple {1536#true} havoc ~i~0;havoc ~j~0; {1536#true} is VALID [2018-11-23 11:35:14,209 INFO L256 TraceCheckUtils]: 3: Hoare triple {1536#true} call #t~ret6 := main(); {1536#true} is VALID [2018-11-23 11:35:14,209 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1536#true} {1536#true} #58#return; {1536#true} is VALID [2018-11-23 11:35:14,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {1536#true} assume true; {1536#true} is VALID [2018-11-23 11:35:14,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {1536#true} call ULTIMATE.init(); {1536#true} is VALID [2018-11-23 11:35:14,212 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:14,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:14,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2018-11-23 11:35:14,221 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 36 [2018-11-23 11:35:14,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:14,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 11:35:14,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:14,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 11:35:14,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 11:35:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2020, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 11:35:14,375 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 52 states. [2018-11-23 11:35:24,382 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:35:25,531 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:35:26,614 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:35:27,588 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:35:28,699 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 11:35:29,836 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 11:35:30,807 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 11:35:39,230 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 7 [2018-11-23 11:35:41,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:41,597 INFO L93 Difference]: Finished difference Result 337 states and 407 transitions. [2018-11-23 11:35:41,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 11:35:41,597 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 36 [2018-11-23 11:35:41,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:35:41,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:35:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 275 transitions. [2018-11-23 11:35:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:35:41,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 275 transitions. [2018-11-23 11:35:41,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 275 transitions. [2018-11-23 11:35:42,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 275 edges. 275 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:42,491 INFO L225 Difference]: With dead ends: 337 [2018-11-23 11:35:42,491 INFO L226 Difference]: Without dead ends: 285 [2018-11-23 11:35:42,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1694, Invalid=3856, Unknown=0, NotChecked=0, Total=5550 [2018-11-23 11:35:42,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-23 11:35:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 107. [2018-11-23 11:35:42,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:35:42,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states. Second operand 107 states. [2018-11-23 11:35:42,525 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand 107 states. [2018-11-23 11:35:42,525 INFO L87 Difference]: Start difference. First operand 285 states. Second operand 107 states. [2018-11-23 11:35:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:42,536 INFO L93 Difference]: Finished difference Result 285 states and 332 transitions. [2018-11-23 11:35:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 332 transitions. [2018-11-23 11:35:42,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:42,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:42,538 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 285 states. [2018-11-23 11:35:42,538 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 285 states. [2018-11-23 11:35:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:35:42,549 INFO L93 Difference]: Finished difference Result 285 states and 332 transitions. [2018-11-23 11:35:42,550 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 332 transitions. [2018-11-23 11:35:42,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:35:42,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:35:42,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:35:42,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:35:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 11:35:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2018-11-23 11:35:42,555 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 36 [2018-11-23 11:35:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:35:42,555 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2018-11-23 11:35:42,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 11:35:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2018-11-23 11:35:42,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 11:35:42,557 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:35:42,557 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:35:42,557 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:35:42,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:35:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash -404467373, now seen corresponding path program 5 times [2018-11-23 11:35:42,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:35:42,558 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 11:35:42,581 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:35:46,286 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:35:46,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:35:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:35:46,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:47,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2018-11-23 11:35:47,897 INFO L273 TraceCheckUtils]: 1: Hoare triple {2900#true} assume true; {2900#true} is VALID [2018-11-23 11:35:47,897 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2900#true} {2900#true} #58#return; {2900#true} is VALID [2018-11-23 11:35:47,897 INFO L256 TraceCheckUtils]: 3: Hoare triple {2900#true} call #t~ret6 := main(); {2900#true} is VALID [2018-11-23 11:35:47,897 INFO L273 TraceCheckUtils]: 4: Hoare triple {2900#true} havoc ~i~0;havoc ~j~0; {2900#true} is VALID [2018-11-23 11:35:47,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {2900#true} ~i~0 := 0bv32; {2920#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:47,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {2920#(= main_~i~0 (_ bv0 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {2920#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:47,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {2920#(= main_~i~0 (_ bv0 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {2920#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:35:47,899 INFO L273 TraceCheckUtils]: 8: Hoare triple {2920#(= main_~i~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2930#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,899 INFO L273 TraceCheckUtils]: 9: Hoare triple {2930#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2934#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 11:35:47,900 INFO L273 TraceCheckUtils]: 10: Hoare triple {2934#(= (_ bv2 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2938#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,900 INFO L273 TraceCheckUtils]: 11: Hoare triple {2938#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2942#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 11:35:47,902 INFO L273 TraceCheckUtils]: 12: Hoare triple {2942#(= (_ bv4 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2946#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,903 INFO L273 TraceCheckUtils]: 13: Hoare triple {2946#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2950#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 11:35:47,904 INFO L273 TraceCheckUtils]: 14: Hoare triple {2950#(= (_ bv6 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2954#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {2954#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2958#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 11:35:47,907 INFO L273 TraceCheckUtils]: 16: Hoare triple {2958#(= (_ bv8 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2962#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,908 INFO L273 TraceCheckUtils]: 17: Hoare triple {2962#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2966#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 11:35:47,909 INFO L273 TraceCheckUtils]: 18: Hoare triple {2966#(= (_ bv10 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2970#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,910 INFO L273 TraceCheckUtils]: 19: Hoare triple {2970#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2974#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 11:35:47,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {2974#(= (_ bv12 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2978#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {2978#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2982#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 11:35:47,913 INFO L273 TraceCheckUtils]: 22: Hoare triple {2982#(= (_ bv14 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2986#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,914 INFO L273 TraceCheckUtils]: 23: Hoare triple {2986#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2990#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 11:35:47,915 INFO L273 TraceCheckUtils]: 24: Hoare triple {2990#(= (_ bv16 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2994#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,916 INFO L273 TraceCheckUtils]: 25: Hoare triple {2994#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2998#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 11:35:47,918 INFO L273 TraceCheckUtils]: 26: Hoare triple {2998#(= (_ bv18 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3002#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,919 INFO L273 TraceCheckUtils]: 27: Hoare triple {3002#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3006#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 11:35:47,921 INFO L273 TraceCheckUtils]: 28: Hoare triple {3006#(= (_ bv20 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3010#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,922 INFO L273 TraceCheckUtils]: 29: Hoare triple {3010#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3014#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,923 INFO L273 TraceCheckUtils]: 30: Hoare triple {3014#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3018#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,924 INFO L273 TraceCheckUtils]: 31: Hoare triple {3018#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3022#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,925 INFO L273 TraceCheckUtils]: 32: Hoare triple {3022#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3026#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-23 11:35:47,926 INFO L273 TraceCheckUtils]: 33: Hoare triple {3026#(= (_ bv25 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3030#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,928 INFO L273 TraceCheckUtils]: 34: Hoare triple {3030#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3034#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 11:35:47,930 INFO L273 TraceCheckUtils]: 35: Hoare triple {3034#(= (_ bv27 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3038#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,931 INFO L273 TraceCheckUtils]: 36: Hoare triple {3038#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3042#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 11:35:47,931 INFO L273 TraceCheckUtils]: 37: Hoare triple {3042#(= (_ bv29 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3046#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,932 INFO L273 TraceCheckUtils]: 38: Hoare triple {3046#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3050#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 11:35:47,933 INFO L273 TraceCheckUtils]: 39: Hoare triple {3050#(= (_ bv31 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3054#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,936 INFO L273 TraceCheckUtils]: 40: Hoare triple {3054#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3058#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 11:35:47,939 INFO L273 TraceCheckUtils]: 41: Hoare triple {3058#(= (_ bv33 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3062#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,941 INFO L273 TraceCheckUtils]: 42: Hoare triple {3062#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3066#(= (_ bv35 32) main_~i~0)} is VALID [2018-11-23 11:35:47,941 INFO L273 TraceCheckUtils]: 43: Hoare triple {3066#(= (_ bv35 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3070#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,942 INFO L273 TraceCheckUtils]: 44: Hoare triple {3070#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3074#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 11:35:47,943 INFO L273 TraceCheckUtils]: 45: Hoare triple {3074#(= (_ bv37 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3078#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,944 INFO L273 TraceCheckUtils]: 46: Hoare triple {3078#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3082#(= (_ bv39 32) main_~i~0)} is VALID [2018-11-23 11:35:47,945 INFO L273 TraceCheckUtils]: 47: Hoare triple {3082#(= (_ bv39 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3086#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,946 INFO L273 TraceCheckUtils]: 48: Hoare triple {3086#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3090#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 11:35:47,948 INFO L273 TraceCheckUtils]: 49: Hoare triple {3090#(= (_ bv41 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3094#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,949 INFO L273 TraceCheckUtils]: 50: Hoare triple {3094#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3098#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 11:35:47,950 INFO L273 TraceCheckUtils]: 51: Hoare triple {3098#(= (_ bv43 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3102#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,951 INFO L273 TraceCheckUtils]: 52: Hoare triple {3102#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3106#(= (_ bv45 32) main_~i~0)} is VALID [2018-11-23 11:35:47,953 INFO L273 TraceCheckUtils]: 53: Hoare triple {3106#(= (_ bv45 32) main_~i~0)} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3110#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,953 INFO L273 TraceCheckUtils]: 54: Hoare triple {3110#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {3110#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,954 INFO L273 TraceCheckUtils]: 55: Hoare triple {3110#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} assume !~bvsge32(~j~0, 100bv32); {3110#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,955 INFO L256 TraceCheckUtils]: 56: Hoare triple {3110#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {3120#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,956 INFO L273 TraceCheckUtils]: 57: Hoare triple {3120#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3124#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:47,956 INFO L273 TraceCheckUtils]: 58: Hoare triple {3124#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2901#false} is VALID [2018-11-23 11:35:47,957 INFO L273 TraceCheckUtils]: 59: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2018-11-23 11:35:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:47,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:35:56,582 INFO L273 TraceCheckUtils]: 59: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2018-11-23 11:35:56,583 INFO L273 TraceCheckUtils]: 58: Hoare triple {3134#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2901#false} is VALID [2018-11-23 11:35:56,584 INFO L273 TraceCheckUtils]: 57: Hoare triple {3138#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3134#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:35:56,585 INFO L256 TraceCheckUtils]: 56: Hoare triple {3142#(bvslt main_~i~0 (_ bv200 32))} call __VERIFIER_assert((if ~bvslt32(~i~0, 200bv32) then 1bv32 else 0bv32)); {3138#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:35:56,586 INFO L273 TraceCheckUtils]: 55: Hoare triple {3142#(bvslt main_~i~0 (_ bv200 32))} assume !~bvsge32(~j~0, 100bv32); {3142#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:56,586 INFO L273 TraceCheckUtils]: 54: Hoare triple {3142#(bvslt main_~i~0 (_ bv200 32))} assume !(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3; {3142#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:56,589 INFO L273 TraceCheckUtils]: 53: Hoare triple {3152#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3142#(bvslt main_~i~0 (_ bv200 32))} is VALID [2018-11-23 11:35:56,593 INFO L273 TraceCheckUtils]: 52: Hoare triple {3156#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3152#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,597 INFO L273 TraceCheckUtils]: 51: Hoare triple {3160#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3156#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,601 INFO L273 TraceCheckUtils]: 50: Hoare triple {3164#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3160#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,606 INFO L273 TraceCheckUtils]: 49: Hoare triple {3168#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3164#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,610 INFO L273 TraceCheckUtils]: 48: Hoare triple {3172#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3168#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {3176#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3172#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,619 INFO L273 TraceCheckUtils]: 46: Hoare triple {3180#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3176#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,625 INFO L273 TraceCheckUtils]: 45: Hoare triple {3184#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3180#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,632 INFO L273 TraceCheckUtils]: 44: Hoare triple {3188#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3184#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,637 INFO L273 TraceCheckUtils]: 43: Hoare triple {3192#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3188#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,642 INFO L273 TraceCheckUtils]: 42: Hoare triple {3196#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3192#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,647 INFO L273 TraceCheckUtils]: 41: Hoare triple {3200#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3196#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,651 INFO L273 TraceCheckUtils]: 40: Hoare triple {3204#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3200#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,656 INFO L273 TraceCheckUtils]: 39: Hoare triple {3208#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3204#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {3212#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3208#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,665 INFO L273 TraceCheckUtils]: 37: Hoare triple {3216#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3212#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,669 INFO L273 TraceCheckUtils]: 36: Hoare triple {3220#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3216#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,676 INFO L273 TraceCheckUtils]: 35: Hoare triple {3224#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3220#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,682 INFO L273 TraceCheckUtils]: 34: Hoare triple {3228#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3224#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {3232#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3228#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,694 INFO L273 TraceCheckUtils]: 32: Hoare triple {3236#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3232#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,700 INFO L273 TraceCheckUtils]: 31: Hoare triple {3240#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3236#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,704 INFO L273 TraceCheckUtils]: 30: Hoare triple {3244#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3240#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,708 INFO L273 TraceCheckUtils]: 29: Hoare triple {3248#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3244#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,714 INFO L273 TraceCheckUtils]: 28: Hoare triple {3252#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3248#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {3256#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3252#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,722 INFO L273 TraceCheckUtils]: 26: Hoare triple {3260#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3256#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {3264#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3260#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,732 INFO L273 TraceCheckUtils]: 24: Hoare triple {3268#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3264#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,736 INFO L273 TraceCheckUtils]: 23: Hoare triple {3272#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3268#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {3276#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3272#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,744 INFO L273 TraceCheckUtils]: 21: Hoare triple {3280#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3276#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,750 INFO L273 TraceCheckUtils]: 20: Hoare triple {3284#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3280#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {3288#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3284#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {3292#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3288#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,767 INFO L273 TraceCheckUtils]: 17: Hoare triple {3296#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3292#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {3300#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3296#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,776 INFO L273 TraceCheckUtils]: 15: Hoare triple {3304#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3300#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {3308#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3304#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {3312#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3308#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,790 INFO L273 TraceCheckUtils]: 12: Hoare triple {3316#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3312#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,794 INFO L273 TraceCheckUtils]: 11: Hoare triple {3320#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3316#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,799 INFO L273 TraceCheckUtils]: 10: Hoare triple {3324#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3320#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {3328#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3324#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {3332#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv200 32))} assume !!(0bv32 != #t~nondet3 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet3;#t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;#t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3328#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,810 INFO L273 TraceCheckUtils]: 7: Hoare triple {3332#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv200 32))} assume !~bvsge32(~i~0, 100bv32);~j~0 := 0bv32; {3332#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {3332#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv200 32))} assume !(0bv32 != #t~nondet1 && ~bvslt32(~i~0, 1000000bv32));havoc #t~nondet1; {3332#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,811 INFO L273 TraceCheckUtils]: 5: Hoare triple {2900#true} ~i~0 := 0bv32; {3332#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv200 32))} is VALID [2018-11-23 11:35:56,811 INFO L273 TraceCheckUtils]: 4: Hoare triple {2900#true} havoc ~i~0;havoc ~j~0; {2900#true} is VALID [2018-11-23 11:35:56,811 INFO L256 TraceCheckUtils]: 3: Hoare triple {2900#true} call #t~ret6 := main(); {2900#true} is VALID [2018-11-23 11:35:56,812 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2900#true} {2900#true} #58#return; {2900#true} is VALID [2018-11-23 11:35:56,812 INFO L273 TraceCheckUtils]: 1: Hoare triple {2900#true} assume true; {2900#true} is VALID [2018-11-23 11:35:56,812 INFO L256 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2018-11-23 11:35:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:35:56,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:35:56,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 100 [2018-11-23 11:35:56,825 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 60 [2018-11-23 11:35:56,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:56,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states. [2018-11-23 11:35:57,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:57,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-11-23 11:35:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-11-23 11:35:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2408, Invalid=7492, Unknown=0, NotChecked=0, Total=9900 [2018-11-23 11:35:57,033 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand 100 states. [2018-11-23 11:36:32,264 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 7 [2018-11-23 11:36:35,378 WARN L180 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 7 [2018-11-23 11:36:38,746 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 7 [2018-11-23 11:36:42,027 WARN L180 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 7 [2018-11-23 11:36:45,346 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 7 [2018-11-23 11:36:48,808 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 7 [2018-11-23 11:36:52,051 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 7 [2018-11-23 11:36:55,318 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 7 [2018-11-23 11:36:58,545 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 7 [2018-11-23 11:37:01,789 WARN L180 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 7 [2018-11-23 11:37:05,138 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 7 [2018-11-23 11:37:08,350 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 7 [2018-11-23 11:37:11,509 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 7 [2018-11-23 11:37:14,654 WARN L180 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 7 [2018-11-23 11:37:17,878 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 7 [2018-11-23 11:37:21,042 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 7 [2018-11-23 11:37:24,153 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 7 [2018-11-23 11:37:27,326 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 7 [2018-11-23 11:37:30,461 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 7 [2018-11-23 11:37:33,552 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2018-11-23 11:37:36,575 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2018-11-23 11:37:39,458 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 7 [2018-11-23 11:37:42,274 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 7 [2018-11-23 11:37:45,054 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-23 11:37:47,657 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:37:50,269 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:37:52,708 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:37:55,065 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:37:57,368 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 11:37:59,634 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 11:38:01,775 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 11:38:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:23,151 INFO L93 Difference]: Finished difference Result 949 states and 1091 transitions. [2018-11-23 11:38:23,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-11-23 11:38:23,151 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 60 [2018-11-23 11:38:23,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:38:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 11:38:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 539 transitions. [2018-11-23 11:38:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-23 11:38:23,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 539 transitions. [2018-11-23 11:38:23,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states and 539 transitions. [2018-11-23 11:38:24,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 539 edges. 539 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:38:24,725 INFO L225 Difference]: With dead ends: 949 [2018-11-23 11:38:24,725 INFO L226 Difference]: Without dead ends: 849 [2018-11-23 11:38:24,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 93.9s TimeCoverageRelationStatistics Valid=6830, Invalid=14632, Unknown=0, NotChecked=0, Total=21462 [2018-11-23 11:38:24,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2018-11-23 11:38:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 203. [2018-11-23 11:38:24,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:38:24,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 849 states. Second operand 203 states. [2018-11-23 11:38:24,838 INFO L74 IsIncluded]: Start isIncluded. First operand 849 states. Second operand 203 states. [2018-11-23 11:38:24,838 INFO L87 Difference]: Start difference. First operand 849 states. Second operand 203 states. [2018-11-23 11:38:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:24,894 INFO L93 Difference]: Finished difference Result 849 states and 944 transitions. [2018-11-23 11:38:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 944 transitions. [2018-11-23 11:38:24,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:24,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:24,897 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand 849 states. [2018-11-23 11:38:24,897 INFO L87 Difference]: Start difference. First operand 203 states. Second operand 849 states. [2018-11-23 11:38:24,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:38:24,945 INFO L93 Difference]: Finished difference Result 849 states and 944 transitions. [2018-11-23 11:38:24,945 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 944 transitions. [2018-11-23 11:38:24,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:38:24,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:38:24,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:38:24,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:38:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-11-23 11:38:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2018-11-23 11:38:24,954 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 60 [2018-11-23 11:38:24,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:38:24,954 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2018-11-23 11:38:24,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-11-23 11:38:24,955 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2018-11-23 11:38:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 11:38:24,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:38:24,956 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:38:24,956 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:38:24,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:38:24,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1239035821, now seen corresponding path program 6 times [2018-11-23 11:38:24,957 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:38:24,958 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:38:24,986 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE