java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:31:21,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:31:21,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:31:21,456 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:31:21,456 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:31:21,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:31:21,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:31:21,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:31:21,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:31:21,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:31:21,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:31:21,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:31:21,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:31:21,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:31:21,468 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:31:21,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:31:21,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:31:21,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:31:21,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:31:21,475 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:31:21,476 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:31:21,478 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:31:21,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:31:21,481 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:31:21,481 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:31:21,482 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:31:21,483 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:31:21,484 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:31:21,484 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:31:21,486 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:31:21,486 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:31:21,487 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:31:21,487 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:31:21,487 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:31:21,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:31:21,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:31:21,489 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:31:21,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:31:21,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:31:21,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:31:21,507 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:31:21,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:31:21,508 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:31:21,508 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:31:21,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:31:21,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:31:21,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:31:21,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:31:21,509 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:31:21,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:31:21,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:31:21,509 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:31:21,510 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:31:21,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:31:21,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:31:21,510 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:31:21,510 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:31:21,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:31:21,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:31:21,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:31:21,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:31:21,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:31:21,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:31:21,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:31:21,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:31:21,512 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:31:21,512 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:31:21,513 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:31:21,513 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:31:21,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:31:21,556 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:31:21,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:31:21,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:31:21,576 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:31:21,577 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:31:21,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 18:31:21,646 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb4d8834/dfa1785b77eb46aeabb85f7bcc869786/FLAGd4d592c18 [2018-11-14 18:31:22,200 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:31:22,200 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 18:31:22,208 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb4d8834/dfa1785b77eb46aeabb85f7bcc869786/FLAGd4d592c18 [2018-11-14 18:31:22,222 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cb4d8834/dfa1785b77eb46aeabb85f7bcc869786 [2018-11-14 18:31:22,233 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:31:22,235 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:31:22,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:31:22,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:31:22,241 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:31:22,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:31:22" (1/1) ... [2018-11-14 18:31:22,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38854913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22, skipping insertion in model container [2018-11-14 18:31:22,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:31:22" (1/1) ... [2018-11-14 18:31:22,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:31:22,292 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:31:22,554 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:31:22,566 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:31:22,624 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:31:22,645 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:31:22,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22 WrapperNode [2018-11-14 18:31:22,646 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:31:22,646 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:31:22,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:31:22,647 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:31:22,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22" (1/1) ... [2018-11-14 18:31:22,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22" (1/1) ... [2018-11-14 18:31:22,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22" (1/1) ... [2018-11-14 18:31:22,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22" (1/1) ... [2018-11-14 18:31:22,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22" (1/1) ... [2018-11-14 18:31:22,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22" (1/1) ... [2018-11-14 18:31:22,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22" (1/1) ... [2018-11-14 18:31:22,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:31:22,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:31:22,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:31:22,703 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:31:22,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22" (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-14 18:31:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:31:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:31:22,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:31:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:31:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:31:22,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:31:22,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:31:22,837 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:31:22,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:31:22,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:31:24,067 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:31:24,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:31:24 BoogieIcfgContainer [2018-11-14 18:31:24,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:31:24,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:31:24,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:31:24,072 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:31:24,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:31:22" (1/3) ... [2018-11-14 18:31:24,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9ede41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:31:24, skipping insertion in model container [2018-11-14 18:31:24,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:31:22" (2/3) ... [2018-11-14 18:31:24,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a9ede41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:31:24, skipping insertion in model container [2018-11-14 18:31:24,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:31:24" (3/3) ... [2018-11-14 18:31:24,076 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 18:31:24,086 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:31:24,094 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-14 18:31:24,110 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-14 18:31:24,142 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:31:24,143 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:31:24,143 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:31:24,144 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:31:24,144 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:31:24,145 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:31:24,145 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:31:24,145 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:31:24,145 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:31:24,169 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-11-14 18:31:24,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:31:24,175 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:24,177 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:24,179 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:24,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:24,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2018-11-14 18:31:24,190 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:24,191 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-14 18:31:24,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:24,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:24,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:24,891 INFO L256 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {90#true} is VALID [2018-11-14 18:31:24,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {90#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {90#true} is VALID [2018-11-14 18:31:24,895 INFO L273 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2018-11-14 18:31:24,896 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #215#return; {90#true} is VALID [2018-11-14 18:31:24,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {90#true} call #t~ret8 := main(); {90#true} is VALID [2018-11-14 18:31:24,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {90#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {90#true} is VALID [2018-11-14 18:31:24,897 INFO L273 TraceCheckUtils]: 6: Hoare triple {90#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {113#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:24,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {113#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {113#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:24,902 INFO L273 TraceCheckUtils]: 8: Hoare triple {113#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {113#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:24,903 INFO L273 TraceCheckUtils]: 9: Hoare triple {113#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {113#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:24,904 INFO L273 TraceCheckUtils]: 10: Hoare triple {113#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {126#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:24,904 INFO L273 TraceCheckUtils]: 11: Hoare triple {126#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {126#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:24,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {126#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume ~bvsgt32(~main__urilen~0, 0bv32); {133#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:24,910 INFO L273 TraceCheckUtils]: 13: Hoare triple {133#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {133#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:24,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {133#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsge32(~main__scheme~0, 0bv32); {140#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:24,918 INFO L273 TraceCheckUtils]: 15: Hoare triple {140#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !(~main__scheme~0 == 0bv32); {144#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (not (= main_~main__scheme~0 (_ bv0 32))) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:24,963 INFO L273 TraceCheckUtils]: 16: Hoare triple {144#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (not (= main_~main__scheme~0 (_ bv0 32))) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {148#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:24,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {148#(= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~0 == 0bv32; {91#false} is VALID [2018-11-14 18:31:24,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {91#false} assume !false; {91#false} is VALID [2018-11-14 18:31:24,977 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-14 18:31:24,977 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:24,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:24,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 18:31:24,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 18:31:24,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:24,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:31:25,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:25,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:31:25,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:31:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:31:25,239 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 8 states. [2018-11-14 18:31:26,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:26,821 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2018-11-14 18:31:26,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:31:26,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 18:31:26,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:31:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2018-11-14 18:31:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:31:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2018-11-14 18:31:26,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 142 transitions. [2018-11-14 18:31:27,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:27,199 INFO L225 Difference]: With dead ends: 106 [2018-11-14 18:31:27,199 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 18:31:27,203 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:31:27,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 18:31:27,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-14 18:31:27,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:27,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-14 18:31:27,327 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 18:31:27,327 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 18:31:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:27,335 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-14 18:31:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 18:31:27,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:27,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:27,337 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 18:31:27,338 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 18:31:27,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:27,345 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-14 18:31:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 18:31:27,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:27,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:27,347 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:27,347 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:27,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:31:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-11-14 18:31:27,354 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2018-11-14 18:31:27,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:27,355 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-11-14 18:31:27,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:31:27,355 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 18:31:27,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:31:27,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:27,356 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:27,357 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:27,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:27,358 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2018-11-14 18:31:27,358 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:27,358 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-14 18:31:27,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:27,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:27,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:27,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {522#true} call ULTIMATE.init(); {522#true} is VALID [2018-11-14 18:31:27,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {522#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {522#true} is VALID [2018-11-14 18:31:27,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {522#true} assume true; {522#true} is VALID [2018-11-14 18:31:27,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {522#true} {522#true} #215#return; {522#true} is VALID [2018-11-14 18:31:27,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {522#true} call #t~ret8 := main(); {522#true} is VALID [2018-11-14 18:31:27,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {522#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {522#true} is VALID [2018-11-14 18:31:27,549 INFO L273 TraceCheckUtils]: 6: Hoare triple {522#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {522#true} is VALID [2018-11-14 18:31:27,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {522#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {522#true} is VALID [2018-11-14 18:31:27,550 INFO L273 TraceCheckUtils]: 8: Hoare triple {522#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {522#true} is VALID [2018-11-14 18:31:27,550 INFO L273 TraceCheckUtils]: 9: Hoare triple {522#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {522#true} is VALID [2018-11-14 18:31:27,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {522#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {557#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:27,583 INFO L273 TraceCheckUtils]: 11: Hoare triple {557#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {557#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:27,584 INFO L273 TraceCheckUtils]: 12: Hoare triple {557#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__urilen~0, 0bv32); {557#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:27,585 INFO L273 TraceCheckUtils]: 13: Hoare triple {557#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {557#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:27,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {557#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsge32(~main__scheme~0, 0bv32); {570#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:27,588 INFO L273 TraceCheckUtils]: 15: Hoare triple {570#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !(~main__scheme~0 == 0bv32); {574#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (not (= main_~main__scheme~0 (_ bv0 32))) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:27,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {574#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (not (= main_~main__scheme~0 (_ bv0 32))) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {578#(and (not (= main_~main__cp~0 (_ bv0 32))) (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:27,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {578#(and (not (= main_~main__cp~0 (_ bv0 32))) (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {582#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:27,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {582#(= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~1 == 0bv32; {523#false} is VALID [2018-11-14 18:31:27,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {523#false} assume !false; {523#false} is VALID [2018-11-14 18:31:27,594 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-14 18:31:27,595 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:27,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:27,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 18:31:27,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 18:31:27,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:27,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:31:27,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:27,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:31:27,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:31:27,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:31:27,664 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 7 states. [2018-11-14 18:31:28,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:28,784 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-11-14 18:31:28,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:31:28,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 18:31:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:31:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-14 18:31:28,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:31:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-14 18:31:28,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2018-11-14 18:31:28,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:28,997 INFO L225 Difference]: With dead ends: 103 [2018-11-14 18:31:28,997 INFO L226 Difference]: Without dead ends: 101 [2018-11-14 18:31:29,002 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:31:29,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-14 18:31:29,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2018-11-14 18:31:29,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:29,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 78 states. [2018-11-14 18:31:29,049 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 78 states. [2018-11-14 18:31:29,049 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 78 states. [2018-11-14 18:31:29,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:29,055 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-14 18:31:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-14 18:31:29,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:29,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:29,057 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 101 states. [2018-11-14 18:31:29,057 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 101 states. [2018-11-14 18:31:29,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:29,063 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-14 18:31:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-14 18:31:29,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:29,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:29,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:29,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 18:31:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-14 18:31:29,074 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2018-11-14 18:31:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:29,075 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-14 18:31:29,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:31:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-14 18:31:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 18:31:29,077 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:29,077 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:29,077 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:29,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:29,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2018-11-14 18:31:29,078 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:29,078 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-14 18:31:29,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:29,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:29,604 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2018-11-14 18:31:29,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {995#true} call ULTIMATE.init(); {995#true} is VALID [2018-11-14 18:31:29,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {995#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {995#true} is VALID [2018-11-14 18:31:29,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {995#true} assume true; {995#true} is VALID [2018-11-14 18:31:29,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {995#true} {995#true} #215#return; {995#true} is VALID [2018-11-14 18:31:29,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {995#true} call #t~ret8 := main(); {995#true} is VALID [2018-11-14 18:31:29,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {995#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {995#true} is VALID [2018-11-14 18:31:29,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {995#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {1018#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:29,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {1018#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {1018#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:29,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {1018#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {1018#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:29,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {1018#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {1018#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:29,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {1018#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {1031#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:29,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {1031#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {1031#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:29,858 INFO L273 TraceCheckUtils]: 12: Hoare triple {1031#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume ~bvsgt32(~main__urilen~0, 0bv32); {1038#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:29,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {1038#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {1038#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:29,860 INFO L273 TraceCheckUtils]: 14: Hoare triple {1038#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsge32(~main__scheme~0, 0bv32); {1045#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:29,860 INFO L273 TraceCheckUtils]: 15: Hoare triple {1045#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !(~main__scheme~0 == 0bv32); {1045#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:29,891 INFO L273 TraceCheckUtils]: 16: Hoare triple {1045#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1052#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:29,894 INFO L273 TraceCheckUtils]: 17: Hoare triple {1052#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1056#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (or (and (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32)))) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:29,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {1056#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (or (and (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32)))) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {1060#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:29,905 INFO L273 TraceCheckUtils]: 19: Hoare triple {1060#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1064#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:29,906 INFO L273 TraceCheckUtils]: 20: Hoare triple {1064#(= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~2 == 0bv32; {996#false} is VALID [2018-11-14 18:31:29,906 INFO L273 TraceCheckUtils]: 21: Hoare triple {996#false} assume !false; {996#false} is VALID [2018-11-14 18:31:29,908 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-14 18:31:29,909 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:29,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:29,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-14 18:31:29,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-14 18:31:29,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:29,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:31:29,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:29,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:31:29,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:31:29,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:31:29,988 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 10 states. [2018-11-14 18:31:30,607 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-11-14 18:31:30,749 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-14 18:31:32,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:32,210 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-14 18:31:32,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:31:32,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-14 18:31:32,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:32,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:31:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2018-11-14 18:31:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:31:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2018-11-14 18:31:32,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 136 transitions. [2018-11-14 18:31:32,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:32,595 INFO L225 Difference]: With dead ends: 130 [2018-11-14 18:31:32,596 INFO L226 Difference]: Without dead ends: 128 [2018-11-14 18:31:32,596 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:31:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-14 18:31:32,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2018-11-14 18:31:32,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:32,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 76 states. [2018-11-14 18:31:32,717 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 76 states. [2018-11-14 18:31:32,717 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 76 states. [2018-11-14 18:31:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:32,727 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-14 18:31:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-11-14 18:31:32,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:32,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:32,731 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 128 states. [2018-11-14 18:31:32,731 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 128 states. [2018-11-14 18:31:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:32,742 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-14 18:31:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-11-14 18:31:32,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:32,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:32,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:32,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 18:31:32,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-14 18:31:32,748 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2018-11-14 18:31:32,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:32,748 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-14 18:31:32,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:31:32,749 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-14 18:31:32,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:31:32,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:32,750 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:32,752 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:32,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:32,752 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2018-11-14 18:31:32,753 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:32,753 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-14 18:31:32,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:32,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:32,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {1564#true} call ULTIMATE.init(); {1564#true} is VALID [2018-11-14 18:31:32,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {1564#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {1564#true} is VALID [2018-11-14 18:31:32,925 INFO L273 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2018-11-14 18:31:32,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1564#true} #215#return; {1564#true} is VALID [2018-11-14 18:31:32,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {1564#true} call #t~ret8 := main(); {1564#true} is VALID [2018-11-14 18:31:32,926 INFO L273 TraceCheckUtils]: 5: Hoare triple {1564#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {1564#true} is VALID [2018-11-14 18:31:32,927 INFO L273 TraceCheckUtils]: 6: Hoare triple {1564#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {1564#true} is VALID [2018-11-14 18:31:32,927 INFO L273 TraceCheckUtils]: 7: Hoare triple {1564#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {1564#true} is VALID [2018-11-14 18:31:32,927 INFO L273 TraceCheckUtils]: 8: Hoare triple {1564#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {1564#true} is VALID [2018-11-14 18:31:32,928 INFO L273 TraceCheckUtils]: 9: Hoare triple {1564#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {1564#true} is VALID [2018-11-14 18:31:32,928 INFO L273 TraceCheckUtils]: 10: Hoare triple {1564#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {1564#true} is VALID [2018-11-14 18:31:32,928 INFO L273 TraceCheckUtils]: 11: Hoare triple {1564#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {1564#true} is VALID [2018-11-14 18:31:32,928 INFO L273 TraceCheckUtils]: 12: Hoare triple {1564#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {1564#true} is VALID [2018-11-14 18:31:32,928 INFO L273 TraceCheckUtils]: 13: Hoare triple {1564#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {1564#true} is VALID [2018-11-14 18:31:32,929 INFO L273 TraceCheckUtils]: 14: Hoare triple {1564#true} assume ~bvsge32(~main__scheme~0, 0bv32); {1611#(bvsge main_~main__scheme~0 (_ bv0 32))} is VALID [2018-11-14 18:31:32,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {1611#(bvsge main_~main__scheme~0 (_ bv0 32))} assume !(~main__scheme~0 == 0bv32); {1611#(bvsge main_~main__scheme~0 (_ bv0 32))} is VALID [2018-11-14 18:31:32,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {1611#(bvsge main_~main__scheme~0 (_ bv0 32))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1618#(bvsge main_~main__cp~0 (_ bv0 32))} is VALID [2018-11-14 18:31:32,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {1618#(bvsge main_~main__cp~0 (_ bv0 32))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1618#(bvsge main_~main__cp~0 (_ bv0 32))} is VALID [2018-11-14 18:31:32,936 INFO L273 TraceCheckUtils]: 18: Hoare triple {1618#(bvsge main_~main__cp~0 (_ bv0 32))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {1618#(bvsge main_~main__cp~0 (_ bv0 32))} is VALID [2018-11-14 18:31:32,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {1618#(bvsge main_~main__cp~0 (_ bv0 32))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1618#(bvsge main_~main__cp~0 (_ bv0 32))} is VALID [2018-11-14 18:31:32,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {1618#(bvsge main_~main__cp~0 (_ bv0 32))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1631#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:32,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {1631#(= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~3 == 0bv32; {1565#false} is VALID [2018-11-14 18:31:32,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {1565#false} assume !false; {1565#false} is VALID [2018-11-14 18:31:32,940 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-14 18:31:32,940 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:32,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:32,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:31:32,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-14 18:31:32,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:32,943 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:31:32,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:32,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:31:32,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:31:32,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:31:32,982 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2018-11-14 18:31:33,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:33,585 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-11-14 18:31:33,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:31:33,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-14 18:31:33,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:33,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:31:33,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2018-11-14 18:31:33,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:31:33,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2018-11-14 18:31:33,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 104 transitions. [2018-11-14 18:31:33,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:33,782 INFO L225 Difference]: With dead ends: 99 [2018-11-14 18:31:33,782 INFO L226 Difference]: Without dead ends: 97 [2018-11-14 18:31:33,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:31:33,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-14 18:31:33,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2018-11-14 18:31:33,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:33,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 74 states. [2018-11-14 18:31:33,824 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 74 states. [2018-11-14 18:31:33,824 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 74 states. [2018-11-14 18:31:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:33,828 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-11-14 18:31:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-11-14 18:31:33,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:33,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:33,829 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 97 states. [2018-11-14 18:31:33,829 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 97 states. [2018-11-14 18:31:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:33,833 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-11-14 18:31:33,833 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-11-14 18:31:33,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:33,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:33,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:33,834 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:33,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 18:31:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-14 18:31:33,836 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2018-11-14 18:31:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:33,837 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-14 18:31:33,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:31:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 18:31:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:31:33,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:33,838 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:33,838 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:33,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:33,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2018-11-14 18:31:33,839 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:33,839 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-14 18:31:33,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:33,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:34,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2018-11-14 18:31:34,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {2028#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {2028#true} is VALID [2018-11-14 18:31:34,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2018-11-14 18:31:34,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #215#return; {2028#true} is VALID [2018-11-14 18:31:34,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret8 := main(); {2028#true} is VALID [2018-11-14 18:31:34,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {2028#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {2028#true} is VALID [2018-11-14 18:31:34,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {2028#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {2028#true} is VALID [2018-11-14 18:31:34,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {2028#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {2028#true} is VALID [2018-11-14 18:31:34,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {2028#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {2028#true} is VALID [2018-11-14 18:31:34,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {2028#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {2028#true} is VALID [2018-11-14 18:31:34,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {2028#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {2028#true} is VALID [2018-11-14 18:31:34,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {2028#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {2028#true} is VALID [2018-11-14 18:31:34,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {2028#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {2028#true} is VALID [2018-11-14 18:31:34,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {2028#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {2028#true} is VALID [2018-11-14 18:31:34,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {2028#true} assume ~bvsge32(~main__scheme~0, 0bv32); {2028#true} is VALID [2018-11-14 18:31:34,331 INFO L273 TraceCheckUtils]: 15: Hoare triple {2028#true} assume !(~main__scheme~0 == 0bv32); {2028#true} is VALID [2018-11-14 18:31:34,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {2028#true} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2028#true} is VALID [2018-11-14 18:31:34,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {2028#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2028#true} is VALID [2018-11-14 18:31:34,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {2028#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {2028#true} is VALID [2018-11-14 18:31:34,334 INFO L273 TraceCheckUtils]: 19: Hoare triple {2028#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2090#(or (and (not (bvslt main_~main__cp~0 main_~main__urilen~0)) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32))) (and (bvslt main_~main__cp~0 main_~main__urilen~0) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:31:34,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {2090#(or (and (not (bvslt main_~main__cp~0 main_~main__urilen~0)) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32))) (and (bvslt main_~main__cp~0 main_~main__urilen~0) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2094#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:31:34,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {2094#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {2094#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:31:34,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {2094#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {2094#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:31:34,344 INFO L273 TraceCheckUtils]: 23: Hoare triple {2094#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2104#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:34,345 INFO L273 TraceCheckUtils]: 24: Hoare triple {2104#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~16 == 0bv32; {2029#false} is VALID [2018-11-14 18:31:34,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2018-11-14 18:31:34,346 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-14 18:31:34,346 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:34,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:34,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:31:34,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 18:31:34,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:34,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:31:34,386 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-14 18:31:34,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:31:34,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:31:34,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:31:34,388 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-11-14 18:31:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:35,597 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-11-14 18:31:35,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:31:35,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 18:31:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:31:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-14 18:31:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:31:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-14 18:31:35,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 151 transitions. [2018-11-14 18:31:35,779 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:35,782 INFO L225 Difference]: With dead ends: 143 [2018-11-14 18:31:35,782 INFO L226 Difference]: Without dead ends: 141 [2018-11-14 18:31:35,782 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:31:35,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-14 18:31:35,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 77. [2018-11-14 18:31:35,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:35,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 77 states. [2018-11-14 18:31:35,824 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 77 states. [2018-11-14 18:31:35,824 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 77 states. [2018-11-14 18:31:35,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:35,830 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-11-14 18:31:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-11-14 18:31:35,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:35,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:35,831 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 141 states. [2018-11-14 18:31:35,831 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 141 states. [2018-11-14 18:31:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:35,835 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-11-14 18:31:35,835 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-11-14 18:31:35,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:35,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:35,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:35,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:35,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 18:31:35,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-14 18:31:35,838 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2018-11-14 18:31:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:35,839 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-14 18:31:35,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:31:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-14 18:31:35,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 18:31:35,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:35,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:35,840 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:35,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:35,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2018-11-14 18:31:35,841 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:35,841 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-14 18:31:35,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:35,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:36,122 INFO L256 TraceCheckUtils]: 0: Hoare triple {2639#true} call ULTIMATE.init(); {2639#true} is VALID [2018-11-14 18:31:36,122 INFO L273 TraceCheckUtils]: 1: Hoare triple {2639#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {2639#true} is VALID [2018-11-14 18:31:36,122 INFO L273 TraceCheckUtils]: 2: Hoare triple {2639#true} assume true; {2639#true} is VALID [2018-11-14 18:31:36,123 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2639#true} {2639#true} #215#return; {2639#true} is VALID [2018-11-14 18:31:36,123 INFO L256 TraceCheckUtils]: 4: Hoare triple {2639#true} call #t~ret8 := main(); {2639#true} is VALID [2018-11-14 18:31:36,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {2639#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {2639#true} is VALID [2018-11-14 18:31:36,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {2639#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {2639#true} is VALID [2018-11-14 18:31:36,123 INFO L273 TraceCheckUtils]: 7: Hoare triple {2639#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {2639#true} is VALID [2018-11-14 18:31:36,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {2639#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {2639#true} is VALID [2018-11-14 18:31:36,124 INFO L273 TraceCheckUtils]: 9: Hoare triple {2639#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {2639#true} is VALID [2018-11-14 18:31:36,124 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {2639#true} is VALID [2018-11-14 18:31:36,124 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {2639#true} is VALID [2018-11-14 18:31:36,124 INFO L273 TraceCheckUtils]: 12: Hoare triple {2639#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {2639#true} is VALID [2018-11-14 18:31:36,125 INFO L273 TraceCheckUtils]: 13: Hoare triple {2639#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {2639#true} is VALID [2018-11-14 18:31:36,125 INFO L273 TraceCheckUtils]: 14: Hoare triple {2639#true} assume ~bvsge32(~main__scheme~0, 0bv32); {2639#true} is VALID [2018-11-14 18:31:36,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {2639#true} assume !(~main__scheme~0 == 0bv32); {2639#true} is VALID [2018-11-14 18:31:36,125 INFO L273 TraceCheckUtils]: 16: Hoare triple {2639#true} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2639#true} is VALID [2018-11-14 18:31:36,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {2639#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2639#true} is VALID [2018-11-14 18:31:36,126 INFO L273 TraceCheckUtils]: 18: Hoare triple {2639#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {2639#true} is VALID [2018-11-14 18:31:36,140 INFO L273 TraceCheckUtils]: 19: Hoare triple {2639#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2701#(or (and (not (bvslt main_~main__cp~0 main_~main__urilen~0)) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32))) (and (bvslt main_~main__cp~0 main_~main__urilen~0) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:31:36,141 INFO L273 TraceCheckUtils]: 20: Hoare triple {2701#(or (and (not (bvslt main_~main__cp~0 main_~main__urilen~0)) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32))) (and (bvslt main_~main__cp~0 main_~main__urilen~0) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2705#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:31:36,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {2705#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {2705#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:31:36,142 INFO L273 TraceCheckUtils]: 22: Hoare triple {2705#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume !(~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32)); {2705#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:31:36,143 INFO L273 TraceCheckUtils]: 23: Hoare triple {2705#(bvslt main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2715#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:36,144 INFO L273 TraceCheckUtils]: 24: Hoare triple {2715#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {2640#false} is VALID [2018-11-14 18:31:36,144 INFO L273 TraceCheckUtils]: 25: Hoare triple {2640#false} assume !false; {2640#false} is VALID [2018-11-14 18:31:36,146 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-14 18:31:36,146 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:36,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:36,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:31:36,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 18:31:36,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:36,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:31:36,177 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-14 18:31:36,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:31:36,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:31:36,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:31:36,178 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-14 18:31:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:36,928 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-14 18:31:36,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:31:36,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 18:31:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:31:36,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2018-11-14 18:31:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:31:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2018-11-14 18:31:36,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 130 transitions. [2018-11-14 18:31:37,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:37,121 INFO L225 Difference]: With dead ends: 124 [2018-11-14 18:31:37,121 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 18:31:37,122 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:31:37,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 18:31:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2018-11-14 18:31:37,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:37,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 79 states. [2018-11-14 18:31:37,168 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 79 states. [2018-11-14 18:31:37,169 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 79 states. [2018-11-14 18:31:37,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:37,173 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-11-14 18:31:37,173 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-11-14 18:31:37,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:37,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:37,174 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 122 states. [2018-11-14 18:31:37,174 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 122 states. [2018-11-14 18:31:37,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:37,178 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-11-14 18:31:37,178 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-11-14 18:31:37,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:37,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:37,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:37,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:37,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-14 18:31:37,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-14 18:31:37,181 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2018-11-14 18:31:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:37,181 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-14 18:31:37,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:31:37,182 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-14 18:31:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:31:37,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:37,182 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:37,183 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:37,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:37,184 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2018-11-14 18:31:37,184 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:37,184 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-14 18:31:37,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:37,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:37,482 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-14 18:31:37,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {3194#true} call ULTIMATE.init(); {3194#true} is VALID [2018-11-14 18:31:37,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {3194#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {3194#true} is VALID [2018-11-14 18:31:37,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {3194#true} assume true; {3194#true} is VALID [2018-11-14 18:31:37,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3194#true} {3194#true} #215#return; {3194#true} is VALID [2018-11-14 18:31:37,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {3194#true} call #t~ret8 := main(); {3194#true} is VALID [2018-11-14 18:31:37,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {3194#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {3194#true} is VALID [2018-11-14 18:31:37,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {3194#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {3194#true} is VALID [2018-11-14 18:31:37,516 INFO L273 TraceCheckUtils]: 7: Hoare triple {3194#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {3194#true} is VALID [2018-11-14 18:31:37,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {3194#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {3194#true} is VALID [2018-11-14 18:31:37,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {3194#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {3194#true} is VALID [2018-11-14 18:31:37,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {3194#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {3194#true} is VALID [2018-11-14 18:31:37,517 INFO L273 TraceCheckUtils]: 11: Hoare triple {3194#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {3194#true} is VALID [2018-11-14 18:31:37,518 INFO L273 TraceCheckUtils]: 12: Hoare triple {3194#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {3194#true} is VALID [2018-11-14 18:31:37,518 INFO L273 TraceCheckUtils]: 13: Hoare triple {3194#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {3194#true} is VALID [2018-11-14 18:31:37,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {3194#true} assume ~bvsge32(~main__scheme~0, 0bv32); {3194#true} is VALID [2018-11-14 18:31:37,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {3194#true} assume !(~main__scheme~0 == 0bv32); {3194#true} is VALID [2018-11-14 18:31:37,519 INFO L273 TraceCheckUtils]: 16: Hoare triple {3194#true} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3194#true} is VALID [2018-11-14 18:31:37,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {3194#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3194#true} is VALID [2018-11-14 18:31:37,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {3194#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {3194#true} is VALID [2018-11-14 18:31:37,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {3194#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3194#true} is VALID [2018-11-14 18:31:37,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {3194#true} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3259#(or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)) (not (bvsle (_ bv0 32) main_~main__cp~0))))} is VALID [2018-11-14 18:31:37,527 INFO L273 TraceCheckUtils]: 21: Hoare triple {3259#(or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)) (not (bvsle (_ bv0 32) main_~main__cp~0))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {3263#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:31:37,527 INFO L273 TraceCheckUtils]: 22: Hoare triple {3263#(bvsle (_ bv0 32) main_~main__cp~0)} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {3263#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:31:37,527 INFO L273 TraceCheckUtils]: 23: Hoare triple {3263#(bvsle (_ bv0 32) main_~main__cp~0)} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {3263#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:31:37,547 INFO L273 TraceCheckUtils]: 24: Hoare triple {3263#(bvsle (_ bv0 32) main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {3273#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:37,561 INFO L273 TraceCheckUtils]: 25: Hoare triple {3273#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~17 == 0bv32; {3195#false} is VALID [2018-11-14 18:31:37,561 INFO L273 TraceCheckUtils]: 26: Hoare triple {3195#false} assume !false; {3195#false} is VALID [2018-11-14 18:31:37,562 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-14 18:31:37,562 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:37,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:37,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:31:37,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 18:31:37,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:37,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:31:37,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:37,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:31:37,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:31:37,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:31:37,604 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-11-14 18:31:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:38,519 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-11-14 18:31:38,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:31:38,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 18:31:38,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:38,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:31:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2018-11-14 18:31:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:31:38,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2018-11-14 18:31:38,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 150 transitions. [2018-11-14 18:31:39,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:39,113 INFO L225 Difference]: With dead ends: 142 [2018-11-14 18:31:39,114 INFO L226 Difference]: Without dead ends: 140 [2018-11-14 18:31:39,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:31:39,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-14 18:31:39,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 80. [2018-11-14 18:31:39,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:39,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 80 states. [2018-11-14 18:31:39,458 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 80 states. [2018-11-14 18:31:39,458 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 80 states. [2018-11-14 18:31:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:39,463 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-14 18:31:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-11-14 18:31:39,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:39,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:39,463 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 140 states. [2018-11-14 18:31:39,464 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 140 states. [2018-11-14 18:31:39,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:39,467 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-14 18:31:39,467 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-11-14 18:31:39,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:39,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:39,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:39,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:39,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:31:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-14 18:31:39,470 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 27 [2018-11-14 18:31:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:39,470 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-14 18:31:39,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:31:39,470 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-14 18:31:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:31:39,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:39,471 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:39,472 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:39,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:39,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2018-11-14 18:31:39,472 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:39,473 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-14 18:31:39,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:39,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:39,606 INFO L256 TraceCheckUtils]: 0: Hoare triple {3809#true} call ULTIMATE.init(); {3809#true} is VALID [2018-11-14 18:31:39,607 INFO L273 TraceCheckUtils]: 1: Hoare triple {3809#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {3809#true} is VALID [2018-11-14 18:31:39,607 INFO L273 TraceCheckUtils]: 2: Hoare triple {3809#true} assume true; {3809#true} is VALID [2018-11-14 18:31:39,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3809#true} {3809#true} #215#return; {3809#true} is VALID [2018-11-14 18:31:39,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {3809#true} call #t~ret8 := main(); {3809#true} is VALID [2018-11-14 18:31:39,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {3809#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {3809#true} is VALID [2018-11-14 18:31:39,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {3809#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {3809#true} is VALID [2018-11-14 18:31:39,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {3809#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {3809#true} is VALID [2018-11-14 18:31:39,608 INFO L273 TraceCheckUtils]: 8: Hoare triple {3809#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {3809#true} is VALID [2018-11-14 18:31:39,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {3809#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {3809#true} is VALID [2018-11-14 18:31:39,609 INFO L273 TraceCheckUtils]: 10: Hoare triple {3809#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {3809#true} is VALID [2018-11-14 18:31:39,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {3809#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {3809#true} is VALID [2018-11-14 18:31:39,609 INFO L273 TraceCheckUtils]: 12: Hoare triple {3809#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {3809#true} is VALID [2018-11-14 18:31:39,609 INFO L273 TraceCheckUtils]: 13: Hoare triple {3809#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {3809#true} is VALID [2018-11-14 18:31:39,610 INFO L273 TraceCheckUtils]: 14: Hoare triple {3809#true} assume ~bvsge32(~main__scheme~0, 0bv32); {3809#true} is VALID [2018-11-14 18:31:39,610 INFO L273 TraceCheckUtils]: 15: Hoare triple {3809#true} assume !(~main__scheme~0 == 0bv32); {3809#true} is VALID [2018-11-14 18:31:39,610 INFO L273 TraceCheckUtils]: 16: Hoare triple {3809#true} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3809#true} is VALID [2018-11-14 18:31:39,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {3809#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3809#true} is VALID [2018-11-14 18:31:39,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {3809#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {3809#true} is VALID [2018-11-14 18:31:39,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {3809#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3809#true} is VALID [2018-11-14 18:31:39,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {3809#true} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3874#(or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)) (not (bvsle (_ bv0 32) main_~main__cp~0))))} is VALID [2018-11-14 18:31:39,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {3874#(or (and (= (bvadd main_~__VERIFIER_assert__cond~3 (_ bv4294967295 32)) (_ bv0 32)) (bvsle (_ bv0 32) main_~main__cp~0)) (and (= main_~__VERIFIER_assert__cond~3 (_ bv0 32)) (not (bvsle (_ bv0 32) main_~main__cp~0))))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {3878#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:31:39,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {3878#(bvsle (_ bv0 32) main_~main__cp~0)} assume !(~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32)); {3878#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:31:39,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {3878#(bvsle (_ bv0 32) main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3878#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:31:39,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {3878#(bvsle (_ bv0 32) main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3888#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:39,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {3888#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~5 == 0bv32; {3810#false} is VALID [2018-11-14 18:31:39,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {3810#false} assume !false; {3810#false} is VALID [2018-11-14 18:31:39,615 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-14 18:31:39,615 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:39,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:39,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:31:39,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 18:31:39,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:39,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:31:39,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:39,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:31:39,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:31:39,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:31:39,647 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2018-11-14 18:31:40,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:40,495 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-11-14 18:31:40,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:31:40,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 18:31:40,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:31:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2018-11-14 18:31:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:31:40,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2018-11-14 18:31:40,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 126 transitions. [2018-11-14 18:31:40,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:40,650 INFO L225 Difference]: With dead ends: 120 [2018-11-14 18:31:40,650 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 18:31:40,651 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:31:40,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 18:31:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 81. [2018-11-14 18:31:40,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:40,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 81 states. [2018-11-14 18:31:40,766 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 81 states. [2018-11-14 18:31:40,766 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 81 states. [2018-11-14 18:31:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:40,770 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-14 18:31:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-14 18:31:40,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:40,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:40,770 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 118 states. [2018-11-14 18:31:40,770 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 118 states. [2018-11-14 18:31:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:40,773 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-14 18:31:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-14 18:31:40,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:40,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:40,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:40,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:40,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-14 18:31:40,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-11-14 18:31:40,777 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 27 [2018-11-14 18:31:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:40,777 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-11-14 18:31:40,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:31:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-14 18:31:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:31:40,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:40,778 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:40,778 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:40,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:40,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2018-11-14 18:31:40,779 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:40,779 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:31:40,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:40,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:40,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {4357#true} call ULTIMATE.init(); {4357#true} is VALID [2018-11-14 18:31:40,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {4357#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {4357#true} is VALID [2018-11-14 18:31:40,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {4357#true} assume true; {4357#true} is VALID [2018-11-14 18:31:40,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4357#true} {4357#true} #215#return; {4357#true} is VALID [2018-11-14 18:31:40,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {4357#true} call #t~ret8 := main(); {4357#true} is VALID [2018-11-14 18:31:40,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {4357#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {4357#true} is VALID [2018-11-14 18:31:40,865 INFO L273 TraceCheckUtils]: 6: Hoare triple {4357#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {4357#true} is VALID [2018-11-14 18:31:40,866 INFO L273 TraceCheckUtils]: 7: Hoare triple {4357#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {4357#true} is VALID [2018-11-14 18:31:40,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {4357#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {4357#true} is VALID [2018-11-14 18:31:40,866 INFO L273 TraceCheckUtils]: 9: Hoare triple {4357#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {4357#true} is VALID [2018-11-14 18:31:40,866 INFO L273 TraceCheckUtils]: 10: Hoare triple {4357#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {4357#true} is VALID [2018-11-14 18:31:40,867 INFO L273 TraceCheckUtils]: 11: Hoare triple {4357#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {4357#true} is VALID [2018-11-14 18:31:40,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {4357#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {4357#true} is VALID [2018-11-14 18:31:40,867 INFO L273 TraceCheckUtils]: 13: Hoare triple {4357#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {4357#true} is VALID [2018-11-14 18:31:40,867 INFO L273 TraceCheckUtils]: 14: Hoare triple {4357#true} assume ~bvsge32(~main__scheme~0, 0bv32); {4357#true} is VALID [2018-11-14 18:31:40,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {4357#true} assume !(~main__scheme~0 == 0bv32); {4357#true} is VALID [2018-11-14 18:31:40,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {4357#true} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4357#true} is VALID [2018-11-14 18:31:40,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {4357#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4357#true} is VALID [2018-11-14 18:31:40,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {4357#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {4357#true} is VALID [2018-11-14 18:31:40,869 INFO L273 TraceCheckUtils]: 19: Hoare triple {4357#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4357#true} is VALID [2018-11-14 18:31:40,869 INFO L273 TraceCheckUtils]: 20: Hoare triple {4357#true} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4357#true} is VALID [2018-11-14 18:31:40,869 INFO L273 TraceCheckUtils]: 21: Hoare triple {4357#true} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {4357#true} is VALID [2018-11-14 18:31:40,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {4357#true} assume !(~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32)); {4428#(= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} is VALID [2018-11-14 18:31:40,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {4428#(= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4428#(= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} is VALID [2018-11-14 18:31:40,877 INFO L273 TraceCheckUtils]: 24: Hoare triple {4428#(= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4428#(= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} is VALID [2018-11-14 18:31:40,880 INFO L273 TraceCheckUtils]: 25: Hoare triple {4428#(= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {4428#(= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} is VALID [2018-11-14 18:31:40,880 INFO L273 TraceCheckUtils]: 26: Hoare triple {4428#(= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4358#false} is VALID [2018-11-14 18:31:40,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {4358#false} assume ~__VERIFIER_assert__cond~6 == 0bv32; {4358#false} is VALID [2018-11-14 18:31:40,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {4358#false} assume !false; {4358#false} is VALID [2018-11-14 18:31:40,882 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-14 18:31:40,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:40,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:40,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:31:40,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:31:40,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:40,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:31:40,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:40,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:31:40,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:31:40,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:31:40,920 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 3 states. [2018-11-14 18:31:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:41,334 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-14 18:31:41,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:31:41,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 18:31:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:41,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:31:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-14 18:31:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:31:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-14 18:31:41,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2018-11-14 18:31:41,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:41,482 INFO L225 Difference]: With dead ends: 128 [2018-11-14 18:31:41,482 INFO L226 Difference]: Without dead ends: 88 [2018-11-14 18:31:41,483 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:31:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-14 18:31:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-11-14 18:31:41,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:41,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 84 states. [2018-11-14 18:31:41,549 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 84 states. [2018-11-14 18:31:41,549 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 84 states. [2018-11-14 18:31:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:41,552 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-14 18:31:41,552 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-14 18:31:41,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:41,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:41,553 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 88 states. [2018-11-14 18:31:41,553 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 88 states. [2018-11-14 18:31:41,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:41,556 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-14 18:31:41,556 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-14 18:31:41,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:41,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:41,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:41,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-14 18:31:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-11-14 18:31:41,560 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 29 [2018-11-14 18:31:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:41,560 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-11-14 18:31:41,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:31:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-14 18:31:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:31:41,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:41,561 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:41,562 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:41,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2018-11-14 18:31:41,562 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:41,563 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:31:41,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:41,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:41,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:41,911 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2018-11-14 18:31:42,206 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2018-11-14 18:31:42,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {4859#true} call ULTIMATE.init(); {4859#true} is VALID [2018-11-14 18:31:42,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {4859#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {4859#true} is VALID [2018-11-14 18:31:42,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {4859#true} assume true; {4859#true} is VALID [2018-11-14 18:31:42,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4859#true} {4859#true} #215#return; {4859#true} is VALID [2018-11-14 18:31:42,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {4859#true} call #t~ret8 := main(); {4859#true} is VALID [2018-11-14 18:31:42,362 INFO L273 TraceCheckUtils]: 5: Hoare triple {4859#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {4859#true} is VALID [2018-11-14 18:31:42,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {4859#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {4882#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:42,364 INFO L273 TraceCheckUtils]: 7: Hoare triple {4882#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {4882#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:42,364 INFO L273 TraceCheckUtils]: 8: Hoare triple {4882#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {4882#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:42,365 INFO L273 TraceCheckUtils]: 9: Hoare triple {4882#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {4882#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:42,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {4882#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {4895#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:42,366 INFO L273 TraceCheckUtils]: 11: Hoare triple {4895#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {4895#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:42,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {4895#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume ~bvsgt32(~main__urilen~0, 0bv32); {4902#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {4902#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {4902#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {4902#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsge32(~main__scheme~0, 0bv32); {4909#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {4909#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !(~main__scheme~0 == 0bv32); {4909#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,397 INFO L273 TraceCheckUtils]: 16: Hoare triple {4909#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4916#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {4916#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (= (bvadd main_~__VERIFIER_assert__cond~0 (_ bv4294967295 32)) (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4920#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (or (and (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32)))) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {4920#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (or (and (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (= (bvadd main_~__VERIFIER_assert__cond~1 (_ bv4294967295 32)) (_ bv0 32))) (and (not (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32)))) (= main_~__VERIFIER_assert__cond~1 (_ bv0 32)))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {4924#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {4924#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4928#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {4928#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4924#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {4924#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {4924#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,424 INFO L273 TraceCheckUtils]: 22: Hoare triple {4924#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {4938#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {4938#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {4938#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {4938#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4938#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {4938#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4938#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,427 INFO L273 TraceCheckUtils]: 26: Hoare triple {4938#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {4938#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:42,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {4938#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv4294967295 32))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4954#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:42,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {4954#(= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~6 == 0bv32; {4860#false} is VALID [2018-11-14 18:31:42,465 INFO L273 TraceCheckUtils]: 29: Hoare triple {4860#false} assume !false; {4860#false} is VALID [2018-11-14 18:31:42,468 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-14 18:31:42,468 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:31:42,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:31:42,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-14 18:31:42,473 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-14 18:31:42,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:42,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:31:42,623 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-14 18:31:42,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:31:42,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:31:42,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:31:42,624 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 12 states. [2018-11-14 18:31:44,980 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-14 18:31:46,558 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-14 18:31:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:46,676 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-11-14 18:31:46,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:31:46,676 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-14 18:31:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:31:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2018-11-14 18:31:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:31:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2018-11-14 18:31:46,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 84 transitions. [2018-11-14 18:31:47,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:47,209 INFO L225 Difference]: With dead ends: 89 [2018-11-14 18:31:47,209 INFO L226 Difference]: Without dead ends: 87 [2018-11-14 18:31:47,210 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=220, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:31:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-14 18:31:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2018-11-14 18:31:47,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:47,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 82 states. [2018-11-14 18:31:47,269 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 82 states. [2018-11-14 18:31:47,269 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 82 states. [2018-11-14 18:31:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:47,271 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-11-14 18:31:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-11-14 18:31:47,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:47,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:47,271 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 87 states. [2018-11-14 18:31:47,271 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 87 states. [2018-11-14 18:31:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:47,273 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-11-14 18:31:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-11-14 18:31:47,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:47,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:47,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:47,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:47,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 18:31:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-11-14 18:31:47,276 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 30 [2018-11-14 18:31:47,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:47,276 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-11-14 18:31:47,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:31:47,276 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-11-14 18:31:47,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:31:47,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:47,277 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:47,278 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:47,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:47,278 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2018-11-14 18:31:47,278 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:47,279 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:31:47,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:47,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:48,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {5342#true} call ULTIMATE.init(); {5342#true} is VALID [2018-11-14 18:31:48,329 INFO L273 TraceCheckUtils]: 1: Hoare triple {5342#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {5342#true} is VALID [2018-11-14 18:31:48,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {5342#true} assume true; {5342#true} is VALID [2018-11-14 18:31:48,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5342#true} {5342#true} #215#return; {5342#true} is VALID [2018-11-14 18:31:48,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {5342#true} call #t~ret8 := main(); {5342#true} is VALID [2018-11-14 18:31:48,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {5342#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {5342#true} is VALID [2018-11-14 18:31:48,333 INFO L273 TraceCheckUtils]: 6: Hoare triple {5342#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {5365#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:48,334 INFO L273 TraceCheckUtils]: 7: Hoare triple {5365#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {5365#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:48,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {5365#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {5365#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:48,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {5365#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {5365#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:48,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {5365#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {5378#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:48,339 INFO L273 TraceCheckUtils]: 11: Hoare triple {5378#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {5378#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:48,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {5378#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume ~bvsgt32(~main__urilen~0, 0bv32); {5385#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,349 INFO L273 TraceCheckUtils]: 13: Hoare triple {5385#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {5385#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,362 INFO L273 TraceCheckUtils]: 14: Hoare triple {5385#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsge32(~main__scheme~0, 0bv32); {5392#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {5392#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !(~main__scheme~0 == 0bv32); {5392#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {5392#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5399#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,392 INFO L273 TraceCheckUtils]: 17: Hoare triple {5399#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5399#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {5399#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {5399#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {5399#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5409#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {5409#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5399#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {5399#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {5399#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,414 INFO L273 TraceCheckUtils]: 22: Hoare triple {5399#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {5419#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,415 INFO L273 TraceCheckUtils]: 23: Hoare triple {5419#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5419#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {5419#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5419#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {5419#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {5429#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~main__cp~0 main_~main__urilen~0)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} is VALID [2018-11-14 18:31:48,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {5429#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~main__cp~0 main_~main__urilen~0)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {5429#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~main__cp~0 main_~main__urilen~0)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} is VALID [2018-11-14 18:31:48,474 INFO L273 TraceCheckUtils]: 27: Hoare triple {5429#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~main__cp~0 main_~main__urilen~0)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5436#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:48,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {5436#(= (bvadd main_~__VERIFIER_assert__cond~16 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~16 == 0bv32; {5343#false} is VALID [2018-11-14 18:31:48,474 INFO L273 TraceCheckUtils]: 29: Hoare triple {5343#false} assume !false; {5343#false} is VALID [2018-11-14 18:31:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:31:48,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:31:48,889 INFO L273 TraceCheckUtils]: 29: Hoare triple {5343#false} assume !false; {5343#false} is VALID [2018-11-14 18:31:48,889 INFO L273 TraceCheckUtils]: 28: Hoare triple {5446#(not (= main_~__VERIFIER_assert__cond~16 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~16 == 0bv32; {5343#false} is VALID [2018-11-14 18:31:48,890 INFO L273 TraceCheckUtils]: 27: Hoare triple {5450#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5446#(not (= main_~__VERIFIER_assert__cond~16 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,890 INFO L273 TraceCheckUtils]: 26: Hoare triple {5450#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {5450#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:31:48,891 INFO L273 TraceCheckUtils]: 25: Hoare triple {5457#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {5450#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:31:48,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {5457#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {5457#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} is VALID [2018-11-14 18:31:48,891 INFO L273 TraceCheckUtils]: 23: Hoare triple {5457#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {5457#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} is VALID [2018-11-14 18:31:48,910 INFO L273 TraceCheckUtils]: 22: Hoare triple {5467#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {5457#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} is VALID [2018-11-14 18:31:48,910 INFO L273 TraceCheckUtils]: 21: Hoare triple {5467#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {5467#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:31:48,911 INFO L273 TraceCheckUtils]: 20: Hoare triple {5474#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5467#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:31:48,943 INFO L273 TraceCheckUtils]: 19: Hoare triple {5342#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5474#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} is VALID [2018-11-14 18:31:48,943 INFO L273 TraceCheckUtils]: 18: Hoare triple {5342#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {5342#true} is VALID [2018-11-14 18:31:48,943 INFO L273 TraceCheckUtils]: 17: Hoare triple {5342#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5342#true} is VALID [2018-11-14 18:31:48,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {5342#true} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5342#true} is VALID [2018-11-14 18:31:48,943 INFO L273 TraceCheckUtils]: 15: Hoare triple {5342#true} assume !(~main__scheme~0 == 0bv32); {5342#true} is VALID [2018-11-14 18:31:48,944 INFO L273 TraceCheckUtils]: 14: Hoare triple {5342#true} assume ~bvsge32(~main__scheme~0, 0bv32); {5342#true} is VALID [2018-11-14 18:31:48,944 INFO L273 TraceCheckUtils]: 13: Hoare triple {5342#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {5342#true} is VALID [2018-11-14 18:31:48,944 INFO L273 TraceCheckUtils]: 12: Hoare triple {5342#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {5342#true} is VALID [2018-11-14 18:31:48,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {5342#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {5342#true} is VALID [2018-11-14 18:31:48,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {5342#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {5342#true} is VALID [2018-11-14 18:31:48,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {5342#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {5342#true} is VALID [2018-11-14 18:31:48,945 INFO L273 TraceCheckUtils]: 8: Hoare triple {5342#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {5342#true} is VALID [2018-11-14 18:31:48,945 INFO L273 TraceCheckUtils]: 7: Hoare triple {5342#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {5342#true} is VALID [2018-11-14 18:31:48,945 INFO L273 TraceCheckUtils]: 6: Hoare triple {5342#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {5342#true} is VALID [2018-11-14 18:31:48,945 INFO L273 TraceCheckUtils]: 5: Hoare triple {5342#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {5342#true} is VALID [2018-11-14 18:31:48,945 INFO L256 TraceCheckUtils]: 4: Hoare triple {5342#true} call #t~ret8 := main(); {5342#true} is VALID [2018-11-14 18:31:48,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5342#true} {5342#true} #215#return; {5342#true} is VALID [2018-11-14 18:31:48,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {5342#true} assume true; {5342#true} is VALID [2018-11-14 18:31:48,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {5342#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {5342#true} is VALID [2018-11-14 18:31:48,946 INFO L256 TraceCheckUtils]: 0: Hoare triple {5342#true} call ULTIMATE.init(); {5342#true} is VALID [2018-11-14 18:31:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:31:48,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:31:48,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-11-14 18:31:48,949 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-14 18:31:48,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:48,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:31:49,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:49,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:31:49,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:31:49,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:31:49,178 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 16 states. [2018-11-14 18:31:50,627 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-11-14 18:31:50,833 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-14 18:31:52,212 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-11-14 18:31:54,795 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-14 18:31:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:56,381 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 18:31:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:31:56,382 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-14 18:31:56,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:31:56,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:31:56,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2018-11-14 18:31:56,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:31:56,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2018-11-14 18:31:56,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 127 transitions. [2018-11-14 18:31:57,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:57,452 INFO L225 Difference]: With dead ends: 123 [2018-11-14 18:31:57,452 INFO L226 Difference]: Without dead ends: 121 [2018-11-14 18:31:57,453 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:31:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-14 18:31:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 80. [2018-11-14 18:31:57,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:31:57,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 80 states. [2018-11-14 18:31:57,510 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 80 states. [2018-11-14 18:31:57,510 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 80 states. [2018-11-14 18:31:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:57,514 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 18:31:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 18:31:57,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:57,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:57,514 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 121 states. [2018-11-14 18:31:57,515 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 121 states. [2018-11-14 18:31:57,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:31:57,517 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 18:31:57,517 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 18:31:57,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:31:57,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:31:57,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:31:57,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:31:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:31:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-14 18:31:57,520 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 30 [2018-11-14 18:31:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:31:57,520 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-14 18:31:57,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:31:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-14 18:31:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:31:57,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:31:57,521 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:31:57,522 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:31:57,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:31:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash -192985298, now seen corresponding path program 1 times [2018-11-14 18:31:57,523 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:31:57,523 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:31:57,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:31:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:31:57,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:31:58,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {6024#true} call ULTIMATE.init(); {6024#true} is VALID [2018-11-14 18:31:58,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {6024#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {6024#true} is VALID [2018-11-14 18:31:58,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {6024#true} assume true; {6024#true} is VALID [2018-11-14 18:31:58,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6024#true} {6024#true} #215#return; {6024#true} is VALID [2018-11-14 18:31:58,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {6024#true} call #t~ret8 := main(); {6024#true} is VALID [2018-11-14 18:31:58,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {6024#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {6024#true} is VALID [2018-11-14 18:31:58,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {6024#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {6047#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:58,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {6047#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {6047#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:58,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {6047#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {6047#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:58,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {6047#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {6047#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:31:58,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {6047#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {6060#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:58,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {6060#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {6060#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:31:58,430 INFO L273 TraceCheckUtils]: 12: Hoare triple {6060#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume ~bvsgt32(~main__urilen~0, 0bv32); {6067#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {6067#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {6067#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,432 INFO L273 TraceCheckUtils]: 14: Hoare triple {6067#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsge32(~main__scheme~0, 0bv32); {6074#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {6074#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !(~main__scheme~0 == 0bv32); {6074#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {6074#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,443 INFO L273 TraceCheckUtils]: 17: Hoare triple {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,445 INFO L273 TraceCheckUtils]: 18: Hoare triple {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,451 INFO L273 TraceCheckUtils]: 19: Hoare triple {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6091#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,451 INFO L273 TraceCheckUtils]: 20: Hoare triple {6091#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,453 INFO L273 TraceCheckUtils]: 21: Hoare triple {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,455 INFO L273 TraceCheckUtils]: 23: Hoare triple {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:31:58,491 INFO L273 TraceCheckUtils]: 25: Hoare triple {6081#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {6110#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} is VALID [2018-11-14 18:31:58,492 INFO L273 TraceCheckUtils]: 26: Hoare triple {6110#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} assume !(~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32)); {6114#(and (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:31:58,500 INFO L273 TraceCheckUtils]: 27: Hoare triple {6114#(and (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6118#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:31:58,501 INFO L273 TraceCheckUtils]: 28: Hoare triple {6118#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {6025#false} is VALID [2018-11-14 18:31:58,501 INFO L273 TraceCheckUtils]: 29: Hoare triple {6025#false} assume !false; {6025#false} is VALID [2018-11-14 18:31:58,504 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-14 18:31:58,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:31:59,071 INFO L273 TraceCheckUtils]: 29: Hoare triple {6025#false} assume !false; {6025#false} is VALID [2018-11-14 18:31:59,072 INFO L273 TraceCheckUtils]: 28: Hoare triple {6128#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {6025#false} is VALID [2018-11-14 18:31:59,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {6132#(bvslt main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6128#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} is VALID [2018-11-14 18:31:59,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {6136#(or (bvslt main_~main__cp~0 main_~main__urilen~0) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)))} assume !(~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32)); {6132#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:31:59,098 INFO L273 TraceCheckUtils]: 25: Hoare triple {6140#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {6136#(or (bvslt main_~main__cp~0 main_~main__urilen~0) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)))} is VALID [2018-11-14 18:31:59,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {6140#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {6140#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:31:59,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {6140#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {6140#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:31:59,099 INFO L273 TraceCheckUtils]: 22: Hoare triple {6140#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {6140#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:31:59,100 INFO L273 TraceCheckUtils]: 21: Hoare triple {6140#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {6140#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:31:59,100 INFO L273 TraceCheckUtils]: 20: Hoare triple {6156#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6140#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:31:59,115 INFO L273 TraceCheckUtils]: 19: Hoare triple {6024#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6156#(or (not (= (bvadd main_~main__cp~0 (_ bv2 32)) main_~main__urilen~0)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} is VALID [2018-11-14 18:31:59,115 INFO L273 TraceCheckUtils]: 18: Hoare triple {6024#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {6024#true} is VALID [2018-11-14 18:31:59,115 INFO L273 TraceCheckUtils]: 17: Hoare triple {6024#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6024#true} is VALID [2018-11-14 18:31:59,116 INFO L273 TraceCheckUtils]: 16: Hoare triple {6024#true} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6024#true} is VALID [2018-11-14 18:31:59,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {6024#true} assume !(~main__scheme~0 == 0bv32); {6024#true} is VALID [2018-11-14 18:31:59,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {6024#true} assume ~bvsge32(~main__scheme~0, 0bv32); {6024#true} is VALID [2018-11-14 18:31:59,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {6024#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {6024#true} is VALID [2018-11-14 18:31:59,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {6024#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {6024#true} is VALID [2018-11-14 18:31:59,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {6024#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {6024#true} is VALID [2018-11-14 18:31:59,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {6024#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {6024#true} is VALID [2018-11-14 18:31:59,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {6024#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {6024#true} is VALID [2018-11-14 18:31:59,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {6024#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {6024#true} is VALID [2018-11-14 18:31:59,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {6024#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {6024#true} is VALID [2018-11-14 18:31:59,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {6024#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {6024#true} is VALID [2018-11-14 18:31:59,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {6024#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {6024#true} is VALID [2018-11-14 18:31:59,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {6024#true} call #t~ret8 := main(); {6024#true} is VALID [2018-11-14 18:31:59,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6024#true} {6024#true} #215#return; {6024#true} is VALID [2018-11-14 18:31:59,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {6024#true} assume true; {6024#true} is VALID [2018-11-14 18:31:59,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {6024#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {6024#true} is VALID [2018-11-14 18:31:59,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {6024#true} call ULTIMATE.init(); {6024#true} is VALID [2018-11-14 18:31:59,120 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-14 18:31:59,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:31:59,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-11-14 18:31:59,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-14 18:31:59,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:31:59,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:31:59,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:31:59,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:31:59,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:31:59,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:31:59,266 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 16 states. [2018-11-14 18:32:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:06,131 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-11-14 18:32:06,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 18:32:06,131 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-14 18:32:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:32:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 196 transitions. [2018-11-14 18:32:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:32:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 196 transitions. [2018-11-14 18:32:06,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 196 transitions. [2018-11-14 18:32:07,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:07,154 INFO L225 Difference]: With dead ends: 188 [2018-11-14 18:32:07,155 INFO L226 Difference]: Without dead ends: 186 [2018-11-14 18:32:07,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=311, Invalid=681, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:32:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-14 18:32:07,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 80. [2018-11-14 18:32:07,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:07,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 80 states. [2018-11-14 18:32:07,393 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 80 states. [2018-11-14 18:32:07,393 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 80 states. [2018-11-14 18:32:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:07,398 INFO L93 Difference]: Finished difference Result 186 states and 193 transitions. [2018-11-14 18:32:07,398 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 193 transitions. [2018-11-14 18:32:07,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:07,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:07,399 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 186 states. [2018-11-14 18:32:07,399 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 186 states. [2018-11-14 18:32:07,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:07,403 INFO L93 Difference]: Finished difference Result 186 states and 193 transitions. [2018-11-14 18:32:07,403 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 193 transitions. [2018-11-14 18:32:07,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:07,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:07,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:07,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:32:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-14 18:32:07,406 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 30 [2018-11-14 18:32:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:07,406 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-14 18:32:07,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:32:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-14 18:32:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:32:07,407 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:07,407 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:07,408 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:07,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:07,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2018-11-14 18:32:07,409 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:07,409 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:32:07,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:07,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:08,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {6924#true} call ULTIMATE.init(); {6924#true} is VALID [2018-11-14 18:32:08,308 INFO L273 TraceCheckUtils]: 1: Hoare triple {6924#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {6924#true} is VALID [2018-11-14 18:32:08,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {6924#true} assume true; {6924#true} is VALID [2018-11-14 18:32:08,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6924#true} {6924#true} #215#return; {6924#true} is VALID [2018-11-14 18:32:08,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {6924#true} call #t~ret8 := main(); {6924#true} is VALID [2018-11-14 18:32:08,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {6924#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {6924#true} is VALID [2018-11-14 18:32:08,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {6924#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {6924#true} is VALID [2018-11-14 18:32:08,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {6924#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {6924#true} is VALID [2018-11-14 18:32:08,310 INFO L273 TraceCheckUtils]: 8: Hoare triple {6924#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {6924#true} is VALID [2018-11-14 18:32:08,310 INFO L273 TraceCheckUtils]: 9: Hoare triple {6924#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {6924#true} is VALID [2018-11-14 18:32:08,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {6924#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {6959#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:08,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {6959#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {6959#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:08,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {6959#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__urilen~0, 0bv32); {6959#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:08,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {6959#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {6959#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:08,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {6959#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsge32(~main__scheme~0, 0bv32); {6972#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {6972#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !(~main__scheme~0 == 0bv32); {6972#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {6972#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,337 INFO L273 TraceCheckUtils]: 21: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,338 INFO L273 TraceCheckUtils]: 22: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,338 INFO L273 TraceCheckUtils]: 23: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,339 INFO L273 TraceCheckUtils]: 24: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,341 INFO L273 TraceCheckUtils]: 26: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:08,343 INFO L273 TraceCheckUtils]: 28: Hoare triple {6979#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~bvadd32(1bv32, ~main__cp~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7016#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:08,344 INFO L273 TraceCheckUtils]: 29: Hoare triple {7016#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~7 == 0bv32; {6925#false} is VALID [2018-11-14 18:32:08,344 INFO L273 TraceCheckUtils]: 30: Hoare triple {6925#false} assume !false; {6925#false} is VALID [2018-11-14 18:32:08,346 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-14 18:32:08,346 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:32:08,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:32:08,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 18:32:08,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-14 18:32:08,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:08,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:32:08,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:08,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:32:08,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:32:08,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:32:08,388 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 6 states. [2018-11-14 18:32:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:09,222 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-11-14 18:32:09,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:32:09,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-14 18:32:09,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:09,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:32:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2018-11-14 18:32:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:32:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2018-11-14 18:32:09,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 117 transitions. [2018-11-14 18:32:09,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:09,739 INFO L225 Difference]: With dead ends: 115 [2018-11-14 18:32:09,740 INFO L226 Difference]: Without dead ends: 113 [2018-11-14 18:32:09,740 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:32:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-14 18:32:09,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2018-11-14 18:32:09,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:09,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 83 states. [2018-11-14 18:32:09,803 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 83 states. [2018-11-14 18:32:09,804 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 83 states. [2018-11-14 18:32:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:09,807 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-11-14 18:32:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-11-14 18:32:09,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:09,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:09,808 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 113 states. [2018-11-14 18:32:09,808 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 113 states. [2018-11-14 18:32:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:09,810 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-11-14 18:32:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-11-14 18:32:09,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:09,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:09,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:09,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 18:32:09,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-14 18:32:09,813 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 31 [2018-11-14 18:32:09,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:09,813 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-14 18:32:09,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:32:09,813 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-14 18:32:09,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:32:09,814 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:09,814 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:09,815 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:09,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:09,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2018-11-14 18:32:09,815 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:09,815 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 15 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 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:32:09,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:09,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:10,854 INFO L256 TraceCheckUtils]: 0: Hoare triple {7474#true} call ULTIMATE.init(); {7474#true} is VALID [2018-11-14 18:32:10,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {7474#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {7474#true} is VALID [2018-11-14 18:32:10,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {7474#true} assume true; {7474#true} is VALID [2018-11-14 18:32:10,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7474#true} {7474#true} #215#return; {7474#true} is VALID [2018-11-14 18:32:10,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {7474#true} call #t~ret8 := main(); {7474#true} is VALID [2018-11-14 18:32:10,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {7474#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {7474#true} is VALID [2018-11-14 18:32:10,855 INFO L273 TraceCheckUtils]: 6: Hoare triple {7474#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {7497#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:10,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {7497#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {7497#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:10,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {7497#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {7497#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:10,856 INFO L273 TraceCheckUtils]: 9: Hoare triple {7497#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {7497#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:10,856 INFO L273 TraceCheckUtils]: 10: Hoare triple {7497#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {7510#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:10,857 INFO L273 TraceCheckUtils]: 11: Hoare triple {7510#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {7510#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:10,857 INFO L273 TraceCheckUtils]: 12: Hoare triple {7510#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume ~bvsgt32(~main__urilen~0, 0bv32); {7517#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,858 INFO L273 TraceCheckUtils]: 13: Hoare triple {7517#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {7517#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {7517#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsge32(~main__scheme~0, 0bv32); {7524#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {7524#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !(~main__scheme~0 == 0bv32); {7524#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {7524#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7531#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,864 INFO L273 TraceCheckUtils]: 17: Hoare triple {7531#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7531#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {7531#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {7531#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,873 INFO L273 TraceCheckUtils]: 19: Hoare triple {7531#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7541#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,873 INFO L273 TraceCheckUtils]: 20: Hoare triple {7541#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7531#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,874 INFO L273 TraceCheckUtils]: 21: Hoare triple {7531#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {7531#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,884 INFO L273 TraceCheckUtils]: 22: Hoare triple {7531#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {7551#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,884 INFO L273 TraceCheckUtils]: 23: Hoare triple {7551#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {7551#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,885 INFO L273 TraceCheckUtils]: 24: Hoare triple {7551#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {7551#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:10,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {7551#(and (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) main_~main__cp~0)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (not (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {7561#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~main__cp~0 main_~main__urilen~0)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} is VALID [2018-11-14 18:32:10,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {7561#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~main__cp~0 main_~main__urilen~0)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {7561#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~main__cp~0 main_~main__urilen~0)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} is VALID [2018-11-14 18:32:10,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {7561#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~main__cp~0 main_~main__urilen~0)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {7561#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~main__cp~0 main_~main__urilen~0)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} is VALID [2018-11-14 18:32:10,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {7561#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~main__cp~0 main_~main__urilen~0)) (not (bvslt (bvadd main_~main__urilen~0 (_ bv4294967295 32)) (bvadd main_~main__cp~0 (_ bv4294967295 32)))))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7571#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:10,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {7571#(= (bvadd main_~__VERIFIER_assert__cond~4 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {7475#false} is VALID [2018-11-14 18:32:10,982 INFO L273 TraceCheckUtils]: 30: Hoare triple {7475#false} assume !false; {7475#false} is VALID [2018-11-14 18:32:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:10,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:32:11,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {7475#false} assume !false; {7475#false} is VALID [2018-11-14 18:32:11,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {7581#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~4 == 0bv32; {7475#false} is VALID [2018-11-14 18:32:11,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {7585#(bvslt main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7581#(not (= main_~__VERIFIER_assert__cond~4 (_ bv0 32)))} is VALID [2018-11-14 18:32:11,553 INFO L273 TraceCheckUtils]: 27: Hoare triple {7585#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {7585#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:32:11,557 INFO L273 TraceCheckUtils]: 26: Hoare triple {7585#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {7585#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:32:11,557 INFO L273 TraceCheckUtils]: 25: Hoare triple {7595#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {7585#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:32:11,558 INFO L273 TraceCheckUtils]: 24: Hoare triple {7595#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {7595#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} is VALID [2018-11-14 18:32:11,558 INFO L273 TraceCheckUtils]: 23: Hoare triple {7595#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {7595#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} is VALID [2018-11-14 18:32:11,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {7605#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {7595#(bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)} is VALID [2018-11-14 18:32:11,579 INFO L273 TraceCheckUtils]: 21: Hoare triple {7605#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {7605#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:32:11,579 INFO L273 TraceCheckUtils]: 20: Hoare triple {7612#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7605#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:32:11,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {7474#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7612#(or (= (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32)))} is VALID [2018-11-14 18:32:11,620 INFO L273 TraceCheckUtils]: 18: Hoare triple {7474#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {7474#true} is VALID [2018-11-14 18:32:11,620 INFO L273 TraceCheckUtils]: 17: Hoare triple {7474#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7474#true} is VALID [2018-11-14 18:32:11,620 INFO L273 TraceCheckUtils]: 16: Hoare triple {7474#true} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7474#true} is VALID [2018-11-14 18:32:11,620 INFO L273 TraceCheckUtils]: 15: Hoare triple {7474#true} assume !(~main__scheme~0 == 0bv32); {7474#true} is VALID [2018-11-14 18:32:11,620 INFO L273 TraceCheckUtils]: 14: Hoare triple {7474#true} assume ~bvsge32(~main__scheme~0, 0bv32); {7474#true} is VALID [2018-11-14 18:32:11,620 INFO L273 TraceCheckUtils]: 13: Hoare triple {7474#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {7474#true} is VALID [2018-11-14 18:32:11,621 INFO L273 TraceCheckUtils]: 12: Hoare triple {7474#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {7474#true} is VALID [2018-11-14 18:32:11,621 INFO L273 TraceCheckUtils]: 11: Hoare triple {7474#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {7474#true} is VALID [2018-11-14 18:32:11,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {7474#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {7474#true} is VALID [2018-11-14 18:32:11,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {7474#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {7474#true} is VALID [2018-11-14 18:32:11,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {7474#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {7474#true} is VALID [2018-11-14 18:32:11,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {7474#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {7474#true} is VALID [2018-11-14 18:32:11,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {7474#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {7474#true} is VALID [2018-11-14 18:32:11,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {7474#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {7474#true} is VALID [2018-11-14 18:32:11,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {7474#true} call #t~ret8 := main(); {7474#true} is VALID [2018-11-14 18:32:11,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7474#true} {7474#true} #215#return; {7474#true} is VALID [2018-11-14 18:32:11,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {7474#true} assume true; {7474#true} is VALID [2018-11-14 18:32:11,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {7474#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {7474#true} is VALID [2018-11-14 18:32:11,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {7474#true} call ULTIMATE.init(); {7474#true} is VALID [2018-11-14 18:32:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:11,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:32:11,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-11-14 18:32:11,625 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-14 18:32:11,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:11,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:32:11,869 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:11,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:32:11,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:32:11,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:32:11,869 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 16 states. [2018-11-14 18:32:13,305 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-14 18:32:13,571 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-11-14 18:32:14,115 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-11-14 18:32:14,359 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-14 18:32:23,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:23,931 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-11-14 18:32:23,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:32:23,931 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-14 18:32:23,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:32:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2018-11-14 18:32:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:32:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2018-11-14 18:32:23,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 90 transitions. [2018-11-14 18:32:24,855 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:24,856 INFO L225 Difference]: With dead ends: 87 [2018-11-14 18:32:24,856 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 18:32:24,857 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:32:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 18:32:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-11-14 18:32:25,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:25,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 81 states. [2018-11-14 18:32:25,068 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 81 states. [2018-11-14 18:32:25,068 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 81 states. [2018-11-14 18:32:25,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:25,072 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-14 18:32:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-14 18:32:25,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:25,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:25,073 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 85 states. [2018-11-14 18:32:25,073 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 85 states. [2018-11-14 18:32:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:25,074 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-14 18:32:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-14 18:32:25,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:25,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:25,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:25,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-14 18:32:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-14 18:32:25,077 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 31 [2018-11-14 18:32:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:25,077 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-14 18:32:25,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:32:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-14 18:32:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:32:25,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:25,078 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:25,079 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:25,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:25,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1803321781, now seen corresponding path program 1 times [2018-11-14 18:32:25,080 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:25,080 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 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 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:32:25,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:25,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:25,625 INFO L256 TraceCheckUtils]: 0: Hoare triple {8052#true} call ULTIMATE.init(); {8052#true} is VALID [2018-11-14 18:32:25,625 INFO L273 TraceCheckUtils]: 1: Hoare triple {8052#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {8052#true} is VALID [2018-11-14 18:32:25,625 INFO L273 TraceCheckUtils]: 2: Hoare triple {8052#true} assume true; {8052#true} is VALID [2018-11-14 18:32:25,625 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8052#true} {8052#true} #215#return; {8052#true} is VALID [2018-11-14 18:32:25,625 INFO L256 TraceCheckUtils]: 4: Hoare triple {8052#true} call #t~ret8 := main(); {8052#true} is VALID [2018-11-14 18:32:25,626 INFO L273 TraceCheckUtils]: 5: Hoare triple {8052#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {8052#true} is VALID [2018-11-14 18:32:25,626 INFO L273 TraceCheckUtils]: 6: Hoare triple {8052#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {8052#true} is VALID [2018-11-14 18:32:25,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {8052#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {8052#true} is VALID [2018-11-14 18:32:25,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {8052#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {8052#true} is VALID [2018-11-14 18:32:25,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {8052#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {8052#true} is VALID [2018-11-14 18:32:25,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {8052#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {8087#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:25,627 INFO L273 TraceCheckUtils]: 11: Hoare triple {8087#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {8087#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:25,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {8087#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__urilen~0, 0bv32); {8087#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:25,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {8087#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {8087#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:25,628 INFO L273 TraceCheckUtils]: 14: Hoare triple {8087#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsge32(~main__scheme~0, 0bv32); {8100#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {8100#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !(~main__scheme~0 == 0bv32); {8100#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {8100#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,632 INFO L273 TraceCheckUtils]: 17: Hoare triple {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,634 INFO L273 TraceCheckUtils]: 20: Hoare triple {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,634 INFO L273 TraceCheckUtils]: 21: Hoare triple {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,635 INFO L273 TraceCheckUtils]: 23: Hoare triple {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:25,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {8107#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {8135#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:25,641 INFO L273 TraceCheckUtils]: 26: Hoare triple {8135#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {8135#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:25,642 INFO L273 TraceCheckUtils]: 27: Hoare triple {8135#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8135#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:25,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {8135#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8145#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:25,644 INFO L273 TraceCheckUtils]: 29: Hoare triple {8145#(= (bvadd main_~__VERIFIER_assert__cond~17 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~17 == 0bv32; {8053#false} is VALID [2018-11-14 18:32:25,644 INFO L273 TraceCheckUtils]: 30: Hoare triple {8053#false} assume !false; {8053#false} is VALID [2018-11-14 18:32:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:25,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:32:25,814 INFO L273 TraceCheckUtils]: 30: Hoare triple {8053#false} assume !false; {8053#false} is VALID [2018-11-14 18:32:25,814 INFO L273 TraceCheckUtils]: 29: Hoare triple {8155#(not (= main_~__VERIFIER_assert__cond~17 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~17 == 0bv32; {8053#false} is VALID [2018-11-14 18:32:25,815 INFO L273 TraceCheckUtils]: 28: Hoare triple {8159#(bvsle (_ bv0 32) main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8155#(not (= main_~__VERIFIER_assert__cond~17 (_ bv0 32)))} is VALID [2018-11-14 18:32:25,816 INFO L273 TraceCheckUtils]: 27: Hoare triple {8159#(bvsle (_ bv0 32) main_~main__cp~0)} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8159#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:25,816 INFO L273 TraceCheckUtils]: 26: Hoare triple {8159#(bvsle (_ bv0 32) main_~main__cp~0)} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {8159#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:25,817 INFO L273 TraceCheckUtils]: 25: Hoare triple {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {8159#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:25,818 INFO L273 TraceCheckUtils]: 24: Hoare triple {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,818 INFO L273 TraceCheckUtils]: 23: Hoare triple {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,820 INFO L273 TraceCheckUtils]: 20: Hoare triple {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,820 INFO L273 TraceCheckUtils]: 19: Hoare triple {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {8197#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8169#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {8197#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32)))} assume !(~main__scheme~0 == 0bv32); {8197#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,826 INFO L273 TraceCheckUtils]: 14: Hoare triple {8204#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} assume ~bvsge32(~main__scheme~0, 0bv32); {8197#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:25,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {8204#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {8204#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} is VALID [2018-11-14 18:32:25,827 INFO L273 TraceCheckUtils]: 12: Hoare triple {8204#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} assume ~bvsgt32(~main__urilen~0, 0bv32); {8204#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} is VALID [2018-11-14 18:32:25,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {8204#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {8204#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} is VALID [2018-11-14 18:32:25,843 INFO L273 TraceCheckUtils]: 10: Hoare triple {8052#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {8204#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} is VALID [2018-11-14 18:32:25,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {8052#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {8052#true} is VALID [2018-11-14 18:32:25,843 INFO L273 TraceCheckUtils]: 8: Hoare triple {8052#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {8052#true} is VALID [2018-11-14 18:32:25,844 INFO L273 TraceCheckUtils]: 7: Hoare triple {8052#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {8052#true} is VALID [2018-11-14 18:32:25,844 INFO L273 TraceCheckUtils]: 6: Hoare triple {8052#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {8052#true} is VALID [2018-11-14 18:32:25,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {8052#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {8052#true} is VALID [2018-11-14 18:32:25,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {8052#true} call #t~ret8 := main(); {8052#true} is VALID [2018-11-14 18:32:25,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8052#true} {8052#true} #215#return; {8052#true} is VALID [2018-11-14 18:32:25,844 INFO L273 TraceCheckUtils]: 2: Hoare triple {8052#true} assume true; {8052#true} is VALID [2018-11-14 18:32:25,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {8052#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {8052#true} is VALID [2018-11-14 18:32:25,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {8052#true} call ULTIMATE.init(); {8052#true} is VALID [2018-11-14 18:32:25,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:25,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:32:25,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 18:32:25,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 18:32:25,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:25,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:32:25,945 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:25,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:32:25,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:32:25,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:32:25,946 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 12 states. [2018-11-14 18:32:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:29,594 INFO L93 Difference]: Finished difference Result 381 states and 404 transitions. [2018-11-14 18:32:29,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 18:32:29,594 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 18:32:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:32:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 389 transitions. [2018-11-14 18:32:29,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:32:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 389 transitions. [2018-11-14 18:32:29,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 389 transitions. [2018-11-14 18:32:30,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 389 edges. 389 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:30,698 INFO L225 Difference]: With dead ends: 381 [2018-11-14 18:32:30,698 INFO L226 Difference]: Without dead ends: 379 [2018-11-14 18:32:30,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:32:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-14 18:32:30,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 93. [2018-11-14 18:32:30,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:30,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand 93 states. [2018-11-14 18:32:30,787 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand 93 states. [2018-11-14 18:32:30,787 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 93 states. [2018-11-14 18:32:30,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:30,797 INFO L93 Difference]: Finished difference Result 379 states and 400 transitions. [2018-11-14 18:32:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 400 transitions. [2018-11-14 18:32:30,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:30,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:30,799 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 379 states. [2018-11-14 18:32:30,799 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 379 states. [2018-11-14 18:32:30,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:30,808 INFO L93 Difference]: Finished difference Result 379 states and 400 transitions. [2018-11-14 18:32:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 400 transitions. [2018-11-14 18:32:30,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:30,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:30,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:30,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-14 18:32:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-14 18:32:30,812 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 31 [2018-11-14 18:32:30,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:30,812 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-14 18:32:30,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:32:30,812 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-14 18:32:30,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:32:30,813 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:30,813 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:30,814 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:30,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:30,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1687573812, now seen corresponding path program 1 times [2018-11-14 18:32:30,814 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:30,814 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:32:30,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:30,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:31,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {9564#true} call ULTIMATE.init(); {9564#true} is VALID [2018-11-14 18:32:31,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {9564#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {9564#true} is VALID [2018-11-14 18:32:31,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {9564#true} assume true; {9564#true} is VALID [2018-11-14 18:32:31,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9564#true} {9564#true} #215#return; {9564#true} is VALID [2018-11-14 18:32:31,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {9564#true} call #t~ret8 := main(); {9564#true} is VALID [2018-11-14 18:32:31,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {9564#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {9564#true} is VALID [2018-11-14 18:32:31,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {9564#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {9564#true} is VALID [2018-11-14 18:32:31,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {9564#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {9564#true} is VALID [2018-11-14 18:32:31,023 INFO L273 TraceCheckUtils]: 8: Hoare triple {9564#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {9564#true} is VALID [2018-11-14 18:32:31,023 INFO L273 TraceCheckUtils]: 9: Hoare triple {9564#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {9564#true} is VALID [2018-11-14 18:32:31,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {9564#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {9599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:31,024 INFO L273 TraceCheckUtils]: 11: Hoare triple {9599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {9599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:31,024 INFO L273 TraceCheckUtils]: 12: Hoare triple {9599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__urilen~0, 0bv32); {9599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:31,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {9599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {9599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:31,025 INFO L273 TraceCheckUtils]: 14: Hoare triple {9599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsge32(~main__scheme~0, 0bv32); {9612#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {9612#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !(~main__scheme~0 == 0bv32); {9612#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,028 INFO L273 TraceCheckUtils]: 16: Hoare triple {9612#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,031 INFO L273 TraceCheckUtils]: 22: Hoare triple {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,032 INFO L273 TraceCheckUtils]: 24: Hoare triple {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:31,037 INFO L273 TraceCheckUtils]: 25: Hoare triple {9619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {9647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:31,038 INFO L273 TraceCheckUtils]: 26: Hoare triple {9647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32)); {9647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:31,039 INFO L273 TraceCheckUtils]: 27: Hoare triple {9647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:31,040 INFO L273 TraceCheckUtils]: 28: Hoare triple {9647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9657#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:31,040 INFO L273 TraceCheckUtils]: 29: Hoare triple {9657#(= (bvadd main_~__VERIFIER_assert__cond~5 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~5 == 0bv32; {9565#false} is VALID [2018-11-14 18:32:31,040 INFO L273 TraceCheckUtils]: 30: Hoare triple {9565#false} assume !false; {9565#false} is VALID [2018-11-14 18:32:31,042 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-14 18:32:31,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:32:31,153 INFO L273 TraceCheckUtils]: 30: Hoare triple {9565#false} assume !false; {9565#false} is VALID [2018-11-14 18:32:31,154 INFO L273 TraceCheckUtils]: 29: Hoare triple {9667#(not (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~5 == 0bv32; {9565#false} is VALID [2018-11-14 18:32:31,155 INFO L273 TraceCheckUtils]: 28: Hoare triple {9671#(bvsle (_ bv0 32) main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {9667#(not (= main_~__VERIFIER_assert__cond~5 (_ bv0 32)))} is VALID [2018-11-14 18:32:31,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {9671#(bvsle (_ bv0 32) main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {9671#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:31,156 INFO L273 TraceCheckUtils]: 26: Hoare triple {9671#(bvsle (_ bv0 32) main_~main__cp~0)} assume !(~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32)); {9671#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:31,157 INFO L273 TraceCheckUtils]: 25: Hoare triple {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {9671#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:31,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,159 INFO L273 TraceCheckUtils]: 20: Hoare triple {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {9709#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {9681#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {9709#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32)))} assume !(~main__scheme~0 == 0bv32); {9709#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {9716#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} assume ~bvsge32(~main__scheme~0, 0bv32); {9709#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:31,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {9716#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {9716#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} is VALID [2018-11-14 18:32:31,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {9716#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} assume ~bvsgt32(~main__urilen~0, 0bv32); {9716#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} is VALID [2018-11-14 18:32:31,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {9716#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {9716#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} is VALID [2018-11-14 18:32:31,185 INFO L273 TraceCheckUtils]: 10: Hoare triple {9564#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {9716#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv1 32))))} is VALID [2018-11-14 18:32:31,185 INFO L273 TraceCheckUtils]: 9: Hoare triple {9564#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {9564#true} is VALID [2018-11-14 18:32:31,185 INFO L273 TraceCheckUtils]: 8: Hoare triple {9564#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {9564#true} is VALID [2018-11-14 18:32:31,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {9564#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {9564#true} is VALID [2018-11-14 18:32:31,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {9564#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {9564#true} is VALID [2018-11-14 18:32:31,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {9564#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {9564#true} is VALID [2018-11-14 18:32:31,186 INFO L256 TraceCheckUtils]: 4: Hoare triple {9564#true} call #t~ret8 := main(); {9564#true} is VALID [2018-11-14 18:32:31,186 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9564#true} {9564#true} #215#return; {9564#true} is VALID [2018-11-14 18:32:31,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {9564#true} assume true; {9564#true} is VALID [2018-11-14 18:32:31,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {9564#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {9564#true} is VALID [2018-11-14 18:32:31,186 INFO L256 TraceCheckUtils]: 0: Hoare triple {9564#true} call ULTIMATE.init(); {9564#true} is VALID [2018-11-14 18:32:31,188 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-14 18:32:31,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:32:31,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 18:32:31,190 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 18:32:31,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:31,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:32:31,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:31,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:32:31,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:32:31,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:32:31,269 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 12 states. [2018-11-14 18:32:34,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:34,649 INFO L93 Difference]: Finished difference Result 292 states and 310 transitions. [2018-11-14 18:32:34,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:32:34,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 18:32:34,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:34,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:32:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 298 transitions. [2018-11-14 18:32:34,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:32:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 298 transitions. [2018-11-14 18:32:34,656 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 298 transitions. [2018-11-14 18:32:35,178 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:35,185 INFO L225 Difference]: With dead ends: 292 [2018-11-14 18:32:35,185 INFO L226 Difference]: Without dead ends: 281 [2018-11-14 18:32:35,186 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:32:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-14 18:32:35,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 96. [2018-11-14 18:32:35,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:35,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand 96 states. [2018-11-14 18:32:35,338 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 96 states. [2018-11-14 18:32:35,338 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 96 states. [2018-11-14 18:32:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:35,346 INFO L93 Difference]: Finished difference Result 281 states and 294 transitions. [2018-11-14 18:32:35,346 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 294 transitions. [2018-11-14 18:32:35,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:35,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:35,347 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 281 states. [2018-11-14 18:32:35,347 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 281 states. [2018-11-14 18:32:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:35,353 INFO L93 Difference]: Finished difference Result 281 states and 294 transitions. [2018-11-14 18:32:35,353 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 294 transitions. [2018-11-14 18:32:35,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:35,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:35,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:35,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-14 18:32:35,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-11-14 18:32:35,356 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 31 [2018-11-14 18:32:35,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:35,356 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-11-14 18:32:35,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:32:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-11-14 18:32:35,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 18:32:35,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:35,357 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:35,358 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:35,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:35,358 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2018-11-14 18:32:35,358 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:35,358 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 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 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:32:35,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:35,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:35,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {10786#true} call ULTIMATE.init(); {10786#true} is VALID [2018-11-14 18:32:35,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {10786#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {10786#true} is VALID [2018-11-14 18:32:35,956 INFO L273 TraceCheckUtils]: 2: Hoare triple {10786#true} assume true; {10786#true} is VALID [2018-11-14 18:32:35,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10786#true} {10786#true} #215#return; {10786#true} is VALID [2018-11-14 18:32:35,956 INFO L256 TraceCheckUtils]: 4: Hoare triple {10786#true} call #t~ret8 := main(); {10786#true} is VALID [2018-11-14 18:32:35,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {10786#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {10786#true} is VALID [2018-11-14 18:32:35,957 INFO L273 TraceCheckUtils]: 6: Hoare triple {10786#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {10809#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:35,958 INFO L273 TraceCheckUtils]: 7: Hoare triple {10809#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {10809#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:35,958 INFO L273 TraceCheckUtils]: 8: Hoare triple {10809#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {10809#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:35,958 INFO L273 TraceCheckUtils]: 9: Hoare triple {10809#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {10809#(bvsle main_~main__urilen~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:35,959 INFO L273 TraceCheckUtils]: 10: Hoare triple {10809#(bvsle main_~main__urilen~0 (_ bv1000000 32))} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {10822#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:35,959 INFO L273 TraceCheckUtils]: 11: Hoare triple {10822#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {10822#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:35,960 INFO L273 TraceCheckUtils]: 12: Hoare triple {10822#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume ~bvsgt32(~main__urilen~0, 0bv32); {10829#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,960 INFO L273 TraceCheckUtils]: 13: Hoare triple {10829#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {10829#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,961 INFO L273 TraceCheckUtils]: 14: Hoare triple {10829#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume ~bvsge32(~main__scheme~0, 0bv32); {10836#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,961 INFO L273 TraceCheckUtils]: 15: Hoare triple {10836#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !(~main__scheme~0 == 0bv32); {10836#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {10836#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {10843#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:35,966 INFO L273 TraceCheckUtils]: 17: Hoare triple {10843#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {10843#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:35,966 INFO L273 TraceCheckUtils]: 18: Hoare triple {10843#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {10843#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:35,968 INFO L273 TraceCheckUtils]: 19: Hoare triple {10843#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {10853#(and (or (and (not (bvslt main_~main__cp~0 main_~main__urilen~0)) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32))) (and (bvslt main_~main__cp~0 main_~main__urilen~0) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)))) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:35,969 INFO L273 TraceCheckUtils]: 20: Hoare triple {10853#(and (or (and (not (bvslt main_~main__cp~0 main_~main__urilen~0)) (= main_~__VERIFIER_assert__cond~2 (_ bv0 32))) (and (bvslt main_~main__cp~0 main_~main__urilen~0) (= (bvadd main_~__VERIFIER_assert__cond~2 (_ bv4294967295 32)) (_ bv0 32)))) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvsgt main_~main__urilen~0 (_ bv0 32)) (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,970 INFO L273 TraceCheckUtils]: 21: Hoare triple {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,971 INFO L273 TraceCheckUtils]: 22: Hoare triple {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,971 INFO L273 TraceCheckUtils]: 23: Hoare triple {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,972 INFO L273 TraceCheckUtils]: 24: Hoare triple {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,973 INFO L273 TraceCheckUtils]: 25: Hoare triple {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,974 INFO L273 TraceCheckUtils]: 26: Hoare triple {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,977 INFO L273 TraceCheckUtils]: 27: Hoare triple {10857#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {10879#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (or (and (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))) (and (= main_~__VERIFIER_assert__cond~6 (_ bv0 32)) (not (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)))) (bvsge main_~main__cp~0 (_ bv0 32)))} is VALID [2018-11-14 18:32:35,980 INFO L273 TraceCheckUtils]: 28: Hoare triple {10879#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (or (and (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0) (= (bvadd main_~__VERIFIER_assert__cond~6 (_ bv4294967295 32)) (_ bv0 32))) (and (= main_~__VERIFIER_assert__cond~6 (_ bv0 32)) (not (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0)))) (bvsge main_~main__cp~0 (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~bvadd32(1bv32, ~main__cp~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {10883#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:32:35,981 INFO L273 TraceCheckUtils]: 29: Hoare triple {10883#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume !(~__VERIFIER_assert__cond~7 == 0bv32); {10883#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} is VALID [2018-11-14 18:32:36,000 INFO L273 TraceCheckUtils]: 30: Hoare triple {10883#(and (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge main_~main__cp~0 (_ bv0 32)) (bvslt (bvadd main_~main__cp~0 (_ bv1 32)) main_~main__urilen~0))} assume !(~bvadd32(1bv32, ~main__cp~0) == ~bvsub32(~main__urilen~0, 1bv32));~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0);~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {10890#(and (bvslt (bvadd main_~main__cp~0 (_ bv4294967295 32)) main_~main__urilen~0) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:36,001 INFO L273 TraceCheckUtils]: 31: Hoare triple {10890#(and (bvslt (bvadd main_~main__cp~0 (_ bv4294967295 32)) main_~main__urilen~0) (bvsle main_~main__urilen~0 (_ bv1000000 32)) (bvslt main_~main__cp~0 main_~main__urilen~0) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~main____CPAchecker_TMP_2~0 == 0bv32);~main__c~0 := 0bv32;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {10894#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:36,002 INFO L273 TraceCheckUtils]: 32: Hoare triple {10894#(= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~8 == 0bv32; {10787#false} is VALID [2018-11-14 18:32:36,002 INFO L273 TraceCheckUtils]: 33: Hoare triple {10787#false} assume !false; {10787#false} is VALID [2018-11-14 18:32:36,004 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-14 18:32:36,004 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:32:36,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:32:36,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-14 18:32:36,006 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-14 18:32:36,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:36,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:32:36,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:36,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:32:36,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:32:36,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:32:36,069 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 13 states. [2018-11-14 18:32:37,358 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2018-11-14 18:32:38,119 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2018-11-14 18:32:38,371 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2018-11-14 18:32:39,575 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-11-14 18:32:41,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:41,040 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-11-14 18:32:41,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:32:41,041 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-14 18:32:41,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:41,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:32:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 110 transitions. [2018-11-14 18:32:41,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:32:41,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 110 transitions. [2018-11-14 18:32:41,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 110 transitions. [2018-11-14 18:32:41,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:41,431 INFO L225 Difference]: With dead ends: 121 [2018-11-14 18:32:41,431 INFO L226 Difference]: Without dead ends: 119 [2018-11-14 18:32:41,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:32:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-14 18:32:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2018-11-14 18:32:41,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:41,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 94 states. [2018-11-14 18:32:41,539 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 94 states. [2018-11-14 18:32:41,539 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 94 states. [2018-11-14 18:32:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:41,542 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-11-14 18:32:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-11-14 18:32:41,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:41,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:41,542 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 119 states. [2018-11-14 18:32:41,543 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 119 states. [2018-11-14 18:32:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:41,545 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-11-14 18:32:41,545 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-11-14 18:32:41,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:41,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:41,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:41,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 18:32:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-11-14 18:32:41,548 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 34 [2018-11-14 18:32:41,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:41,548 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-11-14 18:32:41,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:32:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-11-14 18:32:41,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 18:32:41,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:41,549 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:41,550 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:41,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:41,550 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2018-11-14 18:32:41,550 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:41,551 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 19 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 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:32:41,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:41,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:41,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:41,917 INFO L256 TraceCheckUtils]: 0: Hoare triple {11405#true} call ULTIMATE.init(); {11405#true} is VALID [2018-11-14 18:32:41,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {11405#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {11405#true} is VALID [2018-11-14 18:32:41,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {11405#true} assume true; {11405#true} is VALID [2018-11-14 18:32:41,918 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11405#true} {11405#true} #215#return; {11405#true} is VALID [2018-11-14 18:32:41,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {11405#true} call #t~ret8 := main(); {11405#true} is VALID [2018-11-14 18:32:41,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {11405#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {11405#true} is VALID [2018-11-14 18:32:41,919 INFO L273 TraceCheckUtils]: 6: Hoare triple {11405#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {11405#true} is VALID [2018-11-14 18:32:41,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {11405#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {11405#true} is VALID [2018-11-14 18:32:41,920 INFO L273 TraceCheckUtils]: 8: Hoare triple {11405#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {11405#true} is VALID [2018-11-14 18:32:41,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {11405#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {11405#true} is VALID [2018-11-14 18:32:41,921 INFO L273 TraceCheckUtils]: 10: Hoare triple {11405#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {11440#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:41,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {11440#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {11440#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:41,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {11440#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__urilen~0, 0bv32); {11440#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:41,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {11440#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {11440#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:41,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {11440#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsge32(~main__scheme~0, 0bv32); {11453#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {11453#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !(~main__scheme~0 == 0bv32); {11453#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {11453#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,926 INFO L273 TraceCheckUtils]: 17: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,931 INFO L273 TraceCheckUtils]: 24: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,932 INFO L273 TraceCheckUtils]: 25: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,933 INFO L273 TraceCheckUtils]: 26: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,934 INFO L273 TraceCheckUtils]: 27: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~bvadd32(1bv32, ~main__cp~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,936 INFO L273 TraceCheckUtils]: 29: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~7 == 0bv32); {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:41,943 INFO L273 TraceCheckUtils]: 30: Hoare triple {11460#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~bvadd32(1bv32, ~main__cp~0) == ~bvsub32(~main__urilen~0, 1bv32));~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0);~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {11503#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:41,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {11503#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~main____CPAchecker_TMP_2~0 == 0bv32);~main__c~0 := 0bv32;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {11503#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:41,945 INFO L273 TraceCheckUtils]: 32: Hoare triple {11503#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {11510#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:41,946 INFO L273 TraceCheckUtils]: 33: Hoare triple {11510#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~9 == 0bv32; {11406#false} is VALID [2018-11-14 18:32:41,946 INFO L273 TraceCheckUtils]: 34: Hoare triple {11406#false} assume !false; {11406#false} is VALID [2018-11-14 18:32:41,948 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-14 18:32:41,948 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:32:41,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:32:41,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 18:32:41,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-14 18:32:41,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:41,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:32:42,010 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:42,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:32:42,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:32:42,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:32:42,011 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 7 states. [2018-11-14 18:32:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:43,601 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-11-14 18:32:43,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:32:43,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-14 18:32:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:43,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:32:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2018-11-14 18:32:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:32:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2018-11-14 18:32:43,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 146 transitions. [2018-11-14 18:32:44,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:44,180 INFO L225 Difference]: With dead ends: 153 [2018-11-14 18:32:44,180 INFO L226 Difference]: Without dead ends: 151 [2018-11-14 18:32:44,180 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:32:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-14 18:32:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 98. [2018-11-14 18:32:44,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:44,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 98 states. [2018-11-14 18:32:44,267 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 98 states. [2018-11-14 18:32:44,267 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 98 states. [2018-11-14 18:32:44,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:44,270 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-14 18:32:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-11-14 18:32:44,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:44,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:44,271 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 151 states. [2018-11-14 18:32:44,271 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 151 states. [2018-11-14 18:32:44,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:44,274 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-14 18:32:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-11-14 18:32:44,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:44,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:44,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:44,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 18:32:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-11-14 18:32:44,277 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 35 [2018-11-14 18:32:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:44,277 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-11-14 18:32:44,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:32:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-11-14 18:32:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 18:32:44,277 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:44,278 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:44,278 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:44,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1565027795, now seen corresponding path program 1 times [2018-11-14 18:32:44,279 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:44,279 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 20 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 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:32:44,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:44,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:44,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {12110#true} call ULTIMATE.init(); {12110#true} is VALID [2018-11-14 18:32:44,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {12110#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {12110#true} is VALID [2018-11-14 18:32:44,631 INFO L273 TraceCheckUtils]: 2: Hoare triple {12110#true} assume true; {12110#true} is VALID [2018-11-14 18:32:44,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12110#true} {12110#true} #215#return; {12110#true} is VALID [2018-11-14 18:32:44,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {12110#true} call #t~ret8 := main(); {12110#true} is VALID [2018-11-14 18:32:44,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {12110#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {12110#true} is VALID [2018-11-14 18:32:44,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {12110#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {12110#true} is VALID [2018-11-14 18:32:44,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {12110#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {12110#true} is VALID [2018-11-14 18:32:44,632 INFO L273 TraceCheckUtils]: 8: Hoare triple {12110#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {12110#true} is VALID [2018-11-14 18:32:44,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {12110#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {12110#true} is VALID [2018-11-14 18:32:44,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {12110#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {12145#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:44,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {12145#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {12145#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:44,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {12145#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__urilen~0, 0bv32); {12145#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:44,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {12145#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {12145#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:44,659 INFO L273 TraceCheckUtils]: 14: Hoare triple {12145#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsge32(~main__scheme~0, 0bv32); {12158#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,659 INFO L273 TraceCheckUtils]: 15: Hoare triple {12158#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !(~main__scheme~0 == 0bv32); {12158#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,661 INFO L273 TraceCheckUtils]: 16: Hoare triple {12158#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,662 INFO L273 TraceCheckUtils]: 17: Hoare triple {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,663 INFO L273 TraceCheckUtils]: 18: Hoare triple {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,663 INFO L273 TraceCheckUtils]: 19: Hoare triple {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,668 INFO L273 TraceCheckUtils]: 22: Hoare triple {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,668 INFO L273 TraceCheckUtils]: 23: Hoare triple {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,670 INFO L273 TraceCheckUtils]: 24: Hoare triple {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:44,674 INFO L273 TraceCheckUtils]: 25: Hoare triple {12165#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:44,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:44,676 INFO L273 TraceCheckUtils]: 27: Hoare triple {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:44,679 INFO L273 TraceCheckUtils]: 28: Hoare triple {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:44,679 INFO L273 TraceCheckUtils]: 29: Hoare triple {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:44,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:44,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:44,684 INFO L273 TraceCheckUtils]: 32: Hoare triple {12193#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~bvadd32(1bv32, ~main__cp~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {12215#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:44,684 INFO L273 TraceCheckUtils]: 33: Hoare triple {12215#(= (bvadd main_~__VERIFIER_assert__cond~7 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~7 == 0bv32; {12111#false} is VALID [2018-11-14 18:32:44,685 INFO L273 TraceCheckUtils]: 34: Hoare triple {12111#false} assume !false; {12111#false} is VALID [2018-11-14 18:32:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:44,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:32:44,921 INFO L273 TraceCheckUtils]: 34: Hoare triple {12111#false} assume !false; {12111#false} is VALID [2018-11-14 18:32:44,922 INFO L273 TraceCheckUtils]: 33: Hoare triple {12225#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~7 == 0bv32; {12111#false} is VALID [2018-11-14 18:32:44,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~bvadd32(1bv32, ~main__cp~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {12225#(not (= main_~__VERIFIER_assert__cond~7 (_ bv0 32)))} is VALID [2018-11-14 18:32:44,923 INFO L273 TraceCheckUtils]: 31: Hoare triple {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:44,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:44,924 INFO L273 TraceCheckUtils]: 29: Hoare triple {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:44,925 INFO L273 TraceCheckUtils]: 28: Hoare triple {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:44,925 INFO L273 TraceCheckUtils]: 27: Hoare triple {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:44,926 INFO L273 TraceCheckUtils]: 26: Hoare triple {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:44,929 INFO L273 TraceCheckUtils]: 25: Hoare triple {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {12229#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:44,929 INFO L273 TraceCheckUtils]: 24: Hoare triple {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,930 INFO L273 TraceCheckUtils]: 22: Hoare triple {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,931 INFO L273 TraceCheckUtils]: 21: Hoare triple {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,931 INFO L273 TraceCheckUtils]: 20: Hoare triple {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,932 INFO L273 TraceCheckUtils]: 19: Hoare triple {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,932 INFO L273 TraceCheckUtils]: 18: Hoare triple {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,932 INFO L273 TraceCheckUtils]: 17: Hoare triple {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,935 INFO L273 TraceCheckUtils]: 16: Hoare triple {12279#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {12251#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {12279#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32)))} assume !(~main__scheme~0 == 0bv32); {12279#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {12286#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} assume ~bvsge32(~main__scheme~0, 0bv32); {12279#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:44,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {12286#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {12286#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} is VALID [2018-11-14 18:32:44,937 INFO L273 TraceCheckUtils]: 12: Hoare triple {12286#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} assume ~bvsgt32(~main__urilen~0, 0bv32); {12286#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} is VALID [2018-11-14 18:32:44,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {12286#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {12286#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} is VALID [2018-11-14 18:32:44,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {12110#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {12286#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} is VALID [2018-11-14 18:32:44,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {12110#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {12110#true} is VALID [2018-11-14 18:32:44,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {12110#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {12110#true} is VALID [2018-11-14 18:32:44,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {12110#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {12110#true} is VALID [2018-11-14 18:32:44,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {12110#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {12110#true} is VALID [2018-11-14 18:32:44,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {12110#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {12110#true} is VALID [2018-11-14 18:32:44,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {12110#true} call #t~ret8 := main(); {12110#true} is VALID [2018-11-14 18:32:44,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12110#true} {12110#true} #215#return; {12110#true} is VALID [2018-11-14 18:32:44,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {12110#true} assume true; {12110#true} is VALID [2018-11-14 18:32:44,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {12110#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {12110#true} is VALID [2018-11-14 18:32:44,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {12110#true} call ULTIMATE.init(); {12110#true} is VALID [2018-11-14 18:32:44,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:44,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:32:44,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 18:32:44,944 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-14 18:32:44,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:44,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:32:45,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:45,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:32:45,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:32:45,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:32:45,035 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 12 states. [2018-11-14 18:32:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:47,959 INFO L93 Difference]: Finished difference Result 265 states and 280 transitions. [2018-11-14 18:32:47,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:32:47,959 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-14 18:32:47,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:47,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:32:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 277 transitions. [2018-11-14 18:32:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:32:47,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 277 transitions. [2018-11-14 18:32:47,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 277 transitions. [2018-11-14 18:32:48,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:48,456 INFO L225 Difference]: With dead ends: 265 [2018-11-14 18:32:48,456 INFO L226 Difference]: Without dead ends: 263 [2018-11-14 18:32:48,457 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:32:48,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-14 18:32:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 101. [2018-11-14 18:32:48,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:48,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand 101 states. [2018-11-14 18:32:48,600 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand 101 states. [2018-11-14 18:32:48,600 INFO L87 Difference]: Start difference. First operand 263 states. Second operand 101 states. [2018-11-14 18:32:48,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:48,606 INFO L93 Difference]: Finished difference Result 263 states and 276 transitions. [2018-11-14 18:32:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 276 transitions. [2018-11-14 18:32:48,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:48,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:48,607 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 263 states. [2018-11-14 18:32:48,607 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 263 states. [2018-11-14 18:32:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:48,612 INFO L93 Difference]: Finished difference Result 263 states and 276 transitions. [2018-11-14 18:32:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 276 transitions. [2018-11-14 18:32:48,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:48,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:48,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:48,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 18:32:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2018-11-14 18:32:48,614 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 35 [2018-11-14 18:32:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:48,615 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2018-11-14 18:32:48,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:32:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2018-11-14 18:32:48,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 18:32:48,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:48,615 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:48,616 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:48,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:48,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2018-11-14 18:32:48,616 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:48,616 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 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 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:32:48,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:48,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:48,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {13295#true} call ULTIMATE.init(); {13295#true} is VALID [2018-11-14 18:32:48,750 INFO L273 TraceCheckUtils]: 1: Hoare triple {13295#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {13295#true} is VALID [2018-11-14 18:32:48,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {13295#true} assume true; {13295#true} is VALID [2018-11-14 18:32:48,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13295#true} {13295#true} #215#return; {13295#true} is VALID [2018-11-14 18:32:48,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {13295#true} call #t~ret8 := main(); {13295#true} is VALID [2018-11-14 18:32:48,750 INFO L273 TraceCheckUtils]: 5: Hoare triple {13295#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {13295#true} is VALID [2018-11-14 18:32:48,750 INFO L273 TraceCheckUtils]: 6: Hoare triple {13295#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {13295#true} is VALID [2018-11-14 18:32:48,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {13295#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {13295#true} is VALID [2018-11-14 18:32:48,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {13295#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {13295#true} is VALID [2018-11-14 18:32:48,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {13295#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {13295#true} is VALID [2018-11-14 18:32:48,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {13295#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {13295#true} is VALID [2018-11-14 18:32:48,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {13295#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {13295#true} is VALID [2018-11-14 18:32:48,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {13295#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {13295#true} is VALID [2018-11-14 18:32:48,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {13295#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {13295#true} is VALID [2018-11-14 18:32:48,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {13295#true} assume ~bvsge32(~main__scheme~0, 0bv32); {13295#true} is VALID [2018-11-14 18:32:48,751 INFO L273 TraceCheckUtils]: 15: Hoare triple {13295#true} assume !(~main__scheme~0 == 0bv32); {13295#true} is VALID [2018-11-14 18:32:48,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {13295#true} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13295#true} is VALID [2018-11-14 18:32:48,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {13295#true} is VALID [2018-11-14 18:32:48,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {13295#true} is VALID [2018-11-14 18:32:48,752 INFO L273 TraceCheckUtils]: 19: Hoare triple {13295#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13295#true} is VALID [2018-11-14 18:32:48,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13295#true} is VALID [2018-11-14 18:32:48,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {13295#true} is VALID [2018-11-14 18:32:48,752 INFO L273 TraceCheckUtils]: 22: Hoare triple {13295#true} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {13295#true} is VALID [2018-11-14 18:32:48,752 INFO L273 TraceCheckUtils]: 23: Hoare triple {13295#true} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {13295#true} is VALID [2018-11-14 18:32:48,752 INFO L273 TraceCheckUtils]: 24: Hoare triple {13295#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {13295#true} is VALID [2018-11-14 18:32:48,753 INFO L273 TraceCheckUtils]: 25: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {13295#true} is VALID [2018-11-14 18:32:48,753 INFO L273 TraceCheckUtils]: 26: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {13295#true} is VALID [2018-11-14 18:32:48,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {13295#true} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {13295#true} is VALID [2018-11-14 18:32:48,753 INFO L273 TraceCheckUtils]: 28: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~bvadd32(1bv32, ~main__cp~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {13295#true} is VALID [2018-11-14 18:32:48,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~7 == 0bv32); {13295#true} is VALID [2018-11-14 18:32:48,753 INFO L273 TraceCheckUtils]: 30: Hoare triple {13295#true} assume !(~bvadd32(1bv32, ~main__cp~0) == ~bvsub32(~main__urilen~0, 1bv32));~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0);~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {13295#true} is VALID [2018-11-14 18:32:48,754 INFO L273 TraceCheckUtils]: 31: Hoare triple {13295#true} assume !(~main____CPAchecker_TMP_2~0 == 0bv32);~main__c~0 := 0bv32;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {13393#(or (and (= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~main__cp~0 main_~main__urilen~0)) (and (not (bvslt main_~main__cp~0 main_~main__urilen~0)) (= main_~__VERIFIER_assert__cond~8 (_ bv0 32))))} is VALID [2018-11-14 18:32:48,755 INFO L273 TraceCheckUtils]: 32: Hoare triple {13393#(or (and (= (bvadd main_~__VERIFIER_assert__cond~8 (_ bv4294967295 32)) (_ bv0 32)) (bvslt main_~main__cp~0 main_~main__urilen~0)) (and (not (bvslt main_~main__cp~0 main_~main__urilen~0)) (= main_~__VERIFIER_assert__cond~8 (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {13397#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:32:48,755 INFO L273 TraceCheckUtils]: 33: Hoare triple {13397#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume !(~__VERIFIER_assert__cond~9 == 0bv32); {13397#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:32:48,756 INFO L273 TraceCheckUtils]: 34: Hoare triple {13397#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32); {13397#(bvslt main_~main__cp~0 main_~main__urilen~0)} is VALID [2018-11-14 18:32:48,756 INFO L273 TraceCheckUtils]: 35: Hoare triple {13397#(bvslt main_~main__cp~0 main_~main__urilen~0)} assume ~bvslt32(~main__c~0, ~bvsub32(~main__tokenlen~0, 1bv32));havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {13407#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:48,757 INFO L273 TraceCheckUtils]: 36: Hoare triple {13407#(= (bvadd main_~__VERIFIER_assert__cond~10 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~10 == 0bv32; {13296#false} is VALID [2018-11-14 18:32:48,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {13296#false} assume !false; {13296#false} is VALID [2018-11-14 18:32:48,758 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-14 18:32:48,759 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:32:48,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:32:48,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:32:48,761 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-14 18:32:48,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:48,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:32:48,800 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:48,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:32:48,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:32:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:32:48,801 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 5 states. [2018-11-14 18:32:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:49,546 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-14 18:32:49,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:32:49,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-14 18:32:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:32:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2018-11-14 18:32:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:32:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2018-11-14 18:32:49,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 94 transitions. [2018-11-14 18:32:49,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:49,736 INFO L225 Difference]: With dead ends: 125 [2018-11-14 18:32:49,736 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 18:32:49,736 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:32:49,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 18:32:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2018-11-14 18:32:49,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:49,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 104 states. [2018-11-14 18:32:49,903 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 104 states. [2018-11-14 18:32:49,903 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 104 states. [2018-11-14 18:32:49,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:49,905 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-11-14 18:32:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-11-14 18:32:49,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:49,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:49,905 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 123 states. [2018-11-14 18:32:49,906 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 123 states. [2018-11-14 18:32:49,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:49,907 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-11-14 18:32:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-11-14 18:32:49,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:49,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:49,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:49,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:49,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 18:32:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-11-14 18:32:49,909 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 38 [2018-11-14 18:32:49,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:49,910 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-11-14 18:32:49,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:32:49,910 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-11-14 18:32:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 18:32:49,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:49,911 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:49,911 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:49,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:49,911 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2018-11-14 18:32:49,912 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:49,912 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 22 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 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:32:49,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:49,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:50,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {13926#true} call ULTIMATE.init(); {13926#true} is VALID [2018-11-14 18:32:50,046 INFO L273 TraceCheckUtils]: 1: Hoare triple {13926#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {13926#true} is VALID [2018-11-14 18:32:50,046 INFO L273 TraceCheckUtils]: 2: Hoare triple {13926#true} assume true; {13926#true} is VALID [2018-11-14 18:32:50,046 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13926#true} {13926#true} #215#return; {13926#true} is VALID [2018-11-14 18:32:50,047 INFO L256 TraceCheckUtils]: 4: Hoare triple {13926#true} call #t~ret8 := main(); {13926#true} is VALID [2018-11-14 18:32:50,047 INFO L273 TraceCheckUtils]: 5: Hoare triple {13926#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {13926#true} is VALID [2018-11-14 18:32:50,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {13926#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {13926#true} is VALID [2018-11-14 18:32:50,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {13926#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {13926#true} is VALID [2018-11-14 18:32:50,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {13926#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {13926#true} is VALID [2018-11-14 18:32:50,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {13926#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {13926#true} is VALID [2018-11-14 18:32:50,048 INFO L273 TraceCheckUtils]: 10: Hoare triple {13926#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {13926#true} is VALID [2018-11-14 18:32:50,048 INFO L273 TraceCheckUtils]: 11: Hoare triple {13926#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {13926#true} is VALID [2018-11-14 18:32:50,048 INFO L273 TraceCheckUtils]: 12: Hoare triple {13926#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {13926#true} is VALID [2018-11-14 18:32:50,049 INFO L273 TraceCheckUtils]: 13: Hoare triple {13926#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {13926#true} is VALID [2018-11-14 18:32:50,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {13926#true} assume ~bvsge32(~main__scheme~0, 0bv32); {13926#true} is VALID [2018-11-14 18:32:50,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {13926#true} assume !(~main__scheme~0 == 0bv32); {13926#true} is VALID [2018-11-14 18:32:50,049 INFO L273 TraceCheckUtils]: 16: Hoare triple {13926#true} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {13926#true} is VALID [2018-11-14 18:32:50,049 INFO L273 TraceCheckUtils]: 17: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {13926#true} is VALID [2018-11-14 18:32:50,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {13926#true} is VALID [2018-11-14 18:32:50,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {13926#true} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {13926#true} is VALID [2018-11-14 18:32:50,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {13926#true} is VALID [2018-11-14 18:32:50,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {13926#true} is VALID [2018-11-14 18:32:50,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {13926#true} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {13926#true} is VALID [2018-11-14 18:32:50,050 INFO L273 TraceCheckUtils]: 23: Hoare triple {13926#true} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {13926#true} is VALID [2018-11-14 18:32:50,050 INFO L273 TraceCheckUtils]: 24: Hoare triple {13926#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {13926#true} is VALID [2018-11-14 18:32:50,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {13926#true} is VALID [2018-11-14 18:32:50,051 INFO L273 TraceCheckUtils]: 26: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {13926#true} is VALID [2018-11-14 18:32:50,051 INFO L273 TraceCheckUtils]: 27: Hoare triple {13926#true} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {13926#true} is VALID [2018-11-14 18:32:50,051 INFO L273 TraceCheckUtils]: 28: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~bvadd32(1bv32, ~main__cp~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {13926#true} is VALID [2018-11-14 18:32:50,051 INFO L273 TraceCheckUtils]: 29: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~7 == 0bv32); {13926#true} is VALID [2018-11-14 18:32:50,052 INFO L273 TraceCheckUtils]: 30: Hoare triple {13926#true} assume !(~bvadd32(1bv32, ~main__cp~0) == ~bvsub32(~main__urilen~0, 1bv32));~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0);~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {13926#true} is VALID [2018-11-14 18:32:50,052 INFO L273 TraceCheckUtils]: 31: Hoare triple {13926#true} assume !(~main____CPAchecker_TMP_2~0 == 0bv32);~main__c~0 := 0bv32;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {13926#true} is VALID [2018-11-14 18:32:50,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {14027#(or (and (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)) (not (bvsle (_ bv0 32) main_~main__cp~0))) (and (bvsle (_ bv0 32) main_~main__cp~0) (= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-14 18:32:50,087 INFO L273 TraceCheckUtils]: 33: Hoare triple {14027#(or (and (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)) (not (bvsle (_ bv0 32) main_~main__cp~0))) (and (bvsle (_ bv0 32) main_~main__cp~0) (= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))))} assume !(~__VERIFIER_assert__cond~9 == 0bv32); {14031#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:50,096 INFO L273 TraceCheckUtils]: 34: Hoare triple {14031#(bvsle (_ bv0 32) main_~main__cp~0)} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32); {14031#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:50,111 INFO L273 TraceCheckUtils]: 35: Hoare triple {14031#(bvsle (_ bv0 32) main_~main__cp~0)} assume ~bvslt32(~main__c~0, ~bvsub32(~main__tokenlen~0, 1bv32));havoc ~__tmp_11~0;~__tmp_11~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {14031#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:50,120 INFO L273 TraceCheckUtils]: 36: Hoare triple {14031#(bvsle (_ bv0 32) main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~10 == 0bv32);havoc ~__tmp_12~0;~__tmp_12~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {14041#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:50,136 INFO L273 TraceCheckUtils]: 37: Hoare triple {14041#(= (bvadd main_~__VERIFIER_assert__cond~11 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~11 == 0bv32; {13927#false} is VALID [2018-11-14 18:32:50,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {13927#false} assume !false; {13927#false} is VALID [2018-11-14 18:32:50,137 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-14 18:32:50,138 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:32:50,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:32:50,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:32:50,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-14 18:32:50,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:50,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:32:50,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:50,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:32:50,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:32:50,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:32:50,208 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 5 states. [2018-11-14 18:32:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:50,942 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-11-14 18:32:50,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:32:50,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-14 18:32:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:32:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:32:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2018-11-14 18:32:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:32:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2018-11-14 18:32:50,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2018-11-14 18:32:51,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:51,057 INFO L225 Difference]: With dead ends: 126 [2018-11-14 18:32:51,057 INFO L226 Difference]: Without dead ends: 124 [2018-11-14 18:32:51,057 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:32:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-14 18:32:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2018-11-14 18:32:51,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:32:51,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 105 states. [2018-11-14 18:32:51,204 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 105 states. [2018-11-14 18:32:51,204 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 105 states. [2018-11-14 18:32:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:51,206 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-11-14 18:32:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-11-14 18:32:51,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:51,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:51,207 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 124 states. [2018-11-14 18:32:51,207 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 124 states. [2018-11-14 18:32:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:32:51,209 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-11-14 18:32:51,209 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-11-14 18:32:51,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:32:51,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:32:51,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:32:51,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:32:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-14 18:32:51,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-11-14 18:32:51,212 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 39 [2018-11-14 18:32:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:32:51,212 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-11-14 18:32:51,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:32:51,212 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-11-14 18:32:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 18:32:51,213 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:32:51,213 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:32:51,214 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:32:51,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:32:51,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1969164194, now seen corresponding path program 1 times [2018-11-14 18:32:51,214 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:32:51,214 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 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 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 18:32:51,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:32:51,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:32:51,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:32:51,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {14564#true} call ULTIMATE.init(); {14564#true} is VALID [2018-11-14 18:32:51,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {14564#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {14564#true} is VALID [2018-11-14 18:32:51,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {14564#true} assume true; {14564#true} is VALID [2018-11-14 18:32:51,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14564#true} {14564#true} #215#return; {14564#true} is VALID [2018-11-14 18:32:51,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {14564#true} call #t~ret8 := main(); {14564#true} is VALID [2018-11-14 18:32:51,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {14564#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {14564#true} is VALID [2018-11-14 18:32:51,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {14564#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {14564#true} is VALID [2018-11-14 18:32:51,492 INFO L273 TraceCheckUtils]: 7: Hoare triple {14564#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {14564#true} is VALID [2018-11-14 18:32:51,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {14564#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {14564#true} is VALID [2018-11-14 18:32:51,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {14564#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {14564#true} is VALID [2018-11-14 18:32:51,492 INFO L273 TraceCheckUtils]: 10: Hoare triple {14564#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {14599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:51,493 INFO L273 TraceCheckUtils]: 11: Hoare triple {14599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {14599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:51,493 INFO L273 TraceCheckUtils]: 12: Hoare triple {14599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__urilen~0, 0bv32); {14599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:51,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {14599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {14599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} is VALID [2018-11-14 18:32:51,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {14599#(bvsle main_~main__scheme~0 (_ bv1000000 32))} assume ~bvsge32(~main__scheme~0, 0bv32); {14612#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,494 INFO L273 TraceCheckUtils]: 15: Hoare triple {14612#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !(~main__scheme~0 == 0bv32); {14612#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {14612#(and (bvsge main_~main__scheme~0 (_ bv0 32)) (bvsle main_~main__scheme~0 (_ bv1000000 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,499 INFO L273 TraceCheckUtils]: 20: Hoare triple {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,501 INFO L273 TraceCheckUtils]: 23: Hoare triple {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,501 INFO L273 TraceCheckUtils]: 24: Hoare triple {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} is VALID [2018-11-14 18:32:51,506 INFO L273 TraceCheckUtils]: 25: Hoare triple {14619#(and (bvsge main_~main__cp~0 (_ bv0 32)) (bvsle main_~main__cp~0 (_ bv1000000 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,506 INFO L273 TraceCheckUtils]: 26: Hoare triple {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,507 INFO L273 TraceCheckUtils]: 27: Hoare triple {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,507 INFO L273 TraceCheckUtils]: 28: Hoare triple {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,508 INFO L273 TraceCheckUtils]: 29: Hoare triple {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,509 INFO L273 TraceCheckUtils]: 31: Hoare triple {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,509 INFO L273 TraceCheckUtils]: 32: Hoare triple {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~bvadd32(1bv32, ~main__cp~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,510 INFO L273 TraceCheckUtils]: 33: Hoare triple {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~7 == 0bv32); {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,523 INFO L273 TraceCheckUtils]: 34: Hoare triple {14647#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !(~bvadd32(1bv32, ~main__cp~0) == ~bvsub32(~main__urilen~0, 1bv32));~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0);~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {14675#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967294 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {14675#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967294 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~main____CPAchecker_TMP_2~0 == 0bv32);~main__c~0 := 0bv32;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {14675#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967294 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-14 18:32:51,526 INFO L273 TraceCheckUtils]: 36: Hoare triple {14675#(and (bvsle (bvadd main_~main__cp~0 (_ bv4294967294 32)) (_ bv1000000 32)) (bvsge (bvadd main_~main__cp~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {14682#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 18:32:51,526 INFO L273 TraceCheckUtils]: 37: Hoare triple {14682#(= (bvadd main_~__VERIFIER_assert__cond~9 (_ bv4294967295 32)) (_ bv0 32))} assume ~__VERIFIER_assert__cond~9 == 0bv32; {14565#false} is VALID [2018-11-14 18:32:51,527 INFO L273 TraceCheckUtils]: 38: Hoare triple {14565#false} assume !false; {14565#false} is VALID [2018-11-14 18:32:51,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:51,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:32:51,700 INFO L273 TraceCheckUtils]: 38: Hoare triple {14565#false} assume !false; {14565#false} is VALID [2018-11-14 18:32:51,701 INFO L273 TraceCheckUtils]: 37: Hoare triple {14692#(not (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))} assume ~__VERIFIER_assert__cond~9 == 0bv32; {14565#false} is VALID [2018-11-14 18:32:51,702 INFO L273 TraceCheckUtils]: 36: Hoare triple {14696#(bvsle (_ bv0 32) main_~main__cp~0)} assume !(~__VERIFIER_assert__cond~8 == 0bv32);havoc ~__tmp_10~0;~__tmp_10~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {14692#(not (= main_~__VERIFIER_assert__cond~9 (_ bv0 32)))} is VALID [2018-11-14 18:32:51,702 INFO L273 TraceCheckUtils]: 35: Hoare triple {14696#(bvsle (_ bv0 32) main_~main__cp~0)} assume !(~main____CPAchecker_TMP_2~0 == 0bv32);~main__c~0 := 0bv32;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {14696#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:51,705 INFO L273 TraceCheckUtils]: 34: Hoare triple {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~bvadd32(1bv32, ~main__cp~0) == ~bvsub32(~main__urilen~0, 1bv32));~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0);~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;~main____CPAchecker_TMP_2~0 := #t~nondet6;havoc #t~nondet6; {14696#(bvsle (_ bv0 32) main_~main__cp~0)} is VALID [2018-11-14 18:32:51,705 INFO L273 TraceCheckUtils]: 33: Hoare triple {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~7 == 0bv32); {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:51,706 INFO L273 TraceCheckUtils]: 32: Hoare triple {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~6 == 0bv32);havoc ~__tmp_8~0;~__tmp_8~0 := (if ~bvsle32(0bv32, ~bvadd32(1bv32, ~main__cp~0)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:51,707 INFO L273 TraceCheckUtils]: 31: Hoare triple {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~main__cp~0 == ~bvsub32(~main__urilen~0, 1bv32));havoc ~__tmp_7~0;~__tmp_7~0 := (if ~bvslt32(~bvadd32(1bv32, ~main__cp~0), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:51,707 INFO L273 TraceCheckUtils]: 30: Hoare triple {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:51,707 INFO L273 TraceCheckUtils]: 29: Hoare triple {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~__VERIFIER_assert__cond~4 == 0bv32);havoc ~__tmp_6~0;~__tmp_6~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:51,708 INFO L273 TraceCheckUtils]: 28: Hoare triple {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:51,708 INFO L273 TraceCheckUtils]: 27: Hoare triple {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:51,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:51,711 INFO L273 TraceCheckUtils]: 25: Hoare triple {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~17 == 0bv32);~main__cp~0 := ~bvadd32(1bv32, ~main__cp~0); {14703#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv1 32)))} is VALID [2018-11-14 18:32:51,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~16 == 0bv32);havoc ~__tmp_18~0;~__tmp_18~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !!(~main____CPAchecker_TMP_1~0 == 0bv32);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,712 INFO L273 TraceCheckUtils]: 22: Hoare triple {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume ~main__cp~0 != ~bvsub32(~main__urilen~0, 1bv32);havoc ~main____CPAchecker_TMP_1~0;~main____CPAchecker_TMP_1~0 := #t~nondet5;havoc #t~nondet5; {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~2 == 0bv32);havoc ~__tmp_4~0;~__tmp_4~0 := (if ~bvsle32(0bv32, ~main__cp~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~main____CPAchecker_TMP_0~0 == 0bv32);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~bvslt32(~main__cp~0, ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,714 INFO L273 TraceCheckUtils]: 18: Hoare triple {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~1 == 0bv32);havoc ~main____CPAchecker_TMP_0~0;~main____CPAchecker_TMP_0~0 := #t~nondet4;havoc #t~nondet4; {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} assume !(~__VERIFIER_assert__cond~0 == 0bv32);havoc ~__tmp_2~0;~__tmp_2~0 := (if ~bvsle32(0bv32, ~bvsub32(~main__cp~0, 1bv32)) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,718 INFO L273 TraceCheckUtils]: 16: Hoare triple {14759#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32)))} assume !~bvslt32(~bvsub32(~main__urilen~0, 1bv32), ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~bvslt32(~bvsub32(~main__cp~0, 1bv32), ~main__urilen~0) then 1bv32 else 0bv32);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {14731#(bvsle (_ bv0 32) (bvadd main_~main__cp~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,719 INFO L273 TraceCheckUtils]: 15: Hoare triple {14759#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32)))} assume !(~main__scheme~0 == 0bv32); {14759#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {14766#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} assume ~bvsge32(~main__scheme~0, 0bv32); {14759#(bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32)))} is VALID [2018-11-14 18:32:51,720 INFO L273 TraceCheckUtils]: 13: Hoare triple {14766#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {14766#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} is VALID [2018-11-14 18:32:51,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {14766#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} assume ~bvsgt32(~main__urilen~0, 0bv32); {14766#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} is VALID [2018-11-14 18:32:51,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {14766#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {14766#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} is VALID [2018-11-14 18:32:51,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {14564#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {14766#(or (not (bvsge main_~main__scheme~0 (_ bv0 32))) (bvsle (_ bv0 32) (bvadd main_~main__scheme~0 (_ bv2 32))))} is VALID [2018-11-14 18:32:51,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {14564#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {14564#true} is VALID [2018-11-14 18:32:51,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {14564#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {14564#true} is VALID [2018-11-14 18:32:51,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {14564#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {14564#true} is VALID [2018-11-14 18:32:51,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {14564#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {14564#true} is VALID [2018-11-14 18:32:51,722 INFO L273 TraceCheckUtils]: 5: Hoare triple {14564#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;~main__urilen~0 := #t~nondet1;havoc #t~nondet1;~main__tokenlen~0 := #t~nondet2;havoc #t~nondet2;~main__scheme~0 := #t~nondet3;havoc #t~nondet3; {14564#true} is VALID [2018-11-14 18:32:51,723 INFO L256 TraceCheckUtils]: 4: Hoare triple {14564#true} call #t~ret8 := main(); {14564#true} is VALID [2018-11-14 18:32:51,723 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14564#true} {14564#true} #215#return; {14564#true} is VALID [2018-11-14 18:32:51,723 INFO L273 TraceCheckUtils]: 2: Hoare triple {14564#true} assume true; {14564#true} is VALID [2018-11-14 18:32:51,723 INFO L273 TraceCheckUtils]: 1: Hoare triple {14564#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {14564#true} is VALID [2018-11-14 18:32:51,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {14564#true} call ULTIMATE.init(); {14564#true} is VALID [2018-11-14 18:32:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:32:51,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:32:51,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 18:32:51,727 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-11-14 18:32:51,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:32:51,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:32:51,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:32:51,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:32:51,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:32:51,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:32:51,853 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 14 states.