/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:46:43,410 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:46:43,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:46:43,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:46:43,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:46:43,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:46:43,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:46:43,429 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:46:43,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:46:43,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:46:43,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:46:43,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:46:43,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:46:43,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:46:43,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:46:43,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:46:43,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:46:43,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:46:43,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:46:43,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:46:43,450 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:46:43,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:46:43,457 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:46:43,458 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:46:43,463 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:46:43,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:46:43,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:46:43,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:46:43,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:46:43,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:46:43,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:46:43,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:46:43,467 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:46:43,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:46:43,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:46:43,469 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:46:43,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:46:43,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:46:43,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:46:43,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:46:43,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:46:43,473 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:46:43,487 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:46:43,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:46:43,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:46:43,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:46:43,489 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:46:43,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:46:43,490 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:46:43,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:46:43,490 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:46:43,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:46:43,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:46:43,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:46:43,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:46:43,491 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:46:43,491 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:46:43,492 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:46:43,492 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:46:43,492 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:46:43,492 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:46:43,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:46:43,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:46:43,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:46:43,493 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:46:43,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:46:43,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:46:43,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:46:43,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:46:43,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:46:43,494 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:46:43,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:46:43,820 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:46:43,835 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:46:43,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:46:43,840 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:46:43,841 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:46:43,841 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-07-08 12:46:43,924 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7e5a0e/df07ac3d0bc347d69a44be8f653d4e12/FLAGe26b1f5eb [2020-07-08 12:46:44,452 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:46:44,454 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-07-08 12:46:44,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7e5a0e/df07ac3d0bc347d69a44be8f653d4e12/FLAGe26b1f5eb [2020-07-08 12:46:44,803 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11b7e5a0e/df07ac3d0bc347d69a44be8f653d4e12 [2020-07-08 12:46:44,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:46:44,820 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:46:44,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:46:44,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:46:44,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:46:44,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:46:44" (1/1) ... [2020-07-08 12:46:44,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db79039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:44, skipping insertion in model container [2020-07-08 12:46:44,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:46:44" (1/1) ... [2020-07-08 12:46:44,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:46:44,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:46:45,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:46:45,197 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:46:45,236 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:46:45,256 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:46:45,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:45 WrapperNode [2020-07-08 12:46:45,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:46:45,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:46:45,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:46:45,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:46:45,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:45" (1/1) ... [2020-07-08 12:46:45,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:45" (1/1) ... [2020-07-08 12:46:45,418 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:45" (1/1) ... [2020-07-08 12:46:45,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:45" (1/1) ... [2020-07-08 12:46:45,442 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:45" (1/1) ... [2020-07-08 12:46:45,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:45" (1/1) ... [2020-07-08 12:46:45,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:45" (1/1) ... [2020-07-08 12:46:45,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:46:45,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:46:45,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:46:45,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:46:45,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:45" (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 [2020-07-08 12:46:45,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:46:45,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:46:45,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:46:45,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:46:45,541 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:46:45,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:46:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:46:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:46:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:46:45,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:46:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:46:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:46:45,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:46:46,401 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:46:46,402 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 12:46:46,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:46:46 BoogieIcfgContainer [2020-07-08 12:46:46,407 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:46:46,408 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:46:46,409 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:46:46,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:46:46,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:46:44" (1/3) ... [2020-07-08 12:46:46,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666613e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:46:46, skipping insertion in model container [2020-07-08 12:46:46,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:46:45" (2/3) ... [2020-07-08 12:46:46,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@666613e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:46:46, skipping insertion in model container [2020-07-08 12:46:46,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:46:46" (3/3) ... [2020-07-08 12:46:46,421 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-07-08 12:46:46,438 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:46:46,449 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:46:46,474 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:46:46,512 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:46:46,513 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:46:46,513 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:46:46,513 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:46:46,514 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:46:46,514 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:46:46,514 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:46:46,514 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:46:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states. [2020-07-08 12:46:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-08 12:46:46,548 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:46,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:46,550 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:46,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1626077920, now seen corresponding path program 1 times [2020-07-08 12:46:46,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:46,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275099527] [2020-07-08 12:46:46,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:46,866 INFO L280 TraceCheckUtils]: 0: Hoare triple {56#true} assume true; {56#true} is VALID [2020-07-08 12:46:46,867 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {56#true} {56#true} #140#return; {56#true} is VALID [2020-07-08 12:46:46,869 INFO L263 TraceCheckUtils]: 0: Hoare triple {56#true} call ULTIMATE.init(); {56#true} is VALID [2020-07-08 12:46:46,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {56#true} assume true; {56#true} is VALID [2020-07-08 12:46:46,870 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {56#true} {56#true} #140#return; {56#true} is VALID [2020-07-08 12:46:46,871 INFO L263 TraceCheckUtils]: 3: Hoare triple {56#true} call #t~ret11 := main(); {56#true} is VALID [2020-07-08 12:46:46,871 INFO L280 TraceCheckUtils]: 4: Hoare triple {56#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {56#true} is VALID [2020-07-08 12:46:46,872 INFO L280 TraceCheckUtils]: 5: Hoare triple {56#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {56#true} is VALID [2020-07-08 12:46:46,872 INFO L280 TraceCheckUtils]: 6: Hoare triple {56#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {56#true} is VALID [2020-07-08 12:46:46,872 INFO L280 TraceCheckUtils]: 7: Hoare triple {56#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {56#true} is VALID [2020-07-08 12:46:46,873 INFO L280 TraceCheckUtils]: 8: Hoare triple {56#true} assume ~urilen~0 > 0; {56#true} is VALID [2020-07-08 12:46:46,873 INFO L280 TraceCheckUtils]: 9: Hoare triple {56#true} assume ~tokenlen~0 > 0; {56#true} is VALID [2020-07-08 12:46:46,874 INFO L280 TraceCheckUtils]: 10: Hoare triple {56#true} assume ~scheme~0 >= 0; {56#true} is VALID [2020-07-08 12:46:46,877 INFO L280 TraceCheckUtils]: 11: Hoare triple {56#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {60#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:46,880 INFO L263 TraceCheckUtils]: 12: Hoare triple {60#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {61#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:46:46,881 INFO L280 TraceCheckUtils]: 13: Hoare triple {61#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {62#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:46:46,882 INFO L280 TraceCheckUtils]: 14: Hoare triple {62#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {57#false} is VALID [2020-07-08 12:46:46,882 INFO L280 TraceCheckUtils]: 15: Hoare triple {57#false} assume !false; {57#false} is VALID [2020-07-08 12:46:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:46,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275099527] [2020-07-08 12:46:46,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:46,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:46:46,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633872350] [2020-07-08 12:46:46,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 12:46:46,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:46,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:46:46,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:46,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:46:46,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:46,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:46:46,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:46:46,948 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 5 states. [2020-07-08 12:46:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:47,639 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2020-07-08 12:46:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:46:47,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-08 12:46:47,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2020-07-08 12:46:47,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:46:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2020-07-08 12:46:47,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 206 transitions. [2020-07-08 12:46:47,967 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:48,015 INFO L225 Difference]: With dead ends: 111 [2020-07-08 12:46:48,015 INFO L226 Difference]: Without dead ends: 63 [2020-07-08 12:46:48,024 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-08 12:46:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2020-07-08 12:46:48,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:48,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 56 states. [2020-07-08 12:46:48,118 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 56 states. [2020-07-08 12:46:48,118 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 56 states. [2020-07-08 12:46:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:48,135 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2020-07-08 12:46:48,135 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2020-07-08 12:46:48,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:48,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:48,140 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 63 states. [2020-07-08 12:46:48,140 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 63 states. [2020-07-08 12:46:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:48,156 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2020-07-08 12:46:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2020-07-08 12:46:48,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:48,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:48,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:48,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-08 12:46:48,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2020-07-08 12:46:48,181 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 16 [2020-07-08 12:46:48,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:48,182 INFO L479 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2020-07-08 12:46:48,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:46:48,183 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2020-07-08 12:46:48,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:46:48,183 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:48,183 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:48,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:46:48,184 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:48,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1393145919, now seen corresponding path program 1 times [2020-07-08 12:46:48,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:48,185 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603824830] [2020-07-08 12:46:48,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:48,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-08 12:46:48,322 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {445#true} {445#true} #140#return; {445#true} is VALID [2020-07-08 12:46:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:48,348 INFO L280 TraceCheckUtils]: 0: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2020-07-08 12:46:48,348 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2020-07-08 12:46:48,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-08 12:46:48,354 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {445#true} {450#(<= 1 main_~cp~0)} #144#return; {450#(<= 1 main_~cp~0)} is VALID [2020-07-08 12:46:48,354 INFO L263 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2020-07-08 12:46:48,355 INFO L280 TraceCheckUtils]: 1: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-08 12:46:48,357 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {445#true} {445#true} #140#return; {445#true} is VALID [2020-07-08 12:46:48,358 INFO L263 TraceCheckUtils]: 3: Hoare triple {445#true} call #t~ret11 := main(); {445#true} is VALID [2020-07-08 12:46:48,358 INFO L280 TraceCheckUtils]: 4: Hoare triple {445#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {445#true} is VALID [2020-07-08 12:46:48,358 INFO L280 TraceCheckUtils]: 5: Hoare triple {445#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {445#true} is VALID [2020-07-08 12:46:48,359 INFO L280 TraceCheckUtils]: 6: Hoare triple {445#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {445#true} is VALID [2020-07-08 12:46:48,359 INFO L280 TraceCheckUtils]: 7: Hoare triple {445#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {445#true} is VALID [2020-07-08 12:46:48,359 INFO L280 TraceCheckUtils]: 8: Hoare triple {445#true} assume ~urilen~0 > 0; {445#true} is VALID [2020-07-08 12:46:48,360 INFO L280 TraceCheckUtils]: 9: Hoare triple {445#true} assume ~tokenlen~0 > 0; {445#true} is VALID [2020-07-08 12:46:48,364 INFO L280 TraceCheckUtils]: 10: Hoare triple {445#true} assume ~scheme~0 >= 0; {449#(< 0 (+ main_~scheme~0 1))} is VALID [2020-07-08 12:46:48,366 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#(< 0 (+ main_~scheme~0 1))} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {450#(<= 1 main_~cp~0)} is VALID [2020-07-08 12:46:48,366 INFO L263 TraceCheckUtils]: 12: Hoare triple {450#(<= 1 main_~cp~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {445#true} is VALID [2020-07-08 12:46:48,366 INFO L280 TraceCheckUtils]: 13: Hoare triple {445#true} ~cond := #in~cond; {445#true} is VALID [2020-07-08 12:46:48,367 INFO L280 TraceCheckUtils]: 14: Hoare triple {445#true} assume !(0 == ~cond); {445#true} is VALID [2020-07-08 12:46:48,367 INFO L280 TraceCheckUtils]: 15: Hoare triple {445#true} assume true; {445#true} is VALID [2020-07-08 12:46:48,368 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {445#true} {450#(<= 1 main_~cp~0)} #144#return; {450#(<= 1 main_~cp~0)} is VALID [2020-07-08 12:46:48,369 INFO L263 TraceCheckUtils]: 17: Hoare triple {450#(<= 1 main_~cp~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {455#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:46:48,370 INFO L280 TraceCheckUtils]: 18: Hoare triple {455#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {456#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:46:48,371 INFO L280 TraceCheckUtils]: 19: Hoare triple {456#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {446#false} is VALID [2020-07-08 12:46:48,372 INFO L280 TraceCheckUtils]: 20: Hoare triple {446#false} assume !false; {446#false} is VALID [2020-07-08 12:46:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:48,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603824830] [2020-07-08 12:46:48,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:48,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:46:48,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138275131] [2020-07-08 12:46:48,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-08 12:46:48,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:48,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:48,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:48,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:48,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:48,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:48,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:48,403 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand 6 states. [2020-07-08 12:46:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:49,315 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2020-07-08 12:46:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:49,315 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-07-08 12:46:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-08 12:46:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:49,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-08 12:46:49,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2020-07-08 12:46:49,449 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:49,454 INFO L225 Difference]: With dead ends: 62 [2020-07-08 12:46:49,454 INFO L226 Difference]: Without dead ends: 60 [2020-07-08 12:46:49,456 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:46:49,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-08 12:46:49,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-08 12:46:49,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:49,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2020-07-08 12:46:49,527 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-08 12:46:49,527 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-08 12:46:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:49,533 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2020-07-08 12:46:49,534 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2020-07-08 12:46:49,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:49,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:49,535 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-08 12:46:49,535 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-08 12:46:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:49,541 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2020-07-08 12:46:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2020-07-08 12:46:49,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:49,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:49,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:49,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-08 12:46:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 82 transitions. [2020-07-08 12:46:49,547 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 82 transitions. Word has length 21 [2020-07-08 12:46:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:49,547 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 82 transitions. [2020-07-08 12:46:49,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 82 transitions. [2020-07-08 12:46:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-08 12:46:49,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:49,550 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:49,551 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:46:49,551 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:49,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:49,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1101915893, now seen corresponding path program 1 times [2020-07-08 12:46:49,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:49,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882874086] [2020-07-08 12:46:49,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,637 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {765#true} {765#true} #140#return; {765#true} is VALID [2020-07-08 12:46:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,646 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #144#return; {765#true} is VALID [2020-07-08 12:46:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,652 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,653 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #146#return; {765#true} is VALID [2020-07-08 12:46:49,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,660 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,661 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,662 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #148#return; {765#true} is VALID [2020-07-08 12:46:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,668 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,669 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,670 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #150#return; {765#true} is VALID [2020-07-08 12:46:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,706 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {785#(= (+ main_~cp~0 1) main_~urilen~0)} #156#return; {785#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:49,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,741 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {765#true} {785#(= (+ main_~cp~0 1) main_~urilen~0)} #158#return; {785#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:49,741 INFO L263 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2020-07-08 12:46:49,742 INFO L280 TraceCheckUtils]: 1: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,742 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {765#true} {765#true} #140#return; {765#true} is VALID [2020-07-08 12:46:49,743 INFO L263 TraceCheckUtils]: 3: Hoare triple {765#true} call #t~ret11 := main(); {765#true} is VALID [2020-07-08 12:46:49,743 INFO L280 TraceCheckUtils]: 4: Hoare triple {765#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {765#true} is VALID [2020-07-08 12:46:49,743 INFO L280 TraceCheckUtils]: 5: Hoare triple {765#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {765#true} is VALID [2020-07-08 12:46:49,744 INFO L280 TraceCheckUtils]: 6: Hoare triple {765#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {765#true} is VALID [2020-07-08 12:46:49,744 INFO L280 TraceCheckUtils]: 7: Hoare triple {765#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {765#true} is VALID [2020-07-08 12:46:49,744 INFO L280 TraceCheckUtils]: 8: Hoare triple {765#true} assume ~urilen~0 > 0; {765#true} is VALID [2020-07-08 12:46:49,744 INFO L280 TraceCheckUtils]: 9: Hoare triple {765#true} assume ~tokenlen~0 > 0; {765#true} is VALID [2020-07-08 12:46:49,744 INFO L280 TraceCheckUtils]: 10: Hoare triple {765#true} assume ~scheme~0 >= 0; {765#true} is VALID [2020-07-08 12:46:49,745 INFO L280 TraceCheckUtils]: 11: Hoare triple {765#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {765#true} is VALID [2020-07-08 12:46:49,745 INFO L263 TraceCheckUtils]: 12: Hoare triple {765#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {765#true} is VALID [2020-07-08 12:46:49,745 INFO L280 TraceCheckUtils]: 13: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,749 INFO L280 TraceCheckUtils]: 14: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,749 INFO L280 TraceCheckUtils]: 15: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,749 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {765#true} {765#true} #144#return; {765#true} is VALID [2020-07-08 12:46:49,750 INFO L263 TraceCheckUtils]: 17: Hoare triple {765#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {765#true} is VALID [2020-07-08 12:46:49,750 INFO L280 TraceCheckUtils]: 18: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,750 INFO L280 TraceCheckUtils]: 19: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,750 INFO L280 TraceCheckUtils]: 20: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,751 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {765#true} {765#true} #146#return; {765#true} is VALID [2020-07-08 12:46:49,751 INFO L280 TraceCheckUtils]: 22: Hoare triple {765#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {765#true} is VALID [2020-07-08 12:46:49,751 INFO L280 TraceCheckUtils]: 23: Hoare triple {765#true} assume 0 != #t~nondet3;havoc #t~nondet3; {765#true} is VALID [2020-07-08 12:46:49,752 INFO L263 TraceCheckUtils]: 24: Hoare triple {765#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {765#true} is VALID [2020-07-08 12:46:49,752 INFO L280 TraceCheckUtils]: 25: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,752 INFO L280 TraceCheckUtils]: 26: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,752 INFO L280 TraceCheckUtils]: 27: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,753 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {765#true} {765#true} #148#return; {765#true} is VALID [2020-07-08 12:46:49,753 INFO L263 TraceCheckUtils]: 29: Hoare triple {765#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {765#true} is VALID [2020-07-08 12:46:49,753 INFO L280 TraceCheckUtils]: 30: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,753 INFO L280 TraceCheckUtils]: 31: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,754 INFO L280 TraceCheckUtils]: 32: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,754 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {765#true} {765#true} #150#return; {765#true} is VALID [2020-07-08 12:46:49,759 INFO L280 TraceCheckUtils]: 34: Hoare triple {765#true} assume !(~cp~0 != ~urilen~0 - 1); {785#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:49,760 INFO L263 TraceCheckUtils]: 35: Hoare triple {785#(= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {765#true} is VALID [2020-07-08 12:46:49,761 INFO L280 TraceCheckUtils]: 36: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,761 INFO L280 TraceCheckUtils]: 37: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,762 INFO L280 TraceCheckUtils]: 38: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,765 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {765#true} {785#(= (+ main_~cp~0 1) main_~urilen~0)} #156#return; {785#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:49,766 INFO L263 TraceCheckUtils]: 40: Hoare triple {785#(= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {765#true} is VALID [2020-07-08 12:46:49,766 INFO L280 TraceCheckUtils]: 41: Hoare triple {765#true} ~cond := #in~cond; {765#true} is VALID [2020-07-08 12:46:49,767 INFO L280 TraceCheckUtils]: 42: Hoare triple {765#true} assume !(0 == ~cond); {765#true} is VALID [2020-07-08 12:46:49,767 INFO L280 TraceCheckUtils]: 43: Hoare triple {765#true} assume true; {765#true} is VALID [2020-07-08 12:46:49,768 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {765#true} {785#(= (+ main_~cp~0 1) main_~urilen~0)} #158#return; {785#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:49,770 INFO L280 TraceCheckUtils]: 45: Hoare triple {785#(= (+ main_~cp~0 1) main_~urilen~0)} assume !(~cp~0 == ~urilen~0 - 1); {766#false} is VALID [2020-07-08 12:46:49,771 INFO L263 TraceCheckUtils]: 46: Hoare triple {766#false} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {766#false} is VALID [2020-07-08 12:46:49,772 INFO L280 TraceCheckUtils]: 47: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2020-07-08 12:46:49,772 INFO L280 TraceCheckUtils]: 48: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2020-07-08 12:46:49,773 INFO L280 TraceCheckUtils]: 49: Hoare triple {766#false} assume !false; {766#false} is VALID [2020-07-08 12:46:49,792 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-08 12:46:49,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882874086] [2020-07-08 12:46:49,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:49,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:46:49,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437897458] [2020-07-08 12:46:49,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-08 12:46:49,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:49,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:46:49,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:49,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:46:49,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:49,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:46:49,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:46:49,844 INFO L87 Difference]: Start difference. First operand 60 states and 82 transitions. Second operand 3 states. [2020-07-08 12:46:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:50,095 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2020-07-08 12:46:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:46:50,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-07-08 12:46:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:46:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-08 12:46:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:46:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 105 transitions. [2020-07-08 12:46:50,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 105 transitions. [2020-07-08 12:46:50,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:50,245 INFO L225 Difference]: With dead ends: 89 [2020-07-08 12:46:50,246 INFO L226 Difference]: Without dead ends: 60 [2020-07-08 12:46:50,247 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:46:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-08 12:46:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-07-08 12:46:50,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:50,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2020-07-08 12:46:50,335 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-08 12:46:50,335 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-08 12:46:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:50,345 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2020-07-08 12:46:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-08 12:46:50,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:50,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:50,346 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2020-07-08 12:46:50,347 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2020-07-08 12:46:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:50,356 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2020-07-08 12:46:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-08 12:46:50,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:50,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:50,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:50,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-08 12:46:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2020-07-08 12:46:50,362 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 80 transitions. Word has length 50 [2020-07-08 12:46:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:50,363 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 80 transitions. [2020-07-08 12:46:50,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:46:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 80 transitions. [2020-07-08 12:46:50,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-08 12:46:50,369 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:50,369 INFO L422 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:50,370 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 12:46:50,370 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:50,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:50,370 INFO L82 PathProgramCache]: Analyzing trace with hash 668905142, now seen corresponding path program 1 times [2020-07-08 12:46:50,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:50,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588470089] [2020-07-08 12:46:50,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:50,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,591 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1140#true} {1140#true} #140#return; {1140#true} is VALID [2020-07-08 12:46:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:50,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,606 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,624 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} #144#return; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:50,634 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,635 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,639 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} #146#return; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:50,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,650 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,651 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} #148#return; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:50,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,662 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,672 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} #150#return; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:50,692 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,693 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,693 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,694 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1161#(< (+ main_~cp~0 1) main_~urilen~0)} #156#return; {1161#(< (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:50,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,706 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,707 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1140#true} {1161#(< (+ main_~cp~0 1) main_~urilen~0)} #158#return; {1161#(< (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,708 INFO L263 TraceCheckUtils]: 0: Hoare triple {1140#true} call ULTIMATE.init(); {1140#true} is VALID [2020-07-08 12:46:50,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,708 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1140#true} {1140#true} #140#return; {1140#true} is VALID [2020-07-08 12:46:50,708 INFO L263 TraceCheckUtils]: 3: Hoare triple {1140#true} call #t~ret11 := main(); {1140#true} is VALID [2020-07-08 12:46:50,709 INFO L280 TraceCheckUtils]: 4: Hoare triple {1140#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {1140#true} is VALID [2020-07-08 12:46:50,709 INFO L280 TraceCheckUtils]: 5: Hoare triple {1140#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1140#true} is VALID [2020-07-08 12:46:50,709 INFO L280 TraceCheckUtils]: 6: Hoare triple {1140#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1140#true} is VALID [2020-07-08 12:46:50,709 INFO L280 TraceCheckUtils]: 7: Hoare triple {1140#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1140#true} is VALID [2020-07-08 12:46:50,709 INFO L280 TraceCheckUtils]: 8: Hoare triple {1140#true} assume ~urilen~0 > 0; {1140#true} is VALID [2020-07-08 12:46:50,710 INFO L280 TraceCheckUtils]: 9: Hoare triple {1140#true} assume ~tokenlen~0 > 0; {1140#true} is VALID [2020-07-08 12:46:50,710 INFO L280 TraceCheckUtils]: 10: Hoare triple {1140#true} assume ~scheme~0 >= 0; {1140#true} is VALID [2020-07-08 12:46:50,711 INFO L280 TraceCheckUtils]: 11: Hoare triple {1140#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,711 INFO L263 TraceCheckUtils]: 12: Hoare triple {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1140#true} is VALID [2020-07-08 12:46:50,711 INFO L280 TraceCheckUtils]: 13: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,711 INFO L280 TraceCheckUtils]: 14: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,712 INFO L280 TraceCheckUtils]: 15: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,713 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1140#true} {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} #144#return; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,713 INFO L263 TraceCheckUtils]: 17: Hoare triple {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1140#true} is VALID [2020-07-08 12:46:50,713 INFO L280 TraceCheckUtils]: 18: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,714 INFO L280 TraceCheckUtils]: 19: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,714 INFO L280 TraceCheckUtils]: 20: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,715 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1140#true} {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} #146#return; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,716 INFO L280 TraceCheckUtils]: 22: Hoare triple {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,717 INFO L280 TraceCheckUtils]: 23: Hoare triple {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} assume 0 != #t~nondet3;havoc #t~nondet3; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,717 INFO L263 TraceCheckUtils]: 24: Hoare triple {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1140#true} is VALID [2020-07-08 12:46:50,717 INFO L280 TraceCheckUtils]: 25: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,717 INFO L280 TraceCheckUtils]: 26: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,717 INFO L280 TraceCheckUtils]: 27: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,718 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1140#true} {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} #148#return; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,718 INFO L263 TraceCheckUtils]: 29: Hoare triple {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1140#true} is VALID [2020-07-08 12:46:50,719 INFO L280 TraceCheckUtils]: 30: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,719 INFO L280 TraceCheckUtils]: 31: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,719 INFO L280 TraceCheckUtils]: 32: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,720 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1140#true} {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} #150#return; {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,721 INFO L280 TraceCheckUtils]: 34: Hoare triple {1144#(<= (+ main_~cp~0 1) main_~urilen~0)} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1161#(< (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,722 INFO L280 TraceCheckUtils]: 35: Hoare triple {1161#(< (+ main_~cp~0 1) main_~urilen~0)} assume 0 != #t~nondet4;havoc #t~nondet4; {1161#(< (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,722 INFO L263 TraceCheckUtils]: 36: Hoare triple {1161#(< (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1140#true} is VALID [2020-07-08 12:46:50,722 INFO L280 TraceCheckUtils]: 37: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,722 INFO L280 TraceCheckUtils]: 38: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,723 INFO L280 TraceCheckUtils]: 39: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,723 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1140#true} {1161#(< (+ main_~cp~0 1) main_~urilen~0)} #156#return; {1161#(< (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,724 INFO L263 TraceCheckUtils]: 41: Hoare triple {1161#(< (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1140#true} is VALID [2020-07-08 12:46:50,724 INFO L280 TraceCheckUtils]: 42: Hoare triple {1140#true} ~cond := #in~cond; {1140#true} is VALID [2020-07-08 12:46:50,724 INFO L280 TraceCheckUtils]: 43: Hoare triple {1140#true} assume !(0 == ~cond); {1140#true} is VALID [2020-07-08 12:46:50,724 INFO L280 TraceCheckUtils]: 44: Hoare triple {1140#true} assume true; {1140#true} is VALID [2020-07-08 12:46:50,726 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1140#true} {1161#(< (+ main_~cp~0 1) main_~urilen~0)} #158#return; {1161#(< (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,727 INFO L280 TraceCheckUtils]: 46: Hoare triple {1161#(< (+ main_~cp~0 1) main_~urilen~0)} assume !(~cp~0 == ~urilen~0 - 1); {1161#(< (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-08 12:46:50,728 INFO L263 TraceCheckUtils]: 47: Hoare triple {1161#(< (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1170#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:46:50,729 INFO L280 TraceCheckUtils]: 48: Hoare triple {1170#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1171#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:46:50,729 INFO L280 TraceCheckUtils]: 49: Hoare triple {1171#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1141#false} is VALID [2020-07-08 12:46:50,730 INFO L280 TraceCheckUtils]: 50: Hoare triple {1141#false} assume !false; {1141#false} is VALID [2020-07-08 12:46:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-07-08 12:46:50,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588470089] [2020-07-08 12:46:50,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:50,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:46:50,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553612211] [2020-07-08 12:46:50,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2020-07-08 12:46:50,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:50,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:50,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:50,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:50,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:50,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:50,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:50,790 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2020-07-08 12:46:51,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:51,432 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2020-07-08 12:46:51,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:51,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2020-07-08 12:46:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:51,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-08 12:46:51,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:51,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-08 12:46:51,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2020-07-08 12:46:51,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:51,579 INFO L225 Difference]: With dead ends: 67 [2020-07-08 12:46:51,580 INFO L226 Difference]: Without dead ends: 65 [2020-07-08 12:46:51,581 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:51,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-08 12:46:51,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-07-08 12:46:51,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:51,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 64 states. [2020-07-08 12:46:51,684 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 64 states. [2020-07-08 12:46:51,684 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 64 states. [2020-07-08 12:46:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:51,697 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2020-07-08 12:46:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2020-07-08 12:46:51,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:51,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:51,699 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 65 states. [2020-07-08 12:46:51,699 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 65 states. [2020-07-08 12:46:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:51,707 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2020-07-08 12:46:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2020-07-08 12:46:51,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:51,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:51,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:51,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:51,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-08 12:46:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2020-07-08 12:46:51,716 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 51 [2020-07-08 12:46:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:51,716 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2020-07-08 12:46:51,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2020-07-08 12:46:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-07-08 12:46:51,720 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:51,721 INFO L422 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:51,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:46:51,722 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:51,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:51,723 INFO L82 PathProgramCache]: Analyzing trace with hash -702087769, now seen corresponding path program 1 times [2020-07-08 12:46:51,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:51,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474543120] [2020-07-08 12:46:51,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,945 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:51,946 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1500#true} {1500#true} #140#return; {1500#true} is VALID [2020-07-08 12:46:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,952 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:51,953 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:51,953 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:51,953 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #144#return; {1500#true} is VALID [2020-07-08 12:46:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,961 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:51,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:51,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:51,963 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #146#return; {1500#true} is VALID [2020-07-08 12:46:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,967 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:51,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:51,968 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:51,968 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #148#return; {1500#true} is VALID [2020-07-08 12:46:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:51,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:51,979 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:51,979 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #150#return; {1500#true} is VALID [2020-07-08 12:46:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,983 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:51,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:51,983 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:51,983 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #156#return; {1500#true} is VALID [2020-07-08 12:46:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:51,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:51,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:51,991 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #158#return; {1500#true} is VALID [2020-07-08 12:46:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:51,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:51,997 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:51,997 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:51,997 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #160#return; {1500#true} is VALID [2020-07-08 12:46:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:52,004 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,005 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #162#return; {1500#true} is VALID [2020-07-08 12:46:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:52,011 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,012 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,013 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,014 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #164#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:52,022 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,022 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,023 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,024 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #166#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:52,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,034 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #168#return; {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-08 12:46:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:52,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,040 INFO L280 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,042 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #170#return; {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-08 12:46:52,043 INFO L263 TraceCheckUtils]: 0: Hoare triple {1500#true} call ULTIMATE.init(); {1500#true} is VALID [2020-07-08 12:46:52,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,044 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1500#true} {1500#true} #140#return; {1500#true} is VALID [2020-07-08 12:46:52,044 INFO L263 TraceCheckUtils]: 3: Hoare triple {1500#true} call #t~ret11 := main(); {1500#true} is VALID [2020-07-08 12:46:52,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {1500#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {1500#true} is VALID [2020-07-08 12:46:52,045 INFO L280 TraceCheckUtils]: 5: Hoare triple {1500#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1500#true} is VALID [2020-07-08 12:46:52,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {1500#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1500#true} is VALID [2020-07-08 12:46:52,045 INFO L280 TraceCheckUtils]: 7: Hoare triple {1500#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1500#true} is VALID [2020-07-08 12:46:52,045 INFO L280 TraceCheckUtils]: 8: Hoare triple {1500#true} assume ~urilen~0 > 0; {1500#true} is VALID [2020-07-08 12:46:52,046 INFO L280 TraceCheckUtils]: 9: Hoare triple {1500#true} assume ~tokenlen~0 > 0; {1500#true} is VALID [2020-07-08 12:46:52,046 INFO L280 TraceCheckUtils]: 10: Hoare triple {1500#true} assume ~scheme~0 >= 0; {1500#true} is VALID [2020-07-08 12:46:52,046 INFO L280 TraceCheckUtils]: 11: Hoare triple {1500#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1500#true} is VALID [2020-07-08 12:46:52,046 INFO L263 TraceCheckUtils]: 12: Hoare triple {1500#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,047 INFO L280 TraceCheckUtils]: 13: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,047 INFO L280 TraceCheckUtils]: 14: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,047 INFO L280 TraceCheckUtils]: 15: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,047 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1500#true} {1500#true} #144#return; {1500#true} is VALID [2020-07-08 12:46:52,048 INFO L263 TraceCheckUtils]: 17: Hoare triple {1500#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,048 INFO L280 TraceCheckUtils]: 18: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,048 INFO L280 TraceCheckUtils]: 19: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,049 INFO L280 TraceCheckUtils]: 20: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,049 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1500#true} {1500#true} #146#return; {1500#true} is VALID [2020-07-08 12:46:52,049 INFO L280 TraceCheckUtils]: 22: Hoare triple {1500#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1500#true} is VALID [2020-07-08 12:46:52,049 INFO L280 TraceCheckUtils]: 23: Hoare triple {1500#true} assume 0 != #t~nondet3;havoc #t~nondet3; {1500#true} is VALID [2020-07-08 12:46:52,050 INFO L263 TraceCheckUtils]: 24: Hoare triple {1500#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,050 INFO L280 TraceCheckUtils]: 25: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,050 INFO L280 TraceCheckUtils]: 26: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,051 INFO L280 TraceCheckUtils]: 27: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,051 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1500#true} {1500#true} #148#return; {1500#true} is VALID [2020-07-08 12:46:52,051 INFO L263 TraceCheckUtils]: 29: Hoare triple {1500#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,051 INFO L280 TraceCheckUtils]: 30: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,052 INFO L280 TraceCheckUtils]: 31: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,052 INFO L280 TraceCheckUtils]: 32: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,052 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1500#true} {1500#true} #150#return; {1500#true} is VALID [2020-07-08 12:46:52,052 INFO L280 TraceCheckUtils]: 34: Hoare triple {1500#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1500#true} is VALID [2020-07-08 12:46:52,053 INFO L280 TraceCheckUtils]: 35: Hoare triple {1500#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1500#true} is VALID [2020-07-08 12:46:52,053 INFO L263 TraceCheckUtils]: 36: Hoare triple {1500#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,053 INFO L280 TraceCheckUtils]: 37: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,053 INFO L280 TraceCheckUtils]: 38: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,054 INFO L280 TraceCheckUtils]: 39: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,054 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1500#true} {1500#true} #156#return; {1500#true} is VALID [2020-07-08 12:46:52,054 INFO L263 TraceCheckUtils]: 41: Hoare triple {1500#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,055 INFO L280 TraceCheckUtils]: 42: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,055 INFO L280 TraceCheckUtils]: 43: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,055 INFO L280 TraceCheckUtils]: 44: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,056 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1500#true} {1500#true} #158#return; {1500#true} is VALID [2020-07-08 12:46:52,056 INFO L280 TraceCheckUtils]: 46: Hoare triple {1500#true} assume !(~cp~0 == ~urilen~0 - 1); {1500#true} is VALID [2020-07-08 12:46:52,056 INFO L263 TraceCheckUtils]: 47: Hoare triple {1500#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,057 INFO L280 TraceCheckUtils]: 48: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,057 INFO L280 TraceCheckUtils]: 49: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,057 INFO L280 TraceCheckUtils]: 50: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,057 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1500#true} {1500#true} #160#return; {1500#true} is VALID [2020-07-08 12:46:52,058 INFO L263 TraceCheckUtils]: 52: Hoare triple {1500#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,058 INFO L280 TraceCheckUtils]: 53: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,058 INFO L280 TraceCheckUtils]: 54: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,058 INFO L280 TraceCheckUtils]: 55: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,059 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1500#true} {1500#true} #162#return; {1500#true} is VALID [2020-07-08 12:46:52,059 INFO L280 TraceCheckUtils]: 57: Hoare triple {1500#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre6 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre6;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1500#true} is VALID [2020-07-08 12:46:52,060 INFO L280 TraceCheckUtils]: 58: Hoare triple {1500#true} assume 0 != #t~nondet7;havoc #t~nondet7;~c~0 := 0; {1536#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:52,060 INFO L263 TraceCheckUtils]: 59: Hoare triple {1536#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,060 INFO L280 TraceCheckUtils]: 60: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,061 INFO L280 TraceCheckUtils]: 61: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,061 INFO L280 TraceCheckUtils]: 62: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,062 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #164#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:52,062 INFO L263 TraceCheckUtils]: 64: Hoare triple {1536#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,062 INFO L280 TraceCheckUtils]: 65: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,063 INFO L280 TraceCheckUtils]: 66: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,063 INFO L280 TraceCheckUtils]: 67: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,064 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {1500#true} {1536#(= 0 main_~c~0)} #166#return; {1536#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:52,065 INFO L280 TraceCheckUtils]: 69: Hoare triple {1536#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-08 12:46:52,065 INFO L263 TraceCheckUtils]: 70: Hoare triple {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,065 INFO L280 TraceCheckUtils]: 71: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,066 INFO L280 TraceCheckUtils]: 72: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,066 INFO L280 TraceCheckUtils]: 73: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,067 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {1500#true} {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #168#return; {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-08 12:46:52,067 INFO L263 TraceCheckUtils]: 75: Hoare triple {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1500#true} is VALID [2020-07-08 12:46:52,067 INFO L280 TraceCheckUtils]: 76: Hoare triple {1500#true} ~cond := #in~cond; {1500#true} is VALID [2020-07-08 12:46:52,068 INFO L280 TraceCheckUtils]: 77: Hoare triple {1500#true} assume !(0 == ~cond); {1500#true} is VALID [2020-07-08 12:46:52,068 INFO L280 TraceCheckUtils]: 78: Hoare triple {1500#true} assume true; {1500#true} is VALID [2020-07-08 12:46:52,069 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {1500#true} {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #170#return; {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-08 12:46:52,070 INFO L280 TraceCheckUtils]: 80: Hoare triple {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-08 12:46:52,071 INFO L280 TraceCheckUtils]: 81: Hoare triple {1545#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} assume 0 != #t~nondet8;havoc #t~nondet8;#t~pre9 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre9; {1554#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-08 12:46:52,072 INFO L263 TraceCheckUtils]: 82: Hoare triple {1554#(< main_~c~0 main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {1555#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:46:52,082 INFO L280 TraceCheckUtils]: 83: Hoare triple {1555#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1556#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:46:52,083 INFO L280 TraceCheckUtils]: 84: Hoare triple {1556#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1501#false} is VALID [2020-07-08 12:46:52,083 INFO L280 TraceCheckUtils]: 85: Hoare triple {1501#false} assume !false; {1501#false} is VALID [2020-07-08 12:46:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2020-07-08 12:46:52,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474543120] [2020-07-08 12:46:52,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:52,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-08 12:46:52,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599212590] [2020-07-08 12:46:52,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2020-07-08 12:46:52,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:52,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-08 12:46:52,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:52,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-08 12:46:52,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:52,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-08 12:46:52,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:52,181 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 7 states. [2020-07-08 12:46:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:52,795 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2020-07-08 12:46:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-08 12:46:52,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2020-07-08 12:46:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:52,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2020-07-08 12:46:52,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-08 12:46:52,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 92 transitions. [2020-07-08 12:46:52,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 92 transitions. [2020-07-08 12:46:52,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:52,951 INFO L225 Difference]: With dead ends: 83 [2020-07-08 12:46:52,951 INFO L226 Difference]: Without dead ends: 81 [2020-07-08 12:46:52,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:46:52,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-08 12:46:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2020-07-08 12:46:53,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:53,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 75 states. [2020-07-08 12:46:53,052 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 75 states. [2020-07-08 12:46:53,052 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 75 states. [2020-07-08 12:46:53,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:53,058 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2020-07-08 12:46:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2020-07-08 12:46:53,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:53,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:53,059 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 81 states. [2020-07-08 12:46:53,059 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 81 states. [2020-07-08 12:46:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:53,066 INFO L93 Difference]: Finished difference Result 81 states and 106 transitions. [2020-07-08 12:46:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2020-07-08 12:46:53,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:53,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:53,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:53,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-08 12:46:53,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2020-07-08 12:46:53,072 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 86 [2020-07-08 12:46:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:53,072 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2020-07-08 12:46:53,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-08 12:46:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2020-07-08 12:46:53,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-08 12:46:53,074 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:53,075 INFO L422 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:53,075 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 12:46:53,075 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:53,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash 58209754, now seen corresponding path program 1 times [2020-07-08 12:46:53,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:53,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008290629] [2020-07-08 12:46:53,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,195 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,196 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1958#true} {1958#true} #140#return; {1958#true} is VALID [2020-07-08 12:46:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,200 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,201 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,201 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #144#return; {1958#true} is VALID [2020-07-08 12:46:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,206 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,207 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,207 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,208 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #146#return; {1958#true} is VALID [2020-07-08 12:46:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,212 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,213 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,213 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #148#return; {1958#true} is VALID [2020-07-08 12:46:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,217 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,217 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #150#return; {1958#true} is VALID [2020-07-08 12:46:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,223 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,224 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #156#return; {1958#true} is VALID [2020-07-08 12:46:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,232 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,233 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,233 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #158#return; {1958#true} is VALID [2020-07-08 12:46:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,239 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,239 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,240 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #160#return; {1958#true} is VALID [2020-07-08 12:46:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,247 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1958#true} #162#return; {1958#true} is VALID [2020-07-08 12:46:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,252 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,252 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,253 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,253 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #164#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,259 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,260 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,260 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,261 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #166#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,267 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,268 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #168#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,274 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,275 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,276 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #170#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:53,281 INFO L280 TraceCheckUtils]: 0: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,282 INFO L280 TraceCheckUtils]: 2: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,283 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1958#true} {2011#(<= 1 main_~c~0)} #172#return; {2011#(<= 1 main_~c~0)} is VALID [2020-07-08 12:46:53,283 INFO L263 TraceCheckUtils]: 0: Hoare triple {1958#true} call ULTIMATE.init(); {1958#true} is VALID [2020-07-08 12:46:53,283 INFO L280 TraceCheckUtils]: 1: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,284 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1958#true} {1958#true} #140#return; {1958#true} is VALID [2020-07-08 12:46:53,284 INFO L263 TraceCheckUtils]: 3: Hoare triple {1958#true} call #t~ret11 := main(); {1958#true} is VALID [2020-07-08 12:46:53,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {1958#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {1958#true} is VALID [2020-07-08 12:46:53,284 INFO L280 TraceCheckUtils]: 5: Hoare triple {1958#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1958#true} is VALID [2020-07-08 12:46:53,285 INFO L280 TraceCheckUtils]: 6: Hoare triple {1958#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1958#true} is VALID [2020-07-08 12:46:53,285 INFO L280 TraceCheckUtils]: 7: Hoare triple {1958#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1958#true} is VALID [2020-07-08 12:46:53,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {1958#true} assume ~urilen~0 > 0; {1958#true} is VALID [2020-07-08 12:46:53,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {1958#true} assume ~tokenlen~0 > 0; {1958#true} is VALID [2020-07-08 12:46:53,285 INFO L280 TraceCheckUtils]: 10: Hoare triple {1958#true} assume ~scheme~0 >= 0; {1958#true} is VALID [2020-07-08 12:46:53,286 INFO L280 TraceCheckUtils]: 11: Hoare triple {1958#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1958#true} is VALID [2020-07-08 12:46:53,286 INFO L263 TraceCheckUtils]: 12: Hoare triple {1958#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,286 INFO L280 TraceCheckUtils]: 13: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,286 INFO L280 TraceCheckUtils]: 14: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,287 INFO L280 TraceCheckUtils]: 15: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,287 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1958#true} {1958#true} #144#return; {1958#true} is VALID [2020-07-08 12:46:53,287 INFO L263 TraceCheckUtils]: 17: Hoare triple {1958#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,287 INFO L280 TraceCheckUtils]: 18: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,287 INFO L280 TraceCheckUtils]: 19: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,288 INFO L280 TraceCheckUtils]: 20: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,288 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1958#true} {1958#true} #146#return; {1958#true} is VALID [2020-07-08 12:46:53,288 INFO L280 TraceCheckUtils]: 22: Hoare triple {1958#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1958#true} is VALID [2020-07-08 12:46:53,288 INFO L280 TraceCheckUtils]: 23: Hoare triple {1958#true} assume 0 != #t~nondet3;havoc #t~nondet3; {1958#true} is VALID [2020-07-08 12:46:53,288 INFO L263 TraceCheckUtils]: 24: Hoare triple {1958#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,289 INFO L280 TraceCheckUtils]: 25: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,289 INFO L280 TraceCheckUtils]: 26: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,289 INFO L280 TraceCheckUtils]: 27: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,289 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1958#true} {1958#true} #148#return; {1958#true} is VALID [2020-07-08 12:46:53,290 INFO L263 TraceCheckUtils]: 29: Hoare triple {1958#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,290 INFO L280 TraceCheckUtils]: 30: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,290 INFO L280 TraceCheckUtils]: 31: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,290 INFO L280 TraceCheckUtils]: 32: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,290 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {1958#true} {1958#true} #150#return; {1958#true} is VALID [2020-07-08 12:46:53,291 INFO L280 TraceCheckUtils]: 34: Hoare triple {1958#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1958#true} is VALID [2020-07-08 12:46:53,291 INFO L280 TraceCheckUtils]: 35: Hoare triple {1958#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1958#true} is VALID [2020-07-08 12:46:53,291 INFO L263 TraceCheckUtils]: 36: Hoare triple {1958#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,291 INFO L280 TraceCheckUtils]: 37: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,291 INFO L280 TraceCheckUtils]: 38: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,292 INFO L280 TraceCheckUtils]: 39: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,292 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1958#true} {1958#true} #156#return; {1958#true} is VALID [2020-07-08 12:46:53,292 INFO L263 TraceCheckUtils]: 41: Hoare triple {1958#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,292 INFO L280 TraceCheckUtils]: 42: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,292 INFO L280 TraceCheckUtils]: 43: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,293 INFO L280 TraceCheckUtils]: 44: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,293 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {1958#true} {1958#true} #158#return; {1958#true} is VALID [2020-07-08 12:46:53,293 INFO L280 TraceCheckUtils]: 46: Hoare triple {1958#true} assume !(~cp~0 == ~urilen~0 - 1); {1958#true} is VALID [2020-07-08 12:46:53,293 INFO L263 TraceCheckUtils]: 47: Hoare triple {1958#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,294 INFO L280 TraceCheckUtils]: 48: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,294 INFO L280 TraceCheckUtils]: 49: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,294 INFO L280 TraceCheckUtils]: 50: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,294 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {1958#true} {1958#true} #160#return; {1958#true} is VALID [2020-07-08 12:46:53,294 INFO L263 TraceCheckUtils]: 52: Hoare triple {1958#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,294 INFO L280 TraceCheckUtils]: 53: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,294 INFO L280 TraceCheckUtils]: 54: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,295 INFO L280 TraceCheckUtils]: 55: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,295 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {1958#true} {1958#true} #162#return; {1958#true} is VALID [2020-07-08 12:46:53,295 INFO L280 TraceCheckUtils]: 57: Hoare triple {1958#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre6 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre6;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {1958#true} is VALID [2020-07-08 12:46:53,296 INFO L280 TraceCheckUtils]: 58: Hoare triple {1958#true} assume 0 != #t~nondet7;havoc #t~nondet7;~c~0 := 0; {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,296 INFO L263 TraceCheckUtils]: 59: Hoare triple {1994#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,296 INFO L280 TraceCheckUtils]: 60: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,296 INFO L280 TraceCheckUtils]: 61: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,296 INFO L280 TraceCheckUtils]: 62: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,297 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #164#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,297 INFO L263 TraceCheckUtils]: 64: Hoare triple {1994#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,297 INFO L280 TraceCheckUtils]: 65: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,297 INFO L280 TraceCheckUtils]: 66: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,297 INFO L280 TraceCheckUtils]: 67: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,298 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #166#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,298 INFO L280 TraceCheckUtils]: 69: Hoare triple {1994#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,298 INFO L263 TraceCheckUtils]: 70: Hoare triple {1994#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,299 INFO L280 TraceCheckUtils]: 71: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,299 INFO L280 TraceCheckUtils]: 72: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,299 INFO L280 TraceCheckUtils]: 73: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,299 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #168#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,300 INFO L263 TraceCheckUtils]: 75: Hoare triple {1994#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,300 INFO L280 TraceCheckUtils]: 76: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,300 INFO L280 TraceCheckUtils]: 77: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,300 INFO L280 TraceCheckUtils]: 78: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,301 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {1958#true} {1994#(= 0 main_~c~0)} #170#return; {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,302 INFO L280 TraceCheckUtils]: 80: Hoare triple {1994#(= 0 main_~c~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1994#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:53,303 INFO L280 TraceCheckUtils]: 81: Hoare triple {1994#(= 0 main_~c~0)} assume 0 != #t~nondet8;havoc #t~nondet8;#t~pre9 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre9; {2011#(<= 1 main_~c~0)} is VALID [2020-07-08 12:46:53,303 INFO L263 TraceCheckUtils]: 82: Hoare triple {2011#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {1958#true} is VALID [2020-07-08 12:46:53,304 INFO L280 TraceCheckUtils]: 83: Hoare triple {1958#true} ~cond := #in~cond; {1958#true} is VALID [2020-07-08 12:46:53,304 INFO L280 TraceCheckUtils]: 84: Hoare triple {1958#true} assume !(0 == ~cond); {1958#true} is VALID [2020-07-08 12:46:53,304 INFO L280 TraceCheckUtils]: 85: Hoare triple {1958#true} assume true; {1958#true} is VALID [2020-07-08 12:46:53,305 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {1958#true} {2011#(<= 1 main_~c~0)} #172#return; {2011#(<= 1 main_~c~0)} is VALID [2020-07-08 12:46:53,305 INFO L263 TraceCheckUtils]: 87: Hoare triple {2011#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {2016#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:46:53,306 INFO L280 TraceCheckUtils]: 88: Hoare triple {2016#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2017#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:46:53,306 INFO L280 TraceCheckUtils]: 89: Hoare triple {2017#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1959#false} is VALID [2020-07-08 12:46:53,306 INFO L280 TraceCheckUtils]: 90: Hoare triple {1959#false} assume !false; {1959#false} is VALID [2020-07-08 12:46:53,312 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2020-07-08 12:46:53,312 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008290629] [2020-07-08 12:46:53,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:46:53,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 12:46:53,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660599980] [2020-07-08 12:46:53,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2020-07-08 12:46:53,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:53,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:53,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:53,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:53,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:53,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:53,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:46:53,391 INFO L87 Difference]: Start difference. First operand 75 states and 97 transitions. Second operand 6 states. [2020-07-08 12:46:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:53,959 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2020-07-08 12:46:53,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:46:53,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2020-07-08 12:46:53,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:53,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2020-07-08 12:46:53,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2020-07-08 12:46:53,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2020-07-08 12:46:54,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:54,089 INFO L225 Difference]: With dead ends: 81 [2020-07-08 12:46:54,089 INFO L226 Difference]: Without dead ends: 79 [2020-07-08 12:46:54,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-08 12:46:54,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-08 12:46:54,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-07-08 12:46:54,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:54,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2020-07-08 12:46:54,190 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-08 12:46:54,190 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-08 12:46:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:54,195 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2020-07-08 12:46:54,195 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-07-08 12:46:54,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:54,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:54,197 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-08 12:46:54,197 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-08 12:46:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:54,202 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2020-07-08 12:46:54,203 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-07-08 12:46:54,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:54,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:54,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:54,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-08 12:46:54,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 100 transitions. [2020-07-08 12:46:54,208 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 100 transitions. Word has length 91 [2020-07-08 12:46:54,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:54,209 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 100 transitions. [2020-07-08 12:46:54,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:54,209 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 100 transitions. [2020-07-08 12:46:54,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2020-07-08 12:46:54,211 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:54,212 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:54,212 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:46:54,213 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:54,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash 299780712, now seen corresponding path program 1 times [2020-07-08 12:46:54,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:54,214 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661340345] [2020-07-08 12:46:54,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,368 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,369 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2414#true} {2414#true} #140#return; {2414#true} is VALID [2020-07-08 12:46:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,376 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,377 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,377 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,378 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #144#return; {2414#true} is VALID [2020-07-08 12:46:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,384 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,384 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #146#return; {2414#true} is VALID [2020-07-08 12:46:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,407 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,408 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #148#return; {2414#true} is VALID [2020-07-08 12:46:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,415 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #150#return; {2414#true} is VALID [2020-07-08 12:46:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,421 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,422 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #156#return; {2414#true} is VALID [2020-07-08 12:46:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,435 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #158#return; {2414#true} is VALID [2020-07-08 12:46:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,441 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,442 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #160#return; {2414#true} is VALID [2020-07-08 12:46:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,452 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,453 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #162#return; {2414#true} is VALID [2020-07-08 12:46:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,468 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,468 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,469 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2450#(= 0 main_~c~0)} #164#return; {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,475 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,476 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,477 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,478 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2450#(= 0 main_~c~0)} #166#return; {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,484 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,485 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2450#(= 0 main_~c~0)} #168#return; {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,504 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,506 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2450#(= 0 main_~c~0)} #170#return; {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,511 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,512 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #172#return; {2414#true} is VALID [2020-07-08 12:46:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,517 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,517 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #174#return; {2414#true} is VALID [2020-07-08 12:46:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,525 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,526 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #176#return; {2414#true} is VALID [2020-07-08 12:46:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,530 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,531 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #178#return; {2414#true} is VALID [2020-07-08 12:46:54,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,537 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,540 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} #168#return; {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-08 12:46:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,550 INFO L280 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,551 INFO L280 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,553 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} #170#return; {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-08 12:46:54,554 INFO L263 TraceCheckUtils]: 0: Hoare triple {2414#true} call ULTIMATE.init(); {2414#true} is VALID [2020-07-08 12:46:54,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,555 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2414#true} {2414#true} #140#return; {2414#true} is VALID [2020-07-08 12:46:54,555 INFO L263 TraceCheckUtils]: 3: Hoare triple {2414#true} call #t~ret11 := main(); {2414#true} is VALID [2020-07-08 12:46:54,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {2414#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {2414#true} is VALID [2020-07-08 12:46:54,556 INFO L280 TraceCheckUtils]: 5: Hoare triple {2414#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2414#true} is VALID [2020-07-08 12:46:54,556 INFO L280 TraceCheckUtils]: 6: Hoare triple {2414#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2414#true} is VALID [2020-07-08 12:46:54,557 INFO L280 TraceCheckUtils]: 7: Hoare triple {2414#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2414#true} is VALID [2020-07-08 12:46:54,557 INFO L280 TraceCheckUtils]: 8: Hoare triple {2414#true} assume ~urilen~0 > 0; {2414#true} is VALID [2020-07-08 12:46:54,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {2414#true} assume ~tokenlen~0 > 0; {2414#true} is VALID [2020-07-08 12:46:54,558 INFO L280 TraceCheckUtils]: 10: Hoare triple {2414#true} assume ~scheme~0 >= 0; {2414#true} is VALID [2020-07-08 12:46:54,558 INFO L280 TraceCheckUtils]: 11: Hoare triple {2414#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {2414#true} is VALID [2020-07-08 12:46:54,558 INFO L263 TraceCheckUtils]: 12: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,558 INFO L280 TraceCheckUtils]: 13: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,558 INFO L280 TraceCheckUtils]: 14: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,559 INFO L280 TraceCheckUtils]: 15: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,559 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2414#true} {2414#true} #144#return; {2414#true} is VALID [2020-07-08 12:46:54,559 INFO L263 TraceCheckUtils]: 17: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,559 INFO L280 TraceCheckUtils]: 18: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,559 INFO L280 TraceCheckUtils]: 19: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,559 INFO L280 TraceCheckUtils]: 20: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,560 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2414#true} {2414#true} #146#return; {2414#true} is VALID [2020-07-08 12:46:54,560 INFO L280 TraceCheckUtils]: 22: Hoare triple {2414#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2414#true} is VALID [2020-07-08 12:46:54,560 INFO L280 TraceCheckUtils]: 23: Hoare triple {2414#true} assume 0 != #t~nondet3;havoc #t~nondet3; {2414#true} is VALID [2020-07-08 12:46:54,560 INFO L263 TraceCheckUtils]: 24: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,560 INFO L280 TraceCheckUtils]: 25: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,561 INFO L280 TraceCheckUtils]: 26: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,561 INFO L280 TraceCheckUtils]: 27: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,561 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2414#true} {2414#true} #148#return; {2414#true} is VALID [2020-07-08 12:46:54,562 INFO L263 TraceCheckUtils]: 29: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,562 INFO L280 TraceCheckUtils]: 30: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,563 INFO L280 TraceCheckUtils]: 31: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,563 INFO L280 TraceCheckUtils]: 32: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,564 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2414#true} {2414#true} #150#return; {2414#true} is VALID [2020-07-08 12:46:54,564 INFO L280 TraceCheckUtils]: 34: Hoare triple {2414#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2414#true} is VALID [2020-07-08 12:46:54,564 INFO L280 TraceCheckUtils]: 35: Hoare triple {2414#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2414#true} is VALID [2020-07-08 12:46:54,565 INFO L263 TraceCheckUtils]: 36: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,565 INFO L280 TraceCheckUtils]: 37: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,565 INFO L280 TraceCheckUtils]: 38: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,566 INFO L280 TraceCheckUtils]: 39: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,566 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2414#true} {2414#true} #156#return; {2414#true} is VALID [2020-07-08 12:46:54,566 INFO L263 TraceCheckUtils]: 41: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,567 INFO L280 TraceCheckUtils]: 42: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,567 INFO L280 TraceCheckUtils]: 43: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,567 INFO L280 TraceCheckUtils]: 44: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,567 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2414#true} {2414#true} #158#return; {2414#true} is VALID [2020-07-08 12:46:54,568 INFO L280 TraceCheckUtils]: 46: Hoare triple {2414#true} assume !(~cp~0 == ~urilen~0 - 1); {2414#true} is VALID [2020-07-08 12:46:54,568 INFO L263 TraceCheckUtils]: 47: Hoare triple {2414#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,568 INFO L280 TraceCheckUtils]: 48: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,568 INFO L280 TraceCheckUtils]: 49: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,569 INFO L280 TraceCheckUtils]: 50: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,569 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2414#true} {2414#true} #160#return; {2414#true} is VALID [2020-07-08 12:46:54,569 INFO L263 TraceCheckUtils]: 52: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,569 INFO L280 TraceCheckUtils]: 53: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,570 INFO L280 TraceCheckUtils]: 54: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,570 INFO L280 TraceCheckUtils]: 55: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,570 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2414#true} {2414#true} #162#return; {2414#true} is VALID [2020-07-08 12:46:54,570 INFO L280 TraceCheckUtils]: 57: Hoare triple {2414#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre6 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre6;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2414#true} is VALID [2020-07-08 12:46:54,572 INFO L280 TraceCheckUtils]: 58: Hoare triple {2414#true} assume 0 != #t~nondet7;havoc #t~nondet7;~c~0 := 0; {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,573 INFO L263 TraceCheckUtils]: 59: Hoare triple {2450#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,574 INFO L280 TraceCheckUtils]: 60: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,574 INFO L280 TraceCheckUtils]: 61: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,574 INFO L280 TraceCheckUtils]: 62: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,576 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {2414#true} {2450#(= 0 main_~c~0)} #164#return; {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,577 INFO L263 TraceCheckUtils]: 64: Hoare triple {2450#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,578 INFO L280 TraceCheckUtils]: 65: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,578 INFO L280 TraceCheckUtils]: 66: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,578 INFO L280 TraceCheckUtils]: 67: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,580 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2414#true} {2450#(= 0 main_~c~0)} #166#return; {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,581 INFO L280 TraceCheckUtils]: 69: Hoare triple {2450#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,581 INFO L263 TraceCheckUtils]: 70: Hoare triple {2450#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,581 INFO L280 TraceCheckUtils]: 71: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,581 INFO L280 TraceCheckUtils]: 72: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,582 INFO L280 TraceCheckUtils]: 73: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,583 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {2414#true} {2450#(= 0 main_~c~0)} #168#return; {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,583 INFO L263 TraceCheckUtils]: 75: Hoare triple {2450#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,584 INFO L280 TraceCheckUtils]: 76: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,584 INFO L280 TraceCheckUtils]: 77: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,584 INFO L280 TraceCheckUtils]: 78: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,587 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {2414#true} {2450#(= 0 main_~c~0)} #170#return; {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,588 INFO L280 TraceCheckUtils]: 80: Hoare triple {2450#(= 0 main_~c~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2450#(= 0 main_~c~0)} is VALID [2020-07-08 12:46:54,588 INFO L280 TraceCheckUtils]: 81: Hoare triple {2450#(= 0 main_~c~0)} assume 0 != #t~nondet8;havoc #t~nondet8;#t~pre9 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre9; {2414#true} is VALID [2020-07-08 12:46:54,589 INFO L263 TraceCheckUtils]: 82: Hoare triple {2414#true} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,589 INFO L280 TraceCheckUtils]: 83: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,589 INFO L280 TraceCheckUtils]: 84: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,590 INFO L280 TraceCheckUtils]: 85: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,590 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {2414#true} {2414#true} #172#return; {2414#true} is VALID [2020-07-08 12:46:54,590 INFO L263 TraceCheckUtils]: 87: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,591 INFO L280 TraceCheckUtils]: 88: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,591 INFO L280 TraceCheckUtils]: 89: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,591 INFO L280 TraceCheckUtils]: 90: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,591 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2414#true} {2414#true} #174#return; {2414#true} is VALID [2020-07-08 12:46:54,592 INFO L263 TraceCheckUtils]: 92: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,592 INFO L280 TraceCheckUtils]: 93: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,600 INFO L280 TraceCheckUtils]: 94: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,601 INFO L280 TraceCheckUtils]: 95: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,601 INFO L275 TraceCheckUtils]: 96: Hoare quadruple {2414#true} {2414#true} #176#return; {2414#true} is VALID [2020-07-08 12:46:54,601 INFO L263 TraceCheckUtils]: 97: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,602 INFO L280 TraceCheckUtils]: 98: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,602 INFO L280 TraceCheckUtils]: 99: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,602 INFO L280 TraceCheckUtils]: 100: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,602 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {2414#true} {2414#true} #178#return; {2414#true} is VALID [2020-07-08 12:46:54,603 INFO L280 TraceCheckUtils]: 102: Hoare triple {2414#true} #t~pre10 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre10; {2414#true} is VALID [2020-07-08 12:46:54,615 INFO L280 TraceCheckUtils]: 103: Hoare triple {2414#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-08 12:46:54,616 INFO L263 TraceCheckUtils]: 104: Hoare triple {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,616 INFO L280 TraceCheckUtils]: 105: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,617 INFO L280 TraceCheckUtils]: 106: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,617 INFO L280 TraceCheckUtils]: 107: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,635 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {2414#true} {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} #168#return; {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-08 12:46:54,636 INFO L263 TraceCheckUtils]: 109: Hoare triple {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:54,636 INFO L280 TraceCheckUtils]: 110: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:54,636 INFO L280 TraceCheckUtils]: 111: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:54,636 INFO L280 TraceCheckUtils]: 112: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:54,658 INFO L275 TraceCheckUtils]: 113: Hoare quadruple {2414#true} {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} #170#return; {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-08 12:46:54,676 INFO L280 TraceCheckUtils]: 114: Hoare triple {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-08 12:46:54,678 INFO L280 TraceCheckUtils]: 115: Hoare triple {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume 0 != #t~nondet8;havoc #t~nondet8;#t~pre9 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre9; {2492#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-08 12:46:54,681 INFO L263 TraceCheckUtils]: 116: Hoare triple {2492#(< main_~c~0 main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2493#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:46:54,682 INFO L280 TraceCheckUtils]: 117: Hoare triple {2493#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2494#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:46:54,683 INFO L280 TraceCheckUtils]: 118: Hoare triple {2494#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2415#false} is VALID [2020-07-08 12:46:54,684 INFO L280 TraceCheckUtils]: 119: Hoare triple {2415#false} assume !false; {2415#false} is VALID [2020-07-08 12:46:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 37 proven. 5 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2020-07-08 12:46:54,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661340345] [2020-07-08 12:46:54,701 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325621182] [2020-07-08 12:46:54,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,807 INFO L264 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:46:54,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:54,884 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:55,148 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-08 12:46:55,198 INFO L263 TraceCheckUtils]: 0: Hoare triple {2414#true} call ULTIMATE.init(); {2414#true} is VALID [2020-07-08 12:46:55,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,198 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2414#true} {2414#true} #140#return; {2414#true} is VALID [2020-07-08 12:46:55,199 INFO L263 TraceCheckUtils]: 3: Hoare triple {2414#true} call #t~ret11 := main(); {2414#true} is VALID [2020-07-08 12:46:55,199 INFO L280 TraceCheckUtils]: 4: Hoare triple {2414#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~scheme~0 := #t~nondet2;havoc #t~nondet2; {2414#true} is VALID [2020-07-08 12:46:55,199 INFO L280 TraceCheckUtils]: 5: Hoare triple {2414#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2414#true} is VALID [2020-07-08 12:46:55,200 INFO L280 TraceCheckUtils]: 6: Hoare triple {2414#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2414#true} is VALID [2020-07-08 12:46:55,200 INFO L280 TraceCheckUtils]: 7: Hoare triple {2414#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2414#true} is VALID [2020-07-08 12:46:55,200 INFO L280 TraceCheckUtils]: 8: Hoare triple {2414#true} assume ~urilen~0 > 0; {2414#true} is VALID [2020-07-08 12:46:55,200 INFO L280 TraceCheckUtils]: 9: Hoare triple {2414#true} assume ~tokenlen~0 > 0; {2414#true} is VALID [2020-07-08 12:46:55,200 INFO L280 TraceCheckUtils]: 10: Hoare triple {2414#true} assume ~scheme~0 >= 0; {2414#true} is VALID [2020-07-08 12:46:55,201 INFO L280 TraceCheckUtils]: 11: Hoare triple {2414#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {2414#true} is VALID [2020-07-08 12:46:55,201 INFO L263 TraceCheckUtils]: 12: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,201 INFO L280 TraceCheckUtils]: 13: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,201 INFO L280 TraceCheckUtils]: 14: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,201 INFO L280 TraceCheckUtils]: 15: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,201 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2414#true} {2414#true} #144#return; {2414#true} is VALID [2020-07-08 12:46:55,202 INFO L263 TraceCheckUtils]: 17: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,202 INFO L280 TraceCheckUtils]: 18: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,202 INFO L280 TraceCheckUtils]: 19: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,202 INFO L280 TraceCheckUtils]: 20: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,202 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {2414#true} {2414#true} #146#return; {2414#true} is VALID [2020-07-08 12:46:55,202 INFO L280 TraceCheckUtils]: 22: Hoare triple {2414#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2414#true} is VALID [2020-07-08 12:46:55,203 INFO L280 TraceCheckUtils]: 23: Hoare triple {2414#true} assume 0 != #t~nondet3;havoc #t~nondet3; {2414#true} is VALID [2020-07-08 12:46:55,203 INFO L263 TraceCheckUtils]: 24: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,203 INFO L280 TraceCheckUtils]: 25: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,203 INFO L280 TraceCheckUtils]: 26: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,203 INFO L280 TraceCheckUtils]: 27: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,203 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2414#true} {2414#true} #148#return; {2414#true} is VALID [2020-07-08 12:46:55,204 INFO L263 TraceCheckUtils]: 29: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,204 INFO L280 TraceCheckUtils]: 30: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,204 INFO L280 TraceCheckUtils]: 31: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,204 INFO L280 TraceCheckUtils]: 32: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,204 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {2414#true} {2414#true} #150#return; {2414#true} is VALID [2020-07-08 12:46:55,204 INFO L280 TraceCheckUtils]: 34: Hoare triple {2414#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2414#true} is VALID [2020-07-08 12:46:55,205 INFO L280 TraceCheckUtils]: 35: Hoare triple {2414#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2414#true} is VALID [2020-07-08 12:46:55,205 INFO L263 TraceCheckUtils]: 36: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,205 INFO L280 TraceCheckUtils]: 37: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,205 INFO L280 TraceCheckUtils]: 38: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,205 INFO L280 TraceCheckUtils]: 39: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,205 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {2414#true} {2414#true} #156#return; {2414#true} is VALID [2020-07-08 12:46:55,206 INFO L263 TraceCheckUtils]: 41: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,206 INFO L280 TraceCheckUtils]: 42: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,206 INFO L280 TraceCheckUtils]: 43: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,206 INFO L280 TraceCheckUtils]: 44: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,206 INFO L275 TraceCheckUtils]: 45: Hoare quadruple {2414#true} {2414#true} #158#return; {2414#true} is VALID [2020-07-08 12:46:55,206 INFO L280 TraceCheckUtils]: 46: Hoare triple {2414#true} assume !(~cp~0 == ~urilen~0 - 1); {2414#true} is VALID [2020-07-08 12:46:55,207 INFO L263 TraceCheckUtils]: 47: Hoare triple {2414#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,207 INFO L280 TraceCheckUtils]: 48: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,207 INFO L280 TraceCheckUtils]: 49: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,207 INFO L280 TraceCheckUtils]: 50: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,207 INFO L275 TraceCheckUtils]: 51: Hoare quadruple {2414#true} {2414#true} #160#return; {2414#true} is VALID [2020-07-08 12:46:55,207 INFO L263 TraceCheckUtils]: 52: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,208 INFO L280 TraceCheckUtils]: 53: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,208 INFO L280 TraceCheckUtils]: 54: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,208 INFO L280 TraceCheckUtils]: 55: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,208 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2414#true} {2414#true} #162#return; {2414#true} is VALID [2020-07-08 12:46:55,208 INFO L280 TraceCheckUtils]: 57: Hoare triple {2414#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre6 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre6;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2414#true} is VALID [2020-07-08 12:46:55,208 INFO L280 TraceCheckUtils]: 58: Hoare triple {2414#true} assume 0 != #t~nondet7;havoc #t~nondet7;~c~0 := 0; {2414#true} is VALID [2020-07-08 12:46:55,209 INFO L263 TraceCheckUtils]: 59: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,209 INFO L280 TraceCheckUtils]: 60: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,209 INFO L280 TraceCheckUtils]: 61: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,209 INFO L280 TraceCheckUtils]: 62: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,209 INFO L275 TraceCheckUtils]: 63: Hoare quadruple {2414#true} {2414#true} #164#return; {2414#true} is VALID [2020-07-08 12:46:55,210 INFO L263 TraceCheckUtils]: 64: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,210 INFO L280 TraceCheckUtils]: 65: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,210 INFO L280 TraceCheckUtils]: 66: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,210 INFO L280 TraceCheckUtils]: 67: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,211 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2414#true} {2414#true} #166#return; {2414#true} is VALID [2020-07-08 12:46:55,211 INFO L280 TraceCheckUtils]: 69: Hoare triple {2414#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2414#true} is VALID [2020-07-08 12:46:55,211 INFO L263 TraceCheckUtils]: 70: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,212 INFO L280 TraceCheckUtils]: 71: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,212 INFO L280 TraceCheckUtils]: 72: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,212 INFO L280 TraceCheckUtils]: 73: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,212 INFO L275 TraceCheckUtils]: 74: Hoare quadruple {2414#true} {2414#true} #168#return; {2414#true} is VALID [2020-07-08 12:46:55,213 INFO L263 TraceCheckUtils]: 75: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,213 INFO L280 TraceCheckUtils]: 76: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,213 INFO L280 TraceCheckUtils]: 77: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,213 INFO L280 TraceCheckUtils]: 78: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,214 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {2414#true} {2414#true} #170#return; {2414#true} is VALID [2020-07-08 12:46:55,214 INFO L280 TraceCheckUtils]: 80: Hoare triple {2414#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2414#true} is VALID [2020-07-08 12:46:55,214 INFO L280 TraceCheckUtils]: 81: Hoare triple {2414#true} assume 0 != #t~nondet8;havoc #t~nondet8;#t~pre9 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre9; {2414#true} is VALID [2020-07-08 12:46:55,214 INFO L263 TraceCheckUtils]: 82: Hoare triple {2414#true} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,214 INFO L280 TraceCheckUtils]: 83: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,214 INFO L280 TraceCheckUtils]: 84: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,214 INFO L280 TraceCheckUtils]: 85: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,215 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {2414#true} {2414#true} #172#return; {2414#true} is VALID [2020-07-08 12:46:55,215 INFO L263 TraceCheckUtils]: 87: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,215 INFO L280 TraceCheckUtils]: 88: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,215 INFO L280 TraceCheckUtils]: 89: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,215 INFO L280 TraceCheckUtils]: 90: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,215 INFO L275 TraceCheckUtils]: 91: Hoare quadruple {2414#true} {2414#true} #174#return; {2414#true} is VALID [2020-07-08 12:46:55,215 INFO L263 TraceCheckUtils]: 92: Hoare triple {2414#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,215 INFO L280 TraceCheckUtils]: 93: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,216 INFO L280 TraceCheckUtils]: 94: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,216 INFO L280 TraceCheckUtils]: 95: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,216 INFO L275 TraceCheckUtils]: 96: Hoare quadruple {2414#true} {2414#true} #176#return; {2414#true} is VALID [2020-07-08 12:46:55,216 INFO L263 TraceCheckUtils]: 97: Hoare triple {2414#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,216 INFO L280 TraceCheckUtils]: 98: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,217 INFO L280 TraceCheckUtils]: 99: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,217 INFO L280 TraceCheckUtils]: 100: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,217 INFO L275 TraceCheckUtils]: 101: Hoare quadruple {2414#true} {2414#true} #178#return; {2414#true} is VALID [2020-07-08 12:46:55,217 INFO L280 TraceCheckUtils]: 102: Hoare triple {2414#true} #t~pre10 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre10; {2414#true} is VALID [2020-07-08 12:46:55,218 INFO L280 TraceCheckUtils]: 103: Hoare triple {2414#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-08 12:46:55,218 INFO L263 TraceCheckUtils]: 104: Hoare triple {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,218 INFO L280 TraceCheckUtils]: 105: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,218 INFO L280 TraceCheckUtils]: 106: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,219 INFO L280 TraceCheckUtils]: 107: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,219 INFO L275 TraceCheckUtils]: 108: Hoare quadruple {2414#true} {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} #168#return; {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-08 12:46:55,220 INFO L263 TraceCheckUtils]: 109: Hoare triple {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2414#true} is VALID [2020-07-08 12:46:55,220 INFO L280 TraceCheckUtils]: 110: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2020-07-08 12:46:55,220 INFO L280 TraceCheckUtils]: 111: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2020-07-08 12:46:55,220 INFO L280 TraceCheckUtils]: 112: Hoare triple {2414#true} assume true; {2414#true} is VALID [2020-07-08 12:46:55,221 INFO L275 TraceCheckUtils]: 113: Hoare quadruple {2414#true} {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} #170#return; {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-08 12:46:55,222 INFO L280 TraceCheckUtils]: 114: Hoare triple {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-08 12:46:55,223 INFO L280 TraceCheckUtils]: 115: Hoare triple {2483#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume 0 != #t~nondet8;havoc #t~nondet8;#t~pre9 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre9; {2492#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-08 12:46:55,223 INFO L263 TraceCheckUtils]: 116: Hoare triple {2492#(< main_~c~0 main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2846#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:46:55,224 INFO L280 TraceCheckUtils]: 117: Hoare triple {2846#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2850#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:46:55,224 INFO L280 TraceCheckUtils]: 118: Hoare triple {2850#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2415#false} is VALID [2020-07-08 12:46:55,238 INFO L280 TraceCheckUtils]: 119: Hoare triple {2415#false} assume !false; {2415#false} is VALID [2020-07-08 12:46:55,250 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2020-07-08 12:46:55,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-08 12:46:55,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2020-07-08 12:46:55,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426240647] [2020-07-08 12:46:55,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2020-07-08 12:46:55,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:55,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 12:46:55,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:55,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 12:46:55,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:55,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 12:46:55,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-08 12:46:55,353 INFO L87 Difference]: Start difference. First operand 79 states and 100 transitions. Second operand 6 states. [2020-07-08 12:46:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:55,924 INFO L93 Difference]: Finished difference Result 82 states and 103 transitions. [2020-07-08 12:46:55,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:46:55,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2020-07-08 12:46:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:55,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2020-07-08 12:46:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 12:46:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2020-07-08 12:46:55,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2020-07-08 12:46:56,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:56,052 INFO L225 Difference]: With dead ends: 82 [2020-07-08 12:46:56,052 INFO L226 Difference]: Without dead ends: 0 [2020-07-08 12:46:56,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-08 12:46:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-08 12:46:56,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-08 12:46:56,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:56,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:56,056 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:56,056 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:56,056 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:46:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:56,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:56,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:56,057 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:56,057 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-08 12:46:56,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:56,057 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-08 12:46:56,057 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:56,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:56,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:56,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:56,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:56,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-08 12:46:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-08 12:46:56,059 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 120 [2020-07-08 12:46:56,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:56,059 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-08 12:46:56,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 12:46:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-08 12:46:56,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:56,260 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-08 12:46:56,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-08 12:46:56,883 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-08 12:46:56,884 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:46:56,884 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-08 12:46:56,884 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-08 12:46:56,884 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-08 12:46:56,885 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-08 12:46:56,885 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:46:56,885 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-08 12:46:56,885 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:46:56,885 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-08 12:46:56,885 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (<= 1 main_~cp~0) (< (+ main_~cp~0 1) main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2020-07-08 12:46:56,885 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (<= 1 main_~cp~0) (< (+ main_~cp~0 1) main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2020-07-08 12:46:56,886 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 72) no Hoare annotation was computed. [2020-07-08 12:46:56,886 INFO L264 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< (+ main_~cp~0 1) main_~urilen~0) (= 0 main_~c~0)) [2020-07-08 12:46:56,886 INFO L264 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< (+ main_~cp~0 1) main_~urilen~0) (= 0 main_~c~0)) [2020-07-08 12:46:56,886 INFO L264 CegarLoopResult]: At program point L36-1(lines 35 41) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2020-07-08 12:46:56,886 INFO L264 CegarLoopResult]: At program point L36-2(lines 36 41) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2020-07-08 12:46:56,886 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (<= 1 main_~cp~0) (< (+ main_~cp~0 1) main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2020-07-08 12:46:56,886 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< (+ main_~cp~0 1) main_~urilen~0)) [2020-07-08 12:46:56,887 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< (+ main_~cp~0 1) main_~urilen~0)) [2020-07-08 12:46:56,887 INFO L271 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: true [2020-07-08 12:46:56,887 INFO L268 CegarLoopResult]: For program point L37(line 37) no Hoare annotation was computed. [2020-07-08 12:46:56,887 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (<= 1 main_~cp~0) (< (+ main_~cp~0 1) main_~urilen~0) (< main_~c~0 main_~tokenlen~0)) [2020-07-08 12:46:56,887 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-08 12:46:56,887 INFO L264 CegarLoopResult]: At program point L54-1(lines 53 66) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= (+ main_~cp~0 1) main_~urilen~0)) (.cse2 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 (< main_~c~0 main_~tokenlen~0)) (and .cse0 .cse1 .cse2 (= 0 main_~c~0)))) [2020-07-08 12:46:56,888 INFO L268 CegarLoopResult]: For program point L46(lines 33 69) no Hoare annotation was computed. [2020-07-08 12:46:56,888 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 72) no Hoare annotation was computed. [2020-07-08 12:46:56,888 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< (+ main_~cp~0 1) main_~urilen~0)) [2020-07-08 12:46:56,888 INFO L264 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~cp~0) (< (+ main_~cp~0 1) main_~urilen~0)) [2020-07-08 12:46:56,888 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 72) the Hoare annotation is: true [2020-07-08 12:46:56,888 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-08 12:46:56,888 INFO L268 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2020-07-08 12:46:56,888 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2020-07-08 12:46:56,888 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2020-07-08 12:46:56,889 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse2 (<= 1 main_~cp~0)) (.cse3 (< (+ main_~cp~0 1) main_~urilen~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 main_~c~0)) (and .cse0 .cse1 (<= 1 main_~c~0) .cse2 .cse3))) [2020-07-08 12:46:56,889 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-08 12:46:56,889 INFO L264 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse2 (<= 1 main_~cp~0)) (.cse3 (< (+ main_~cp~0 1) main_~urilen~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= 0 main_~c~0)) (and .cse0 .cse1 (<= 1 main_~c~0) .cse2 .cse3))) [2020-07-08 12:46:56,889 INFO L268 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-07-08 12:46:56,889 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-08 12:46:56,889 INFO L268 CegarLoopResult]: For program point L24(line 24) no Hoare annotation was computed. [2020-07-08 12:46:56,889 INFO L268 CegarLoopResult]: For program point L24-1(lines 14 72) no Hoare annotation was computed. [2020-07-08 12:46:56,889 INFO L268 CegarLoopResult]: For program point L33(lines 33 69) no Hoare annotation was computed. [2020-07-08 12:46:56,889 INFO L268 CegarLoopResult]: For program point L58(lines 58 64) no Hoare annotation was computed. [2020-07-08 12:46:56,889 INFO L268 CegarLoopResult]: For program point L25(lines 14 72) no Hoare annotation was computed. [2020-07-08 12:46:56,890 INFO L268 CegarLoopResult]: For program point L58-1(lines 58 64) no Hoare annotation was computed. [2020-07-08 12:46:56,890 INFO L268 CegarLoopResult]: For program point L50(lines 50 68) no Hoare annotation was computed. [2020-07-08 12:46:56,890 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse2 (<= 1 main_~cp~0)) (.cse1 (+ main_~cp~0 1))) (or (and .cse0 (= .cse1 main_~urilen~0) .cse2) (and .cse0 .cse2 (< .cse1 main_~urilen~0)))) [2020-07-08 12:46:56,890 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2020-07-08 12:46:56,890 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2020-07-08 12:46:56,890 INFO L268 CegarLoopResult]: For program point L26(lines 14 72) no Hoare annotation was computed. [2020-07-08 12:46:56,890 INFO L268 CegarLoopResult]: For program point L43(lines 33 69) no Hoare annotation was computed. [2020-07-08 12:46:56,890 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-08 12:46:56,891 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:46:56,891 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-08 12:46:56,891 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-08 12:46:56,891 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-08 12:46:56,891 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-08 12:46:56,895 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:46:56,895 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:46:56,895 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 12:46:56,896 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:46:56,896 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:46:56,896 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:56,896 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:56,908 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:56,908 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 12:46:56,908 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-08 12:46:56,908 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:46:56,909 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-08 12:46:56,909 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:56,909 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:46:56,909 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:46:56,909 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:46:56,909 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:46:56,909 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:46:56,909 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-08 12:46:56,909 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-08 12:46:56,909 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,910 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,911 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:56,911 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-08 12:46:56,911 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-08 12:46:56,912 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 12:46:56,912 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-08 12:46:56,913 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 12:46:56,913 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 12:46:56,913 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-08 12:46:56,913 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-08 12:46:56,913 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-08 12:46:56,913 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2020-07-08 12:46:56,914 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-08 12:46:56,914 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-08 12:46:56,914 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-08 12:46:56,915 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-08 12:46:56,916 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-08 12:46:56,916 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-08 12:46:56,916 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-08 12:46:56,916 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-08 12:46:56,916 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-08 12:46:56,917 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:46:56,917 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 12:46:56,917 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-08 12:46:56,917 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 12:46:56,917 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 12:46:56,917 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 12:46:56,917 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-08 12:46:56,918 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-08 12:46:56,918 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-08 12:46:56,918 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 12:46:56,918 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2020-07-08 12:46:56,918 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 12:46:56,918 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-08 12:46:56,918 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:46:56,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:46:56 BoogieIcfgContainer [2020-07-08 12:46:56,931 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:46:56,936 INFO L168 Benchmark]: Toolchain (without parser) took 12116.55 ms. Allocated memory was 135.3 MB in the beginning and 343.9 MB in the end (delta: 208.7 MB). Free memory was 100.5 MB in the beginning and 315.2 MB in the end (delta: -214.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:46:56,937 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory is still 118.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:46:56,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.73 ms. Allocated memory is still 135.3 MB. Free memory was 100.0 MB in the beginning and 89.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:56,938 INFO L168 Benchmark]: Boogie Preprocessor took 198.96 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 89.2 MB in the beginning and 179.7 MB in the end (delta: -90.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:56,939 INFO L168 Benchmark]: RCFGBuilder took 947.69 ms. Allocated memory is still 201.3 MB. Free memory was 179.7 MB in the beginning and 142.9 MB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:56,940 INFO L168 Benchmark]: TraceAbstraction took 10522.62 ms. Allocated memory was 201.3 MB in the beginning and 343.9 MB in the end (delta: 142.6 MB). Free memory was 142.9 MB in the beginning and 315.2 MB in the end (delta: -172.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 12:46:56,943 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory is still 118.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 437.73 ms. Allocated memory is still 135.3 MB. Free memory was 100.0 MB in the beginning and 89.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 198.96 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 89.2 MB in the beginning and 179.7 MB in the end (delta: -90.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 947.69 ms. Allocated memory is still 201.3 MB. Free memory was 179.7 MB in the beginning and 142.9 MB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10522.62 ms. Allocated memory was 201.3 MB in the beginning and 343.9 MB in the end (delta: 142.6 MB). Free memory was 142.9 MB in the beginning and 315.2 MB in the end (delta: -172.3 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && cp + 1 <= urilen) && 1 <= cp - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((0 < scheme + 1 && 1 <= c) && cp + 1 <= urilen) && 1 <= cp) && c < tokenlen) || (((0 < scheme + 1 && cp + 1 <= urilen) && 1 <= cp) && 0 == c) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 9.7s, OverallIterations: 7, TraceHistogramMax: 19, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 461 SDtfs, 105 SDslu, 1192 SDs, 0 SdLazy, 381 SolverSat, 95 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 256 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 7 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 77 PreInvPairs, 107 NumberOfFragments, 417 HoareAnnotationTreeSize, 77 FomulaSimplifications, 185 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 26 FomulaSimplificationsInter, 197 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 555 NumberOfCodeBlocks, 555 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 547 ConstructedInterpolants, 0 QuantifiedInterpolants, 66101 SizeOfPredicates, 2 NumberOfNonLiveVariables, 240 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 2075/2080 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...