/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:48:27,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:48:27,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:48:27,047 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:48:27,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:48:27,049 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:48:27,050 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:48:27,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:48:27,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:48:27,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:48:27,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:48:27,059 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:48:27,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:48:27,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:48:27,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:48:27,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:48:27,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:48:27,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:48:27,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:48:27,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:48:27,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:48:27,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:48:27,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:48:27,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:48:27,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:48:27,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:48:27,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:48:27,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:48:27,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:48:27,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:48:27,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:48:27,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:48:27,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:48:27,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:48:27,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:48:27,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:48:27,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:48:27,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:48:27,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:48:27,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:48:27,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:48:27,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:48:27,093 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:48:27,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:48:27,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:48:27,095 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:48:27,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:48:27,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:48:27,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:48:27,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:48:27,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:48:27,096 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:48:27,096 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:48:27,096 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:48:27,097 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:48:27,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:48:27,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:48:27,097 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:48:27,097 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:48:27,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:48:27,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:48:27,098 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:48:27,098 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:48:27,098 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:48:27,099 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:48:27,396 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:48:27,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:48:27,412 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:48:27,413 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:48:27,413 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:48:27,414 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-18 00:48:27,493 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4f7146a/f49a92e0d5c949ceb75ccac7ee081f05/FLAGd94e9007d [2020-07-18 00:48:28,002 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:48:28,003 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2020-07-18 00:48:28,011 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4f7146a/f49a92e0d5c949ceb75ccac7ee081f05/FLAGd94e9007d [2020-07-18 00:48:28,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a4f7146a/f49a92e0d5c949ceb75ccac7ee081f05 [2020-07-18 00:48:28,319 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:48:28,322 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:48:28,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:28,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:48:28,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:48:28,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:28" (1/1) ... [2020-07-18 00:48:28,332 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7779094a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28, skipping insertion in model container [2020-07-18 00:48:28,332 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:48:28" (1/1) ... [2020-07-18 00:48:28,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:48:28,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:48:28,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:28,699 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:48:28,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:48:28,779 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:48:28,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28 WrapperNode [2020-07-18 00:48:28,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:48:28,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:48:28,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:48:28,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:48:28,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28" (1/1) ... [2020-07-18 00:48:28,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28" (1/1) ... [2020-07-18 00:48:28,888 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28" (1/1) ... [2020-07-18 00:48:28,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28" (1/1) ... [2020-07-18 00:48:28,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28" (1/1) ... [2020-07-18 00:48:28,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28" (1/1) ... [2020-07-18 00:48:28,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28" (1/1) ... [2020-07-18 00:48:28,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:48:28,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:48:28,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:48:28,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:48:28,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28" (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-18 00:48:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:48:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:48:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:48:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:48:28,977 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:48:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:48:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:48:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:48:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:48:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:48:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:48:28,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:48:28,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:48:29,608 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:48:29,608 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-18 00:48:29,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:29 BoogieIcfgContainer [2020-07-18 00:48:29,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:48:29,615 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:48:29,616 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:48:29,619 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:48:29,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:48:28" (1/3) ... [2020-07-18 00:48:29,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752f068f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:29, skipping insertion in model container [2020-07-18 00:48:29,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:48:28" (2/3) ... [2020-07-18 00:48:29,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@752f068f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:48:29, skipping insertion in model container [2020-07-18 00:48:29,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:48:29" (3/3) ... [2020-07-18 00:48:29,624 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2020-07-18 00:48:29,635 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:48:29,644 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:48:29,660 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:48:29,701 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:48:29,701 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:48:29,702 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:48:29,702 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:48:29,702 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:48:29,702 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:48:29,703 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:48:29,703 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:48:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2020-07-18 00:48:29,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-18 00:48:29,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:29,736 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:29,737 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:29,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:29,744 INFO L82 PathProgramCache]: Analyzing trace with hash 60896664, now seen corresponding path program 1 times [2020-07-18 00:48:29,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:29,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [562042099] [2020-07-18 00:48:29,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:30,008 INFO L280 TraceCheckUtils]: 0: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-18 00:48:30,008 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {95#true} {95#true} #180#return; {95#true} is VALID [2020-07-18 00:48:30,011 INFO L263 TraceCheckUtils]: 0: Hoare triple {95#true} call ULTIMATE.init(); {95#true} is VALID [2020-07-18 00:48:30,011 INFO L280 TraceCheckUtils]: 1: Hoare triple {95#true} assume true; {95#true} is VALID [2020-07-18 00:48:30,012 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {95#true} {95#true} #180#return; {95#true} is VALID [2020-07-18 00:48:30,012 INFO L263 TraceCheckUtils]: 3: Hoare triple {95#true} call #t~ret11 := main(); {95#true} is VALID [2020-07-18 00:48:30,013 INFO L280 TraceCheckUtils]: 4: Hoare triple {95#true} havoc ~scheme~0; {95#true} is VALID [2020-07-18 00:48:30,013 INFO L280 TraceCheckUtils]: 5: Hoare triple {95#true} havoc ~urilen~0; {95#true} is VALID [2020-07-18 00:48:30,013 INFO L280 TraceCheckUtils]: 6: Hoare triple {95#true} havoc ~tokenlen~0; {95#true} is VALID [2020-07-18 00:48:30,014 INFO L280 TraceCheckUtils]: 7: Hoare triple {95#true} havoc ~cp~0; {95#true} is VALID [2020-07-18 00:48:30,014 INFO L280 TraceCheckUtils]: 8: Hoare triple {95#true} havoc ~c~0; {95#true} is VALID [2020-07-18 00:48:30,014 INFO L280 TraceCheckUtils]: 9: Hoare triple {95#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {95#true} is VALID [2020-07-18 00:48:30,015 INFO L280 TraceCheckUtils]: 10: Hoare triple {95#true} ~urilen~0 := #t~nondet0; {95#true} is VALID [2020-07-18 00:48:30,015 INFO L280 TraceCheckUtils]: 11: Hoare triple {95#true} havoc #t~nondet0; {95#true} is VALID [2020-07-18 00:48:30,016 INFO L280 TraceCheckUtils]: 12: Hoare triple {95#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {95#true} is VALID [2020-07-18 00:48:30,016 INFO L280 TraceCheckUtils]: 13: Hoare triple {95#true} ~tokenlen~0 := #t~nondet1; {95#true} is VALID [2020-07-18 00:48:30,016 INFO L280 TraceCheckUtils]: 14: Hoare triple {95#true} havoc #t~nondet1; {95#true} is VALID [2020-07-18 00:48:30,017 INFO L280 TraceCheckUtils]: 15: Hoare triple {95#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {95#true} is VALID [2020-07-18 00:48:30,017 INFO L280 TraceCheckUtils]: 16: Hoare triple {95#true} ~scheme~0 := #t~nondet2; {95#true} is VALID [2020-07-18 00:48:30,017 INFO L280 TraceCheckUtils]: 17: Hoare triple {95#true} havoc #t~nondet2; {95#true} is VALID [2020-07-18 00:48:30,018 INFO L280 TraceCheckUtils]: 18: Hoare triple {95#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {95#true} is VALID [2020-07-18 00:48:30,018 INFO L280 TraceCheckUtils]: 19: Hoare triple {95#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {95#true} is VALID [2020-07-18 00:48:30,018 INFO L280 TraceCheckUtils]: 20: Hoare triple {95#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {95#true} is VALID [2020-07-18 00:48:30,019 INFO L280 TraceCheckUtils]: 21: Hoare triple {95#true} assume ~urilen~0 > 0; {95#true} is VALID [2020-07-18 00:48:30,019 INFO L280 TraceCheckUtils]: 22: Hoare triple {95#true} assume ~tokenlen~0 > 0; {95#true} is VALID [2020-07-18 00:48:30,019 INFO L280 TraceCheckUtils]: 23: Hoare triple {95#true} assume ~scheme~0 >= 0; {95#true} is VALID [2020-07-18 00:48:30,021 INFO L280 TraceCheckUtils]: 24: Hoare triple {95#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {99#(<= (+ main_~scheme~0 1) main_~urilen~0)} is VALID [2020-07-18 00:48:30,025 INFO L280 TraceCheckUtils]: 25: Hoare triple {99#(<= (+ main_~scheme~0 1) main_~urilen~0)} ~cp~0 := ~scheme~0; {100#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-18 00:48:30,027 INFO L263 TraceCheckUtils]: 26: Hoare triple {100#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {101#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:30,028 INFO L280 TraceCheckUtils]: 27: Hoare triple {101#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {102#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:30,029 INFO L280 TraceCheckUtils]: 28: Hoare triple {102#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {96#false} is VALID [2020-07-18 00:48:30,029 INFO L280 TraceCheckUtils]: 29: Hoare triple {96#false} assume !false; {96#false} is VALID [2020-07-18 00:48:30,034 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-18 00:48:30,036 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:30,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [562042099] [2020-07-18 00:48:30,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:30,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:48:30,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302204155] [2020-07-18 00:48:30,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-18 00:48:30,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:30,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:48:30,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:30,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:48:30,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:30,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:48:30,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:48:30,119 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 6 states. [2020-07-18 00:48:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:31,388 INFO L93 Difference]: Finished difference Result 178 states and 273 transitions. [2020-07-18 00:48:31,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:48:31,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-18 00:48:31,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:31,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:31,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 273 transitions. [2020-07-18 00:48:31,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:31,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 273 transitions. [2020-07-18 00:48:31,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 273 transitions. [2020-07-18 00:48:31,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:31,832 INFO L225 Difference]: With dead ends: 178 [2020-07-18 00:48:31,832 INFO L226 Difference]: Without dead ends: 103 [2020-07-18 00:48:31,842 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-18 00:48:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-18 00:48:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2020-07-18 00:48:31,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:31,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 93 states. [2020-07-18 00:48:31,982 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 93 states. [2020-07-18 00:48:31,982 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 93 states. [2020-07-18 00:48:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:31,998 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2020-07-18 00:48:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2020-07-18 00:48:32,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:32,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:32,002 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 103 states. [2020-07-18 00:48:32,002 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 103 states. [2020-07-18 00:48:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:32,012 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2020-07-18 00:48:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 130 transitions. [2020-07-18 00:48:32,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:32,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:32,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:32,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-18 00:48:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 116 transitions. [2020-07-18 00:48:32,029 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 116 transitions. Word has length 30 [2020-07-18 00:48:32,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:32,030 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 116 transitions. [2020-07-18 00:48:32,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:48:32,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 93 states and 116 transitions. [2020-07-18 00:48:32,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2020-07-18 00:48:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-18 00:48:32,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:32,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:32,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:48:32,225 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:32,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1464371663, now seen corresponding path program 1 times [2020-07-18 00:48:32,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:32,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [179325261] [2020-07-18 00:48:32,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:32,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:32,362 INFO L280 TraceCheckUtils]: 0: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-18 00:48:32,363 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {857#true} {857#true} #180#return; {857#true} is VALID [2020-07-18 00:48:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:32,375 INFO L280 TraceCheckUtils]: 0: Hoare triple {857#true} ~cond := #in~cond; {857#true} is VALID [2020-07-18 00:48:32,375 INFO L280 TraceCheckUtils]: 1: Hoare triple {857#true} assume !(0 == ~cond); {857#true} is VALID [2020-07-18 00:48:32,376 INFO L280 TraceCheckUtils]: 2: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-18 00:48:32,385 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {857#true} {863#(<= 1 main_~cp~0)} #184#return; {863#(<= 1 main_~cp~0)} is VALID [2020-07-18 00:48:32,386 INFO L263 TraceCheckUtils]: 0: Hoare triple {857#true} call ULTIMATE.init(); {857#true} is VALID [2020-07-18 00:48:32,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-18 00:48:32,387 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {857#true} {857#true} #180#return; {857#true} is VALID [2020-07-18 00:48:32,387 INFO L263 TraceCheckUtils]: 3: Hoare triple {857#true} call #t~ret11 := main(); {857#true} is VALID [2020-07-18 00:48:32,387 INFO L280 TraceCheckUtils]: 4: Hoare triple {857#true} havoc ~scheme~0; {857#true} is VALID [2020-07-18 00:48:32,388 INFO L280 TraceCheckUtils]: 5: Hoare triple {857#true} havoc ~urilen~0; {857#true} is VALID [2020-07-18 00:48:32,388 INFO L280 TraceCheckUtils]: 6: Hoare triple {857#true} havoc ~tokenlen~0; {857#true} is VALID [2020-07-18 00:48:32,388 INFO L280 TraceCheckUtils]: 7: Hoare triple {857#true} havoc ~cp~0; {857#true} is VALID [2020-07-18 00:48:32,388 INFO L280 TraceCheckUtils]: 8: Hoare triple {857#true} havoc ~c~0; {857#true} is VALID [2020-07-18 00:48:32,389 INFO L280 TraceCheckUtils]: 9: Hoare triple {857#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {857#true} is VALID [2020-07-18 00:48:32,389 INFO L280 TraceCheckUtils]: 10: Hoare triple {857#true} ~urilen~0 := #t~nondet0; {857#true} is VALID [2020-07-18 00:48:32,389 INFO L280 TraceCheckUtils]: 11: Hoare triple {857#true} havoc #t~nondet0; {857#true} is VALID [2020-07-18 00:48:32,390 INFO L280 TraceCheckUtils]: 12: Hoare triple {857#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {857#true} is VALID [2020-07-18 00:48:32,390 INFO L280 TraceCheckUtils]: 13: Hoare triple {857#true} ~tokenlen~0 := #t~nondet1; {857#true} is VALID [2020-07-18 00:48:32,391 INFO L280 TraceCheckUtils]: 14: Hoare triple {857#true} havoc #t~nondet1; {857#true} is VALID [2020-07-18 00:48:32,391 INFO L280 TraceCheckUtils]: 15: Hoare triple {857#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {857#true} is VALID [2020-07-18 00:48:32,392 INFO L280 TraceCheckUtils]: 16: Hoare triple {857#true} ~scheme~0 := #t~nondet2; {857#true} is VALID [2020-07-18 00:48:32,393 INFO L280 TraceCheckUtils]: 17: Hoare triple {857#true} havoc #t~nondet2; {857#true} is VALID [2020-07-18 00:48:32,393 INFO L280 TraceCheckUtils]: 18: Hoare triple {857#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {857#true} is VALID [2020-07-18 00:48:32,394 INFO L280 TraceCheckUtils]: 19: Hoare triple {857#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {857#true} is VALID [2020-07-18 00:48:32,394 INFO L280 TraceCheckUtils]: 20: Hoare triple {857#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {857#true} is VALID [2020-07-18 00:48:32,394 INFO L280 TraceCheckUtils]: 21: Hoare triple {857#true} assume ~urilen~0 > 0; {857#true} is VALID [2020-07-18 00:48:32,394 INFO L280 TraceCheckUtils]: 22: Hoare triple {857#true} assume ~tokenlen~0 > 0; {857#true} is VALID [2020-07-18 00:48:32,395 INFO L280 TraceCheckUtils]: 23: Hoare triple {857#true} assume ~scheme~0 >= 0; {861#(< 0 (+ main_~scheme~0 1))} is VALID [2020-07-18 00:48:32,399 INFO L280 TraceCheckUtils]: 24: Hoare triple {861#(< 0 (+ main_~scheme~0 1))} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {862#(< 0 main_~scheme~0)} is VALID [2020-07-18 00:48:32,402 INFO L280 TraceCheckUtils]: 25: Hoare triple {862#(< 0 main_~scheme~0)} ~cp~0 := ~scheme~0; {863#(<= 1 main_~cp~0)} is VALID [2020-07-18 00:48:32,402 INFO L263 TraceCheckUtils]: 26: Hoare triple {863#(<= 1 main_~cp~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {857#true} is VALID [2020-07-18 00:48:32,402 INFO L280 TraceCheckUtils]: 27: Hoare triple {857#true} ~cond := #in~cond; {857#true} is VALID [2020-07-18 00:48:32,403 INFO L280 TraceCheckUtils]: 28: Hoare triple {857#true} assume !(0 == ~cond); {857#true} is VALID [2020-07-18 00:48:32,403 INFO L280 TraceCheckUtils]: 29: Hoare triple {857#true} assume true; {857#true} is VALID [2020-07-18 00:48:32,404 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {857#true} {863#(<= 1 main_~cp~0)} #184#return; {863#(<= 1 main_~cp~0)} is VALID [2020-07-18 00:48:32,406 INFO L263 TraceCheckUtils]: 31: Hoare triple {863#(<= 1 main_~cp~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {868#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:32,407 INFO L280 TraceCheckUtils]: 32: Hoare triple {868#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {869#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:32,408 INFO L280 TraceCheckUtils]: 33: Hoare triple {869#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {858#false} is VALID [2020-07-18 00:48:32,408 INFO L280 TraceCheckUtils]: 34: Hoare triple {858#false} assume !false; {858#false} is VALID [2020-07-18 00:48:32,411 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-18 00:48:32,411 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:32,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [179325261] [2020-07-18 00:48:32,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:32,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:48:32,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877822430] [2020-07-18 00:48:32,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-18 00:48:32,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:32,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:48:32,468 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-18 00:48:32,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:48:32,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:32,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:48:32,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:32,470 INFO L87 Difference]: Start difference. First operand 93 states and 116 transitions. Second operand 7 states. [2020-07-18 00:48:33,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:33,347 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2020-07-18 00:48:33,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:48:33,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-18 00:48:33,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-18 00:48:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:33,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2020-07-18 00:48:33,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2020-07-18 00:48:33,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:33,507 INFO L225 Difference]: With dead ends: 99 [2020-07-18 00:48:33,508 INFO L226 Difference]: Without dead ends: 97 [2020-07-18 00:48:33,509 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-18 00:48:33,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-18 00:48:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-07-18 00:48:33,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:33,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2020-07-18 00:48:33,637 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-18 00:48:33,637 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-18 00:48:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:33,648 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2020-07-18 00:48:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-07-18 00:48:33,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:33,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:33,652 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-18 00:48:33,652 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-18 00:48:33,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:33,670 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2020-07-18 00:48:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-07-18 00:48:33,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:33,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:33,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:33,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-18 00:48:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 119 transitions. [2020-07-18 00:48:33,679 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 119 transitions. Word has length 35 [2020-07-18 00:48:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:33,679 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 119 transitions. [2020-07-18 00:48:33,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:48:33,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 119 transitions. [2020-07-18 00:48:33,852 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:33,852 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2020-07-18 00:48:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-07-18 00:48:33,854 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:33,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:33,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:48:33,855 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:33,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1188311592, now seen corresponding path program 1 times [2020-07-18 00:48:33,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:33,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084592302] [2020-07-18 00:48:33,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:33,952 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1462#true} {1462#true} #180#return; {1462#true} is VALID [2020-07-18 00:48:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,956 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:33,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:33,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:33,957 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #184#return; {1462#true} is VALID [2020-07-18 00:48:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,962 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:33,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:33,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:33,963 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #186#return; {1462#true} is VALID [2020-07-18 00:48:33,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,967 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:33,968 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:33,968 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:33,968 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #188#return; {1462#true} is VALID [2020-07-18 00:48:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:33,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:33,974 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:33,974 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1462#true} #190#return; {1462#true} is VALID [2020-07-18 00:48:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,981 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:33,982 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:33,982 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:33,983 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #196#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-18 00:48:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:33,990 INFO L280 TraceCheckUtils]: 0: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:33,990 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:33,990 INFO L280 TraceCheckUtils]: 2: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:33,991 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #198#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-18 00:48:33,992 INFO L263 TraceCheckUtils]: 0: Hoare triple {1462#true} call ULTIMATE.init(); {1462#true} is VALID [2020-07-18 00:48:33,992 INFO L280 TraceCheckUtils]: 1: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:33,992 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1462#true} {1462#true} #180#return; {1462#true} is VALID [2020-07-18 00:48:33,992 INFO L263 TraceCheckUtils]: 3: Hoare triple {1462#true} call #t~ret11 := main(); {1462#true} is VALID [2020-07-18 00:48:33,993 INFO L280 TraceCheckUtils]: 4: Hoare triple {1462#true} havoc ~scheme~0; {1462#true} is VALID [2020-07-18 00:48:33,993 INFO L280 TraceCheckUtils]: 5: Hoare triple {1462#true} havoc ~urilen~0; {1462#true} is VALID [2020-07-18 00:48:33,993 INFO L280 TraceCheckUtils]: 6: Hoare triple {1462#true} havoc ~tokenlen~0; {1462#true} is VALID [2020-07-18 00:48:33,994 INFO L280 TraceCheckUtils]: 7: Hoare triple {1462#true} havoc ~cp~0; {1462#true} is VALID [2020-07-18 00:48:33,994 INFO L280 TraceCheckUtils]: 8: Hoare triple {1462#true} havoc ~c~0; {1462#true} is VALID [2020-07-18 00:48:33,994 INFO L280 TraceCheckUtils]: 9: Hoare triple {1462#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1462#true} is VALID [2020-07-18 00:48:33,995 INFO L280 TraceCheckUtils]: 10: Hoare triple {1462#true} ~urilen~0 := #t~nondet0; {1462#true} is VALID [2020-07-18 00:48:33,995 INFO L280 TraceCheckUtils]: 11: Hoare triple {1462#true} havoc #t~nondet0; {1462#true} is VALID [2020-07-18 00:48:33,995 INFO L280 TraceCheckUtils]: 12: Hoare triple {1462#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1462#true} is VALID [2020-07-18 00:48:33,995 INFO L280 TraceCheckUtils]: 13: Hoare triple {1462#true} ~tokenlen~0 := #t~nondet1; {1462#true} is VALID [2020-07-18 00:48:33,996 INFO L280 TraceCheckUtils]: 14: Hoare triple {1462#true} havoc #t~nondet1; {1462#true} is VALID [2020-07-18 00:48:33,996 INFO L280 TraceCheckUtils]: 15: Hoare triple {1462#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {1462#true} is VALID [2020-07-18 00:48:33,996 INFO L280 TraceCheckUtils]: 16: Hoare triple {1462#true} ~scheme~0 := #t~nondet2; {1462#true} is VALID [2020-07-18 00:48:33,997 INFO L280 TraceCheckUtils]: 17: Hoare triple {1462#true} havoc #t~nondet2; {1462#true} is VALID [2020-07-18 00:48:33,997 INFO L280 TraceCheckUtils]: 18: Hoare triple {1462#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1462#true} is VALID [2020-07-18 00:48:33,997 INFO L280 TraceCheckUtils]: 19: Hoare triple {1462#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1462#true} is VALID [2020-07-18 00:48:33,997 INFO L280 TraceCheckUtils]: 20: Hoare triple {1462#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1462#true} is VALID [2020-07-18 00:48:33,998 INFO L280 TraceCheckUtils]: 21: Hoare triple {1462#true} assume ~urilen~0 > 0; {1462#true} is VALID [2020-07-18 00:48:33,998 INFO L280 TraceCheckUtils]: 22: Hoare triple {1462#true} assume ~tokenlen~0 > 0; {1462#true} is VALID [2020-07-18 00:48:33,998 INFO L280 TraceCheckUtils]: 23: Hoare triple {1462#true} assume ~scheme~0 >= 0; {1462#true} is VALID [2020-07-18 00:48:33,999 INFO L280 TraceCheckUtils]: 24: Hoare triple {1462#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {1462#true} is VALID [2020-07-18 00:48:33,999 INFO L280 TraceCheckUtils]: 25: Hoare triple {1462#true} ~cp~0 := ~scheme~0; {1462#true} is VALID [2020-07-18 00:48:33,999 INFO L263 TraceCheckUtils]: 26: Hoare triple {1462#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1462#true} is VALID [2020-07-18 00:48:33,999 INFO L280 TraceCheckUtils]: 27: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:34,000 INFO L280 TraceCheckUtils]: 28: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:34,000 INFO L280 TraceCheckUtils]: 29: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:34,000 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1462#true} {1462#true} #184#return; {1462#true} is VALID [2020-07-18 00:48:34,001 INFO L263 TraceCheckUtils]: 31: Hoare triple {1462#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1462#true} is VALID [2020-07-18 00:48:34,001 INFO L280 TraceCheckUtils]: 32: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:34,001 INFO L280 TraceCheckUtils]: 33: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:34,001 INFO L280 TraceCheckUtils]: 34: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:34,002 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {1462#true} {1462#true} #186#return; {1462#true} is VALID [2020-07-18 00:48:34,002 INFO L280 TraceCheckUtils]: 36: Hoare triple {1462#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1462#true} is VALID [2020-07-18 00:48:34,002 INFO L280 TraceCheckUtils]: 37: Hoare triple {1462#true} assume 0 != #t~nondet3; {1462#true} is VALID [2020-07-18 00:48:34,003 INFO L280 TraceCheckUtils]: 38: Hoare triple {1462#true} havoc #t~nondet3; {1462#true} is VALID [2020-07-18 00:48:34,003 INFO L263 TraceCheckUtils]: 39: Hoare triple {1462#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1462#true} is VALID [2020-07-18 00:48:34,003 INFO L280 TraceCheckUtils]: 40: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:34,004 INFO L280 TraceCheckUtils]: 41: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:34,004 INFO L280 TraceCheckUtils]: 42: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:34,004 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1462#true} {1462#true} #188#return; {1462#true} is VALID [2020-07-18 00:48:34,005 INFO L263 TraceCheckUtils]: 44: Hoare triple {1462#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1462#true} is VALID [2020-07-18 00:48:34,005 INFO L280 TraceCheckUtils]: 45: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:34,005 INFO L280 TraceCheckUtils]: 46: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:34,005 INFO L280 TraceCheckUtils]: 47: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:34,006 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {1462#true} {1462#true} #190#return; {1462#true} is VALID [2020-07-18 00:48:34,007 INFO L280 TraceCheckUtils]: 49: Hoare triple {1462#true} assume !(~cp~0 != ~urilen~0 - 1); {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-18 00:48:34,007 INFO L263 TraceCheckUtils]: 50: Hoare triple {1482#(= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1462#true} is VALID [2020-07-18 00:48:34,007 INFO L280 TraceCheckUtils]: 51: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:34,008 INFO L280 TraceCheckUtils]: 52: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:34,008 INFO L280 TraceCheckUtils]: 53: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:34,009 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #196#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-18 00:48:34,009 INFO L263 TraceCheckUtils]: 55: Hoare triple {1482#(= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1462#true} is VALID [2020-07-18 00:48:34,009 INFO L280 TraceCheckUtils]: 56: Hoare triple {1462#true} ~cond := #in~cond; {1462#true} is VALID [2020-07-18 00:48:34,010 INFO L280 TraceCheckUtils]: 57: Hoare triple {1462#true} assume !(0 == ~cond); {1462#true} is VALID [2020-07-18 00:48:34,010 INFO L280 TraceCheckUtils]: 58: Hoare triple {1462#true} assume true; {1462#true} is VALID [2020-07-18 00:48:34,011 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {1462#true} {1482#(= (+ main_~cp~0 1) main_~urilen~0)} #198#return; {1482#(= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2020-07-18 00:48:34,012 INFO L280 TraceCheckUtils]: 60: Hoare triple {1482#(= (+ main_~cp~0 1) main_~urilen~0)} assume !(~cp~0 == ~urilen~0 - 1); {1463#false} is VALID [2020-07-18 00:48:34,012 INFO L263 TraceCheckUtils]: 61: Hoare triple {1463#false} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1463#false} is VALID [2020-07-18 00:48:34,013 INFO L280 TraceCheckUtils]: 62: Hoare triple {1463#false} ~cond := #in~cond; {1463#false} is VALID [2020-07-18 00:48:34,013 INFO L280 TraceCheckUtils]: 63: Hoare triple {1463#false} assume 0 == ~cond; {1463#false} is VALID [2020-07-18 00:48:34,014 INFO L280 TraceCheckUtils]: 64: Hoare triple {1463#false} assume !false; {1463#false} is VALID [2020-07-18 00:48:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-18 00:48:34,020 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:34,021 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084592302] [2020-07-18 00:48:34,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:34,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-18 00:48:34,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968933553] [2020-07-18 00:48:34,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-18 00:48:34,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:34,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-18 00:48:34,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:34,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-18 00:48:34,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:34,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-18 00:48:34,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-18 00:48:34,069 INFO L87 Difference]: Start difference. First operand 97 states and 119 transitions. Second operand 3 states. [2020-07-18 00:48:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:34,434 INFO L93 Difference]: Finished difference Result 140 states and 173 transitions. [2020-07-18 00:48:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-18 00:48:34,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-07-18 00:48:34,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:48:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-18 00:48:34,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-18 00:48:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2020-07-18 00:48:34,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2020-07-18 00:48:34,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:34,637 INFO L225 Difference]: With dead ends: 140 [2020-07-18 00:48:34,637 INFO L226 Difference]: Without dead ends: 97 [2020-07-18 00:48:34,638 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-18 00:48:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-18 00:48:34,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2020-07-18 00:48:34,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:34,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 97 states. [2020-07-18 00:48:34,772 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-18 00:48:34,772 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-18 00:48:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:34,777 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2020-07-18 00:48:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-07-18 00:48:34,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:34,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:34,778 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 97 states. [2020-07-18 00:48:34,780 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 97 states. [2020-07-18 00:48:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:34,793 INFO L93 Difference]: Finished difference Result 97 states and 117 transitions. [2020-07-18 00:48:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-07-18 00:48:34,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:34,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:34,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:34,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:34,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-18 00:48:34,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2020-07-18 00:48:34,803 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 65 [2020-07-18 00:48:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:34,804 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2020-07-18 00:48:34,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-18 00:48:34,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 117 transitions. [2020-07-18 00:48:34,977 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2020-07-18 00:48:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-07-18 00:48:34,979 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:34,980 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:48:34,980 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:48:34,980 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:34,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:34,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2082475577, now seen corresponding path program 1 times [2020-07-18 00:48:34,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:34,981 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2135915883] [2020-07-18 00:48:34,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,159 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,159 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2161#true} {2161#true} #180#return; {2161#true} is VALID [2020-07-18 00:48:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,178 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,179 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #184#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,191 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,192 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,192 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,193 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #186#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,205 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #188#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,225 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,225 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,230 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #190#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,243 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,244 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #196#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-18 00:48:35,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:35,271 INFO L280 TraceCheckUtils]: 0: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,271 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,272 INFO L280 TraceCheckUtils]: 2: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,273 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #198#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-18 00:48:35,274 INFO L263 TraceCheckUtils]: 0: Hoare triple {2161#true} call ULTIMATE.init(); {2161#true} is VALID [2020-07-18 00:48:35,274 INFO L280 TraceCheckUtils]: 1: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,274 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2161#true} {2161#true} #180#return; {2161#true} is VALID [2020-07-18 00:48:35,275 INFO L263 TraceCheckUtils]: 3: Hoare triple {2161#true} call #t~ret11 := main(); {2161#true} is VALID [2020-07-18 00:48:35,275 INFO L280 TraceCheckUtils]: 4: Hoare triple {2161#true} havoc ~scheme~0; {2161#true} is VALID [2020-07-18 00:48:35,275 INFO L280 TraceCheckUtils]: 5: Hoare triple {2161#true} havoc ~urilen~0; {2161#true} is VALID [2020-07-18 00:48:35,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {2161#true} havoc ~tokenlen~0; {2161#true} is VALID [2020-07-18 00:48:35,279 INFO L280 TraceCheckUtils]: 7: Hoare triple {2161#true} havoc ~cp~0; {2161#true} is VALID [2020-07-18 00:48:35,279 INFO L280 TraceCheckUtils]: 8: Hoare triple {2161#true} havoc ~c~0; {2161#true} is VALID [2020-07-18 00:48:35,279 INFO L280 TraceCheckUtils]: 9: Hoare triple {2161#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2161#true} is VALID [2020-07-18 00:48:35,279 INFO L280 TraceCheckUtils]: 10: Hoare triple {2161#true} ~urilen~0 := #t~nondet0; {2161#true} is VALID [2020-07-18 00:48:35,280 INFO L280 TraceCheckUtils]: 11: Hoare triple {2161#true} havoc #t~nondet0; {2161#true} is VALID [2020-07-18 00:48:35,280 INFO L280 TraceCheckUtils]: 12: Hoare triple {2161#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2161#true} is VALID [2020-07-18 00:48:35,280 INFO L280 TraceCheckUtils]: 13: Hoare triple {2161#true} ~tokenlen~0 := #t~nondet1; {2161#true} is VALID [2020-07-18 00:48:35,280 INFO L280 TraceCheckUtils]: 14: Hoare triple {2161#true} havoc #t~nondet1; {2161#true} is VALID [2020-07-18 00:48:35,280 INFO L280 TraceCheckUtils]: 15: Hoare triple {2161#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2161#true} is VALID [2020-07-18 00:48:35,280 INFO L280 TraceCheckUtils]: 16: Hoare triple {2161#true} ~scheme~0 := #t~nondet2; {2161#true} is VALID [2020-07-18 00:48:35,281 INFO L280 TraceCheckUtils]: 17: Hoare triple {2161#true} havoc #t~nondet2; {2161#true} is VALID [2020-07-18 00:48:35,281 INFO L280 TraceCheckUtils]: 18: Hoare triple {2161#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2161#true} is VALID [2020-07-18 00:48:35,281 INFO L280 TraceCheckUtils]: 19: Hoare triple {2161#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2161#true} is VALID [2020-07-18 00:48:35,283 INFO L280 TraceCheckUtils]: 20: Hoare triple {2161#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2161#true} is VALID [2020-07-18 00:48:35,283 INFO L280 TraceCheckUtils]: 21: Hoare triple {2161#true} assume ~urilen~0 > 0; {2161#true} is VALID [2020-07-18 00:48:35,283 INFO L280 TraceCheckUtils]: 22: Hoare triple {2161#true} assume ~tokenlen~0 > 0; {2161#true} is VALID [2020-07-18 00:48:35,283 INFO L280 TraceCheckUtils]: 23: Hoare triple {2161#true} assume ~scheme~0 >= 0; {2161#true} is VALID [2020-07-18 00:48:35,284 INFO L280 TraceCheckUtils]: 24: Hoare triple {2161#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {2165#(<= (+ main_~scheme~0 1) main_~urilen~0)} is VALID [2020-07-18 00:48:35,285 INFO L280 TraceCheckUtils]: 25: Hoare triple {2165#(<= (+ main_~scheme~0 1) main_~urilen~0)} ~cp~0 := ~scheme~0; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,285 INFO L263 TraceCheckUtils]: 26: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2161#true} is VALID [2020-07-18 00:48:35,285 INFO L280 TraceCheckUtils]: 27: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,285 INFO L280 TraceCheckUtils]: 28: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,285 INFO L280 TraceCheckUtils]: 29: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,287 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #184#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,287 INFO L263 TraceCheckUtils]: 31: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2161#true} is VALID [2020-07-18 00:48:35,287 INFO L280 TraceCheckUtils]: 32: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,288 INFO L280 TraceCheckUtils]: 33: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,288 INFO L280 TraceCheckUtils]: 34: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,289 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #186#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,290 INFO L280 TraceCheckUtils]: 36: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,290 INFO L280 TraceCheckUtils]: 37: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} assume 0 != #t~nondet3; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,290 INFO L280 TraceCheckUtils]: 38: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} havoc #t~nondet3; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,291 INFO L263 TraceCheckUtils]: 39: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2161#true} is VALID [2020-07-18 00:48:35,291 INFO L280 TraceCheckUtils]: 40: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,291 INFO L280 TraceCheckUtils]: 41: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,291 INFO L280 TraceCheckUtils]: 42: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,292 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #188#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,292 INFO L263 TraceCheckUtils]: 44: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2161#true} is VALID [2020-07-18 00:48:35,292 INFO L280 TraceCheckUtils]: 45: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,293 INFO L280 TraceCheckUtils]: 46: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,293 INFO L280 TraceCheckUtils]: 47: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,295 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2161#true} {2166#(< main_~cp~0 main_~urilen~0)} #190#return; {2166#(< main_~cp~0 main_~urilen~0)} is VALID [2020-07-18 00:48:35,296 INFO L280 TraceCheckUtils]: 49: Hoare triple {2166#(< main_~cp~0 main_~urilen~0)} assume !!(~cp~0 != ~urilen~0 - 1); {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-18 00:48:35,297 INFO L280 TraceCheckUtils]: 50: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-18 00:48:35,298 INFO L280 TraceCheckUtils]: 51: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume 0 != #t~nondet4; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-18 00:48:35,298 INFO L280 TraceCheckUtils]: 52: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} havoc #t~nondet4; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-18 00:48:35,299 INFO L263 TraceCheckUtils]: 53: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2161#true} is VALID [2020-07-18 00:48:35,299 INFO L280 TraceCheckUtils]: 54: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,299 INFO L280 TraceCheckUtils]: 55: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,299 INFO L280 TraceCheckUtils]: 56: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,300 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #196#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-18 00:48:35,301 INFO L263 TraceCheckUtils]: 58: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2161#true} is VALID [2020-07-18 00:48:35,301 INFO L280 TraceCheckUtils]: 59: Hoare triple {2161#true} ~cond := #in~cond; {2161#true} is VALID [2020-07-18 00:48:35,301 INFO L280 TraceCheckUtils]: 60: Hoare triple {2161#true} assume !(0 == ~cond); {2161#true} is VALID [2020-07-18 00:48:35,301 INFO L280 TraceCheckUtils]: 61: Hoare triple {2161#true} assume true; {2161#true} is VALID [2020-07-18 00:48:35,302 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2161#true} {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} #198#return; {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-18 00:48:35,303 INFO L280 TraceCheckUtils]: 63: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} assume !(~cp~0 == ~urilen~0 - 1); {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} is VALID [2020-07-18 00:48:35,305 INFO L263 TraceCheckUtils]: 64: Hoare triple {2183#(and (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0))} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2192#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:35,305 INFO L280 TraceCheckUtils]: 65: Hoare triple {2192#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2193#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:35,306 INFO L280 TraceCheckUtils]: 66: Hoare triple {2193#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2162#false} is VALID [2020-07-18 00:48:35,306 INFO L280 TraceCheckUtils]: 67: Hoare triple {2162#false} assume !false; {2162#false} is VALID [2020-07-18 00:48:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-07-18 00:48:35,312 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:35,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2135915883] [2020-07-18 00:48:35,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:35,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:48:35,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845329574] [2020-07-18 00:48:35,314 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-07-18 00:48:35,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:35,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:48:35,375 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-18 00:48:35,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:48:35,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:35,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:48:35,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:35,376 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 7 states. [2020-07-18 00:48:36,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:36,336 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2020-07-18 00:48:36,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:48:36,336 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2020-07-18 00:48:36,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2020-07-18 00:48:36,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 106 transitions. [2020-07-18 00:48:36,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 106 transitions. [2020-07-18 00:48:36,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:36,501 INFO L225 Difference]: With dead ends: 103 [2020-07-18 00:48:36,501 INFO L226 Difference]: Without dead ends: 101 [2020-07-18 00:48:36,502 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:48:36,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-07-18 00:48:36,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-07-18 00:48:36,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:36,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 101 states. [2020-07-18 00:48:36,696 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2020-07-18 00:48:36,696 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2020-07-18 00:48:36,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:36,701 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2020-07-18 00:48:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-07-18 00:48:36,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:36,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:36,702 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 101 states. [2020-07-18 00:48:36,703 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 101 states. [2020-07-18 00:48:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:36,707 INFO L93 Difference]: Finished difference Result 101 states and 120 transitions. [2020-07-18 00:48:36,708 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-07-18 00:48:36,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:36,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:36,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:36,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-18 00:48:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 120 transitions. [2020-07-18 00:48:36,713 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 120 transitions. Word has length 68 [2020-07-18 00:48:36,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:36,713 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 120 transitions. [2020-07-18 00:48:36,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:48:36,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 101 states and 120 transitions. [2020-07-18 00:48:36,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 120 transitions. [2020-07-18 00:48:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-07-18 00:48:36,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:36,875 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, 1, 1, 1, 1, 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-18 00:48:36,875 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:48:36,875 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:36,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:36,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1342891699, now seen corresponding path program 1 times [2020-07-18 00:48:36,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:36,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1320158369] [2020-07-18 00:48:36,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,013 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,013 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2812#true} {2812#true} #180#return; {2812#true} is VALID [2020-07-18 00:48:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,023 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,024 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,024 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #184#return; {2812#true} is VALID [2020-07-18 00:48:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,028 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,029 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,029 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #186#return; {2812#true} is VALID [2020-07-18 00:48:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,035 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #188#return; {2812#true} is VALID [2020-07-18 00:48:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,040 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,040 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #190#return; {2812#true} is VALID [2020-07-18 00:48:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,045 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,046 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,046 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #196#return; {2812#true} is VALID [2020-07-18 00:48:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,050 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,051 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,051 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,052 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #198#return; {2812#true} is VALID [2020-07-18 00:48:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,056 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,056 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,057 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,057 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #200#return; {2812#true} is VALID [2020-07-18 00:48:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,062 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,062 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,063 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2812#true} #202#return; {2812#true} is VALID [2020-07-18 00:48:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,069 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,070 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,071 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #204#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,078 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,079 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #206#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,085 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,085 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,086 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,087 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #208#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-18 00:48:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:37,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,096 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,096 INFO L280 TraceCheckUtils]: 2: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,097 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #210#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-18 00:48:37,098 INFO L263 TraceCheckUtils]: 0: Hoare triple {2812#true} call ULTIMATE.init(); {2812#true} is VALID [2020-07-18 00:48:37,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,098 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2812#true} {2812#true} #180#return; {2812#true} is VALID [2020-07-18 00:48:37,098 INFO L263 TraceCheckUtils]: 3: Hoare triple {2812#true} call #t~ret11 := main(); {2812#true} is VALID [2020-07-18 00:48:37,099 INFO L280 TraceCheckUtils]: 4: Hoare triple {2812#true} havoc ~scheme~0; {2812#true} is VALID [2020-07-18 00:48:37,099 INFO L280 TraceCheckUtils]: 5: Hoare triple {2812#true} havoc ~urilen~0; {2812#true} is VALID [2020-07-18 00:48:37,099 INFO L280 TraceCheckUtils]: 6: Hoare triple {2812#true} havoc ~tokenlen~0; {2812#true} is VALID [2020-07-18 00:48:37,100 INFO L280 TraceCheckUtils]: 7: Hoare triple {2812#true} havoc ~cp~0; {2812#true} is VALID [2020-07-18 00:48:37,100 INFO L280 TraceCheckUtils]: 8: Hoare triple {2812#true} havoc ~c~0; {2812#true} is VALID [2020-07-18 00:48:37,100 INFO L280 TraceCheckUtils]: 9: Hoare triple {2812#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2812#true} is VALID [2020-07-18 00:48:37,101 INFO L280 TraceCheckUtils]: 10: Hoare triple {2812#true} ~urilen~0 := #t~nondet0; {2812#true} is VALID [2020-07-18 00:48:37,101 INFO L280 TraceCheckUtils]: 11: Hoare triple {2812#true} havoc #t~nondet0; {2812#true} is VALID [2020-07-18 00:48:37,101 INFO L280 TraceCheckUtils]: 12: Hoare triple {2812#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2812#true} is VALID [2020-07-18 00:48:37,102 INFO L280 TraceCheckUtils]: 13: Hoare triple {2812#true} ~tokenlen~0 := #t~nondet1; {2812#true} is VALID [2020-07-18 00:48:37,102 INFO L280 TraceCheckUtils]: 14: Hoare triple {2812#true} havoc #t~nondet1; {2812#true} is VALID [2020-07-18 00:48:37,102 INFO L280 TraceCheckUtils]: 15: Hoare triple {2812#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {2812#true} is VALID [2020-07-18 00:48:37,102 INFO L280 TraceCheckUtils]: 16: Hoare triple {2812#true} ~scheme~0 := #t~nondet2; {2812#true} is VALID [2020-07-18 00:48:37,103 INFO L280 TraceCheckUtils]: 17: Hoare triple {2812#true} havoc #t~nondet2; {2812#true} is VALID [2020-07-18 00:48:37,103 INFO L280 TraceCheckUtils]: 18: Hoare triple {2812#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2812#true} is VALID [2020-07-18 00:48:37,103 INFO L280 TraceCheckUtils]: 19: Hoare triple {2812#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2812#true} is VALID [2020-07-18 00:48:37,103 INFO L280 TraceCheckUtils]: 20: Hoare triple {2812#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2812#true} is VALID [2020-07-18 00:48:37,104 INFO L280 TraceCheckUtils]: 21: Hoare triple {2812#true} assume ~urilen~0 > 0; {2812#true} is VALID [2020-07-18 00:48:37,104 INFO L280 TraceCheckUtils]: 22: Hoare triple {2812#true} assume ~tokenlen~0 > 0; {2812#true} is VALID [2020-07-18 00:48:37,104 INFO L280 TraceCheckUtils]: 23: Hoare triple {2812#true} assume ~scheme~0 >= 0; {2812#true} is VALID [2020-07-18 00:48:37,105 INFO L280 TraceCheckUtils]: 24: Hoare triple {2812#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {2812#true} is VALID [2020-07-18 00:48:37,105 INFO L280 TraceCheckUtils]: 25: Hoare triple {2812#true} ~cp~0 := ~scheme~0; {2812#true} is VALID [2020-07-18 00:48:37,105 INFO L263 TraceCheckUtils]: 26: Hoare triple {2812#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,106 INFO L280 TraceCheckUtils]: 27: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,106 INFO L280 TraceCheckUtils]: 28: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,106 INFO L280 TraceCheckUtils]: 29: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,106 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {2812#true} {2812#true} #184#return; {2812#true} is VALID [2020-07-18 00:48:37,107 INFO L263 TraceCheckUtils]: 31: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,107 INFO L280 TraceCheckUtils]: 32: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,107 INFO L280 TraceCheckUtils]: 33: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,108 INFO L280 TraceCheckUtils]: 34: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,108 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {2812#true} {2812#true} #186#return; {2812#true} is VALID [2020-07-18 00:48:37,108 INFO L280 TraceCheckUtils]: 36: Hoare triple {2812#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2812#true} is VALID [2020-07-18 00:48:37,108 INFO L280 TraceCheckUtils]: 37: Hoare triple {2812#true} assume 0 != #t~nondet3; {2812#true} is VALID [2020-07-18 00:48:37,109 INFO L280 TraceCheckUtils]: 38: Hoare triple {2812#true} havoc #t~nondet3; {2812#true} is VALID [2020-07-18 00:48:37,109 INFO L263 TraceCheckUtils]: 39: Hoare triple {2812#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,109 INFO L280 TraceCheckUtils]: 40: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,109 INFO L280 TraceCheckUtils]: 41: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,110 INFO L280 TraceCheckUtils]: 42: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,110 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {2812#true} {2812#true} #188#return; {2812#true} is VALID [2020-07-18 00:48:37,124 INFO L263 TraceCheckUtils]: 44: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,124 INFO L280 TraceCheckUtils]: 45: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,125 INFO L280 TraceCheckUtils]: 46: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,125 INFO L280 TraceCheckUtils]: 47: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,125 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {2812#true} {2812#true} #190#return; {2812#true} is VALID [2020-07-18 00:48:37,125 INFO L280 TraceCheckUtils]: 49: Hoare triple {2812#true} assume !!(~cp~0 != ~urilen~0 - 1); {2812#true} is VALID [2020-07-18 00:48:37,125 INFO L280 TraceCheckUtils]: 50: Hoare triple {2812#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2812#true} is VALID [2020-07-18 00:48:37,126 INFO L280 TraceCheckUtils]: 51: Hoare triple {2812#true} assume 0 != #t~nondet4; {2812#true} is VALID [2020-07-18 00:48:37,126 INFO L280 TraceCheckUtils]: 52: Hoare triple {2812#true} havoc #t~nondet4; {2812#true} is VALID [2020-07-18 00:48:37,126 INFO L263 TraceCheckUtils]: 53: Hoare triple {2812#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,126 INFO L280 TraceCheckUtils]: 54: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,126 INFO L280 TraceCheckUtils]: 55: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,127 INFO L280 TraceCheckUtils]: 56: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,127 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {2812#true} {2812#true} #196#return; {2812#true} is VALID [2020-07-18 00:48:37,127 INFO L263 TraceCheckUtils]: 58: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,127 INFO L280 TraceCheckUtils]: 59: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,128 INFO L280 TraceCheckUtils]: 60: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,128 INFO L280 TraceCheckUtils]: 61: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,128 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2812#true} {2812#true} #198#return; {2812#true} is VALID [2020-07-18 00:48:37,128 INFO L280 TraceCheckUtils]: 63: Hoare triple {2812#true} assume !(~cp~0 == ~urilen~0 - 1); {2812#true} is VALID [2020-07-18 00:48:37,128 INFO L263 TraceCheckUtils]: 64: Hoare triple {2812#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,129 INFO L280 TraceCheckUtils]: 65: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,129 INFO L280 TraceCheckUtils]: 66: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,129 INFO L280 TraceCheckUtils]: 67: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,129 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {2812#true} {2812#true} #200#return; {2812#true} is VALID [2020-07-18 00:48:37,130 INFO L263 TraceCheckUtils]: 69: Hoare triple {2812#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,130 INFO L280 TraceCheckUtils]: 70: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,130 INFO L280 TraceCheckUtils]: 71: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,130 INFO L280 TraceCheckUtils]: 72: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,130 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2812#true} {2812#true} #202#return; {2812#true} is VALID [2020-07-18 00:48:37,131 INFO L280 TraceCheckUtils]: 74: Hoare triple {2812#true} assume !(1 + ~cp~0 == ~urilen~0 - 1); {2812#true} is VALID [2020-07-18 00:48:37,131 INFO L280 TraceCheckUtils]: 75: Hoare triple {2812#true} #t~pre6 := 1 + ~cp~0; {2812#true} is VALID [2020-07-18 00:48:37,131 INFO L280 TraceCheckUtils]: 76: Hoare triple {2812#true} ~cp~0 := 1 + ~cp~0; {2812#true} is VALID [2020-07-18 00:48:37,131 INFO L280 TraceCheckUtils]: 77: Hoare triple {2812#true} havoc #t~pre6; {2812#true} is VALID [2020-07-18 00:48:37,132 INFO L280 TraceCheckUtils]: 78: Hoare triple {2812#true} ~scheme~0 := ~cp~0; {2812#true} is VALID [2020-07-18 00:48:37,132 INFO L280 TraceCheckUtils]: 79: Hoare triple {2812#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {2812#true} is VALID [2020-07-18 00:48:37,132 INFO L280 TraceCheckUtils]: 80: Hoare triple {2812#true} assume 0 != #t~nondet7; {2812#true} is VALID [2020-07-18 00:48:37,132 INFO L280 TraceCheckUtils]: 81: Hoare triple {2812#true} havoc #t~nondet7; {2812#true} is VALID [2020-07-18 00:48:37,134 INFO L280 TraceCheckUtils]: 82: Hoare triple {2812#true} ~c~0 := 0; {2848#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:37,134 INFO L263 TraceCheckUtils]: 83: Hoare triple {2848#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,134 INFO L280 TraceCheckUtils]: 84: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,134 INFO L280 TraceCheckUtils]: 85: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,134 INFO L280 TraceCheckUtils]: 86: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,136 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #204#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:37,136 INFO L263 TraceCheckUtils]: 88: Hoare triple {2848#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,136 INFO L280 TraceCheckUtils]: 89: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,136 INFO L280 TraceCheckUtils]: 90: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,137 INFO L280 TraceCheckUtils]: 91: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,137 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {2812#true} {2848#(= 0 main_~c~0)} #206#return; {2848#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:37,138 INFO L280 TraceCheckUtils]: 93: Hoare triple {2848#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-18 00:48:37,139 INFO L263 TraceCheckUtils]: 94: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,139 INFO L280 TraceCheckUtils]: 95: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,139 INFO L280 TraceCheckUtils]: 96: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,140 INFO L280 TraceCheckUtils]: 97: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,141 INFO L275 TraceCheckUtils]: 98: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #208#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-18 00:48:37,141 INFO L263 TraceCheckUtils]: 99: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2812#true} is VALID [2020-07-18 00:48:37,141 INFO L280 TraceCheckUtils]: 100: Hoare triple {2812#true} ~cond := #in~cond; {2812#true} is VALID [2020-07-18 00:48:37,142 INFO L280 TraceCheckUtils]: 101: Hoare triple {2812#true} assume !(0 == ~cond); {2812#true} is VALID [2020-07-18 00:48:37,142 INFO L280 TraceCheckUtils]: 102: Hoare triple {2812#true} assume true; {2812#true} is VALID [2020-07-18 00:48:37,143 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {2812#true} {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #210#return; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-18 00:48:37,144 INFO L280 TraceCheckUtils]: 104: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-18 00:48:37,144 INFO L280 TraceCheckUtils]: 105: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} assume 0 != #t~nondet8; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-18 00:48:37,145 INFO L280 TraceCheckUtils]: 106: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} havoc #t~nondet8; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-18 00:48:37,146 INFO L280 TraceCheckUtils]: 107: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} #t~pre9 := 1 + ~c~0; {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} is VALID [2020-07-18 00:48:37,147 INFO L280 TraceCheckUtils]: 108: Hoare triple {2857#(and (<= (+ main_~c~0 2) main_~tokenlen~0) (= 0 main_~c~0))} ~c~0 := 1 + ~c~0; {2866#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-18 00:48:37,147 INFO L280 TraceCheckUtils]: 109: Hoare triple {2866#(< main_~c~0 main_~tokenlen~0)} havoc #t~pre9; {2866#(< main_~c~0 main_~tokenlen~0)} is VALID [2020-07-18 00:48:37,148 INFO L263 TraceCheckUtils]: 110: Hoare triple {2866#(< main_~c~0 main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2867#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:37,149 INFO L280 TraceCheckUtils]: 111: Hoare triple {2867#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2868#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:37,150 INFO L280 TraceCheckUtils]: 112: Hoare triple {2868#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2813#false} is VALID [2020-07-18 00:48:37,150 INFO L280 TraceCheckUtils]: 113: Hoare triple {2813#false} assume !false; {2813#false} is VALID [2020-07-18 00:48:37,161 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-18 00:48:37,161 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:37,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1320158369] [2020-07-18 00:48:37,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:37,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:48:37,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154560736] [2020-07-18 00:48:37,163 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2020-07-18 00:48:37,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:37,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:48:37,245 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-18 00:48:37,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:48:37,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:37,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:48:37,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:37,246 INFO L87 Difference]: Start difference. First operand 101 states and 120 transitions. Second operand 7 states. [2020-07-18 00:48:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:37,981 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2020-07-18 00:48:37,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:48:37,981 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2020-07-18 00:48:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2020-07-18 00:48:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:48:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 135 transitions. [2020-07-18 00:48:37,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 135 transitions. [2020-07-18 00:48:38,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:38,150 INFO L225 Difference]: With dead ends: 129 [2020-07-18 00:48:38,151 INFO L226 Difference]: Without dead ends: 127 [2020-07-18 00:48:38,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 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-18 00:48:38,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-18 00:48:38,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-07-18 00:48:38,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:38,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 119 states. [2020-07-18 00:48:38,392 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 119 states. [2020-07-18 00:48:38,392 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 119 states. [2020-07-18 00:48:38,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:38,398 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2020-07-18 00:48:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2020-07-18 00:48:38,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:38,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:38,399 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 127 states. [2020-07-18 00:48:38,400 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 127 states. [2020-07-18 00:48:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:38,405 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2020-07-18 00:48:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 152 transitions. [2020-07-18 00:48:38,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:38,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:38,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:38,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:38,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-18 00:48:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2020-07-18 00:48:38,412 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 114 [2020-07-18 00:48:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:38,412 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2020-07-18 00:48:38,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:48:38,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 119 states and 141 transitions. [2020-07-18 00:48:38,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2020-07-18 00:48:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2020-07-18 00:48:38,634 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:38,634 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, 1, 1, 1, 1, 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-18 00:48:38,635 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:48:38,635 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:38,635 INFO L82 PathProgramCache]: Analyzing trace with hash -279016842, now seen corresponding path program 1 times [2020-07-18 00:48:38,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:38,636 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923502425] [2020-07-18 00:48:38,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,778 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,779 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3623#true} {3623#true} #180#return; {3623#true} is VALID [2020-07-18 00:48:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,785 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,786 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #184#return; {3623#true} is VALID [2020-07-18 00:48:38,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,794 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,794 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,795 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #186#return; {3623#true} is VALID [2020-07-18 00:48:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,801 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,801 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,802 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #188#return; {3623#true} is VALID [2020-07-18 00:48:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,807 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #190#return; {3623#true} is VALID [2020-07-18 00:48:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,816 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #196#return; {3623#true} is VALID [2020-07-18 00:48:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,824 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,824 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,825 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #198#return; {3623#true} is VALID [2020-07-18 00:48:38,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,834 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,834 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,834 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,835 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #200#return; {3623#true} is VALID [2020-07-18 00:48:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,841 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #202#return; {3623#true} is VALID [2020-07-18 00:48:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,846 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,846 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,846 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,848 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #204#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,853 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,853 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,853 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,856 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #206#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,869 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,870 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,871 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #208#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,877 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,878 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,878 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,879 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #210#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:38,901 INFO L280 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,902 INFO L280 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,903 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3676#(<= 0 main_~c~0)} #212#return; {3676#(<= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,903 INFO L263 TraceCheckUtils]: 0: Hoare triple {3623#true} call ULTIMATE.init(); {3623#true} is VALID [2020-07-18 00:48:38,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,904 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3623#true} {3623#true} #180#return; {3623#true} is VALID [2020-07-18 00:48:38,904 INFO L263 TraceCheckUtils]: 3: Hoare triple {3623#true} call #t~ret11 := main(); {3623#true} is VALID [2020-07-18 00:48:38,904 INFO L280 TraceCheckUtils]: 4: Hoare triple {3623#true} havoc ~scheme~0; {3623#true} is VALID [2020-07-18 00:48:38,905 INFO L280 TraceCheckUtils]: 5: Hoare triple {3623#true} havoc ~urilen~0; {3623#true} is VALID [2020-07-18 00:48:38,905 INFO L280 TraceCheckUtils]: 6: Hoare triple {3623#true} havoc ~tokenlen~0; {3623#true} is VALID [2020-07-18 00:48:38,905 INFO L280 TraceCheckUtils]: 7: Hoare triple {3623#true} havoc ~cp~0; {3623#true} is VALID [2020-07-18 00:48:38,905 INFO L280 TraceCheckUtils]: 8: Hoare triple {3623#true} havoc ~c~0; {3623#true} is VALID [2020-07-18 00:48:38,906 INFO L280 TraceCheckUtils]: 9: Hoare triple {3623#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3623#true} is VALID [2020-07-18 00:48:38,906 INFO L280 TraceCheckUtils]: 10: Hoare triple {3623#true} ~urilen~0 := #t~nondet0; {3623#true} is VALID [2020-07-18 00:48:38,906 INFO L280 TraceCheckUtils]: 11: Hoare triple {3623#true} havoc #t~nondet0; {3623#true} is VALID [2020-07-18 00:48:38,907 INFO L280 TraceCheckUtils]: 12: Hoare triple {3623#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3623#true} is VALID [2020-07-18 00:48:38,907 INFO L280 TraceCheckUtils]: 13: Hoare triple {3623#true} ~tokenlen~0 := #t~nondet1; {3623#true} is VALID [2020-07-18 00:48:38,907 INFO L280 TraceCheckUtils]: 14: Hoare triple {3623#true} havoc #t~nondet1; {3623#true} is VALID [2020-07-18 00:48:38,908 INFO L280 TraceCheckUtils]: 15: Hoare triple {3623#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {3623#true} is VALID [2020-07-18 00:48:38,908 INFO L280 TraceCheckUtils]: 16: Hoare triple {3623#true} ~scheme~0 := #t~nondet2; {3623#true} is VALID [2020-07-18 00:48:38,908 INFO L280 TraceCheckUtils]: 17: Hoare triple {3623#true} havoc #t~nondet2; {3623#true} is VALID [2020-07-18 00:48:38,909 INFO L280 TraceCheckUtils]: 18: Hoare triple {3623#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {3623#true} is VALID [2020-07-18 00:48:38,909 INFO L280 TraceCheckUtils]: 19: Hoare triple {3623#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {3623#true} is VALID [2020-07-18 00:48:38,909 INFO L280 TraceCheckUtils]: 20: Hoare triple {3623#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {3623#true} is VALID [2020-07-18 00:48:38,910 INFO L280 TraceCheckUtils]: 21: Hoare triple {3623#true} assume ~urilen~0 > 0; {3623#true} is VALID [2020-07-18 00:48:38,910 INFO L280 TraceCheckUtils]: 22: Hoare triple {3623#true} assume ~tokenlen~0 > 0; {3623#true} is VALID [2020-07-18 00:48:38,910 INFO L280 TraceCheckUtils]: 23: Hoare triple {3623#true} assume ~scheme~0 >= 0; {3623#true} is VALID [2020-07-18 00:48:38,911 INFO L280 TraceCheckUtils]: 24: Hoare triple {3623#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {3623#true} is VALID [2020-07-18 00:48:38,911 INFO L280 TraceCheckUtils]: 25: Hoare triple {3623#true} ~cp~0 := ~scheme~0; {3623#true} is VALID [2020-07-18 00:48:38,912 INFO L263 TraceCheckUtils]: 26: Hoare triple {3623#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,912 INFO L280 TraceCheckUtils]: 27: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,912 INFO L280 TraceCheckUtils]: 28: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,912 INFO L280 TraceCheckUtils]: 29: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,912 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {3623#true} {3623#true} #184#return; {3623#true} is VALID [2020-07-18 00:48:38,913 INFO L263 TraceCheckUtils]: 31: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,913 INFO L280 TraceCheckUtils]: 32: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,913 INFO L280 TraceCheckUtils]: 33: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,913 INFO L280 TraceCheckUtils]: 34: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,925 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {3623#true} {3623#true} #186#return; {3623#true} is VALID [2020-07-18 00:48:38,926 INFO L280 TraceCheckUtils]: 36: Hoare triple {3623#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3623#true} is VALID [2020-07-18 00:48:38,926 INFO L280 TraceCheckUtils]: 37: Hoare triple {3623#true} assume 0 != #t~nondet3; {3623#true} is VALID [2020-07-18 00:48:38,926 INFO L280 TraceCheckUtils]: 38: Hoare triple {3623#true} havoc #t~nondet3; {3623#true} is VALID [2020-07-18 00:48:38,927 INFO L263 TraceCheckUtils]: 39: Hoare triple {3623#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,927 INFO L280 TraceCheckUtils]: 40: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,931 INFO L280 TraceCheckUtils]: 41: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,931 INFO L280 TraceCheckUtils]: 42: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,931 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {3623#true} {3623#true} #188#return; {3623#true} is VALID [2020-07-18 00:48:38,931 INFO L263 TraceCheckUtils]: 44: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,932 INFO L280 TraceCheckUtils]: 45: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,932 INFO L280 TraceCheckUtils]: 46: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,932 INFO L280 TraceCheckUtils]: 47: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,932 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {3623#true} {3623#true} #190#return; {3623#true} is VALID [2020-07-18 00:48:38,933 INFO L280 TraceCheckUtils]: 49: Hoare triple {3623#true} assume !!(~cp~0 != ~urilen~0 - 1); {3623#true} is VALID [2020-07-18 00:48:38,933 INFO L280 TraceCheckUtils]: 50: Hoare triple {3623#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {3623#true} is VALID [2020-07-18 00:48:38,933 INFO L280 TraceCheckUtils]: 51: Hoare triple {3623#true} assume 0 != #t~nondet4; {3623#true} is VALID [2020-07-18 00:48:38,934 INFO L280 TraceCheckUtils]: 52: Hoare triple {3623#true} havoc #t~nondet4; {3623#true} is VALID [2020-07-18 00:48:38,934 INFO L263 TraceCheckUtils]: 53: Hoare triple {3623#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,934 INFO L280 TraceCheckUtils]: 54: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,935 INFO L280 TraceCheckUtils]: 55: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,935 INFO L280 TraceCheckUtils]: 56: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,939 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {3623#true} {3623#true} #196#return; {3623#true} is VALID [2020-07-18 00:48:38,939 INFO L263 TraceCheckUtils]: 58: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,939 INFO L280 TraceCheckUtils]: 59: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,940 INFO L280 TraceCheckUtils]: 60: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,940 INFO L280 TraceCheckUtils]: 61: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,943 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {3623#true} {3623#true} #198#return; {3623#true} is VALID [2020-07-18 00:48:38,944 INFO L280 TraceCheckUtils]: 63: Hoare triple {3623#true} assume !(~cp~0 == ~urilen~0 - 1); {3623#true} is VALID [2020-07-18 00:48:38,944 INFO L263 TraceCheckUtils]: 64: Hoare triple {3623#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,944 INFO L280 TraceCheckUtils]: 65: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,945 INFO L280 TraceCheckUtils]: 66: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,945 INFO L280 TraceCheckUtils]: 67: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,945 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {3623#true} {3623#true} #200#return; {3623#true} is VALID [2020-07-18 00:48:38,946 INFO L263 TraceCheckUtils]: 69: Hoare triple {3623#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,946 INFO L280 TraceCheckUtils]: 70: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,949 INFO L280 TraceCheckUtils]: 71: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,950 INFO L280 TraceCheckUtils]: 72: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,950 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {3623#true} {3623#true} #202#return; {3623#true} is VALID [2020-07-18 00:48:38,950 INFO L280 TraceCheckUtils]: 74: Hoare triple {3623#true} assume !(1 + ~cp~0 == ~urilen~0 - 1); {3623#true} is VALID [2020-07-18 00:48:38,951 INFO L280 TraceCheckUtils]: 75: Hoare triple {3623#true} #t~pre6 := 1 + ~cp~0; {3623#true} is VALID [2020-07-18 00:48:38,953 INFO L280 TraceCheckUtils]: 76: Hoare triple {3623#true} ~cp~0 := 1 + ~cp~0; {3623#true} is VALID [2020-07-18 00:48:38,953 INFO L280 TraceCheckUtils]: 77: Hoare triple {3623#true} havoc #t~pre6; {3623#true} is VALID [2020-07-18 00:48:38,953 INFO L280 TraceCheckUtils]: 78: Hoare triple {3623#true} ~scheme~0 := ~cp~0; {3623#true} is VALID [2020-07-18 00:48:38,954 INFO L280 TraceCheckUtils]: 79: Hoare triple {3623#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {3623#true} is VALID [2020-07-18 00:48:38,954 INFO L280 TraceCheckUtils]: 80: Hoare triple {3623#true} assume 0 != #t~nondet7; {3623#true} is VALID [2020-07-18 00:48:38,954 INFO L280 TraceCheckUtils]: 81: Hoare triple {3623#true} havoc #t~nondet7; {3623#true} is VALID [2020-07-18 00:48:38,960 INFO L280 TraceCheckUtils]: 82: Hoare triple {3623#true} ~c~0 := 0; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,961 INFO L263 TraceCheckUtils]: 83: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,961 INFO L280 TraceCheckUtils]: 84: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,962 INFO L280 TraceCheckUtils]: 85: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,962 INFO L280 TraceCheckUtils]: 86: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,963 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #204#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,963 INFO L263 TraceCheckUtils]: 88: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,963 INFO L280 TraceCheckUtils]: 89: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,964 INFO L280 TraceCheckUtils]: 90: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,964 INFO L280 TraceCheckUtils]: 91: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,965 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #206#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,966 INFO L280 TraceCheckUtils]: 93: Hoare triple {3659#(= 0 main_~c~0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,966 INFO L263 TraceCheckUtils]: 94: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,966 INFO L280 TraceCheckUtils]: 95: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,967 INFO L280 TraceCheckUtils]: 96: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,967 INFO L280 TraceCheckUtils]: 97: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,968 INFO L275 TraceCheckUtils]: 98: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #208#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,969 INFO L263 TraceCheckUtils]: 99: Hoare triple {3659#(= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,969 INFO L280 TraceCheckUtils]: 100: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,969 INFO L280 TraceCheckUtils]: 101: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,970 INFO L280 TraceCheckUtils]: 102: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,971 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {3623#true} {3659#(= 0 main_~c~0)} #210#return; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,971 INFO L280 TraceCheckUtils]: 104: Hoare triple {3659#(= 0 main_~c~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,972 INFO L280 TraceCheckUtils]: 105: Hoare triple {3659#(= 0 main_~c~0)} assume 0 != #t~nondet8; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,972 INFO L280 TraceCheckUtils]: 106: Hoare triple {3659#(= 0 main_~c~0)} havoc #t~nondet8; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,973 INFO L280 TraceCheckUtils]: 107: Hoare triple {3659#(= 0 main_~c~0)} #t~pre9 := 1 + ~c~0; {3659#(= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,973 INFO L280 TraceCheckUtils]: 108: Hoare triple {3659#(= 0 main_~c~0)} ~c~0 := 1 + ~c~0; {3676#(<= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,974 INFO L280 TraceCheckUtils]: 109: Hoare triple {3676#(<= 0 main_~c~0)} havoc #t~pre9; {3676#(<= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,974 INFO L263 TraceCheckUtils]: 110: Hoare triple {3676#(<= 0 main_~c~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {3623#true} is VALID [2020-07-18 00:48:38,974 INFO L280 TraceCheckUtils]: 111: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2020-07-18 00:48:38,975 INFO L280 TraceCheckUtils]: 112: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2020-07-18 00:48:38,975 INFO L280 TraceCheckUtils]: 113: Hoare triple {3623#true} assume true; {3623#true} is VALID [2020-07-18 00:48:38,976 INFO L275 TraceCheckUtils]: 114: Hoare quadruple {3623#true} {3676#(<= 0 main_~c~0)} #212#return; {3676#(<= 0 main_~c~0)} is VALID [2020-07-18 00:48:38,977 INFO L263 TraceCheckUtils]: 115: Hoare triple {3676#(<= 0 main_~c~0)} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {3681#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:38,977 INFO L280 TraceCheckUtils]: 116: Hoare triple {3681#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3682#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:38,978 INFO L280 TraceCheckUtils]: 117: Hoare triple {3682#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3624#false} is VALID [2020-07-18 00:48:38,978 INFO L280 TraceCheckUtils]: 118: Hoare triple {3624#false} assume !false; {3624#false} is VALID [2020-07-18 00:48:38,987 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-07-18 00:48:38,988 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:38,988 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923502425] [2020-07-18 00:48:38,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:38,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:48:38,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950521664] [2020-07-18 00:48:38,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-07-18 00:48:38,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:38,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:48:39,103 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:39,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:48:39,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:48:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:48:39,106 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 6 states. [2020-07-18 00:48:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:39,842 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2020-07-18 00:48:39,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:48:39,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2020-07-18 00:48:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:39,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2020-07-18 00:48:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 121 transitions. [2020-07-18 00:48:39,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 121 transitions. [2020-07-18 00:48:39,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:40,000 INFO L225 Difference]: With dead ends: 125 [2020-07-18 00:48:40,000 INFO L226 Difference]: Without dead ends: 123 [2020-07-18 00:48:40,000 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-18 00:48:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-07-18 00:48:40,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:40,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 123 states. [2020-07-18 00:48:40,261 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-18 00:48:40,261 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-18 00:48:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:40,267 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2020-07-18 00:48:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-07-18 00:48:40,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:40,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:40,269 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-18 00:48:40,269 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-18 00:48:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:40,276 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2020-07-18 00:48:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-07-18 00:48:40,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:40,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:40,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:40,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-18 00:48:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2020-07-18 00:48:40,283 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 119 [2020-07-18 00:48:40,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:40,283 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2020-07-18 00:48:40,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:48:40,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 123 states and 144 transitions. [2020-07-18 00:48:40,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2020-07-18 00:48:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-18 00:48:40,518 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:48:40,519 INFO L422 BasicCegarLoop]: trace histogram [19, 18, 18, 2, 2, 2, 2, 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, 1, 1, 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-18 00:48:40,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:48:40,519 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:48:40,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:48:40,519 INFO L82 PathProgramCache]: Analyzing trace with hash 486899888, now seen corresponding path program 1 times [2020-07-18 00:48:40,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:48:40,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2012108317] [2020-07-18 00:48:40,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:48:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,616 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,616 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {4429#true} {4429#true} #180#return; {4429#true} is VALID [2020-07-18 00:48:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,619 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,620 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #184#return; {4429#true} is VALID [2020-07-18 00:48:40,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,624 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #186#return; {4429#true} is VALID [2020-07-18 00:48:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,627 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,627 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,627 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,627 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #188#return; {4429#true} is VALID [2020-07-18 00:48:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,631 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,631 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,631 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,631 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #190#return; {4429#true} is VALID [2020-07-18 00:48:40,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,641 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,641 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,642 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #196#return; {4429#true} is VALID [2020-07-18 00:48:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,657 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,658 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #198#return; {4429#true} is VALID [2020-07-18 00:48:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,663 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #200#return; {4429#true} is VALID [2020-07-18 00:48:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,667 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,667 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,667 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #202#return; {4429#true} is VALID [2020-07-18 00:48:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,675 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,675 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,676 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,676 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #204#return; {4429#true} is VALID [2020-07-18 00:48:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,680 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,681 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #206#return; {4429#true} is VALID [2020-07-18 00:48:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,684 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,685 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #208#return; {4429#true} is VALID [2020-07-18 00:48:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,690 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #210#return; {4429#true} is VALID [2020-07-18 00:48:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,695 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,695 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #212#return; {4429#true} is VALID [2020-07-18 00:48:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,699 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #214#return; {4429#true} is VALID [2020-07-18 00:48:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,709 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,710 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #216#return; {4429#true} is VALID [2020-07-18 00:48:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,726 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,727 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,727 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4429#true} #218#return; {4429#true} is VALID [2020-07-18 00:48:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,736 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,737 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,739 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #208#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:48:40,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,752 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #210#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,752 INFO L263 TraceCheckUtils]: 0: Hoare triple {4429#true} call ULTIMATE.init(); {4429#true} is VALID [2020-07-18 00:48:40,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,752 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4429#true} {4429#true} #180#return; {4429#true} is VALID [2020-07-18 00:48:40,753 INFO L263 TraceCheckUtils]: 3: Hoare triple {4429#true} call #t~ret11 := main(); {4429#true} is VALID [2020-07-18 00:48:40,753 INFO L280 TraceCheckUtils]: 4: Hoare triple {4429#true} havoc ~scheme~0; {4429#true} is VALID [2020-07-18 00:48:40,753 INFO L280 TraceCheckUtils]: 5: Hoare triple {4429#true} havoc ~urilen~0; {4429#true} is VALID [2020-07-18 00:48:40,753 INFO L280 TraceCheckUtils]: 6: Hoare triple {4429#true} havoc ~tokenlen~0; {4429#true} is VALID [2020-07-18 00:48:40,753 INFO L280 TraceCheckUtils]: 7: Hoare triple {4429#true} havoc ~cp~0; {4429#true} is VALID [2020-07-18 00:48:40,754 INFO L280 TraceCheckUtils]: 8: Hoare triple {4429#true} havoc ~c~0; {4429#true} is VALID [2020-07-18 00:48:40,754 INFO L280 TraceCheckUtils]: 9: Hoare triple {4429#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {4429#true} is VALID [2020-07-18 00:48:40,754 INFO L280 TraceCheckUtils]: 10: Hoare triple {4429#true} ~urilen~0 := #t~nondet0; {4429#true} is VALID [2020-07-18 00:48:40,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {4429#true} havoc #t~nondet0; {4429#true} is VALID [2020-07-18 00:48:40,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {4429#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4429#true} is VALID [2020-07-18 00:48:40,757 INFO L280 TraceCheckUtils]: 13: Hoare triple {4429#true} ~tokenlen~0 := #t~nondet1; {4429#true} is VALID [2020-07-18 00:48:40,757 INFO L280 TraceCheckUtils]: 14: Hoare triple {4429#true} havoc #t~nondet1; {4429#true} is VALID [2020-07-18 00:48:40,757 INFO L280 TraceCheckUtils]: 15: Hoare triple {4429#true} assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; {4429#true} is VALID [2020-07-18 00:48:40,757 INFO L280 TraceCheckUtils]: 16: Hoare triple {4429#true} ~scheme~0 := #t~nondet2; {4429#true} is VALID [2020-07-18 00:48:40,757 INFO L280 TraceCheckUtils]: 17: Hoare triple {4429#true} havoc #t~nondet2; {4429#true} is VALID [2020-07-18 00:48:40,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {4429#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {4429#true} is VALID [2020-07-18 00:48:40,758 INFO L280 TraceCheckUtils]: 19: Hoare triple {4429#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {4429#true} is VALID [2020-07-18 00:48:40,758 INFO L280 TraceCheckUtils]: 20: Hoare triple {4429#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {4429#true} is VALID [2020-07-18 00:48:40,758 INFO L280 TraceCheckUtils]: 21: Hoare triple {4429#true} assume ~urilen~0 > 0; {4429#true} is VALID [2020-07-18 00:48:40,758 INFO L280 TraceCheckUtils]: 22: Hoare triple {4429#true} assume ~tokenlen~0 > 0; {4429#true} is VALID [2020-07-18 00:48:40,758 INFO L280 TraceCheckUtils]: 23: Hoare triple {4429#true} assume ~scheme~0 >= 0; {4429#true} is VALID [2020-07-18 00:48:40,759 INFO L280 TraceCheckUtils]: 24: Hoare triple {4429#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0); {4429#true} is VALID [2020-07-18 00:48:40,759 INFO L280 TraceCheckUtils]: 25: Hoare triple {4429#true} ~cp~0 := ~scheme~0; {4429#true} is VALID [2020-07-18 00:48:40,759 INFO L263 TraceCheckUtils]: 26: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,759 INFO L280 TraceCheckUtils]: 27: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,759 INFO L280 TraceCheckUtils]: 28: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,760 INFO L280 TraceCheckUtils]: 29: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,760 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {4429#true} {4429#true} #184#return; {4429#true} is VALID [2020-07-18 00:48:40,760 INFO L263 TraceCheckUtils]: 31: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,760 INFO L280 TraceCheckUtils]: 32: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,760 INFO L280 TraceCheckUtils]: 33: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,761 INFO L280 TraceCheckUtils]: 34: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,761 INFO L275 TraceCheckUtils]: 35: Hoare quadruple {4429#true} {4429#true} #186#return; {4429#true} is VALID [2020-07-18 00:48:40,761 INFO L280 TraceCheckUtils]: 36: Hoare triple {4429#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {4429#true} is VALID [2020-07-18 00:48:40,761 INFO L280 TraceCheckUtils]: 37: Hoare triple {4429#true} assume 0 != #t~nondet3; {4429#true} is VALID [2020-07-18 00:48:40,761 INFO L280 TraceCheckUtils]: 38: Hoare triple {4429#true} havoc #t~nondet3; {4429#true} is VALID [2020-07-18 00:48:40,762 INFO L263 TraceCheckUtils]: 39: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,762 INFO L280 TraceCheckUtils]: 40: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,762 INFO L280 TraceCheckUtils]: 41: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,762 INFO L280 TraceCheckUtils]: 42: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,762 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {4429#true} {4429#true} #188#return; {4429#true} is VALID [2020-07-18 00:48:40,762 INFO L263 TraceCheckUtils]: 44: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,763 INFO L280 TraceCheckUtils]: 45: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,763 INFO L280 TraceCheckUtils]: 46: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,763 INFO L280 TraceCheckUtils]: 47: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,763 INFO L275 TraceCheckUtils]: 48: Hoare quadruple {4429#true} {4429#true} #190#return; {4429#true} is VALID [2020-07-18 00:48:40,763 INFO L280 TraceCheckUtils]: 49: Hoare triple {4429#true} assume !!(~cp~0 != ~urilen~0 - 1); {4429#true} is VALID [2020-07-18 00:48:40,764 INFO L280 TraceCheckUtils]: 50: Hoare triple {4429#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {4429#true} is VALID [2020-07-18 00:48:40,764 INFO L280 TraceCheckUtils]: 51: Hoare triple {4429#true} assume 0 != #t~nondet4; {4429#true} is VALID [2020-07-18 00:48:40,764 INFO L280 TraceCheckUtils]: 52: Hoare triple {4429#true} havoc #t~nondet4; {4429#true} is VALID [2020-07-18 00:48:40,764 INFO L263 TraceCheckUtils]: 53: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,764 INFO L280 TraceCheckUtils]: 54: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,765 INFO L280 TraceCheckUtils]: 55: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,765 INFO L280 TraceCheckUtils]: 56: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,765 INFO L275 TraceCheckUtils]: 57: Hoare quadruple {4429#true} {4429#true} #196#return; {4429#true} is VALID [2020-07-18 00:48:40,765 INFO L263 TraceCheckUtils]: 58: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,765 INFO L280 TraceCheckUtils]: 59: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,765 INFO L280 TraceCheckUtils]: 60: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,766 INFO L280 TraceCheckUtils]: 61: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,766 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {4429#true} {4429#true} #198#return; {4429#true} is VALID [2020-07-18 00:48:40,766 INFO L280 TraceCheckUtils]: 63: Hoare triple {4429#true} assume !(~cp~0 == ~urilen~0 - 1); {4429#true} is VALID [2020-07-18 00:48:40,766 INFO L263 TraceCheckUtils]: 64: Hoare triple {4429#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,766 INFO L280 TraceCheckUtils]: 65: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,767 INFO L280 TraceCheckUtils]: 66: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,767 INFO L280 TraceCheckUtils]: 67: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,767 INFO L275 TraceCheckUtils]: 68: Hoare quadruple {4429#true} {4429#true} #200#return; {4429#true} is VALID [2020-07-18 00:48:40,767 INFO L263 TraceCheckUtils]: 69: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,767 INFO L280 TraceCheckUtils]: 70: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,768 INFO L280 TraceCheckUtils]: 71: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,768 INFO L280 TraceCheckUtils]: 72: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,768 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {4429#true} {4429#true} #202#return; {4429#true} is VALID [2020-07-18 00:48:40,768 INFO L280 TraceCheckUtils]: 74: Hoare triple {4429#true} assume !(1 + ~cp~0 == ~urilen~0 - 1); {4429#true} is VALID [2020-07-18 00:48:40,768 INFO L280 TraceCheckUtils]: 75: Hoare triple {4429#true} #t~pre6 := 1 + ~cp~0; {4429#true} is VALID [2020-07-18 00:48:40,769 INFO L280 TraceCheckUtils]: 76: Hoare triple {4429#true} ~cp~0 := 1 + ~cp~0; {4429#true} is VALID [2020-07-18 00:48:40,769 INFO L280 TraceCheckUtils]: 77: Hoare triple {4429#true} havoc #t~pre6; {4429#true} is VALID [2020-07-18 00:48:40,769 INFO L280 TraceCheckUtils]: 78: Hoare triple {4429#true} ~scheme~0 := ~cp~0; {4429#true} is VALID [2020-07-18 00:48:40,769 INFO L280 TraceCheckUtils]: 79: Hoare triple {4429#true} assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; {4429#true} is VALID [2020-07-18 00:48:40,770 INFO L280 TraceCheckUtils]: 80: Hoare triple {4429#true} assume 0 != #t~nondet7; {4429#true} is VALID [2020-07-18 00:48:40,770 INFO L280 TraceCheckUtils]: 81: Hoare triple {4429#true} havoc #t~nondet7; {4429#true} is VALID [2020-07-18 00:48:40,770 INFO L280 TraceCheckUtils]: 82: Hoare triple {4429#true} ~c~0 := 0; {4429#true} is VALID [2020-07-18 00:48:40,770 INFO L263 TraceCheckUtils]: 83: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,770 INFO L280 TraceCheckUtils]: 84: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,770 INFO L280 TraceCheckUtils]: 85: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,771 INFO L280 TraceCheckUtils]: 86: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,771 INFO L275 TraceCheckUtils]: 87: Hoare quadruple {4429#true} {4429#true} #204#return; {4429#true} is VALID [2020-07-18 00:48:40,771 INFO L263 TraceCheckUtils]: 88: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,771 INFO L280 TraceCheckUtils]: 89: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,771 INFO L280 TraceCheckUtils]: 90: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,772 INFO L280 TraceCheckUtils]: 91: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,772 INFO L275 TraceCheckUtils]: 92: Hoare quadruple {4429#true} {4429#true} #206#return; {4429#true} is VALID [2020-07-18 00:48:40,772 INFO L280 TraceCheckUtils]: 93: Hoare triple {4429#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {4429#true} is VALID [2020-07-18 00:48:40,772 INFO L263 TraceCheckUtils]: 94: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,772 INFO L280 TraceCheckUtils]: 95: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,773 INFO L280 TraceCheckUtils]: 96: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,773 INFO L280 TraceCheckUtils]: 97: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,773 INFO L275 TraceCheckUtils]: 98: Hoare quadruple {4429#true} {4429#true} #208#return; {4429#true} is VALID [2020-07-18 00:48:40,773 INFO L263 TraceCheckUtils]: 99: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,773 INFO L280 TraceCheckUtils]: 100: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,773 INFO L280 TraceCheckUtils]: 101: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,774 INFO L280 TraceCheckUtils]: 102: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,774 INFO L275 TraceCheckUtils]: 103: Hoare quadruple {4429#true} {4429#true} #210#return; {4429#true} is VALID [2020-07-18 00:48:40,774 INFO L280 TraceCheckUtils]: 104: Hoare triple {4429#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4429#true} is VALID [2020-07-18 00:48:40,774 INFO L280 TraceCheckUtils]: 105: Hoare triple {4429#true} assume 0 != #t~nondet8; {4429#true} is VALID [2020-07-18 00:48:40,774 INFO L280 TraceCheckUtils]: 106: Hoare triple {4429#true} havoc #t~nondet8; {4429#true} is VALID [2020-07-18 00:48:40,775 INFO L280 TraceCheckUtils]: 107: Hoare triple {4429#true} #t~pre9 := 1 + ~c~0; {4429#true} is VALID [2020-07-18 00:48:40,775 INFO L280 TraceCheckUtils]: 108: Hoare triple {4429#true} ~c~0 := 1 + ~c~0; {4429#true} is VALID [2020-07-18 00:48:40,775 INFO L280 TraceCheckUtils]: 109: Hoare triple {4429#true} havoc #t~pre9; {4429#true} is VALID [2020-07-18 00:48:40,775 INFO L263 TraceCheckUtils]: 110: Hoare triple {4429#true} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,775 INFO L280 TraceCheckUtils]: 111: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,776 INFO L280 TraceCheckUtils]: 112: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,776 INFO L280 TraceCheckUtils]: 113: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,776 INFO L275 TraceCheckUtils]: 114: Hoare quadruple {4429#true} {4429#true} #212#return; {4429#true} is VALID [2020-07-18 00:48:40,776 INFO L263 TraceCheckUtils]: 115: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,776 INFO L280 TraceCheckUtils]: 116: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,776 INFO L280 TraceCheckUtils]: 117: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,777 INFO L280 TraceCheckUtils]: 118: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,777 INFO L275 TraceCheckUtils]: 119: Hoare quadruple {4429#true} {4429#true} #214#return; {4429#true} is VALID [2020-07-18 00:48:40,777 INFO L263 TraceCheckUtils]: 120: Hoare triple {4429#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,777 INFO L280 TraceCheckUtils]: 121: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,777 INFO L280 TraceCheckUtils]: 122: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,778 INFO L280 TraceCheckUtils]: 123: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,778 INFO L275 TraceCheckUtils]: 124: Hoare quadruple {4429#true} {4429#true} #216#return; {4429#true} is VALID [2020-07-18 00:48:40,778 INFO L263 TraceCheckUtils]: 125: Hoare triple {4429#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,778 INFO L280 TraceCheckUtils]: 126: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,778 INFO L280 TraceCheckUtils]: 127: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,779 INFO L280 TraceCheckUtils]: 128: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,779 INFO L275 TraceCheckUtils]: 129: Hoare quadruple {4429#true} {4429#true} #218#return; {4429#true} is VALID [2020-07-18 00:48:40,779 INFO L280 TraceCheckUtils]: 130: Hoare triple {4429#true} #t~pre10 := 1 + ~cp~0; {4429#true} is VALID [2020-07-18 00:48:40,779 INFO L280 TraceCheckUtils]: 131: Hoare triple {4429#true} ~cp~0 := 1 + ~cp~0; {4429#true} is VALID [2020-07-18 00:48:40,779 INFO L280 TraceCheckUtils]: 132: Hoare triple {4429#true} havoc #t~pre10; {4429#true} is VALID [2020-07-18 00:48:40,783 INFO L280 TraceCheckUtils]: 133: Hoare triple {4429#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,784 INFO L263 TraceCheckUtils]: 134: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,784 INFO L280 TraceCheckUtils]: 135: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,784 INFO L280 TraceCheckUtils]: 136: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,784 INFO L280 TraceCheckUtils]: 137: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,785 INFO L275 TraceCheckUtils]: 138: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #208#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,785 INFO L263 TraceCheckUtils]: 139: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {4429#true} is VALID [2020-07-18 00:48:40,785 INFO L280 TraceCheckUtils]: 140: Hoare triple {4429#true} ~cond := #in~cond; {4429#true} is VALID [2020-07-18 00:48:40,786 INFO L280 TraceCheckUtils]: 141: Hoare triple {4429#true} assume !(0 == ~cond); {4429#true} is VALID [2020-07-18 00:48:40,786 INFO L280 TraceCheckUtils]: 142: Hoare triple {4429#true} assume true; {4429#true} is VALID [2020-07-18 00:48:40,787 INFO L275 TraceCheckUtils]: 143: Hoare quadruple {4429#true} {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #210#return; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,787 INFO L280 TraceCheckUtils]: 144: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,787 INFO L280 TraceCheckUtils]: 145: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume 0 != #t~nondet8; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,788 INFO L280 TraceCheckUtils]: 146: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} havoc #t~nondet8; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,788 INFO L280 TraceCheckUtils]: 147: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} #t~pre9 := 1 + ~c~0; {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,789 INFO L280 TraceCheckUtils]: 148: Hoare triple {4497#(<= (+ main_~c~0 2) main_~tokenlen~0)} ~c~0 := 1 + ~c~0; {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,790 INFO L280 TraceCheckUtils]: 149: Hoare triple {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} havoc #t~pre9; {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2020-07-18 00:48:40,791 INFO L263 TraceCheckUtils]: 150: Hoare triple {4506#(<= (+ main_~c~0 1) main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {4507#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:48:40,792 INFO L280 TraceCheckUtils]: 151: Hoare triple {4507#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {4508#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:48:40,792 INFO L280 TraceCheckUtils]: 152: Hoare triple {4508#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {4430#false} is VALID [2020-07-18 00:48:40,792 INFO L280 TraceCheckUtils]: 153: Hoare triple {4430#false} assume !false; {4430#false} is VALID [2020-07-18 00:48:40,806 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2020-07-18 00:48:40,806 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:48:40,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2012108317] [2020-07-18 00:48:40,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:48:40,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:48:40,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135111590] [2020-07-18 00:48:40,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2020-07-18 00:48:40,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:48:40,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:48:40,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:40,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:48:40,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:48:40,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:48:40,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:48:40,913 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 6 states. [2020-07-18 00:48:41,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:41,624 INFO L93 Difference]: Finished difference Result 128 states and 149 transitions. [2020-07-18 00:48:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:48:41,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2020-07-18 00:48:41,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:48:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-18 00:48:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:48:41,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2020-07-18 00:48:41,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 109 transitions. [2020-07-18 00:48:41,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:41,736 INFO L225 Difference]: With dead ends: 128 [2020-07-18 00:48:41,736 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:48:41,738 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:48:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:48:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:48:41,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:48:41,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:41,738 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:41,739 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:41,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:41,739 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:48:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:48:41,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:41,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:41,740 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:41,740 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:48:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:48:41,740 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:48:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:48:41,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:41,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:48:41,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:48:41,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:48:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:48:41,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:48:41,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2020-07-18 00:48:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:48:41,741 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:48:41,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:48:41,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:48:41,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:48:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:48:41,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:48:41,742 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:48:41,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:48:43,437 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:48:43,437 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:48:43,437 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:48:43,437 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:48:43,438 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:48:43,438 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:48:43,438 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:48:43,438 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:48:43,438 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 00:48:43,438 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 00:48:43,438 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:48:43,439 INFO L264 CegarLoopResult]: At program point L60(line 60) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,439 INFO L264 CegarLoopResult]: At program point L60-1(line 60) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,439 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 72) the Hoare annotation is: true [2020-07-18 00:48:43,440 INFO L264 CegarLoopResult]: At program point L52(line 52) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (= 0 main_~c~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,440 INFO L271 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: true [2020-07-18 00:48:43,440 INFO L264 CegarLoopResult]: At program point L52-1(line 52) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (= 0 main_~c~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,440 INFO L271 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: true [2020-07-18 00:48:43,440 INFO L271 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: true [2020-07-18 00:48:43,441 INFO L264 CegarLoopResult]: At program point L36-1(lines 35 41) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,441 INFO L264 CegarLoopResult]: At program point L36-2(lines 36 41) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2020-07-18 00:48:43,441 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,441 INFO L271 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: true [2020-07-18 00:48:43,441 INFO L271 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-07-18 00:48:43,441 INFO L271 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: true [2020-07-18 00:48:43,442 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,442 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,442 INFO L271 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: true [2020-07-18 00:48:43,442 INFO L264 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,442 INFO L264 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,442 INFO L264 CegarLoopResult]: At program point L37-2(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,442 INFO L264 CegarLoopResult]: At program point L37-4(line 37) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,442 INFO L264 CegarLoopResult]: At program point L62(line 62) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,443 INFO L271 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: true [2020-07-18 00:48:43,443 INFO L264 CegarLoopResult]: At program point L54-1(lines 53 66) the Hoare annotation is: (let ((.cse0 (<= (+ main_~scheme~0 1) main_~urilen~0)) (.cse1 (< 0 main_~scheme~0)) (.cse2 (<= 1 main_~cp~0)) (.cse3 (< main_~cp~0 main_~urilen~0))) (or (and .cse0 .cse1 .cse2 (= 0 main_~c~0) .cse3) (and .cse0 (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) .cse1 .cse2 .cse3))) [2020-07-18 00:48:43,443 INFO L271 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: true [2020-07-18 00:48:43,443 INFO L264 CegarLoopResult]: At program point L46(lines 33 69) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,443 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 72) the Hoare annotation is: true [2020-07-18 00:48:43,443 INFO L264 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,443 INFO L264 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,443 INFO L264 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0)) [2020-07-18 00:48:43,443 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 72) the Hoare annotation is: true [2020-07-18 00:48:43,444 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-18 00:48:43,444 INFO L271 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: true [2020-07-18 00:48:43,444 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,444 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,444 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,444 INFO L264 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,444 INFO L271 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: true [2020-07-18 00:48:43,444 INFO L264 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,444 INFO L271 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: true [2020-07-18 00:48:43,445 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,445 INFO L264 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,445 INFO L264 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,445 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,445 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,445 INFO L264 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,445 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,445 INFO L264 CegarLoopResult]: At program point L65-1(line 65) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,446 INFO L264 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,446 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-18 00:48:43,446 INFO L271 CegarLoopResult]: At program point L24-1(lines 14 72) the Hoare annotation is: true [2020-07-18 00:48:43,446 INFO L264 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,446 INFO L271 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: true [2020-07-18 00:48:43,446 INFO L271 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: true [2020-07-18 00:48:43,446 INFO L264 CegarLoopResult]: At program point L33(lines 33 69) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,446 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,446 INFO L264 CegarLoopResult]: At program point L33-3(line 33) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~cp~0 1) main_~urilen~0)) [2020-07-18 00:48:43,447 INFO L264 CegarLoopResult]: At program point L58(lines 58 64) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,447 INFO L271 CegarLoopResult]: At program point L25(lines 14 72) the Hoare annotation is: true [2020-07-18 00:48:43,447 INFO L264 CegarLoopResult]: At program point L58-1(line 58) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,447 INFO L264 CegarLoopResult]: At program point L58-2(line 58) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,447 INFO L264 CegarLoopResult]: At program point L58-3(lines 58 64) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,447 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,447 INFO L271 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-07-18 00:48:43,448 INFO L264 CegarLoopResult]: At program point L50-1(lines 50 68) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,448 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-18 00:48:43,448 INFO L264 CegarLoopResult]: At program point L50-2(line 50) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,448 INFO L271 CegarLoopResult]: At program point L50-3(line 50) the Hoare annotation is: true [2020-07-18 00:48:43,448 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,448 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,448 INFO L264 CegarLoopResult]: At program point L34-1(line 34) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,449 INFO L264 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,449 INFO L264 CegarLoopResult]: At program point L26(lines 14 72) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2020-07-18 00:48:43,449 INFO L264 CegarLoopResult]: At program point L59-1(line 59) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= 0 main_~c~0) (<= (+ main_~c~0 2) main_~tokenlen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,449 INFO L264 CegarLoopResult]: At program point L59-2(line 59) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 0 main_~c~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (not (= (+ main_~cp~0 1) main_~urilen~0)) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,449 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,449 INFO L271 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-07-18 00:48:43,449 INFO L271 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-07-18 00:48:43,449 INFO L271 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-07-18 00:48:43,449 INFO L264 CegarLoopResult]: At program point L43(lines 33 69) the Hoare annotation is: (and (<= (+ main_~scheme~0 1) main_~urilen~0) (< 0 main_~scheme~0) (<= 1 main_~cp~0) (< main_~cp~0 main_~urilen~0)) [2020-07-18 00:48:43,449 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 00:48:43,450 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:48:43,450 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:48:43,450 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:48:43,450 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:48:43,450 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:48:43,453 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 00:48:43,454 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:48:43,454 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:48:43,455 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 00:48:43,455 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 00:48:43,503 INFO L163 areAnnotationChecker]: CFG has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:48:43,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:48:43 BoogieIcfgContainer [2020-07-18 00:48:43,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:48:43,527 INFO L168 Benchmark]: Toolchain (without parser) took 15203.77 ms. Allocated memory was 142.1 MB in the beginning and 393.2 MB in the end (delta: 251.1 MB). Free memory was 100.9 MB in the beginning and 193.1 MB in the end (delta: -92.2 MB). Peak memory consumption was 159.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:43,535 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 142.1 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 00:48:43,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 456.34 ms. Allocated memory is still 142.1 MB. Free memory was 100.5 MB in the beginning and 89.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:43,537 INFO L168 Benchmark]: Boogie Preprocessor took 129.96 ms. Allocated memory was 142.1 MB in the beginning and 198.2 MB in the end (delta: 56.1 MB). Free memory was 89.5 MB in the beginning and 175.7 MB in the end (delta: -86.2 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:43,537 INFO L168 Benchmark]: RCFGBuilder took 703.71 ms. Allocated memory is still 198.2 MB. Free memory was 175.7 MB in the beginning and 132.9 MB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:43,538 INFO L168 Benchmark]: TraceAbstraction took 13906.49 ms. Allocated memory was 198.2 MB in the beginning and 393.2 MB in the end (delta: 195.0 MB). Free memory was 132.2 MB in the beginning and 193.1 MB in the end (delta: -60.9 MB). Peak memory consumption was 134.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:48:43,540 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.19 ms. Allocated memory is still 142.1 MB. Free memory was 118.7 MB in the beginning and 118.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 456.34 ms. Allocated memory is still 142.1 MB. Free memory was 100.5 MB in the beginning and 89.5 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 129.96 ms. Allocated memory was 142.1 MB in the beginning and 198.2 MB in the end (delta: 56.1 MB). Free memory was 89.5 MB in the beginning and 175.7 MB in the end (delta: -86.2 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 703.71 ms. Allocated memory is still 198.2 MB. Free memory was 175.7 MB in the beginning and 132.9 MB in the end (delta: 42.8 MB). Peak memory consumption was 42.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13906.49 ms. Allocated memory was 198.2 MB in the beginning and 393.2 MB in the end (delta: 195.0 MB). Free memory was 132.2 MB in the beginning and 193.1 MB in the end (delta: -60.9 MB). Peak memory consumption was 134.1 MB. 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: ((scheme + 1 <= urilen && 0 < scheme) && 1 <= cp) && cp < urilen - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((scheme + 1 <= urilen && 0 < scheme) && 1 <= cp) && 0 == c) && cp < urilen) || (((((scheme + 1 <= urilen && c + 1 <= tokenlen) && 0 <= c) && 0 < scheme) && 1 <= cp) && cp < urilen) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.0s, OverallIterations: 7, TraceHistogramMax: 19, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 681 SDtfs, 320 SDslu, 1933 SDs, 0 SdLazy, 490 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred 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: 1.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 92 LocationsWithAnnotation, 398 PreInvPairs, 536 NumberOfFragments, 1170 HoareAnnotationTreeSize, 398 FomulaSimplifications, 795 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 92 FomulaSimplificationsInter, 565 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...