java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:43:00,767 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:43:00,771 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:43:00,789 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:43:00,789 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:43:00,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:43:00,792 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:43:00,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:43:00,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:43:00,804 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:43:00,807 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:43:00,807 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:43:00,809 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:43:00,811 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:43:00,814 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:43:00,815 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:43:00,816 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:43:00,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:43:00,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:43:00,825 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:43:00,827 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:43:00,828 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:43:00,831 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:43:00,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:43:00,831 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:43:00,834 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:43:00,836 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:43:00,837 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:43:00,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:43:00,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:43:00,842 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:43:00,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:43:00,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:43:00,844 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:43:00,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:43:00,846 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:43:00,847 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:43:00,866 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:43:00,866 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:43:00,867 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:43:00,867 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:43:00,868 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:43:00,868 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:43:00,869 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:43:00,869 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:43:00,869 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:43:00,869 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:43:00,869 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:43:00,870 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:43:00,870 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:43:00,870 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:43:00,870 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:43:00,870 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:43:00,871 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:43:00,871 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:43:00,871 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:43:00,871 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:43:00,871 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:43:00,872 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:43:00,872 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:43:00,872 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:43:00,872 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:43:00,872 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:43:00,873 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:43:00,873 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:43:00,873 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:43:00,873 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:43:00,873 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:43:00,873 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:43:00,923 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:43:00,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:43:00,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:43:00,945 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:43:00,946 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:43:00,946 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 16:43:01,018 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040cfca22/34c7bb33a3164b2180ac6ff4c726bc08/FLAGdd73c1e83 [2018-11-14 16:43:01,457 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:43:01,460 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 16:43:01,475 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040cfca22/34c7bb33a3164b2180ac6ff4c726bc08/FLAGdd73c1e83 [2018-11-14 16:43:01,493 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040cfca22/34c7bb33a3164b2180ac6ff4c726bc08 [2018-11-14 16:43:01,503 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:43:01,504 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:43:01,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:43:01,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:43:01,509 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:43:01,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:43:01" (1/1) ... [2018-11-14 16:43:01,514 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1951ebf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01, skipping insertion in model container [2018-11-14 16:43:01,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:43:01" (1/1) ... [2018-11-14 16:43:01,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:43:01,563 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:43:01,855 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:43:01,863 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:43:01,963 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:43:01,991 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:43:01,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01 WrapperNode [2018-11-14 16:43:01,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:43:01,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:43:01,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:43:01,993 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:43:02,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01" (1/1) ... [2018-11-14 16:43:02,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01" (1/1) ... [2018-11-14 16:43:02,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01" (1/1) ... [2018-11-14 16:43:02,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01" (1/1) ... [2018-11-14 16:43:02,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01" (1/1) ... [2018-11-14 16:43:02,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01" (1/1) ... [2018-11-14 16:43:02,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01" (1/1) ... [2018-11-14 16:43:02,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:43:02,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:43:02,071 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:43:02,071 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:43:02,072 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01" (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 16:43:02,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:43:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:43:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:43:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:43:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:43:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:43:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:43:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:43:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:43:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:43:03,665 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:43:03,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:43:03 BoogieIcfgContainer [2018-11-14 16:43:03,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:43:03,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:43:03,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:43:03,671 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:43:03,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:43:01" (1/3) ... [2018-11-14 16:43:03,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbe873a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:43:03, skipping insertion in model container [2018-11-14 16:43:03,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:43:01" (2/3) ... [2018-11-14 16:43:03,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbe873a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:43:03, skipping insertion in model container [2018-11-14 16:43:03,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:43:03" (3/3) ... [2018-11-14 16:43:03,676 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute_true-unreach-call.i.v+cfa-reducer.c [2018-11-14 16:43:03,685 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:43:03,693 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2018-11-14 16:43:03,710 INFO L257 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2018-11-14 16:43:03,743 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:43:03,744 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:43:03,744 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:43:03,744 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:43:03,744 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:43:03,745 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:43:03,745 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:43:03,745 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:43:03,745 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:43:03,769 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-11-14 16:43:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:43:03,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:03,777 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 16:43:03,780 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:03,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:03,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1637525138, now seen corresponding path program 1 times [2018-11-14 16:43:03,791 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:03,791 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 16:43:03,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:03,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:04,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {90#true} is VALID [2018-11-14 16:43:04,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {90#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {90#true} is VALID [2018-11-14 16:43:04,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2018-11-14 16:43:04,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #215#return; {90#true} is VALID [2018-11-14 16:43:04,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {90#true} call #t~ret8 := main(); {90#true} is VALID [2018-11-14 16:43:04,876 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 16:43:04,877 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 16:43:04,878 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 16:43:04,880 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 16:43:04,880 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 16:43:04,882 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 16:43:04,882 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 16:43:04,887 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 16:43:04,888 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 16:43:04,889 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 16:43:04,894 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 16:43:04,929 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 16:43:04,931 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 16:43:04,932 INFO L273 TraceCheckUtils]: 18: Hoare triple {91#false} assume !false; {91#false} is VALID [2018-11-14 16:43:04,941 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 16:43:04,942 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Stream closed [2018-11-14 16:43:04,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:04,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-14 16:43:04,955 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 16:43:04,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:04,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 16:43:05,024 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 16:43:05,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 16:43:05,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 16:43:05,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-14 16:43:05,036 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 8 states. [2018-11-14 16:43:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:06,786 INFO L93 Difference]: Finished difference Result 106 states and 142 transitions. [2018-11-14 16:43:06,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:43:06,786 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-14 16:43:06,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:06,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:43:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2018-11-14 16:43:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 16:43:06,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2018-11-14 16:43:06,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 142 transitions. [2018-11-14 16:43:07,171 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 16:43:07,190 INFO L225 Difference]: With dead ends: 106 [2018-11-14 16:43:07,191 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 16:43:07,195 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:43:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 16:43:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-14 16:43:07,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:07,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-14 16:43:07,301 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 16:43:07,301 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 16:43:07,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:07,309 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-14 16:43:07,310 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 16:43:07,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:07,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:07,311 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 16:43:07,311 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 16:43:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:07,319 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-11-14 16:43:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 16:43:07,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:07,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:07,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:07,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:07,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 16:43:07,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2018-11-14 16:43:07,328 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2018-11-14 16:43:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:07,329 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2018-11-14 16:43:07,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 16:43:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2018-11-14 16:43:07,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:43:07,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:07,330 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 16:43:07,331 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:07,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:07,332 INFO L82 PathProgramCache]: Analyzing trace with hash 776331368, now seen corresponding path program 1 times [2018-11-14 16:43:07,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:07,332 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 16:43:07,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:07,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:07,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {522#true} call ULTIMATE.init(); {522#true} is VALID [2018-11-14 16:43:07,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {522#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {522#true} is VALID [2018-11-14 16:43:07,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {522#true} assume true; {522#true} is VALID [2018-11-14 16:43:07,532 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {522#true} {522#true} #215#return; {522#true} is VALID [2018-11-14 16:43:07,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {522#true} call #t~ret8 := main(); {522#true} is VALID [2018-11-14 16:43:07,533 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 16:43:07,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {522#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {522#true} is VALID [2018-11-14 16:43:07,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {522#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {522#true} is VALID [2018-11-14 16:43:07,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {522#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {522#true} is VALID [2018-11-14 16:43:07,534 INFO L273 TraceCheckUtils]: 9: Hoare triple {522#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {522#true} is VALID [2018-11-14 16:43:07,535 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 16:43:07,536 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 16:43:07,553 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 16:43:07,559 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 16:43:07,559 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 16:43:07,562 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 16:43:07,564 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 16:43:07,579 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 16:43:07,586 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 16:43:07,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {523#false} assume !false; {523#false} is VALID [2018-11-14 16:43:07,588 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 16:43:07,589 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:07,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:07,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:43:07,593 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 16:43:07,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:07,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:43:07,645 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 16:43:07,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:43:07,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:43:07,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:43:07,646 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 7 states. [2018-11-14 16:43:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:08,697 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-11-14 16:43:08,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:43:08,698 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-14 16:43:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:08,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:43:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-14 16:43:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:43:08,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2018-11-14 16:43:08,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2018-11-14 16:43:08,935 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 16:43:08,939 INFO L225 Difference]: With dead ends: 103 [2018-11-14 16:43:08,940 INFO L226 Difference]: Without dead ends: 101 [2018-11-14 16:43:08,941 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 16:43:08,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-14 16:43:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2018-11-14 16:43:09,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:09,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 78 states. [2018-11-14 16:43:09,005 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 78 states. [2018-11-14 16:43:09,006 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 78 states. [2018-11-14 16:43:09,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:09,012 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-14 16:43:09,012 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-14 16:43:09,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:09,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:09,014 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 101 states. [2018-11-14 16:43:09,014 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 101 states. [2018-11-14 16:43:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:09,022 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-11-14 16:43:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-11-14 16:43:09,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:09,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:09,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:09,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 16:43:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2018-11-14 16:43:09,028 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2018-11-14 16:43:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:09,029 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2018-11-14 16:43:09,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:43:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2018-11-14 16:43:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 16:43:09,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:09,030 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 16:43:09,031 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:09,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1269768629, now seen corresponding path program 1 times [2018-11-14 16:43:09,032 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:09,032 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 16:43:09,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:09,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:09,486 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2018-11-14 16:43:09,723 INFO L256 TraceCheckUtils]: 0: Hoare triple {995#true} call ULTIMATE.init(); {995#true} is VALID [2018-11-14 16:43:09,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {995#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {995#true} is VALID [2018-11-14 16:43:09,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {995#true} assume true; {995#true} is VALID [2018-11-14 16:43:09,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {995#true} {995#true} #215#return; {995#true} is VALID [2018-11-14 16:43:09,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {995#true} call #t~ret8 := main(); {995#true} is VALID [2018-11-14 16:43:09,725 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 16:43:09,726 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 16:43:09,728 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 16:43:09,728 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 16:43:09,729 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 16:43:09,730 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 16:43:09,731 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 16:43:09,737 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 16:43:09,738 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 16:43:09,739 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 16:43:09,739 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 16:43:09,768 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 16:43:09,770 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 16:43:09,771 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 16:43:09,782 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 16:43:09,782 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 16:43:09,783 INFO L273 TraceCheckUtils]: 21: Hoare triple {996#false} assume !false; {996#false} is VALID [2018-11-14 16:43:09,785 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 16:43:09,785 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:09,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:09,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-14 16:43:09,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-14 16:43:09,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:09,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:43:09,862 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 16:43:09,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:43:09,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:43:09,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:43:09,864 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 10 states. [2018-11-14 16:43:10,495 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2018-11-14 16:43:10,660 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-11-14 16:43:12,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:12,182 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-11-14 16:43:12,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:43:12,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-11-14 16:43:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:43:12,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2018-11-14 16:43:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:43:12,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 136 transitions. [2018-11-14 16:43:12,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 136 transitions. [2018-11-14 16:43:12,572 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 16:43:12,577 INFO L225 Difference]: With dead ends: 130 [2018-11-14 16:43:12,577 INFO L226 Difference]: Without dead ends: 128 [2018-11-14 16:43:12,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:43:12,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-14 16:43:12,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2018-11-14 16:43:12,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:12,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand 76 states. [2018-11-14 16:43:12,671 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand 76 states. [2018-11-14 16:43:12,671 INFO L87 Difference]: Start difference. First operand 128 states. Second operand 76 states. [2018-11-14 16:43:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:12,676 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-14 16:43:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-11-14 16:43:12,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:12,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:12,679 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 128 states. [2018-11-14 16:43:12,679 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 128 states. [2018-11-14 16:43:12,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:12,684 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-14 16:43:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-11-14 16:43:12,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:12,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:12,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:12,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 16:43:12,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-11-14 16:43:12,690 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2018-11-14 16:43:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:12,690 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-11-14 16:43:12,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:43:12,690 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-11-14 16:43:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 16:43:12,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:12,691 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 16:43:12,692 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:12,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:12,692 INFO L82 PathProgramCache]: Analyzing trace with hash -708118726, now seen corresponding path program 1 times [2018-11-14 16:43:12,693 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:12,693 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 16:43:12,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:12,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:12,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {1564#true} call ULTIMATE.init(); {1564#true} is VALID [2018-11-14 16:43:12,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {1564#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {1564#true} is VALID [2018-11-14 16:43:12,815 INFO L273 TraceCheckUtils]: 2: Hoare triple {1564#true} assume true; {1564#true} is VALID [2018-11-14 16:43:12,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1564#true} {1564#true} #215#return; {1564#true} is VALID [2018-11-14 16:43:12,816 INFO L256 TraceCheckUtils]: 4: Hoare triple {1564#true} call #t~ret8 := main(); {1564#true} is VALID [2018-11-14 16:43:12,816 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 16:43:12,817 INFO L273 TraceCheckUtils]: 6: Hoare triple {1564#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {1564#true} is VALID [2018-11-14 16:43:12,817 INFO L273 TraceCheckUtils]: 7: Hoare triple {1564#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {1564#true} is VALID [2018-11-14 16:43:12,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {1564#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {1564#true} is VALID [2018-11-14 16:43:12,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {1564#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {1564#true} is VALID [2018-11-14 16:43:12,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {1564#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {1564#true} is VALID [2018-11-14 16:43:12,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {1564#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {1564#true} is VALID [2018-11-14 16:43:12,818 INFO L273 TraceCheckUtils]: 12: Hoare triple {1564#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {1564#true} is VALID [2018-11-14 16:43:12,819 INFO L273 TraceCheckUtils]: 13: Hoare triple {1564#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {1564#true} is VALID [2018-11-14 16:43:12,822 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 16:43:12,823 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 16:43:12,824 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 16:43:12,824 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 16:43:12,826 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 16:43:12,826 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 16:43:12,828 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 16:43:12,829 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 16:43:12,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {1565#false} assume !false; {1565#false} is VALID [2018-11-14 16:43:12,830 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 16:43:12,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:12,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:12,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:12,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-14 16:43:12,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:12,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:12,907 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 16:43:12,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:12,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:12,908 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 5 states. [2018-11-14 16:43:13,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:13,419 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-11-14 16:43:13,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:43:13,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-14 16:43:13,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:13,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2018-11-14 16:43:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2018-11-14 16:43:13,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 104 transitions. [2018-11-14 16:43:13,616 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 16:43:13,618 INFO L225 Difference]: With dead ends: 99 [2018-11-14 16:43:13,619 INFO L226 Difference]: Without dead ends: 97 [2018-11-14 16:43:13,619 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 16:43:13,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-14 16:43:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 74. [2018-11-14 16:43:13,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:13,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 74 states. [2018-11-14 16:43:13,682 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 74 states. [2018-11-14 16:43:13,682 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 74 states. [2018-11-14 16:43:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:13,686 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-11-14 16:43:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-11-14 16:43:13,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:13,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:13,687 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 97 states. [2018-11-14 16:43:13,687 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 97 states. [2018-11-14 16:43:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:13,691 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-11-14 16:43:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2018-11-14 16:43:13,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:13,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:13,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:13,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 16:43:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-11-14 16:43:13,695 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2018-11-14 16:43:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:13,695 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-11-14 16:43:13,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-11-14 16:43:13,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:43:13,696 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:13,697 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 16:43:13,697 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:13,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:13,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1317531748, now seen corresponding path program 1 times [2018-11-14 16:43:13,698 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:13,698 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 16:43:13,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:13,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:14,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2018-11-14 16:43:14,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {2028#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {2028#true} is VALID [2018-11-14 16:43:14,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2018-11-14 16:43:14,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #215#return; {2028#true} is VALID [2018-11-14 16:43:14,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret8 := main(); {2028#true} is VALID [2018-11-14 16:43:14,107 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 16:43:14,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {2028#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {2028#true} is VALID [2018-11-14 16:43:14,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {2028#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {2028#true} is VALID [2018-11-14 16:43:14,107 INFO L273 TraceCheckUtils]: 8: Hoare triple {2028#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {2028#true} is VALID [2018-11-14 16:43:14,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {2028#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {2028#true} is VALID [2018-11-14 16:43:14,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {2028#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {2028#true} is VALID [2018-11-14 16:43:14,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {2028#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {2028#true} is VALID [2018-11-14 16:43:14,108 INFO L273 TraceCheckUtils]: 12: Hoare triple {2028#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {2028#true} is VALID [2018-11-14 16:43:14,109 INFO L273 TraceCheckUtils]: 13: Hoare triple {2028#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {2028#true} is VALID [2018-11-14 16:43:14,109 INFO L273 TraceCheckUtils]: 14: Hoare triple {2028#true} assume ~bvsge32(~main__scheme~0, 0bv32); {2028#true} is VALID [2018-11-14 16:43:14,109 INFO L273 TraceCheckUtils]: 15: Hoare triple {2028#true} assume !(~main__scheme~0 == 0bv32); {2028#true} is VALID [2018-11-14 16:43:14,109 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 16:43:14,110 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 16:43:14,110 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 16:43:14,115 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 16:43:14,116 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 16:43:14,117 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 16:43:14,123 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 16:43:14,124 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 16:43:14,125 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 16:43:14,125 INFO L273 TraceCheckUtils]: 25: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2018-11-14 16:43:14,126 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 16:43:14,126 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:14,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:14,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:14,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 16:43:14,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:14,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:14,161 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 16:43:14,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:14,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:14,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:14,162 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 5 states. [2018-11-14 16:43:15,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:15,402 INFO L93 Difference]: Finished difference Result 143 states and 151 transitions. [2018-11-14 16:43:15,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:15,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 16:43:15,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:15,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-14 16:43:15,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2018-11-14 16:43:15,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 151 transitions. [2018-11-14 16:43:15,680 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 16:43:15,682 INFO L225 Difference]: With dead ends: 143 [2018-11-14 16:43:15,682 INFO L226 Difference]: Without dead ends: 141 [2018-11-14 16:43:15,683 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 16:43:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-14 16:43:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 77. [2018-11-14 16:43:15,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:15,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 77 states. [2018-11-14 16:43:15,753 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 77 states. [2018-11-14 16:43:15,753 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 77 states. [2018-11-14 16:43:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:15,758 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-11-14 16:43:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-11-14 16:43:15,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:15,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:15,759 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 141 states. [2018-11-14 16:43:15,759 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 141 states. [2018-11-14 16:43:15,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:15,764 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2018-11-14 16:43:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-11-14 16:43:15,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:15,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:15,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:15,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:15,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-14 16:43:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-11-14 16:43:15,768 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2018-11-14 16:43:15,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:15,768 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-11-14 16:43:15,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-11-14 16:43:15,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-14 16:43:15,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:15,770 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 16:43:15,770 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:15,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:15,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1321265557, now seen corresponding path program 1 times [2018-11-14 16:43:15,771 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:15,771 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 16:43:15,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:15,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:16,033 INFO L256 TraceCheckUtils]: 0: Hoare triple {2639#true} call ULTIMATE.init(); {2639#true} is VALID [2018-11-14 16:43:16,033 INFO L273 TraceCheckUtils]: 1: Hoare triple {2639#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {2639#true} is VALID [2018-11-14 16:43:16,033 INFO L273 TraceCheckUtils]: 2: Hoare triple {2639#true} assume true; {2639#true} is VALID [2018-11-14 16:43:16,034 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2639#true} {2639#true} #215#return; {2639#true} is VALID [2018-11-14 16:43:16,034 INFO L256 TraceCheckUtils]: 4: Hoare triple {2639#true} call #t~ret8 := main(); {2639#true} is VALID [2018-11-14 16:43:16,034 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 16:43:16,034 INFO L273 TraceCheckUtils]: 6: Hoare triple {2639#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {2639#true} is VALID [2018-11-14 16:43:16,035 INFO L273 TraceCheckUtils]: 7: Hoare triple {2639#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {2639#true} is VALID [2018-11-14 16:43:16,035 INFO L273 TraceCheckUtils]: 8: Hoare triple {2639#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {2639#true} is VALID [2018-11-14 16:43:16,035 INFO L273 TraceCheckUtils]: 9: Hoare triple {2639#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {2639#true} is VALID [2018-11-14 16:43:16,035 INFO L273 TraceCheckUtils]: 10: Hoare triple {2639#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {2639#true} is VALID [2018-11-14 16:43:16,035 INFO L273 TraceCheckUtils]: 11: Hoare triple {2639#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {2639#true} is VALID [2018-11-14 16:43:16,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {2639#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {2639#true} is VALID [2018-11-14 16:43:16,036 INFO L273 TraceCheckUtils]: 13: Hoare triple {2639#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {2639#true} is VALID [2018-11-14 16:43:16,036 INFO L273 TraceCheckUtils]: 14: Hoare triple {2639#true} assume ~bvsge32(~main__scheme~0, 0bv32); {2639#true} is VALID [2018-11-14 16:43:16,036 INFO L273 TraceCheckUtils]: 15: Hoare triple {2639#true} assume !(~main__scheme~0 == 0bv32); {2639#true} is VALID [2018-11-14 16:43:16,036 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 16:43:16,037 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 16:43:16,037 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 16:43:16,047 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 16:43:16,051 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 16:43:16,052 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 16:43:16,052 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 16:43:16,056 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 16:43:16,056 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 16:43:16,056 INFO L273 TraceCheckUtils]: 25: Hoare triple {2640#false} assume !false; {2640#false} is VALID [2018-11-14 16:43:16,057 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 16:43:16,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:16,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:16,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:16,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 16:43:16,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:16,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:16,091 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 16:43:16,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:16,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:16,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:16,092 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 5 states. [2018-11-14 16:43:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:16,850 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-11-14 16:43:16,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:16,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-11-14 16:43:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2018-11-14 16:43:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:16,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 130 transitions. [2018-11-14 16:43:16,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 130 transitions. [2018-11-14 16:43:17,035 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 16:43:17,038 INFO L225 Difference]: With dead ends: 124 [2018-11-14 16:43:17,038 INFO L226 Difference]: Without dead ends: 122 [2018-11-14 16:43:17,039 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 16:43:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-14 16:43:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 79. [2018-11-14 16:43:17,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:17,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 79 states. [2018-11-14 16:43:17,085 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 79 states. [2018-11-14 16:43:17,085 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 79 states. [2018-11-14 16:43:17,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:17,088 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-11-14 16:43:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-11-14 16:43:17,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:17,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:17,089 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 122 states. [2018-11-14 16:43:17,090 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 122 states. [2018-11-14 16:43:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:17,094 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2018-11-14 16:43:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2018-11-14 16:43:17,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:17,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:17,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:17,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:17,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-14 16:43:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-11-14 16:43:17,097 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2018-11-14 16:43:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:17,098 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-11-14 16:43:17,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-11-14 16:43:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:43:17,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:17,099 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 16:43:17,099 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:17,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:17,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2106185532, now seen corresponding path program 1 times [2018-11-14 16:43:17,100 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:17,100 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 16:43:17,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:17,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:17,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {3194#true} call ULTIMATE.init(); {3194#true} is VALID [2018-11-14 16:43:17,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {3194#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {3194#true} is VALID [2018-11-14 16:43:17,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {3194#true} assume true; {3194#true} is VALID [2018-11-14 16:43:17,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3194#true} {3194#true} #215#return; {3194#true} is VALID [2018-11-14 16:43:17,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {3194#true} call #t~ret8 := main(); {3194#true} is VALID [2018-11-14 16:43:17,383 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 16:43:17,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {3194#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {3194#true} is VALID [2018-11-14 16:43:17,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {3194#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {3194#true} is VALID [2018-11-14 16:43:17,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {3194#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {3194#true} is VALID [2018-11-14 16:43:17,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {3194#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {3194#true} is VALID [2018-11-14 16:43:17,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {3194#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {3194#true} is VALID [2018-11-14 16:43:17,384 INFO L273 TraceCheckUtils]: 11: Hoare triple {3194#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {3194#true} is VALID [2018-11-14 16:43:17,384 INFO L273 TraceCheckUtils]: 12: Hoare triple {3194#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {3194#true} is VALID [2018-11-14 16:43:17,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {3194#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {3194#true} is VALID [2018-11-14 16:43:17,385 INFO L273 TraceCheckUtils]: 14: Hoare triple {3194#true} assume ~bvsge32(~main__scheme~0, 0bv32); {3194#true} is VALID [2018-11-14 16:43:17,385 INFO L273 TraceCheckUtils]: 15: Hoare triple {3194#true} assume !(~main__scheme~0 == 0bv32); {3194#true} is VALID [2018-11-14 16:43:17,385 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 16:43:17,385 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 16:43:17,386 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 16:43:17,386 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 16:43:17,388 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 16:43:17,389 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 16:43:17,390 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 16:43:17,390 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 16:43:17,390 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 16:43:17,391 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 16:43:17,391 INFO L273 TraceCheckUtils]: 26: Hoare triple {3195#false} assume !false; {3195#false} is VALID [2018-11-14 16:43:17,392 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 16:43:17,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:17,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:17,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:17,394 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 16:43:17,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:17,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:17,428 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 16:43:17,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:17,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:17,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:17,429 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 5 states. [2018-11-14 16:43:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:18,718 INFO L93 Difference]: Finished difference Result 142 states and 150 transitions. [2018-11-14 16:43:18,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:18,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 16:43:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2018-11-14 16:43:18,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:18,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 150 transitions. [2018-11-14 16:43:18,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 150 transitions. [2018-11-14 16:43:19,470 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 16:43:19,474 INFO L225 Difference]: With dead ends: 142 [2018-11-14 16:43:19,474 INFO L226 Difference]: Without dead ends: 140 [2018-11-14 16:43:19,474 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 16:43:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-14 16:43:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 80. [2018-11-14 16:43:19,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:19,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 80 states. [2018-11-14 16:43:19,544 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 80 states. [2018-11-14 16:43:19,545 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 80 states. [2018-11-14 16:43:19,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:19,549 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-14 16:43:19,550 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-11-14 16:43:19,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:19,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:19,550 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 140 states. [2018-11-14 16:43:19,551 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 140 states. [2018-11-14 16:43:19,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:19,555 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-11-14 16:43:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2018-11-14 16:43:19,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:19,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:19,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:19,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 16:43:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-14 16:43:19,558 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 27 [2018-11-14 16:43:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:19,558 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-14 16:43:19,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:19,559 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-14 16:43:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:43:19,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:19,559 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 16:43:19,560 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:19,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:19,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1990437563, now seen corresponding path program 1 times [2018-11-14 16:43:19,561 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:19,561 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 16:43:19,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:19,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:19,719 INFO L256 TraceCheckUtils]: 0: Hoare triple {3809#true} call ULTIMATE.init(); {3809#true} is VALID [2018-11-14 16:43:19,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {3809#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {3809#true} is VALID [2018-11-14 16:43:19,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {3809#true} assume true; {3809#true} is VALID [2018-11-14 16:43:19,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3809#true} {3809#true} #215#return; {3809#true} is VALID [2018-11-14 16:43:19,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {3809#true} call #t~ret8 := main(); {3809#true} is VALID [2018-11-14 16:43:19,721 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 16:43:19,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {3809#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {3809#true} is VALID [2018-11-14 16:43:19,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {3809#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {3809#true} is VALID [2018-11-14 16:43:19,722 INFO L273 TraceCheckUtils]: 8: Hoare triple {3809#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {3809#true} is VALID [2018-11-14 16:43:19,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {3809#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {3809#true} is VALID [2018-11-14 16:43:19,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {3809#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {3809#true} is VALID [2018-11-14 16:43:19,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {3809#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {3809#true} is VALID [2018-11-14 16:43:19,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {3809#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {3809#true} is VALID [2018-11-14 16:43:19,723 INFO L273 TraceCheckUtils]: 13: Hoare triple {3809#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {3809#true} is VALID [2018-11-14 16:43:19,723 INFO L273 TraceCheckUtils]: 14: Hoare triple {3809#true} assume ~bvsge32(~main__scheme~0, 0bv32); {3809#true} is VALID [2018-11-14 16:43:19,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {3809#true} assume !(~main__scheme~0 == 0bv32); {3809#true} is VALID [2018-11-14 16:43:19,723 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 16:43:19,724 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 16:43:19,724 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 16:43:19,724 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 16:43:19,725 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 16:43:19,725 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 16:43:19,726 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 16:43:19,726 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 16:43:19,727 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 16:43:19,727 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 16:43:19,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {3810#false} assume !false; {3810#false} is VALID [2018-11-14 16:43:19,729 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 16:43:19,729 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:19,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:19,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:43:19,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 16:43:19,731 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:19,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:43:19,758 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 16:43:19,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:43:19,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:43:19,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:43:19,760 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2018-11-14 16:43:20,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:20,647 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-11-14 16:43:20,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:43:20,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 16:43:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2018-11-14 16:43:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:43:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2018-11-14 16:43:20,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 126 transitions. [2018-11-14 16:43:20,845 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 16:43:20,847 INFO L225 Difference]: With dead ends: 120 [2018-11-14 16:43:20,847 INFO L226 Difference]: Without dead ends: 118 [2018-11-14 16:43:20,847 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 16:43:20,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-14 16:43:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 81. [2018-11-14 16:43:20,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:20,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 81 states. [2018-11-14 16:43:20,909 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 81 states. [2018-11-14 16:43:20,910 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 81 states. [2018-11-14 16:43:20,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:20,914 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-14 16:43:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-14 16:43:20,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:20,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:20,915 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 118 states. [2018-11-14 16:43:20,915 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 118 states. [2018-11-14 16:43:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:20,918 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-11-14 16:43:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 124 transitions. [2018-11-14 16:43:20,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:20,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:20,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:20,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-14 16:43:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2018-11-14 16:43:20,922 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 27 [2018-11-14 16:43:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:20,922 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2018-11-14 16:43:20,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:43:20,923 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2018-11-14 16:43:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 16:43:20,923 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:20,923 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 16:43:20,924 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:20,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:20,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1549950965, now seen corresponding path program 1 times [2018-11-14 16:43:20,925 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:20,925 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 16:43:20,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:20,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:21,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {4357#true} call ULTIMATE.init(); {4357#true} is VALID [2018-11-14 16:43:21,018 INFO L273 TraceCheckUtils]: 1: Hoare triple {4357#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {4357#true} is VALID [2018-11-14 16:43:21,018 INFO L273 TraceCheckUtils]: 2: Hoare triple {4357#true} assume true; {4357#true} is VALID [2018-11-14 16:43:21,019 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4357#true} {4357#true} #215#return; {4357#true} is VALID [2018-11-14 16:43:21,019 INFO L256 TraceCheckUtils]: 4: Hoare triple {4357#true} call #t~ret8 := main(); {4357#true} is VALID [2018-11-14 16:43:21,019 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 16:43:21,020 INFO L273 TraceCheckUtils]: 6: Hoare triple {4357#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {4357#true} is VALID [2018-11-14 16:43:21,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {4357#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {4357#true} is VALID [2018-11-14 16:43:21,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {4357#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {4357#true} is VALID [2018-11-14 16:43:21,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {4357#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {4357#true} is VALID [2018-11-14 16:43:21,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {4357#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {4357#true} is VALID [2018-11-14 16:43:21,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {4357#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {4357#true} is VALID [2018-11-14 16:43:21,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {4357#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {4357#true} is VALID [2018-11-14 16:43:21,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {4357#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {4357#true} is VALID [2018-11-14 16:43:21,022 INFO L273 TraceCheckUtils]: 14: Hoare triple {4357#true} assume ~bvsge32(~main__scheme~0, 0bv32); {4357#true} is VALID [2018-11-14 16:43:21,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {4357#true} assume !(~main__scheme~0 == 0bv32); {4357#true} is VALID [2018-11-14 16:43:21,022 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 16:43:21,023 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 16:43:21,023 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 16:43:21,023 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 16:43:21,024 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 16:43:21,024 INFO L273 TraceCheckUtils]: 21: Hoare triple {4357#true} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {4357#true} is VALID [2018-11-14 16:43:21,024 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 16:43:21,025 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 16:43:21,025 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 16:43:21,026 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 16:43:21,026 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 16:43:21,026 INFO L273 TraceCheckUtils]: 27: Hoare triple {4358#false} assume ~__VERIFIER_assert__cond~6 == 0bv32; {4358#false} is VALID [2018-11-14 16:43:21,027 INFO L273 TraceCheckUtils]: 28: Hoare triple {4358#false} assume !false; {4358#false} is VALID [2018-11-14 16:43:21,028 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 16:43:21,028 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:21,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:21,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:43:21,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:43:21,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:21,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:43:21,076 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 16:43:21,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:43:21,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:43:21,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:43:21,077 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand 3 states. [2018-11-14 16:43:21,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:21,508 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-11-14 16:43:21,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:43:21,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-14 16:43:21,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:43:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-14 16:43:21,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:43:21,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2018-11-14 16:43:21,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2018-11-14 16:43:21,659 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 16:43:21,661 INFO L225 Difference]: With dead ends: 128 [2018-11-14 16:43:21,661 INFO L226 Difference]: Without dead ends: 88 [2018-11-14 16:43:21,662 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 16:43:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-14 16:43:21,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2018-11-14 16:43:21,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:21,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 84 states. [2018-11-14 16:43:21,728 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 84 states. [2018-11-14 16:43:21,729 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 84 states. [2018-11-14 16:43:21,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:21,732 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-14 16:43:21,732 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-14 16:43:21,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:21,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:21,732 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 88 states. [2018-11-14 16:43:21,733 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 88 states. [2018-11-14 16:43:21,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:21,736 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-11-14 16:43:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2018-11-14 16:43:21,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:21,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:21,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:21,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-14 16:43:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2018-11-14 16:43:21,754 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 29 [2018-11-14 16:43:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:21,754 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2018-11-14 16:43:21,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:43:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2018-11-14 16:43:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:43:21,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:21,755 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 16:43:21,756 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:21,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash 54388864, now seen corresponding path program 1 times [2018-11-14 16:43:21,756 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:21,756 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 16:43:21,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:21,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:22,107 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2018-11-14 16:43:22,521 INFO L256 TraceCheckUtils]: 0: Hoare triple {4859#true} call ULTIMATE.init(); {4859#true} is VALID [2018-11-14 16:43:22,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {4859#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {4859#true} is VALID [2018-11-14 16:43:22,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {4859#true} assume true; {4859#true} is VALID [2018-11-14 16:43:22,522 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4859#true} {4859#true} #215#return; {4859#true} is VALID [2018-11-14 16:43:22,522 INFO L256 TraceCheckUtils]: 4: Hoare triple {4859#true} call #t~ret8 := main(); {4859#true} is VALID [2018-11-14 16:43:22,522 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 16:43:22,523 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 16:43:22,523 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 16:43:22,524 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 16:43:22,524 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 16:43:22,525 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 16:43:22,525 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 16:43:22,526 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 16:43:22,527 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 16:43:22,527 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 16:43:22,528 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 16:43:22,562 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 16:43:22,565 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 16:43:22,565 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 16:43:22,578 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 16:43:22,578 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 16:43:22,579 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 16:43:22,590 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 16:43:22,591 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 16:43:22,592 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 16:43:22,592 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 16:43:22,593 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 16:43:22,617 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 16:43:22,618 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 16:43:22,618 INFO L273 TraceCheckUtils]: 29: Hoare triple {4860#false} assume !false; {4860#false} is VALID [2018-11-14 16:43:22,621 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 16:43:22,621 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:22,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:22,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-14 16:43:22,631 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-14 16:43:22,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:22,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:43:22,769 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 16:43:22,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:43:22,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:43:22,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:43:22,771 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand 12 states. [2018-11-14 16:43:24,757 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2018-11-14 16:43:25,996 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2018-11-14 16:43:26,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:26,169 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2018-11-14 16:43:26,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 16:43:26,170 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-14 16:43:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:43:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2018-11-14 16:43:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:43:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 84 transitions. [2018-11-14 16:43:26,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 84 transitions. [2018-11-14 16:43:26,650 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 16:43:26,652 INFO L225 Difference]: With dead ends: 89 [2018-11-14 16:43:26,652 INFO L226 Difference]: Without dead ends: 87 [2018-11-14 16:43:26,653 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 16:43:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-14 16:43:26,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2018-11-14 16:43:26,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:26,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 82 states. [2018-11-14 16:43:26,701 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 82 states. [2018-11-14 16:43:26,701 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 82 states. [2018-11-14 16:43:26,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:26,705 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-11-14 16:43:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-11-14 16:43:26,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:26,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:26,705 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 87 states. [2018-11-14 16:43:26,705 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 87 states. [2018-11-14 16:43:26,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:26,707 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-11-14 16:43:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2018-11-14 16:43:26,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:26,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:26,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:26,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:26,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 16:43:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-11-14 16:43:26,710 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 30 [2018-11-14 16:43:26,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:26,710 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-11-14 16:43:26,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:43:26,710 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-11-14 16:43:26,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:43:26,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:26,711 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 16:43:26,712 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:26,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:26,712 INFO L82 PathProgramCache]: Analyzing trace with hash -196719107, now seen corresponding path program 1 times [2018-11-14 16:43:26,712 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:26,713 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 16:43:26,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:26,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:27,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {5342#true} call ULTIMATE.init(); {5342#true} is VALID [2018-11-14 16:43:27,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {5342#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {5342#true} is VALID [2018-11-14 16:43:27,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {5342#true} assume true; {5342#true} is VALID [2018-11-14 16:43:27,773 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5342#true} {5342#true} #215#return; {5342#true} is VALID [2018-11-14 16:43:27,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {5342#true} call #t~ret8 := main(); {5342#true} is VALID [2018-11-14 16:43:27,774 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 16:43:27,775 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 16:43:27,776 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 16:43:27,778 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 16:43:27,778 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 16:43:27,779 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 16:43:27,779 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 16:43:27,780 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 16:43:27,780 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 16:43:27,781 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 16:43:27,781 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 16:43:27,785 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 16:43:27,786 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 16:43:27,787 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 16:43:27,794 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 16:43:27,795 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 16:43:27,795 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 16:43:27,804 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 16:43:27,804 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 16:43:27,805 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 16:43:27,843 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 16:43:27,844 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 16:43:27,894 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 16:43:27,895 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 16:43:27,895 INFO L273 TraceCheckUtils]: 29: Hoare triple {5343#false} assume !false; {5343#false} is VALID [2018-11-14 16:43:27,898 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 16:43:27,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:28,618 INFO L273 TraceCheckUtils]: 29: Hoare triple {5343#false} assume !false; {5343#false} is VALID [2018-11-14 16:43:28,619 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 16:43:28,620 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 16:43:28,621 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 16:43:28,622 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 16:43:28,623 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 16:43:28,623 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 16:43:28,641 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 16:43:28,641 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 16:43:28,642 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 16:43:28,666 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 16:43:28,667 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 16:43:28,667 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 16:43:28,667 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 16:43:28,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {5342#true} assume !(~main__scheme~0 == 0bv32); {5342#true} is VALID [2018-11-14 16:43:28,667 INFO L273 TraceCheckUtils]: 14: Hoare triple {5342#true} assume ~bvsge32(~main__scheme~0, 0bv32); {5342#true} is VALID [2018-11-14 16:43:28,668 INFO L273 TraceCheckUtils]: 13: Hoare triple {5342#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {5342#true} is VALID [2018-11-14 16:43:28,668 INFO L273 TraceCheckUtils]: 12: Hoare triple {5342#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {5342#true} is VALID [2018-11-14 16:43:28,668 INFO L273 TraceCheckUtils]: 11: Hoare triple {5342#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {5342#true} is VALID [2018-11-14 16:43:28,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {5342#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {5342#true} is VALID [2018-11-14 16:43:28,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {5342#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {5342#true} is VALID [2018-11-14 16:43:28,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {5342#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {5342#true} is VALID [2018-11-14 16:43:28,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {5342#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {5342#true} is VALID [2018-11-14 16:43:28,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {5342#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {5342#true} is VALID [2018-11-14 16:43:28,669 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 16:43:28,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {5342#true} call #t~ret8 := main(); {5342#true} is VALID [2018-11-14 16:43:28,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5342#true} {5342#true} #215#return; {5342#true} is VALID [2018-11-14 16:43:28,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {5342#true} assume true; {5342#true} is VALID [2018-11-14 16:43:28,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {5342#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {5342#true} is VALID [2018-11-14 16:43:28,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {5342#true} call ULTIMATE.init(); {5342#true} is VALID [2018-11-14 16:43:28,672 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 16:43:28,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:28,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-11-14 16:43:28,674 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-14 16:43:28,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:28,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:43:28,898 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 16:43:28,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:43:28,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:43:28,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:43:28,899 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 16 states. [2018-11-14 16:43:30,329 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-11-14 16:43:30,556 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-14 16:43:31,933 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-11-14 16:43:34,674 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-14 16:43:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:36,242 INFO L93 Difference]: Finished difference Result 123 states and 127 transitions. [2018-11-14 16:43:36,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:43:36,243 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-14 16:43:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:36,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:43:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2018-11-14 16:43:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:43:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2018-11-14 16:43:36,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 127 transitions. [2018-11-14 16:43:37,264 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 16:43:37,267 INFO L225 Difference]: With dead ends: 123 [2018-11-14 16:43:37,267 INFO L226 Difference]: Without dead ends: 121 [2018-11-14 16:43:37,268 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:43:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-14 16:43:37,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 80. [2018-11-14 16:43:37,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:37,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 80 states. [2018-11-14 16:43:37,322 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 80 states. [2018-11-14 16:43:37,323 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 80 states. [2018-11-14 16:43:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:37,326 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 16:43:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 16:43:37,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:37,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:37,327 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 121 states. [2018-11-14 16:43:37,327 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 121 states. [2018-11-14 16:43:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:37,330 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-11-14 16:43:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2018-11-14 16:43:37,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:37,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:37,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:37,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:37,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 16:43:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2018-11-14 16:43:37,332 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 30 [2018-11-14 16:43:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:37,333 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2018-11-14 16:43:37,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:43:37,333 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2018-11-14 16:43:37,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:43:37,334 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:37,334 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 16:43:37,334 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:37,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:37,335 INFO L82 PathProgramCache]: Analyzing trace with hash -192985298, now seen corresponding path program 1 times [2018-11-14 16:43:37,335 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:37,335 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 16:43:37,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:37,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:37,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:38,110 INFO L256 TraceCheckUtils]: 0: Hoare triple {6024#true} call ULTIMATE.init(); {6024#true} is VALID [2018-11-14 16:43:38,110 INFO L273 TraceCheckUtils]: 1: Hoare triple {6024#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {6024#true} is VALID [2018-11-14 16:43:38,111 INFO L273 TraceCheckUtils]: 2: Hoare triple {6024#true} assume true; {6024#true} is VALID [2018-11-14 16:43:38,111 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6024#true} {6024#true} #215#return; {6024#true} is VALID [2018-11-14 16:43:38,111 INFO L256 TraceCheckUtils]: 4: Hoare triple {6024#true} call #t~ret8 := main(); {6024#true} is VALID [2018-11-14 16:43:38,111 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 16:43:38,111 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 16:43:38,112 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 16:43:38,112 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 16:43:38,112 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 16:43:38,113 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 16:43:38,113 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 16:43:38,114 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 16:43:38,114 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 16:43:38,115 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 16:43:38,116 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 16:43:38,119 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 16:43:38,120 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 16:43:38,121 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 16:43:38,128 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 16:43:38,129 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 16:43:38,130 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 16:43:38,130 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 16:43:38,131 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 16:43:38,132 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 16:43:38,156 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 16:43:38,157 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 16:43:38,163 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 16:43:38,164 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 16:43:38,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {6025#false} assume !false; {6025#false} is VALID [2018-11-14 16:43:38,166 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 16:43:38,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:38,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {6025#false} assume !false; {6025#false} is VALID [2018-11-14 16:43:38,691 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 16:43:38,692 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 16:43:38,692 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 16:43:38,711 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 16:43:38,711 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 16:43:38,712 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 16:43:38,712 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 16:43:38,712 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 16:43:38,713 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 16:43:38,729 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 16:43:38,729 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 16:43:38,729 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 16:43:38,729 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 16:43:38,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {6024#true} assume !(~main__scheme~0 == 0bv32); {6024#true} is VALID [2018-11-14 16:43:38,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {6024#true} assume ~bvsge32(~main__scheme~0, 0bv32); {6024#true} is VALID [2018-11-14 16:43:38,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {6024#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {6024#true} is VALID [2018-11-14 16:43:38,730 INFO L273 TraceCheckUtils]: 12: Hoare triple {6024#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {6024#true} is VALID [2018-11-14 16:43:38,730 INFO L273 TraceCheckUtils]: 11: Hoare triple {6024#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {6024#true} is VALID [2018-11-14 16:43:38,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {6024#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {6024#true} is VALID [2018-11-14 16:43:38,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {6024#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {6024#true} is VALID [2018-11-14 16:43:38,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {6024#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {6024#true} is VALID [2018-11-14 16:43:38,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {6024#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {6024#true} is VALID [2018-11-14 16:43:38,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {6024#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {6024#true} is VALID [2018-11-14 16:43:38,731 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 16:43:38,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {6024#true} call #t~ret8 := main(); {6024#true} is VALID [2018-11-14 16:43:38,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6024#true} {6024#true} #215#return; {6024#true} is VALID [2018-11-14 16:43:38,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {6024#true} assume true; {6024#true} is VALID [2018-11-14 16:43:38,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {6024#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {6024#true} is VALID [2018-11-14 16:43:38,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {6024#true} call ULTIMATE.init(); {6024#true} is VALID [2018-11-14 16:43:38,733 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 16:43:38,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:38,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-11-14 16:43:38,737 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-14 16:43:38,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:38,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:43:38,871 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 16:43:38,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:43:38,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:43:38,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:43:38,872 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 16 states. [2018-11-14 16:43:45,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:45,653 INFO L93 Difference]: Finished difference Result 188 states and 196 transitions. [2018-11-14 16:43:45,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 16:43:45,653 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-14 16:43:45,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:45,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:43:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 196 transitions. [2018-11-14 16:43:45,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:43:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 196 transitions. [2018-11-14 16:43:45,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 196 transitions. [2018-11-14 16:43:46,388 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 16:43:46,391 INFO L225 Difference]: With dead ends: 188 [2018-11-14 16:43:46,391 INFO L226 Difference]: Without dead ends: 186 [2018-11-14 16:43:46,392 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 16:43:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-14 16:43:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 80. [2018-11-14 16:43:46,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:46,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 80 states. [2018-11-14 16:43:46,675 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 80 states. [2018-11-14 16:43:46,675 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 80 states. [2018-11-14 16:43:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:46,679 INFO L93 Difference]: Finished difference Result 186 states and 193 transitions. [2018-11-14 16:43:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 193 transitions. [2018-11-14 16:43:46,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:46,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:46,680 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 186 states. [2018-11-14 16:43:46,680 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 186 states. [2018-11-14 16:43:46,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:46,685 INFO L93 Difference]: Finished difference Result 186 states and 193 transitions. [2018-11-14 16:43:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 193 transitions. [2018-11-14 16:43:46,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:46,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:46,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:46,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 16:43:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2018-11-14 16:43:46,688 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 30 [2018-11-14 16:43:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:46,688 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2018-11-14 16:43:46,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:43:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2018-11-14 16:43:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:43:46,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:46,689 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 16:43:46,690 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:46,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:46,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1686057932, now seen corresponding path program 1 times [2018-11-14 16:43:46,691 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:46,691 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 16:43:46,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:46,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:47,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {6924#true} call ULTIMATE.init(); {6924#true} is VALID [2018-11-14 16:43:47,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {6924#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {6924#true} is VALID [2018-11-14 16:43:47,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {6924#true} assume true; {6924#true} is VALID [2018-11-14 16:43:47,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6924#true} {6924#true} #215#return; {6924#true} is VALID [2018-11-14 16:43:47,343 INFO L256 TraceCheckUtils]: 4: Hoare triple {6924#true} call #t~ret8 := main(); {6924#true} is VALID [2018-11-14 16:43:47,343 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 16:43:47,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {6924#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {6924#true} is VALID [2018-11-14 16:43:47,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {6924#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {6924#true} is VALID [2018-11-14 16:43:47,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {6924#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {6924#true} is VALID [2018-11-14 16:43:47,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {6924#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {6924#true} is VALID [2018-11-14 16:43:47,344 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 16:43:47,345 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 16:43:47,345 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 16:43:47,348 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 16:43:47,352 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 16:43:47,361 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 16:43:47,363 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 16:43:47,364 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 16:43:47,365 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 16:43:47,365 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 16:43:47,366 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 16:43:47,366 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 16:43:47,367 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 16:43:47,367 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 16:43:47,368 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 16:43:47,369 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 16:43:47,370 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 16:43:47,370 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 16:43:47,372 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 16:43:47,373 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 16:43:47,373 INFO L273 TraceCheckUtils]: 30: Hoare triple {6925#false} assume !false; {6925#false} is VALID [2018-11-14 16:43:47,375 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 16:43:47,375 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:43:47,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:43:47,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-14 16:43:47,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-14 16:43:47,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:47,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:43:47,416 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 16:43:47,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:43:47,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:43:47,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:43:47,418 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 6 states. [2018-11-14 16:43:48,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:48,234 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-11-14 16:43:48,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:43:48,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-14 16:43:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:43:48,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2018-11-14 16:43:48,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:43:48,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2018-11-14 16:43:48,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 117 transitions. [2018-11-14 16:43:48,430 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 16:43:48,432 INFO L225 Difference]: With dead ends: 115 [2018-11-14 16:43:48,433 INFO L226 Difference]: Without dead ends: 113 [2018-11-14 16:43:48,433 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 16:43:48,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-14 16:43:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 83. [2018-11-14 16:43:48,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:43:48,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 83 states. [2018-11-14 16:43:48,491 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 83 states. [2018-11-14 16:43:48,491 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 83 states. [2018-11-14 16:43:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:48,493 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-11-14 16:43:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-11-14 16:43:48,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:48,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:48,494 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand 113 states. [2018-11-14 16:43:48,494 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 113 states. [2018-11-14 16:43:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:43:48,497 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-11-14 16:43:48,497 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2018-11-14 16:43:48,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:43:48,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:43:48,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:43:48,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:43:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-14 16:43:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 87 transitions. [2018-11-14 16:43:48,500 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 87 transitions. Word has length 31 [2018-11-14 16:43:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:43:48,500 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 87 transitions. [2018-11-14 16:43:48,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:43:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 87 transitions. [2018-11-14 16:43:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:43:48,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:43:48,501 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 16:43:48,502 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:43:48,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:43:48,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1806773561, now seen corresponding path program 1 times [2018-11-14 16:43:48,502 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:43:48,502 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 16:43:48,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:43:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:43:48,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:43:49,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {7474#true} call ULTIMATE.init(); {7474#true} is VALID [2018-11-14 16:43:49,460 INFO L273 TraceCheckUtils]: 1: Hoare triple {7474#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {7474#true} is VALID [2018-11-14 16:43:49,461 INFO L273 TraceCheckUtils]: 2: Hoare triple {7474#true} assume true; {7474#true} is VALID [2018-11-14 16:43:49,461 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7474#true} {7474#true} #215#return; {7474#true} is VALID [2018-11-14 16:43:49,461 INFO L256 TraceCheckUtils]: 4: Hoare triple {7474#true} call #t~ret8 := main(); {7474#true} is VALID [2018-11-14 16:43:49,461 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 16:43:49,462 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 16:43:49,462 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 16:43:49,463 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 16:43:49,463 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 16:43:49,464 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 16:43:49,464 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 16:43:49,465 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 16:43:49,465 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 16:43:49,466 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 16:43:49,466 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 16:43:49,470 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 16:43:49,471 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 16:43:49,471 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 16:43:49,478 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 16:43:49,479 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 16:43:49,480 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 16:43:49,487 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 16:43:49,488 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 16:43:49,489 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 16:43:49,521 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 16:43:49,522 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 16:43:49,522 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 16:43:49,566 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 16:43:49,568 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 16:43:49,568 INFO L273 TraceCheckUtils]: 30: Hoare triple {7475#false} assume !false; {7475#false} is VALID [2018-11-14 16:43:49,571 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 16:43:49,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:43:50,019 INFO L273 TraceCheckUtils]: 30: Hoare triple {7475#false} assume !false; {7475#false} is VALID [2018-11-14 16:43:50,020 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 16:43:50,021 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 16:43:50,021 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 16:43:50,023 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 16:43:50,024 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 16:43:50,024 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 16:43:50,025 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 16:43:50,047 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 16:43:50,047 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 16:43:50,048 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 16:43:50,115 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 16:43:50,116 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 16:43:50,116 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 16:43:50,116 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 16:43:50,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {7474#true} assume !(~main__scheme~0 == 0bv32); {7474#true} is VALID [2018-11-14 16:43:50,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {7474#true} assume ~bvsge32(~main__scheme~0, 0bv32); {7474#true} is VALID [2018-11-14 16:43:50,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {7474#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {7474#true} is VALID [2018-11-14 16:43:50,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {7474#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {7474#true} is VALID [2018-11-14 16:43:50,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {7474#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {7474#true} is VALID [2018-11-14 16:43:50,117 INFO L273 TraceCheckUtils]: 10: Hoare triple {7474#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {7474#true} is VALID [2018-11-14 16:43:50,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {7474#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {7474#true} is VALID [2018-11-14 16:43:50,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {7474#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {7474#true} is VALID [2018-11-14 16:43:50,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {7474#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {7474#true} is VALID [2018-11-14 16:43:50,117 INFO L273 TraceCheckUtils]: 6: Hoare triple {7474#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {7474#true} is VALID [2018-11-14 16:43:50,117 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 16:43:50,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {7474#true} call #t~ret8 := main(); {7474#true} is VALID [2018-11-14 16:43:50,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7474#true} {7474#true} #215#return; {7474#true} is VALID [2018-11-14 16:43:50,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {7474#true} assume true; {7474#true} is VALID [2018-11-14 16:43:50,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {7474#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {7474#true} is VALID [2018-11-14 16:43:50,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {7474#true} call ULTIMATE.init(); {7474#true} is VALID [2018-11-14 16:43:50,119 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 16:43:50,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:43:50,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-11-14 16:43:50,121 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-14 16:43:50,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:43:50,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 16:43:50,350 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 16:43:50,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 16:43:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 16:43:50,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:43:50,351 INFO L87 Difference]: Start difference. First operand 83 states and 87 transitions. Second operand 16 states. [2018-11-14 16:43:51,834 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-14 16:43:52,218 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 25 [2018-11-14 16:43:52,670 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2018-11-14 16:43:52,940 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2018-11-14 16:44:02,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:02,757 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2018-11-14 16:44:02,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 16:44:02,758 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-11-14 16:44:02,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:02,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:44:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2018-11-14 16:44:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 16:44:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 90 transitions. [2018-11-14 16:44:02,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 90 transitions. [2018-11-14 16:44:03,722 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 16:44:03,724 INFO L225 Difference]: With dead ends: 87 [2018-11-14 16:44:03,724 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 16:44:03,724 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 16:44:03,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 16:44:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2018-11-14 16:44:03,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:03,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 81 states. [2018-11-14 16:44:03,787 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 81 states. [2018-11-14 16:44:03,787 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 81 states. [2018-11-14 16:44:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:03,790 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-14 16:44:03,790 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-14 16:44:03,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:03,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:03,791 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 85 states. [2018-11-14 16:44:03,791 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 85 states. [2018-11-14 16:44:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:03,793 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-11-14 16:44:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2018-11-14 16:44:03,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:03,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:03,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:03,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:03,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-14 16:44:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2018-11-14 16:44:03,796 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 31 [2018-11-14 16:44:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:03,796 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2018-11-14 16:44:03,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 16:44:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2018-11-14 16:44:03,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:44:03,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:03,797 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 16:44:03,798 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:03,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:03,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1803321781, now seen corresponding path program 1 times [2018-11-14 16:44:03,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:03,798 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 16:44:03,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:03,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:04,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {8052#true} call ULTIMATE.init(); {8052#true} is VALID [2018-11-14 16:44:04,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {8052#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {8052#true} is VALID [2018-11-14 16:44:04,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {8052#true} assume true; {8052#true} is VALID [2018-11-14 16:44:04,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8052#true} {8052#true} #215#return; {8052#true} is VALID [2018-11-14 16:44:04,343 INFO L256 TraceCheckUtils]: 4: Hoare triple {8052#true} call #t~ret8 := main(); {8052#true} is VALID [2018-11-14 16:44:04,343 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 16:44:04,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {8052#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {8052#true} is VALID [2018-11-14 16:44:04,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {8052#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {8052#true} is VALID [2018-11-14 16:44:04,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {8052#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {8052#true} is VALID [2018-11-14 16:44:04,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {8052#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {8052#true} is VALID [2018-11-14 16:44:04,344 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 16:44:04,345 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 16:44:04,345 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 16:44:04,346 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 16:44:04,346 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 16:44:04,346 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 16:44:04,349 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 16:44:04,350 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 16:44:04,368 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 16:44:04,375 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 16:44:04,375 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 16:44:04,376 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 16:44:04,376 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 16:44:04,377 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 16:44:04,377 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 16:44:04,383 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 16:44:04,383 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 16:44:04,384 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 16:44:04,385 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 16:44:04,386 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 16:44:04,386 INFO L273 TraceCheckUtils]: 30: Hoare triple {8053#false} assume !false; {8053#false} is VALID [2018-11-14 16:44:04,388 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 16:44:04,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:04,541 INFO L273 TraceCheckUtils]: 30: Hoare triple {8053#false} assume !false; {8053#false} is VALID [2018-11-14 16:44:04,542 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 16:44:04,543 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 16:44:04,544 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 16:44:04,544 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 16:44:04,545 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 16:44:04,545 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 16:44:04,546 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 16:44:04,547 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 16:44:04,547 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 16:44:04,548 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 16:44:04,548 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 16:44:04,565 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 16:44:04,574 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 16:44:04,589 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 16:44:04,596 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 16:44:04,597 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 16:44:04,597 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 16:44:04,597 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 16:44:04,613 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 16:44:04,614 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 16:44:04,614 INFO L273 TraceCheckUtils]: 9: Hoare triple {8052#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {8052#true} is VALID [2018-11-14 16:44:04,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {8052#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {8052#true} is VALID [2018-11-14 16:44:04,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {8052#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {8052#true} is VALID [2018-11-14 16:44:04,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {8052#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {8052#true} is VALID [2018-11-14 16:44:04,615 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 16:44:04,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {8052#true} call #t~ret8 := main(); {8052#true} is VALID [2018-11-14 16:44:04,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8052#true} {8052#true} #215#return; {8052#true} is VALID [2018-11-14 16:44:04,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {8052#true} assume true; {8052#true} is VALID [2018-11-14 16:44:04,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {8052#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {8052#true} is VALID [2018-11-14 16:44:04,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {8052#true} call ULTIMATE.init(); {8052#true} is VALID [2018-11-14 16:44:04,616 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 16:44:04,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:04,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:44:04,618 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 16:44:04,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:04,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:44:04,693 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 16:44:04,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:44:04,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:44:04,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:44:04,695 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 12 states. [2018-11-14 16:44:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:08,207 INFO L93 Difference]: Finished difference Result 381 states and 404 transitions. [2018-11-14 16:44:08,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 16:44:08,207 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 16:44:08,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:44:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 389 transitions. [2018-11-14 16:44:08,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:44:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 389 transitions. [2018-11-14 16:44:08,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 389 transitions. [2018-11-14 16:44:09,197 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 16:44:09,208 INFO L225 Difference]: With dead ends: 381 [2018-11-14 16:44:09,208 INFO L226 Difference]: Without dead ends: 379 [2018-11-14 16:44:09,210 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 16:44:09,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-11-14 16:44:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 93. [2018-11-14 16:44:09,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:09,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand 93 states. [2018-11-14 16:44:09,294 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand 93 states. [2018-11-14 16:44:09,294 INFO L87 Difference]: Start difference. First operand 379 states. Second operand 93 states. [2018-11-14 16:44:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:09,305 INFO L93 Difference]: Finished difference Result 379 states and 400 transitions. [2018-11-14 16:44:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 400 transitions. [2018-11-14 16:44:09,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:09,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:09,306 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 379 states. [2018-11-14 16:44:09,307 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 379 states. [2018-11-14 16:44:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:09,318 INFO L93 Difference]: Finished difference Result 379 states and 400 transitions. [2018-11-14 16:44:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 400 transitions. [2018-11-14 16:44:09,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:09,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:09,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:09,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:09,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-14 16:44:09,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2018-11-14 16:44:09,322 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 31 [2018-11-14 16:44:09,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:09,322 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2018-11-14 16:44:09,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:44:09,322 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2018-11-14 16:44:09,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 16:44:09,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:09,323 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 16:44:09,324 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:09,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:09,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1687573812, now seen corresponding path program 1 times [2018-11-14 16:44:09,324 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:09,324 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 16:44:09,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:09,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:09,881 INFO L256 TraceCheckUtils]: 0: Hoare triple {9564#true} call ULTIMATE.init(); {9564#true} is VALID [2018-11-14 16:44:09,881 INFO L273 TraceCheckUtils]: 1: Hoare triple {9564#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {9564#true} is VALID [2018-11-14 16:44:09,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {9564#true} assume true; {9564#true} is VALID [2018-11-14 16:44:09,882 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9564#true} {9564#true} #215#return; {9564#true} is VALID [2018-11-14 16:44:09,882 INFO L256 TraceCheckUtils]: 4: Hoare triple {9564#true} call #t~ret8 := main(); {9564#true} is VALID [2018-11-14 16:44:09,882 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 16:44:09,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {9564#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {9564#true} is VALID [2018-11-14 16:44:09,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {9564#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {9564#true} is VALID [2018-11-14 16:44:09,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {9564#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {9564#true} is VALID [2018-11-14 16:44:09,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {9564#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {9564#true} is VALID [2018-11-14 16:44:09,883 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 16:44:09,883 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 16:44:09,883 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 16:44:09,884 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 16:44:09,884 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 16:44:09,885 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 16:44:09,887 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 16:44:09,887 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 16:44:09,888 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 16:44:09,888 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 16:44:09,889 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 16:44:09,889 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 16:44:09,890 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 16:44:09,890 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 16:44:09,890 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 16:44:09,897 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 16:44:09,898 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 16:44:09,899 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 16:44:09,900 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 16:44:09,900 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 16:44:09,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {9565#false} assume !false; {9565#false} is VALID [2018-11-14 16:44:09,902 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 16:44:09,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:10,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {9565#false} assume !false; {9565#false} is VALID [2018-11-14 16:44:10,034 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 16:44:10,035 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 16:44:10,036 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 16:44:10,036 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 16:44:10,037 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 16:44:10,038 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 16:44:10,038 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 16:44:10,039 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 16:44:10,039 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 16:44:10,040 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 16:44:10,040 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 16:44:10,041 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 16:44:10,041 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 16:44:10,045 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 16:44:10,046 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 16:44:10,046 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 16:44:10,047 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 16:44:10,047 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 16:44:10,048 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 16:44:10,048 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 16:44:10,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {9564#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {9564#true} is VALID [2018-11-14 16:44:10,049 INFO L273 TraceCheckUtils]: 8: Hoare triple {9564#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {9564#true} is VALID [2018-11-14 16:44:10,049 INFO L273 TraceCheckUtils]: 7: Hoare triple {9564#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {9564#true} is VALID [2018-11-14 16:44:10,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {9564#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {9564#true} is VALID [2018-11-14 16:44:10,049 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 16:44:10,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {9564#true} call #t~ret8 := main(); {9564#true} is VALID [2018-11-14 16:44:10,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9564#true} {9564#true} #215#return; {9564#true} is VALID [2018-11-14 16:44:10,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {9564#true} assume true; {9564#true} is VALID [2018-11-14 16:44:10,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {9564#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {9564#true} is VALID [2018-11-14 16:44:10,050 INFO L256 TraceCheckUtils]: 0: Hoare triple {9564#true} call ULTIMATE.init(); {9564#true} is VALID [2018-11-14 16:44:10,052 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 16:44:10,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:10,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:44:10,054 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 16:44:10,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:10,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:44:10,130 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 16:44:10,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:44:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:44:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:44:10,131 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand 12 states. [2018-11-14 16:44:13,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:13,412 INFO L93 Difference]: Finished difference Result 292 states and 310 transitions. [2018-11-14 16:44:13,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 16:44:13,412 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 16:44:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:13,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:44:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 298 transitions. [2018-11-14 16:44:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:44:13,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 298 transitions. [2018-11-14 16:44:13,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 298 transitions. [2018-11-14 16:44:13,915 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 16:44:13,920 INFO L225 Difference]: With dead ends: 292 [2018-11-14 16:44:13,920 INFO L226 Difference]: Without dead ends: 281 [2018-11-14 16:44:13,921 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:44:13,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-11-14 16:44:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 96. [2018-11-14 16:44:14,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:14,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand 96 states. [2018-11-14 16:44:14,052 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand 96 states. [2018-11-14 16:44:14,052 INFO L87 Difference]: Start difference. First operand 281 states. Second operand 96 states. [2018-11-14 16:44:14,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:14,059 INFO L93 Difference]: Finished difference Result 281 states and 294 transitions. [2018-11-14 16:44:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 294 transitions. [2018-11-14 16:44:14,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:14,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:14,060 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 281 states. [2018-11-14 16:44:14,060 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 281 states. [2018-11-14 16:44:14,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:14,066 INFO L93 Difference]: Finished difference Result 281 states and 294 transitions. [2018-11-14 16:44:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 294 transitions. [2018-11-14 16:44:14,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:14,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:14,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:14,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:14,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-14 16:44:14,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2018-11-14 16:44:14,069 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 31 [2018-11-14 16:44:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:14,069 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2018-11-14 16:44:14,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:44:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2018-11-14 16:44:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 16:44:14,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:14,070 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 16:44:14,070 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:14,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:14,071 INFO L82 PathProgramCache]: Analyzing trace with hash -287576151, now seen corresponding path program 1 times [2018-11-14 16:44:14,071 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:14,071 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 16:44:14,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:14,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:14,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {10786#true} call ULTIMATE.init(); {10786#true} is VALID [2018-11-14 16:44:14,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {10786#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {10786#true} is VALID [2018-11-14 16:44:14,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {10786#true} assume true; {10786#true} is VALID [2018-11-14 16:44:14,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10786#true} {10786#true} #215#return; {10786#true} is VALID [2018-11-14 16:44:14,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {10786#true} call #t~ret8 := main(); {10786#true} is VALID [2018-11-14 16:44:14,676 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 16:44:14,677 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 16:44:14,677 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 16:44:14,678 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 16:44:14,678 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 16:44:14,678 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 16:44:14,679 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 16:44:14,679 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 16:44:14,680 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 16:44:14,681 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 16:44:14,681 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 16:44:14,685 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 16:44:14,686 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 16:44:14,686 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 16:44:14,687 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 16:44:14,688 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 16:44:14,689 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 16:44:14,689 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 16:44:14,690 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 16:44:14,691 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 16:44:14,692 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 16:44:14,692 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 16:44:14,696 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 16:44:14,699 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 16:44:14,699 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 16:44:14,721 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 16:44:14,722 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 16:44:14,723 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 16:44:14,723 INFO L273 TraceCheckUtils]: 33: Hoare triple {10787#false} assume !false; {10787#false} is VALID [2018-11-14 16:44:14,725 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 16:44:14,725 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:14,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:14,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-14 16:44:14,727 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-14 16:44:14,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:14,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 16:44:14,782 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 16:44:14,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 16:44:14,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 16:44:14,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-11-14 16:44:14,783 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand 13 states. [2018-11-14 16:44:16,112 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2018-11-14 16:44:16,978 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2018-11-14 16:44:17,286 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2018-11-14 16:44:18,400 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-11-14 16:44:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:19,821 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2018-11-14 16:44:19,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:44:19,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-11-14 16:44:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:19,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:44:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 110 transitions. [2018-11-14 16:44:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 16:44:19,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 110 transitions. [2018-11-14 16:44:19,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 110 transitions. [2018-11-14 16:44:20,202 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 16:44:20,203 INFO L225 Difference]: With dead ends: 121 [2018-11-14 16:44:20,204 INFO L226 Difference]: Without dead ends: 119 [2018-11-14 16:44:20,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2018-11-14 16:44:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-14 16:44:20,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 94. [2018-11-14 16:44:20,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:20,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 94 states. [2018-11-14 16:44:20,291 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 94 states. [2018-11-14 16:44:20,291 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 94 states. [2018-11-14 16:44:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:20,294 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-11-14 16:44:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-11-14 16:44:20,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:20,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:20,295 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 119 states. [2018-11-14 16:44:20,296 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 119 states. [2018-11-14 16:44:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:20,298 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2018-11-14 16:44:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-11-14 16:44:20,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:20,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:20,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:20,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:20,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 16:44:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-11-14 16:44:20,300 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 34 [2018-11-14 16:44:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:20,301 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-11-14 16:44:20,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 16:44:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-11-14 16:44:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 16:44:20,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:20,301 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 16:44:20,302 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:20,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash -324922921, now seen corresponding path program 1 times [2018-11-14 16:44:20,303 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:20,303 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 16:44:20,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:20,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:20,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {11405#true} call ULTIMATE.init(); {11405#true} is VALID [2018-11-14 16:44:20,670 INFO L273 TraceCheckUtils]: 1: Hoare triple {11405#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {11405#true} is VALID [2018-11-14 16:44:20,670 INFO L273 TraceCheckUtils]: 2: Hoare triple {11405#true} assume true; {11405#true} is VALID [2018-11-14 16:44:20,670 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11405#true} {11405#true} #215#return; {11405#true} is VALID [2018-11-14 16:44:20,670 INFO L256 TraceCheckUtils]: 4: Hoare triple {11405#true} call #t~ret8 := main(); {11405#true} is VALID [2018-11-14 16:44:20,671 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 16:44:20,671 INFO L273 TraceCheckUtils]: 6: Hoare triple {11405#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {11405#true} is VALID [2018-11-14 16:44:20,671 INFO L273 TraceCheckUtils]: 7: Hoare triple {11405#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {11405#true} is VALID [2018-11-14 16:44:20,671 INFO L273 TraceCheckUtils]: 8: Hoare triple {11405#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {11405#true} is VALID [2018-11-14 16:44:20,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {11405#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {11405#true} is VALID [2018-11-14 16:44:20,671 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 16:44:20,672 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 16:44:20,672 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 16:44:20,672 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 16:44:20,673 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 16:44:20,673 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 16:44:20,676 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 16:44:20,676 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 16:44:20,677 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 16:44:20,678 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 16:44:20,682 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 16:44:20,683 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 16:44:20,684 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 16:44:20,684 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 16:44:20,684 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 16:44:20,685 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 16:44:20,685 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 16:44:20,686 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 16:44:20,686 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 16:44:20,687 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 16:44:20,696 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 16:44:20,696 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 16:44:20,698 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 16:44:20,698 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 16:44:20,699 INFO L273 TraceCheckUtils]: 34: Hoare triple {11406#false} assume !false; {11406#false} is VALID [2018-11-14 16:44:20,701 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 16:44:20,701 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:20,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:20,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 16:44:20,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-14 16:44:20,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:20,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:44:20,759 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 16:44:20,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:44:20,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:44:20,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:20,760 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 7 states. [2018-11-14 16:44:22,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:22,500 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-11-14 16:44:22,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:44:22,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2018-11-14 16:44:22,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:22,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2018-11-14 16:44:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:44:22,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 146 transitions. [2018-11-14 16:44:22,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 146 transitions. [2018-11-14 16:44:23,109 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 16:44:23,111 INFO L225 Difference]: With dead ends: 153 [2018-11-14 16:44:23,112 INFO L226 Difference]: Without dead ends: 151 [2018-11-14 16:44:23,112 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 16:44:23,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-14 16:44:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 98. [2018-11-14 16:44:23,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:23,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 98 states. [2018-11-14 16:44:23,233 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 98 states. [2018-11-14 16:44:23,233 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 98 states. [2018-11-14 16:44:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:23,235 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-14 16:44:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-11-14 16:44:23,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:23,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:23,237 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 151 states. [2018-11-14 16:44:23,237 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 151 states. [2018-11-14 16:44:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:23,240 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-11-14 16:44:23,240 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2018-11-14 16:44:23,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:23,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:23,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:23,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 16:44:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-11-14 16:44:23,242 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 35 [2018-11-14 16:44:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:23,243 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-11-14 16:44:23,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:44:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-11-14 16:44:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 16:44:23,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:23,244 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 16:44:23,244 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:23,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:23,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1565027795, now seen corresponding path program 1 times [2018-11-14 16:44:23,245 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:23,245 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 16:44:23,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:23,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:23,510 INFO L256 TraceCheckUtils]: 0: Hoare triple {12110#true} call ULTIMATE.init(); {12110#true} is VALID [2018-11-14 16:44:23,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {12110#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {12110#true} is VALID [2018-11-14 16:44:23,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {12110#true} assume true; {12110#true} is VALID [2018-11-14 16:44:23,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12110#true} {12110#true} #215#return; {12110#true} is VALID [2018-11-14 16:44:23,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {12110#true} call #t~ret8 := main(); {12110#true} is VALID [2018-11-14 16:44:23,511 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 16:44:23,511 INFO L273 TraceCheckUtils]: 6: Hoare triple {12110#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {12110#true} is VALID [2018-11-14 16:44:23,511 INFO L273 TraceCheckUtils]: 7: Hoare triple {12110#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {12110#true} is VALID [2018-11-14 16:44:23,511 INFO L273 TraceCheckUtils]: 8: Hoare triple {12110#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {12110#true} is VALID [2018-11-14 16:44:23,511 INFO L273 TraceCheckUtils]: 9: Hoare triple {12110#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {12110#true} is VALID [2018-11-14 16:44:23,528 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 16:44:23,536 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 16:44:23,537 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 16:44:23,537 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 16:44:23,538 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 16:44:23,538 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 16:44:23,540 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 16:44:23,541 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 16:44:23,542 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 16:44:23,542 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 16:44:23,543 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 16:44:23,543 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 16:44:23,543 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 16:44:23,544 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 16:44:23,544 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 16:44:23,551 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 16:44:23,552 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 16:44:23,552 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 16:44:23,553 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 16:44:23,553 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 16:44:23,554 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 16:44:23,554 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 16:44:23,556 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 16:44:23,557 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 16:44:23,557 INFO L273 TraceCheckUtils]: 34: Hoare triple {12111#false} assume !false; {12111#false} is VALID [2018-11-14 16:44:23,560 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 16:44:23,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:23,681 INFO L273 TraceCheckUtils]: 34: Hoare triple {12111#false} assume !false; {12111#false} is VALID [2018-11-14 16:44:23,682 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 16:44:23,683 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 16:44:23,683 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 16:44:23,684 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 16:44:23,684 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 16:44:23,685 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 16:44:23,685 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 16:44:23,686 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 16:44:23,689 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 16:44:23,690 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 16:44:23,690 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 16:44:23,691 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 16:44:23,691 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 16:44:23,692 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 16:44:23,692 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 16:44:23,692 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 16:44:23,693 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 16:44:23,696 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 16:44:23,697 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 16:44:23,697 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 16:44:23,698 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 16:44:23,698 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 16:44:23,698 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 16:44:23,699 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 16:44:23,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {12110#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {12110#true} is VALID [2018-11-14 16:44:23,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {12110#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {12110#true} is VALID [2018-11-14 16:44:23,700 INFO L273 TraceCheckUtils]: 7: Hoare triple {12110#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {12110#true} is VALID [2018-11-14 16:44:23,700 INFO L273 TraceCheckUtils]: 6: Hoare triple {12110#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {12110#true} is VALID [2018-11-14 16:44:23,700 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 16:44:23,701 INFO L256 TraceCheckUtils]: 4: Hoare triple {12110#true} call #t~ret8 := main(); {12110#true} is VALID [2018-11-14 16:44:23,701 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12110#true} {12110#true} #215#return; {12110#true} is VALID [2018-11-14 16:44:23,701 INFO L273 TraceCheckUtils]: 2: Hoare triple {12110#true} assume true; {12110#true} is VALID [2018-11-14 16:44:23,701 INFO L273 TraceCheckUtils]: 1: Hoare triple {12110#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {12110#true} is VALID [2018-11-14 16:44:23,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {12110#true} call ULTIMATE.init(); {12110#true} is VALID [2018-11-14 16:44:23,703 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 16:44:23,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:23,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:44:23,705 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-14 16:44:23,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:23,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:44:23,797 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 16:44:23,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:44:23,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:44:23,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:44:23,799 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 12 states. [2018-11-14 16:44:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:26,712 INFO L93 Difference]: Finished difference Result 265 states and 280 transitions. [2018-11-14 16:44:26,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 16:44:26,713 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-11-14 16:44:26,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:44:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 277 transitions. [2018-11-14 16:44:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:44:26,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 277 transitions. [2018-11-14 16:44:26,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 277 transitions. [2018-11-14 16:44:27,233 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 16:44:27,239 INFO L225 Difference]: With dead ends: 265 [2018-11-14 16:44:27,240 INFO L226 Difference]: Without dead ends: 263 [2018-11-14 16:44:27,240 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2018-11-14 16:44:27,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-11-14 16:44:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 101. [2018-11-14 16:44:27,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:27,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand 101 states. [2018-11-14 16:44:27,463 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand 101 states. [2018-11-14 16:44:27,463 INFO L87 Difference]: Start difference. First operand 263 states. Second operand 101 states. [2018-11-14 16:44:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:27,467 INFO L93 Difference]: Finished difference Result 263 states and 276 transitions. [2018-11-14 16:44:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 276 transitions. [2018-11-14 16:44:27,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:27,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:27,468 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 263 states. [2018-11-14 16:44:27,468 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 263 states. [2018-11-14 16:44:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:27,473 INFO L93 Difference]: Finished difference Result 263 states and 276 transitions. [2018-11-14 16:44:27,474 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 276 transitions. [2018-11-14 16:44:27,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:27,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:27,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:27,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-14 16:44:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2018-11-14 16:44:27,476 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 35 [2018-11-14 16:44:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:27,476 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2018-11-14 16:44:27,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:44:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2018-11-14 16:44:27,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-14 16:44:27,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:27,476 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 16:44:27,477 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:27,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:27,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1080633106, now seen corresponding path program 1 times [2018-11-14 16:44:27,477 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:27,477 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 16:44:27,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:27,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:27,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {13295#true} call ULTIMATE.init(); {13295#true} is VALID [2018-11-14 16:44:27,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {13295#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {13295#true} is VALID [2018-11-14 16:44:27,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {13295#true} assume true; {13295#true} is VALID [2018-11-14 16:44:27,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13295#true} {13295#true} #215#return; {13295#true} is VALID [2018-11-14 16:44:27,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {13295#true} call #t~ret8 := main(); {13295#true} is VALID [2018-11-14 16:44:27,654 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 16:44:27,654 INFO L273 TraceCheckUtils]: 6: Hoare triple {13295#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {13295#true} is VALID [2018-11-14 16:44:27,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {13295#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {13295#true} is VALID [2018-11-14 16:44:27,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {13295#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {13295#true} is VALID [2018-11-14 16:44:27,655 INFO L273 TraceCheckUtils]: 9: Hoare triple {13295#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {13295#true} is VALID [2018-11-14 16:44:27,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {13295#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {13295#true} is VALID [2018-11-14 16:44:27,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {13295#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {13295#true} is VALID [2018-11-14 16:44:27,655 INFO L273 TraceCheckUtils]: 12: Hoare triple {13295#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {13295#true} is VALID [2018-11-14 16:44:27,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {13295#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {13295#true} is VALID [2018-11-14 16:44:27,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {13295#true} assume ~bvsge32(~main__scheme~0, 0bv32); {13295#true} is VALID [2018-11-14 16:44:27,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {13295#true} assume !(~main__scheme~0 == 0bv32); {13295#true} is VALID [2018-11-14 16:44:27,656 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 16:44:27,656 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 16:44:27,657 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 16:44:27,657 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 16:44:27,657 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 16:44:27,657 INFO L273 TraceCheckUtils]: 21: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {13295#true} is VALID [2018-11-14 16:44:27,657 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 16:44:27,657 INFO L273 TraceCheckUtils]: 23: Hoare triple {13295#true} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {13295#true} is VALID [2018-11-14 16:44:27,658 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 16:44:27,658 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 16:44:27,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {13295#true} is VALID [2018-11-14 16:44:27,658 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 16:44:27,658 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 16:44:27,658 INFO L273 TraceCheckUtils]: 29: Hoare triple {13295#true} assume !(~__VERIFIER_assert__cond~7 == 0bv32); {13295#true} is VALID [2018-11-14 16:44:27,658 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 16:44:27,659 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 16:44:27,660 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 16:44:27,660 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 16:44:27,661 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 16:44:27,673 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 16:44:27,674 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 16:44:27,674 INFO L273 TraceCheckUtils]: 37: Hoare triple {13296#false} assume !false; {13296#false} is VALID [2018-11-14 16:44:27,675 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 16:44:27,675 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:27,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:27,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:44:27,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-14 16:44:27,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:27,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:44:27,719 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 16:44:27,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:44:27,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:44:27,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:44:27,720 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 5 states. [2018-11-14 16:44:28,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:28,466 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-11-14 16:44:28,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:28,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-11-14 16:44:28,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:28,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2018-11-14 16:44:28,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 94 transitions. [2018-11-14 16:44:28,468 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 94 transitions. [2018-11-14 16:44:28,579 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 16:44:28,580 INFO L225 Difference]: With dead ends: 125 [2018-11-14 16:44:28,581 INFO L226 Difference]: Without dead ends: 123 [2018-11-14 16:44:28,581 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 16:44:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-11-14 16:44:28,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 104. [2018-11-14 16:44:28,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:28,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 104 states. [2018-11-14 16:44:28,706 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 104 states. [2018-11-14 16:44:28,706 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 104 states. [2018-11-14 16:44:28,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:28,708 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-11-14 16:44:28,709 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-11-14 16:44:28,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:28,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:28,709 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 123 states. [2018-11-14 16:44:28,709 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 123 states. [2018-11-14 16:44:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:28,711 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-11-14 16:44:28,711 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-11-14 16:44:28,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:28,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:28,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:28,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-14 16:44:28,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-11-14 16:44:28,714 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 38 [2018-11-14 16:44:28,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:28,714 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-11-14 16:44:28,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:44:28,715 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-11-14 16:44:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 16:44:28,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:28,715 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 16:44:28,716 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:28,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash -860108895, now seen corresponding path program 1 times [2018-11-14 16:44:28,717 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:28,717 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 16:44:28,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:28,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:28,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {13926#true} call ULTIMATE.init(); {13926#true} is VALID [2018-11-14 16:44:28,891 INFO L273 TraceCheckUtils]: 1: Hoare triple {13926#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {13926#true} is VALID [2018-11-14 16:44:28,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {13926#true} assume true; {13926#true} is VALID [2018-11-14 16:44:28,891 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13926#true} {13926#true} #215#return; {13926#true} is VALID [2018-11-14 16:44:28,891 INFO L256 TraceCheckUtils]: 4: Hoare triple {13926#true} call #t~ret8 := main(); {13926#true} is VALID [2018-11-14 16:44:28,891 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 16:44:28,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {13926#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {13926#true} is VALID [2018-11-14 16:44:28,892 INFO L273 TraceCheckUtils]: 7: Hoare triple {13926#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {13926#true} is VALID [2018-11-14 16:44:28,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {13926#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {13926#true} is VALID [2018-11-14 16:44:28,892 INFO L273 TraceCheckUtils]: 9: Hoare triple {13926#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {13926#true} is VALID [2018-11-14 16:44:28,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {13926#true} assume !!~bvsle32(~main__scheme~0, 1000000bv32); {13926#true} is VALID [2018-11-14 16:44:28,892 INFO L273 TraceCheckUtils]: 11: Hoare triple {13926#true} assume !!~bvsge32(~main__scheme~0, 4293967296bv32); {13926#true} is VALID [2018-11-14 16:44:28,892 INFO L273 TraceCheckUtils]: 12: Hoare triple {13926#true} assume ~bvsgt32(~main__urilen~0, 0bv32); {13926#true} is VALID [2018-11-14 16:44:28,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {13926#true} assume ~bvsgt32(~main__tokenlen~0, 0bv32); {13926#true} is VALID [2018-11-14 16:44:28,892 INFO L273 TraceCheckUtils]: 14: Hoare triple {13926#true} assume ~bvsge32(~main__scheme~0, 0bv32); {13926#true} is VALID [2018-11-14 16:44:28,893 INFO L273 TraceCheckUtils]: 15: Hoare triple {13926#true} assume !(~main__scheme~0 == 0bv32); {13926#true} is VALID [2018-11-14 16:44:28,893 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 16:44:28,893 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 16:44:28,893 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 16:44:28,893 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 16:44:28,894 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 16:44:28,894 INFO L273 TraceCheckUtils]: 21: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~3 == 0bv32); {13926#true} is VALID [2018-11-14 16:44:28,894 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 16:44:28,894 INFO L273 TraceCheckUtils]: 23: Hoare triple {13926#true} assume !(~main____CPAchecker_TMP_1~0 == 0bv32); {13926#true} is VALID [2018-11-14 16:44:28,894 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 16:44:28,894 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 16:44:28,895 INFO L273 TraceCheckUtils]: 26: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~5 == 0bv32); {13926#true} is VALID [2018-11-14 16:44:28,895 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 16:44:28,895 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 16:44:28,895 INFO L273 TraceCheckUtils]: 29: Hoare triple {13926#true} assume !(~__VERIFIER_assert__cond~7 == 0bv32); {13926#true} is VALID [2018-11-14 16:44:28,895 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 16:44:28,896 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 16:44:28,911 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 16:44:28,920 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 16:44:28,933 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 16:44:28,942 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 16:44:28,957 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 16:44:28,966 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 16:44:28,966 INFO L273 TraceCheckUtils]: 38: Hoare triple {13927#false} assume !false; {13927#false} is VALID [2018-11-14 16:44:28,967 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 16:44:28,968 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:28,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:28,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:44:28,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-14 16:44:28,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:28,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:44:29,046 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 16:44:29,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:44:29,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:44:29,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:44:29,047 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 5 states. [2018-11-14 16:44:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:29,717 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2018-11-14 16:44:29,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:29,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-14 16:44:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2018-11-14 16:44:29,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:44:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2018-11-14 16:44:29,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2018-11-14 16:44:29,821 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 16:44:29,824 INFO L225 Difference]: With dead ends: 126 [2018-11-14 16:44:29,824 INFO L226 Difference]: Without dead ends: 124 [2018-11-14 16:44:29,824 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 16:44:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-14 16:44:29,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 105. [2018-11-14 16:44:29,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:29,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 105 states. [2018-11-14 16:44:29,941 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 105 states. [2018-11-14 16:44:29,941 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 105 states. [2018-11-14 16:44:29,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:29,943 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-11-14 16:44:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-11-14 16:44:29,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:29,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:29,944 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 124 states. [2018-11-14 16:44:29,944 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 124 states. [2018-11-14 16:44:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:29,946 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2018-11-14 16:44:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-11-14 16:44:29,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:29,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:29,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:29,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-14 16:44:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2018-11-14 16:44:29,949 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 39 [2018-11-14 16:44:29,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:29,949 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2018-11-14 16:44:29,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:44:29,949 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2018-11-14 16:44:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 16:44:29,950 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:29,950 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 16:44:29,950 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:29,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1969164194, now seen corresponding path program 1 times [2018-11-14 16:44:29,951 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:29,951 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 16:44:29,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:30,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:30,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {14564#true} call ULTIMATE.init(); {14564#true} is VALID [2018-11-14 16:44:30,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {14564#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {14564#true} is VALID [2018-11-14 16:44:30,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {14564#true} assume true; {14564#true} is VALID [2018-11-14 16:44:30,207 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14564#true} {14564#true} #215#return; {14564#true} is VALID [2018-11-14 16:44:30,208 INFO L256 TraceCheckUtils]: 4: Hoare triple {14564#true} call #t~ret8 := main(); {14564#true} is VALID [2018-11-14 16:44:30,208 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 16:44:30,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {14564#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {14564#true} is VALID [2018-11-14 16:44:30,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {14564#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {14564#true} is VALID [2018-11-14 16:44:30,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {14564#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {14564#true} is VALID [2018-11-14 16:44:30,208 INFO L273 TraceCheckUtils]: 9: Hoare triple {14564#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {14564#true} is VALID [2018-11-14 16:44:30,209 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 16:44:30,209 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 16:44:30,209 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 16:44:30,209 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 16:44:30,210 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 16:44:30,210 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 16:44:30,213 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 16:44:30,214 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 16:44:30,215 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 16:44:30,215 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 16:44:30,216 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 16:44:30,216 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 16:44:30,217 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 16:44:30,218 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 16:44:30,218 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 16:44:30,225 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 16:44:30,225 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 16:44:30,226 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 16:44:30,226 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 16:44:30,227 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 16:44:30,227 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 16:44:30,228 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 16:44:30,228 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 16:44:30,229 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 16:44:30,241 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 16:44:30,242 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 16:44:30,243 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 16:44:30,244 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 16:44:30,244 INFO L273 TraceCheckUtils]: 38: Hoare triple {14565#false} assume !false; {14565#false} is VALID [2018-11-14 16:44:30,247 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 16:44:30,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:30,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {14565#false} assume !false; {14565#false} is VALID [2018-11-14 16:44:30,404 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 16:44:30,405 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 16:44:30,406 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 16:44:30,408 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 16:44:30,409 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 16:44:30,409 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 16:44:30,410 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 16:44:30,410 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 16:44:30,411 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 16:44:30,411 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 16:44:30,411 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 16:44:30,412 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 16:44:30,413 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 16:44:30,414 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 16:44:30,415 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 16:44:30,415 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 16:44:30,415 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 16:44:30,416 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 16:44:30,416 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 16:44:30,416 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 16:44:30,417 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 16:44:30,420 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 16:44:30,421 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 16:44:30,421 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 16:44:30,422 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 16:44:30,422 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 16:44:30,423 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 16:44:30,424 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 16:44:30,424 INFO L273 TraceCheckUtils]: 9: Hoare triple {14564#true} assume !!~bvsge32(~main__tokenlen~0, 4293967296bv32); {14564#true} is VALID [2018-11-14 16:44:30,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {14564#true} assume !!~bvsle32(~main__tokenlen~0, 1000000bv32); {14564#true} is VALID [2018-11-14 16:44:30,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {14564#true} assume !!~bvsge32(~main__urilen~0, 4293967296bv32); {14564#true} is VALID [2018-11-14 16:44:30,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {14564#true} assume !!~bvsle32(~main__urilen~0, 1000000bv32); {14564#true} is VALID [2018-11-14 16:44:30,425 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 16:44:30,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {14564#true} call #t~ret8 := main(); {14564#true} is VALID [2018-11-14 16:44:30,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14564#true} {14564#true} #215#return; {14564#true} is VALID [2018-11-14 16:44:30,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {14564#true} assume true; {14564#true} is VALID [2018-11-14 16:44:30,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {14564#true} ~__return_main~0 := 0bv32;~__return_375~0 := 0bv32; {14564#true} is VALID [2018-11-14 16:44:30,425 INFO L256 TraceCheckUtils]: 0: Hoare triple {14564#true} call ULTIMATE.init(); {14564#true} is VALID [2018-11-14 16:44:30,428 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 16:44:30,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:30,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 16:44:30,430 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-11-14 16:44:30,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:30,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 16:44:30,549 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 16:44:30,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 16:44:30,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 16:44:30,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-11-14 16:44:30,549 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 14 states. [2018-11-14 16:44:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:35,954 INFO L93 Difference]: Finished difference Result 376 states and 399 transitions. [2018-11-14 16:44:35,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 16:44:35,954 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2018-11-14 16:44:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:44:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 374 transitions. [2018-11-14 16:44:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:44:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 374 transitions. [2018-11-14 16:44:35,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 374 transitions. [2018-11-14 16:44:36,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:36,640 INFO L225 Difference]: With dead ends: 376 [2018-11-14 16:44:36,640 INFO L226 Difference]: Without dead ends: 374 [2018-11-14 16:44:36,640 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=745, Unknown=0, NotChecked=0, Total=992 [2018-11-14 16:44:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-11-14 16:44:36,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 107. [2018-11-14 16:44:36,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:36,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 374 states. Second operand 107 states. [2018-11-14 16:44:36,796 INFO L74 IsIncluded]: Start isIncluded. First operand 374 states. Second operand 107 states. [2018-11-14 16:44:36,796 INFO L87 Difference]: Start difference. First operand 374 states. Second operand 107 states. [2018-11-14 16:44:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:36,803 INFO L93 Difference]: Finished difference Result 374 states and 394 transitions. [2018-11-14 16:44:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 394 transitions. [2018-11-14 16:44:36,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:36,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:36,804 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 374 states. [2018-11-14 16:44:36,804 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 374 states. [2018-11-14 16:44:36,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:36,813 INFO L93 Difference]: Finished difference Result 374 states and 394 transitions. [2018-11-14 16:44:36,813 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 394 transitions. [2018-11-14 16:44:36,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:36,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:36,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:36,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:36,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 16:44:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2018-11-14 16:44:36,816 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 39 [2018-11-14 16:44:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:36,816 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2018-11-14 16:44:36,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 16:44:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2018-11-14 16:44:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 16:44:36,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:36,817 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, 1, 1] [2018-11-14 16:44:36,817 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:36,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:36,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1930828060, now seen corresponding path program 1 times [2018-11-14 16:44:36,818 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:36,818 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk