/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:28:26,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:28:26,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:28:26,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:28:26,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:28:26,544 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:28:26,545 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:28:26,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:28:26,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:28:26,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:28:26,552 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:28:26,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:28:26,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:28:26,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:28:26,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:28:26,558 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:28:26,559 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:28:26,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:28:26,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:28:26,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:28:26,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:28:26,569 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:28:26,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:28:26,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:28:26,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:28:26,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:28:26,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:28:26,576 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:28:26,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:28:26,578 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:28:26,578 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:28:26,579 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:28:26,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:28:26,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:28:26,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:28:26,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:28:26,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:28:26,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:28:26,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:28:26,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:28:26,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:28:26,588 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:28:26,605 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:28:26,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:28:26,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:28:26,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:28:26,608 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:28:26,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:28:26,608 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:28:26,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:28:26,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:28:26,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:28:26,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:28:26,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:28:26,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:28:26,610 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:28:26,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:28:26,610 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:28:26,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:28:26,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:28:26,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:28:26,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:28:26,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:28:26,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:26,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:28:26,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:28:26,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:28:26,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:28:26,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:28:26,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:28:26,613 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:28:26,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:28:26,942 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:28:26,961 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:28:26,965 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:28:26,967 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:28:26,968 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:28:26,969 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.v+cfa-reducer.c [2020-07-10 15:28:27,071 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d881dfee1/5ed01dc307744d8b96928b2c21d02174/FLAG19fab116c [2020-07-10 15:28:27,679 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:28:27,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i.v+cfa-reducer.c [2020-07-10 15:28:27,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d881dfee1/5ed01dc307744d8b96928b2c21d02174/FLAG19fab116c [2020-07-10 15:28:28,000 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d881dfee1/5ed01dc307744d8b96928b2c21d02174 [2020-07-10 15:28:28,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:28:28,015 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:28:28,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:28,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:28:28,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:28:28,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716a727c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28, skipping insertion in model container [2020-07-10 15:28:28,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:28:28,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:28:28,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:28,332 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:28:28,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:28,405 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:28:28,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28 WrapperNode [2020-07-10 15:28:28,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:28,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:28:28,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:28:28,408 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:28:28,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,548 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (1/1) ... [2020-07-10 15:28:28,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:28,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:28,557 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:28,557 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:28,558 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28: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-10 15:28:28,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:28,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:28,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:28:28,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:28,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:28,644 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:28:28,644 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:28:28,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:28:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:29,458 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:29,458 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 15:28:29,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:29 BoogieIcfgContainer [2020-07-10 15:28:29,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:29,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:29,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:29,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:29,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:28:28" (1/3) ... [2020-07-10 15:28:29,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b20e63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:29, skipping insertion in model container [2020-07-10 15:28:29,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:28" (2/3) ... [2020-07-10 15:28:29,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b20e63f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:29, skipping insertion in model container [2020-07-10 15:28:29,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:29" (3/3) ... [2020-07-10 15:28:29,484 INFO L109 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i.v+cfa-reducer.c [2020-07-10 15:28:29,499 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:29,512 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 18 error locations. [2020-07-10 15:28:29,532 INFO L251 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2020-07-10 15:28:29,587 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:29,587 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:29,587 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:29,588 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:29,588 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:29,588 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:29,588 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:29,588 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:29,638 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-07-10 15:28:29,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-10 15:28:29,651 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:29,653 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:29,654 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:29,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash -2019463306, now seen corresponding path program 1 times [2020-07-10 15:28:29,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:29,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881173692] [2020-07-10 15:28:29,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:29,974 INFO L280 TraceCheckUtils]: 0: Hoare triple {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID [2020-07-10 15:28:29,975 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-10 15:28:29,975 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} #223#return; {90#true} is VALID [2020-07-10 15:28:29,979 INFO L263 TraceCheckUtils]: 0: Hoare triple {90#true} call ULTIMATE.init(); {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:29,980 INFO L280 TraceCheckUtils]: 1: Hoare triple {96#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {90#true} is VALID [2020-07-10 15:28:29,980 INFO L280 TraceCheckUtils]: 2: Hoare triple {90#true} assume true; {90#true} is VALID [2020-07-10 15:28:29,980 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} #223#return; {90#true} is VALID [2020-07-10 15:28:29,981 INFO L263 TraceCheckUtils]: 4: Hoare triple {90#true} call #t~ret7 := main(); {90#true} is VALID [2020-07-10 15:28:29,981 INFO L280 TraceCheckUtils]: 5: Hoare triple {90#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {90#true} is VALID [2020-07-10 15:28:29,982 INFO L280 TraceCheckUtils]: 6: Hoare triple {90#true} assume !!(~main__urilen~0 <= 1000000); {90#true} is VALID [2020-07-10 15:28:29,982 INFO L280 TraceCheckUtils]: 7: Hoare triple {90#true} assume !!(~main__urilen~0 >= -1000000); {90#true} is VALID [2020-07-10 15:28:29,982 INFO L280 TraceCheckUtils]: 8: Hoare triple {90#true} assume !!(~main__tokenlen~0 <= 1000000); {90#true} is VALID [2020-07-10 15:28:29,983 INFO L280 TraceCheckUtils]: 9: Hoare triple {90#true} assume !!(~main__tokenlen~0 >= -1000000); {90#true} is VALID [2020-07-10 15:28:29,983 INFO L280 TraceCheckUtils]: 10: Hoare triple {90#true} assume !!(~main__scheme~0 <= 1000000); {90#true} is VALID [2020-07-10 15:28:29,983 INFO L280 TraceCheckUtils]: 11: Hoare triple {90#true} assume !!(~main__scheme~0 >= -1000000); {90#true} is VALID [2020-07-10 15:28:29,984 INFO L280 TraceCheckUtils]: 12: Hoare triple {90#true} assume ~main__urilen~0 > 0; {90#true} is VALID [2020-07-10 15:28:29,984 INFO L280 TraceCheckUtils]: 13: Hoare triple {90#true} assume ~main__tokenlen~0 > 0; {90#true} is VALID [2020-07-10 15:28:29,984 INFO L280 TraceCheckUtils]: 14: Hoare triple {90#true} assume ~main__scheme~0 >= 0; {90#true} is VALID [2020-07-10 15:28:29,985 INFO L280 TraceCheckUtils]: 15: Hoare triple {90#true} assume !(0 == ~main__scheme~0); {90#true} is VALID [2020-07-10 15:28:29,991 INFO L280 TraceCheckUtils]: 16: Hoare triple {90#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {95#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-10 15:28:29,992 INFO L280 TraceCheckUtils]: 17: Hoare triple {95#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {91#false} is VALID [2020-07-10 15:28:29,993 INFO L280 TraceCheckUtils]: 18: Hoare triple {91#false} assume !false; {91#false} is VALID [2020-07-10 15:28:29,995 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-10 15:28:29,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881173692] [2020-07-10 15:28:29,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:29,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:28:30,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713893486] [2020-07-10 15:28:30,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-10 15:28:30,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:30,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:28:30,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:30,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:28:30,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:30,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:28:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:28:30,076 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2020-07-10 15:28:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:30,739 INFO L93 Difference]: Finished difference Result 93 states and 129 transitions. [2020-07-10 15:28:30,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:28:30,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-10 15:28:30,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2020-07-10 15:28:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2020-07-10 15:28:30,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 129 transitions. [2020-07-10 15:28:31,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:31,065 INFO L225 Difference]: With dead ends: 93 [2020-07-10 15:28:31,065 INFO L226 Difference]: Without dead ends: 80 [2020-07-10 15:28:31,074 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:31,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-10 15:28:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-07-10 15:28:31,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:31,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2020-07-10 15:28:31,180 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-10 15:28:31,182 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-10 15:28:31,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,194 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2020-07-10 15:28:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2020-07-10 15:28:31,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:31,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:31,197 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2020-07-10 15:28:31,197 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2020-07-10 15:28:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:31,218 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2020-07-10 15:28:31,218 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2020-07-10 15:28:31,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:31,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:31,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:31,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-10 15:28:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2020-07-10 15:28:31,241 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 19 [2020-07-10 15:28:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:31,242 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2020-07-10 15:28:31,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:28:31,244 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2020-07-10 15:28:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:28:31,246 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:31,246 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] [2020-07-10 15:28:31,247 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:28:31,247 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:31,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:31,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1821150056, now seen corresponding path program 1 times [2020-07-10 15:28:31,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:31,249 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023679875] [2020-07-10 15:28:31,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:31,435 INFO L280 TraceCheckUtils]: 0: Hoare triple {460#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {451#true} is VALID [2020-07-10 15:28:31,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {451#true} assume true; {451#true} is VALID [2020-07-10 15:28:31,436 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {451#true} {451#true} #223#return; {451#true} is VALID [2020-07-10 15:28:31,437 INFO L263 TraceCheckUtils]: 0: Hoare triple {451#true} call ULTIMATE.init(); {460#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:31,438 INFO L280 TraceCheckUtils]: 1: Hoare triple {460#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {451#true} is VALID [2020-07-10 15:28:31,438 INFO L280 TraceCheckUtils]: 2: Hoare triple {451#true} assume true; {451#true} is VALID [2020-07-10 15:28:31,439 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {451#true} {451#true} #223#return; {451#true} is VALID [2020-07-10 15:28:31,439 INFO L263 TraceCheckUtils]: 4: Hoare triple {451#true} call #t~ret7 := main(); {451#true} is VALID [2020-07-10 15:28:31,439 INFO L280 TraceCheckUtils]: 5: Hoare triple {451#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {451#true} is VALID [2020-07-10 15:28:31,440 INFO L280 TraceCheckUtils]: 6: Hoare triple {451#true} assume !!(~main__urilen~0 <= 1000000); {451#true} is VALID [2020-07-10 15:28:31,440 INFO L280 TraceCheckUtils]: 7: Hoare triple {451#true} assume !!(~main__urilen~0 >= -1000000); {451#true} is VALID [2020-07-10 15:28:31,441 INFO L280 TraceCheckUtils]: 8: Hoare triple {451#true} assume !!(~main__tokenlen~0 <= 1000000); {451#true} is VALID [2020-07-10 15:28:31,441 INFO L280 TraceCheckUtils]: 9: Hoare triple {451#true} assume !!(~main__tokenlen~0 >= -1000000); {451#true} is VALID [2020-07-10 15:28:31,441 INFO L280 TraceCheckUtils]: 10: Hoare triple {451#true} assume !!(~main__scheme~0 <= 1000000); {451#true} is VALID [2020-07-10 15:28:31,442 INFO L280 TraceCheckUtils]: 11: Hoare triple {451#true} assume !!(~main__scheme~0 >= -1000000); {451#true} is VALID [2020-07-10 15:28:31,442 INFO L280 TraceCheckUtils]: 12: Hoare triple {451#true} assume ~main__urilen~0 > 0; {451#true} is VALID [2020-07-10 15:28:31,442 INFO L280 TraceCheckUtils]: 13: Hoare triple {451#true} assume ~main__tokenlen~0 > 0; {451#true} is VALID [2020-07-10 15:28:31,444 INFO L280 TraceCheckUtils]: 14: Hoare triple {451#true} assume ~main__scheme~0 >= 0; {456#(< 0 (+ main_~main__scheme~0 1))} is VALID [2020-07-10 15:28:31,445 INFO L280 TraceCheckUtils]: 15: Hoare triple {456#(< 0 (+ main_~main__scheme~0 1))} assume !(0 == ~main__scheme~0); {457#(< 0 main_~main__scheme~0)} is VALID [2020-07-10 15:28:31,447 INFO L280 TraceCheckUtils]: 16: Hoare triple {457#(< 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {458#(<= 1 main_~main__cp~0)} is VALID [2020-07-10 15:28:31,449 INFO L280 TraceCheckUtils]: 17: Hoare triple {458#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {459#(not (= 0 main_~__VERIFIER_assert__cond~1))} is VALID [2020-07-10 15:28:31,450 INFO L280 TraceCheckUtils]: 18: Hoare triple {459#(not (= 0 main_~__VERIFIER_assert__cond~1))} assume 0 == ~__VERIFIER_assert__cond~1; {452#false} is VALID [2020-07-10 15:28:31,451 INFO L280 TraceCheckUtils]: 19: Hoare triple {452#false} assume !false; {452#false} is VALID [2020-07-10 15:28:31,452 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-10 15:28:31,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023679875] [2020-07-10 15:28:31,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:31,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:28:31,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066405561] [2020-07-10 15:28:31,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 15:28:31,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:31,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:31,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:31,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:31,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:31,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:31,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:31,483 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 7 states. [2020-07-10 15:28:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,123 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2020-07-10 15:28:32,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:32,123 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 15:28:32,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2020-07-10 15:28:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:32,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2020-07-10 15:28:32,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 83 transitions. [2020-07-10 15:28:32,267 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-10 15:28:32,271 INFO L225 Difference]: With dead ends: 80 [2020-07-10 15:28:32,271 INFO L226 Difference]: Without dead ends: 78 [2020-07-10 15:28:32,273 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:28:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-10 15:28:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-07-10 15:28:32,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:32,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2020-07-10 15:28:32,299 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-10 15:28:32,299 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-10 15:28:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,304 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2020-07-10 15:28:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2020-07-10 15:28:32,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:32,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:32,306 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2020-07-10 15:28:32,306 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2020-07-10 15:28:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:32,311 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2020-07-10 15:28:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2020-07-10 15:28:32,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:32,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:32,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:32,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-10 15:28:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2020-07-10 15:28:32,320 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 20 [2020-07-10 15:28:32,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:32,320 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2020-07-10 15:28:32,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:32,321 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2020-07-10 15:28:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:28:32,324 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:32,324 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] [2020-07-10 15:28:32,325 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:28:32,325 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:32,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:32,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2073610827, now seen corresponding path program 1 times [2020-07-10 15:28:32,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:32,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274264421] [2020-07-10 15:28:32,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:32,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {808#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {801#true} is VALID [2020-07-10 15:28:32,479 INFO L280 TraceCheckUtils]: 1: Hoare triple {801#true} assume true; {801#true} is VALID [2020-07-10 15:28:32,479 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {801#true} {801#true} #223#return; {801#true} is VALID [2020-07-10 15:28:32,481 INFO L263 TraceCheckUtils]: 0: Hoare triple {801#true} call ULTIMATE.init(); {808#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:32,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {808#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {801#true} is VALID [2020-07-10 15:28:32,482 INFO L280 TraceCheckUtils]: 2: Hoare triple {801#true} assume true; {801#true} is VALID [2020-07-10 15:28:32,482 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {801#true} {801#true} #223#return; {801#true} is VALID [2020-07-10 15:28:32,482 INFO L263 TraceCheckUtils]: 4: Hoare triple {801#true} call #t~ret7 := main(); {801#true} is VALID [2020-07-10 15:28:32,482 INFO L280 TraceCheckUtils]: 5: Hoare triple {801#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {801#true} is VALID [2020-07-10 15:28:32,483 INFO L280 TraceCheckUtils]: 6: Hoare triple {801#true} assume !!(~main__urilen~0 <= 1000000); {801#true} is VALID [2020-07-10 15:28:32,483 INFO L280 TraceCheckUtils]: 7: Hoare triple {801#true} assume !!(~main__urilen~0 >= -1000000); {801#true} is VALID [2020-07-10 15:28:32,483 INFO L280 TraceCheckUtils]: 8: Hoare triple {801#true} assume !!(~main__tokenlen~0 <= 1000000); {801#true} is VALID [2020-07-10 15:28:32,484 INFO L280 TraceCheckUtils]: 9: Hoare triple {801#true} assume !!(~main__tokenlen~0 >= -1000000); {801#true} is VALID [2020-07-10 15:28:32,484 INFO L280 TraceCheckUtils]: 10: Hoare triple {801#true} assume !!(~main__scheme~0 <= 1000000); {801#true} is VALID [2020-07-10 15:28:32,484 INFO L280 TraceCheckUtils]: 11: Hoare triple {801#true} assume !!(~main__scheme~0 >= -1000000); {801#true} is VALID [2020-07-10 15:28:32,485 INFO L280 TraceCheckUtils]: 12: Hoare triple {801#true} assume ~main__urilen~0 > 0; {801#true} is VALID [2020-07-10 15:28:32,485 INFO L280 TraceCheckUtils]: 13: Hoare triple {801#true} assume ~main__tokenlen~0 > 0; {801#true} is VALID [2020-07-10 15:28:32,485 INFO L280 TraceCheckUtils]: 14: Hoare triple {801#true} assume ~main__scheme~0 >= 0; {801#true} is VALID [2020-07-10 15:28:32,485 INFO L280 TraceCheckUtils]: 15: Hoare triple {801#true} assume !(0 == ~main__scheme~0); {801#true} is VALID [2020-07-10 15:28:32,487 INFO L280 TraceCheckUtils]: 16: Hoare triple {801#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:32,488 INFO L280 TraceCheckUtils]: 17: Hoare triple {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:32,490 INFO L280 TraceCheckUtils]: 18: Hoare triple {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:32,492 INFO L280 TraceCheckUtils]: 19: Hoare triple {806#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {807#(not (= 0 main_~__VERIFIER_assert__cond~2))} is VALID [2020-07-10 15:28:32,493 INFO L280 TraceCheckUtils]: 20: Hoare triple {807#(not (= 0 main_~__VERIFIER_assert__cond~2))} assume 0 == ~__VERIFIER_assert__cond~2; {802#false} is VALID [2020-07-10 15:28:32,493 INFO L280 TraceCheckUtils]: 21: Hoare triple {802#false} assume !false; {802#false} is VALID [2020-07-10 15:28:32,494 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-10 15:28:32,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274264421] [2020-07-10 15:28:32,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:32,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:32,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121321024] [2020-07-10 15:28:32,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-10 15:28:32,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:32,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:32,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:32,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:32,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:32,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:32,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:32,529 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand 5 states. [2020-07-10 15:28:33,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,088 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2020-07-10 15:28:33,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:33,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-10 15:28:33,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:33,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2020-07-10 15:28:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2020-07-10 15:28:33,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 106 transitions. [2020-07-10 15:28:33,253 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-10 15:28:33,257 INFO L225 Difference]: With dead ends: 101 [2020-07-10 15:28:33,257 INFO L226 Difference]: Without dead ends: 99 [2020-07-10 15:28:33,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:33,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-10 15:28:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 76. [2020-07-10 15:28:33,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:33,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 76 states. [2020-07-10 15:28:33,284 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 76 states. [2020-07-10 15:28:33,284 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 76 states. [2020-07-10 15:28:33,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,290 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2020-07-10 15:28:33,290 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2020-07-10 15:28:33,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:33,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:33,292 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 99 states. [2020-07-10 15:28:33,292 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 99 states. [2020-07-10 15:28:33,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,297 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2020-07-10 15:28:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2020-07-10 15:28:33,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:33,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:33,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:33,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-10 15:28:33,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2020-07-10 15:28:33,303 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 22 [2020-07-10 15:28:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:33,304 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2020-07-10 15:28:33,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:33,304 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2020-07-10 15:28:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 15:28:33,305 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:33,305 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] [2020-07-10 15:28:33,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:28:33,306 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:33,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:33,306 INFO L82 PathProgramCache]: Analyzing trace with hash -142570686, now seen corresponding path program 1 times [2020-07-10 15:28:33,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:33,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186567244] [2020-07-10 15:28:33,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:33,395 INFO L280 TraceCheckUtils]: 0: Hoare triple {1218#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {1210#true} is VALID [2020-07-10 15:28:33,396 INFO L280 TraceCheckUtils]: 1: Hoare triple {1210#true} assume true; {1210#true} is VALID [2020-07-10 15:28:33,396 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1210#true} {1210#true} #223#return; {1210#true} is VALID [2020-07-10 15:28:33,397 INFO L263 TraceCheckUtils]: 0: Hoare triple {1210#true} call ULTIMATE.init(); {1218#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:33,397 INFO L280 TraceCheckUtils]: 1: Hoare triple {1218#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {1210#true} is VALID [2020-07-10 15:28:33,397 INFO L280 TraceCheckUtils]: 2: Hoare triple {1210#true} assume true; {1210#true} is VALID [2020-07-10 15:28:33,398 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1210#true} {1210#true} #223#return; {1210#true} is VALID [2020-07-10 15:28:33,398 INFO L263 TraceCheckUtils]: 4: Hoare triple {1210#true} call #t~ret7 := main(); {1210#true} is VALID [2020-07-10 15:28:33,398 INFO L280 TraceCheckUtils]: 5: Hoare triple {1210#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {1210#true} is VALID [2020-07-10 15:28:33,399 INFO L280 TraceCheckUtils]: 6: Hoare triple {1210#true} assume !!(~main__urilen~0 <= 1000000); {1210#true} is VALID [2020-07-10 15:28:33,399 INFO L280 TraceCheckUtils]: 7: Hoare triple {1210#true} assume !!(~main__urilen~0 >= -1000000); {1210#true} is VALID [2020-07-10 15:28:33,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {1210#true} assume !!(~main__tokenlen~0 <= 1000000); {1210#true} is VALID [2020-07-10 15:28:33,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {1210#true} assume !!(~main__tokenlen~0 >= -1000000); {1210#true} is VALID [2020-07-10 15:28:33,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {1210#true} assume !!(~main__scheme~0 <= 1000000); {1210#true} is VALID [2020-07-10 15:28:33,400 INFO L280 TraceCheckUtils]: 11: Hoare triple {1210#true} assume !!(~main__scheme~0 >= -1000000); {1210#true} is VALID [2020-07-10 15:28:33,400 INFO L280 TraceCheckUtils]: 12: Hoare triple {1210#true} assume ~main__urilen~0 > 0; {1210#true} is VALID [2020-07-10 15:28:33,400 INFO L280 TraceCheckUtils]: 13: Hoare triple {1210#true} assume ~main__tokenlen~0 > 0; {1210#true} is VALID [2020-07-10 15:28:33,401 INFO L280 TraceCheckUtils]: 14: Hoare triple {1210#true} assume ~main__scheme~0 >= 0; {1215#(<= 0 main_~main__scheme~0)} is VALID [2020-07-10 15:28:33,403 INFO L280 TraceCheckUtils]: 15: Hoare triple {1215#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {1215#(<= 0 main_~main__scheme~0)} is VALID [2020-07-10 15:28:33,404 INFO L280 TraceCheckUtils]: 16: Hoare triple {1215#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1216#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:33,406 INFO L280 TraceCheckUtils]: 17: Hoare triple {1216#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1216#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:33,406 INFO L280 TraceCheckUtils]: 18: Hoare triple {1216#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {1216#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:33,407 INFO L280 TraceCheckUtils]: 19: Hoare triple {1216#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1216#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:33,408 INFO L280 TraceCheckUtils]: 20: Hoare triple {1216#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1217#(not (= 0 main_~__VERIFIER_assert__cond~3))} is VALID [2020-07-10 15:28:33,409 INFO L280 TraceCheckUtils]: 21: Hoare triple {1217#(not (= 0 main_~__VERIFIER_assert__cond~3))} assume 0 == ~__VERIFIER_assert__cond~3; {1211#false} is VALID [2020-07-10 15:28:33,410 INFO L280 TraceCheckUtils]: 22: Hoare triple {1211#false} assume !false; {1211#false} is VALID [2020-07-10 15:28:33,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-10 15:28:33,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186567244] [2020-07-10 15:28:33,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:33,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:33,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077954660] [2020-07-10 15:28:33,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 15:28:33,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:33,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:33,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:33,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:33,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:33,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:33,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:33,439 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 6 states. [2020-07-10 15:28:33,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:33,881 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2020-07-10 15:28:33,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:33,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-10 15:28:33,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-10 15:28:33,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:33,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2020-07-10 15:28:33,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2020-07-10 15:28:34,003 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:34,006 INFO L225 Difference]: With dead ends: 76 [2020-07-10 15:28:34,006 INFO L226 Difference]: Without dead ends: 74 [2020-07-10 15:28:34,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:34,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-10 15:28:34,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-10 15:28:34,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:34,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-10 15:28:34,049 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-10 15:28:34,049 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-10 15:28:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,052 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-10 15:28:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 15:28:34,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:34,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:34,053 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-10 15:28:34,053 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-10 15:28:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:34,057 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-10 15:28:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 15:28:34,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:34,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:34,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:34,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-10 15:28:34,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2020-07-10 15:28:34,061 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 23 [2020-07-10 15:28:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:34,062 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2020-07-10 15:28:34,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 15:28:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:28:34,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:34,063 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] [2020-07-10 15:28:34,063 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:28:34,064 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:34,064 INFO L82 PathProgramCache]: Analyzing trace with hash 402497124, now seen corresponding path program 1 times [2020-07-10 15:28:34,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:34,065 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155328892] [2020-07-10 15:28:34,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:34,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {1549#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {1541#true} is VALID [2020-07-10 15:28:34,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {1541#true} assume true; {1541#true} is VALID [2020-07-10 15:28:34,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1541#true} {1541#true} #223#return; {1541#true} is VALID [2020-07-10 15:28:34,185 INFO L263 TraceCheckUtils]: 0: Hoare triple {1541#true} call ULTIMATE.init(); {1549#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:34,185 INFO L280 TraceCheckUtils]: 1: Hoare triple {1549#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {1541#true} is VALID [2020-07-10 15:28:34,186 INFO L280 TraceCheckUtils]: 2: Hoare triple {1541#true} assume true; {1541#true} is VALID [2020-07-10 15:28:34,186 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1541#true} {1541#true} #223#return; {1541#true} is VALID [2020-07-10 15:28:34,187 INFO L263 TraceCheckUtils]: 4: Hoare triple {1541#true} call #t~ret7 := main(); {1541#true} is VALID [2020-07-10 15:28:34,187 INFO L280 TraceCheckUtils]: 5: Hoare triple {1541#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {1541#true} is VALID [2020-07-10 15:28:34,188 INFO L280 TraceCheckUtils]: 6: Hoare triple {1541#true} assume !!(~main__urilen~0 <= 1000000); {1541#true} is VALID [2020-07-10 15:28:34,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {1541#true} assume !!(~main__urilen~0 >= -1000000); {1541#true} is VALID [2020-07-10 15:28:34,188 INFO L280 TraceCheckUtils]: 8: Hoare triple {1541#true} assume !!(~main__tokenlen~0 <= 1000000); {1541#true} is VALID [2020-07-10 15:28:34,188 INFO L280 TraceCheckUtils]: 9: Hoare triple {1541#true} assume !!(~main__tokenlen~0 >= -1000000); {1541#true} is VALID [2020-07-10 15:28:34,189 INFO L280 TraceCheckUtils]: 10: Hoare triple {1541#true} assume !!(~main__scheme~0 <= 1000000); {1541#true} is VALID [2020-07-10 15:28:34,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {1541#true} assume !!(~main__scheme~0 >= -1000000); {1541#true} is VALID [2020-07-10 15:28:34,189 INFO L280 TraceCheckUtils]: 12: Hoare triple {1541#true} assume ~main__urilen~0 > 0; {1541#true} is VALID [2020-07-10 15:28:34,190 INFO L280 TraceCheckUtils]: 13: Hoare triple {1541#true} assume ~main__tokenlen~0 > 0; {1541#true} is VALID [2020-07-10 15:28:34,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {1541#true} assume ~main__scheme~0 >= 0; {1541#true} is VALID [2020-07-10 15:28:34,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {1541#true} assume !(0 == ~main__scheme~0); {1541#true} is VALID [2020-07-10 15:28:34,190 INFO L280 TraceCheckUtils]: 16: Hoare triple {1541#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {1541#true} is VALID [2020-07-10 15:28:34,191 INFO L280 TraceCheckUtils]: 17: Hoare triple {1541#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {1541#true} is VALID [2020-07-10 15:28:34,191 INFO L280 TraceCheckUtils]: 18: Hoare triple {1541#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {1541#true} is VALID [2020-07-10 15:28:34,193 INFO L280 TraceCheckUtils]: 19: Hoare triple {1541#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {1546#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= 0 main_~__VERIFIER_assert__cond~2)) (and (= 1 main_~__VERIFIER_assert__cond~2) (< main_~main__cp~0 main_~main__urilen~0)))} is VALID [2020-07-10 15:28:34,195 INFO L280 TraceCheckUtils]: 20: Hoare triple {1546#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= 0 main_~__VERIFIER_assert__cond~2)) (and (= 1 main_~__VERIFIER_assert__cond~2) (< main_~main__cp~0 main_~main__urilen~0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {1547#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:34,196 INFO L280 TraceCheckUtils]: 21: Hoare triple {1547#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {1547#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:34,201 INFO L280 TraceCheckUtils]: 22: Hoare triple {1547#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {1547#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:34,202 INFO L280 TraceCheckUtils]: 23: Hoare triple {1547#(< main_~main__cp~0 main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {1548#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2020-07-10 15:28:34,206 INFO L280 TraceCheckUtils]: 24: Hoare triple {1548#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {1542#false} is VALID [2020-07-10 15:28:34,207 INFO L280 TraceCheckUtils]: 25: Hoare triple {1542#false} assume !false; {1542#false} is VALID [2020-07-10 15:28:34,209 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-10 15:28:34,209 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155328892] [2020-07-10 15:28:34,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:34,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:34,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909351] [2020-07-10 15:28:34,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 15:28:34,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:34,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:34,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:34,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:34,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:34,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:34,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:34,244 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 6 states. [2020-07-10 15:28:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,433 INFO L93 Difference]: Finished difference Result 141 states and 147 transitions. [2020-07-10 15:28:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:28:35,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 15:28:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2020-07-10 15:28:35,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 147 transitions. [2020-07-10 15:28:35,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 147 transitions. [2020-07-10 15:28:35,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:35,651 INFO L225 Difference]: With dead ends: 141 [2020-07-10 15:28:35,652 INFO L226 Difference]: Without dead ends: 139 [2020-07-10 15:28:35,652 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:28:35,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-07-10 15:28:35,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 77. [2020-07-10 15:28:35,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:35,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand 77 states. [2020-07-10 15:28:35,705 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 77 states. [2020-07-10 15:28:35,705 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 77 states. [2020-07-10 15:28:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,711 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2020-07-10 15:28:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2020-07-10 15:28:35,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:35,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:35,712 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 139 states. [2020-07-10 15:28:35,712 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 139 states. [2020-07-10 15:28:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:35,718 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2020-07-10 15:28:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2020-07-10 15:28:35,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:35,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:35,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:35,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-10 15:28:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-07-10 15:28:35,723 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2020-07-10 15:28:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:35,724 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-07-10 15:28:35,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-10 15:28:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:28:35,725 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:35,725 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] [2020-07-10 15:28:35,725 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:28:35,725 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:35,726 INFO L82 PathProgramCache]: Analyzing trace with hash 406230933, now seen corresponding path program 1 times [2020-07-10 15:28:35,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:35,727 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331138403] [2020-07-10 15:28:35,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:35,823 INFO L280 TraceCheckUtils]: 0: Hoare triple {2088#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {2080#true} is VALID [2020-07-10 15:28:35,823 INFO L280 TraceCheckUtils]: 1: Hoare triple {2080#true} assume true; {2080#true} is VALID [2020-07-10 15:28:35,824 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2080#true} {2080#true} #223#return; {2080#true} is VALID [2020-07-10 15:28:35,828 INFO L263 TraceCheckUtils]: 0: Hoare triple {2080#true} call ULTIMATE.init(); {2088#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:35,828 INFO L280 TraceCheckUtils]: 1: Hoare triple {2088#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {2080#true} is VALID [2020-07-10 15:28:35,828 INFO L280 TraceCheckUtils]: 2: Hoare triple {2080#true} assume true; {2080#true} is VALID [2020-07-10 15:28:35,829 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2080#true} {2080#true} #223#return; {2080#true} is VALID [2020-07-10 15:28:35,829 INFO L263 TraceCheckUtils]: 4: Hoare triple {2080#true} call #t~ret7 := main(); {2080#true} is VALID [2020-07-10 15:28:35,829 INFO L280 TraceCheckUtils]: 5: Hoare triple {2080#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {2080#true} is VALID [2020-07-10 15:28:35,829 INFO L280 TraceCheckUtils]: 6: Hoare triple {2080#true} assume !!(~main__urilen~0 <= 1000000); {2080#true} is VALID [2020-07-10 15:28:35,829 INFO L280 TraceCheckUtils]: 7: Hoare triple {2080#true} assume !!(~main__urilen~0 >= -1000000); {2080#true} is VALID [2020-07-10 15:28:35,830 INFO L280 TraceCheckUtils]: 8: Hoare triple {2080#true} assume !!(~main__tokenlen~0 <= 1000000); {2080#true} is VALID [2020-07-10 15:28:35,830 INFO L280 TraceCheckUtils]: 9: Hoare triple {2080#true} assume !!(~main__tokenlen~0 >= -1000000); {2080#true} is VALID [2020-07-10 15:28:35,830 INFO L280 TraceCheckUtils]: 10: Hoare triple {2080#true} assume !!(~main__scheme~0 <= 1000000); {2080#true} is VALID [2020-07-10 15:28:35,830 INFO L280 TraceCheckUtils]: 11: Hoare triple {2080#true} assume !!(~main__scheme~0 >= -1000000); {2080#true} is VALID [2020-07-10 15:28:35,830 INFO L280 TraceCheckUtils]: 12: Hoare triple {2080#true} assume ~main__urilen~0 > 0; {2080#true} is VALID [2020-07-10 15:28:35,830 INFO L280 TraceCheckUtils]: 13: Hoare triple {2080#true} assume ~main__tokenlen~0 > 0; {2080#true} is VALID [2020-07-10 15:28:35,831 INFO L280 TraceCheckUtils]: 14: Hoare triple {2080#true} assume ~main__scheme~0 >= 0; {2080#true} is VALID [2020-07-10 15:28:35,831 INFO L280 TraceCheckUtils]: 15: Hoare triple {2080#true} assume !(0 == ~main__scheme~0); {2080#true} is VALID [2020-07-10 15:28:35,831 INFO L280 TraceCheckUtils]: 16: Hoare triple {2080#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2080#true} is VALID [2020-07-10 15:28:35,831 INFO L280 TraceCheckUtils]: 17: Hoare triple {2080#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2080#true} is VALID [2020-07-10 15:28:35,832 INFO L280 TraceCheckUtils]: 18: Hoare triple {2080#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {2080#true} is VALID [2020-07-10 15:28:35,833 INFO L280 TraceCheckUtils]: 19: Hoare triple {2080#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2085#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= 0 main_~__VERIFIER_assert__cond~2)) (and (= 1 main_~__VERIFIER_assert__cond~2) (< main_~main__cp~0 main_~main__urilen~0)))} is VALID [2020-07-10 15:28:35,838 INFO L280 TraceCheckUtils]: 20: Hoare triple {2085#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= 0 main_~__VERIFIER_assert__cond~2)) (and (= 1 main_~__VERIFIER_assert__cond~2) (< main_~main__cp~0 main_~main__urilen~0)))} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2086#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:35,839 INFO L280 TraceCheckUtils]: 21: Hoare triple {2086#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {2086#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:35,840 INFO L280 TraceCheckUtils]: 22: Hoare triple {2086#(< main_~main__cp~0 main_~main__urilen~0)} assume !(~main__cp~0 != ~main__urilen~0 - 1); {2086#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:35,841 INFO L280 TraceCheckUtils]: 23: Hoare triple {2086#(< main_~main__cp~0 main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {2087#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2020-07-10 15:28:35,841 INFO L280 TraceCheckUtils]: 24: Hoare triple {2087#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume 0 == ~__VERIFIER_assert__cond~4; {2081#false} is VALID [2020-07-10 15:28:35,841 INFO L280 TraceCheckUtils]: 25: Hoare triple {2081#false} assume !false; {2081#false} is VALID [2020-07-10 15:28:35,842 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-10 15:28:35,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331138403] [2020-07-10 15:28:35,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:35,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:35,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835096851] [2020-07-10 15:28:35,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 15:28:35,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:35,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:35,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:35,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:35,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:35,887 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2020-07-10 15:28:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,682 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2020-07-10 15:28:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:28:36,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-07-10 15:28:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:36,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2020-07-10 15:28:36,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 114 transitions. [2020-07-10 15:28:36,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 114 transitions. [2020-07-10 15:28:36,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:36,855 INFO L225 Difference]: With dead ends: 108 [2020-07-10 15:28:36,855 INFO L226 Difference]: Without dead ends: 106 [2020-07-10 15:28:36,856 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:28:36,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-07-10 15:28:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 79. [2020-07-10 15:28:36,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:36,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 79 states. [2020-07-10 15:28:36,920 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 79 states. [2020-07-10 15:28:36,920 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 79 states. [2020-07-10 15:28:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,925 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2020-07-10 15:28:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2020-07-10 15:28:36,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:36,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:36,927 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 106 states. [2020-07-10 15:28:36,927 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 106 states. [2020-07-10 15:28:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:36,931 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2020-07-10 15:28:36,931 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2020-07-10 15:28:36,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:36,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:36,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:36,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:36,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-10 15:28:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2020-07-10 15:28:36,935 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2020-07-10 15:28:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:36,935 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2020-07-10 15:28:36,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2020-07-10 15:28:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:28:36,936 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:36,936 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] [2020-07-10 15:28:36,937 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:28:36,937 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:36,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:36,938 INFO L82 PathProgramCache]: Analyzing trace with hash -407487796, now seen corresponding path program 1 times [2020-07-10 15:28:36,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:36,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568329811] [2020-07-10 15:28:36,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:37,039 INFO L280 TraceCheckUtils]: 0: Hoare triple {2530#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {2522#true} is VALID [2020-07-10 15:28:37,039 INFO L280 TraceCheckUtils]: 1: Hoare triple {2522#true} assume true; {2522#true} is VALID [2020-07-10 15:28:37,039 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2522#true} {2522#true} #223#return; {2522#true} is VALID [2020-07-10 15:28:37,040 INFO L263 TraceCheckUtils]: 0: Hoare triple {2522#true} call ULTIMATE.init(); {2530#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:37,041 INFO L280 TraceCheckUtils]: 1: Hoare triple {2530#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {2522#true} is VALID [2020-07-10 15:28:37,041 INFO L280 TraceCheckUtils]: 2: Hoare triple {2522#true} assume true; {2522#true} is VALID [2020-07-10 15:28:37,041 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2522#true} {2522#true} #223#return; {2522#true} is VALID [2020-07-10 15:28:37,041 INFO L263 TraceCheckUtils]: 4: Hoare triple {2522#true} call #t~ret7 := main(); {2522#true} is VALID [2020-07-10 15:28:37,041 INFO L280 TraceCheckUtils]: 5: Hoare triple {2522#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {2522#true} is VALID [2020-07-10 15:28:37,042 INFO L280 TraceCheckUtils]: 6: Hoare triple {2522#true} assume !!(~main__urilen~0 <= 1000000); {2522#true} is VALID [2020-07-10 15:28:37,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {2522#true} assume !!(~main__urilen~0 >= -1000000); {2522#true} is VALID [2020-07-10 15:28:37,042 INFO L280 TraceCheckUtils]: 8: Hoare triple {2522#true} assume !!(~main__tokenlen~0 <= 1000000); {2522#true} is VALID [2020-07-10 15:28:37,042 INFO L280 TraceCheckUtils]: 9: Hoare triple {2522#true} assume !!(~main__tokenlen~0 >= -1000000); {2522#true} is VALID [2020-07-10 15:28:37,042 INFO L280 TraceCheckUtils]: 10: Hoare triple {2522#true} assume !!(~main__scheme~0 <= 1000000); {2522#true} is VALID [2020-07-10 15:28:37,043 INFO L280 TraceCheckUtils]: 11: Hoare triple {2522#true} assume !!(~main__scheme~0 >= -1000000); {2522#true} is VALID [2020-07-10 15:28:37,043 INFO L280 TraceCheckUtils]: 12: Hoare triple {2522#true} assume ~main__urilen~0 > 0; {2522#true} is VALID [2020-07-10 15:28:37,043 INFO L280 TraceCheckUtils]: 13: Hoare triple {2522#true} assume ~main__tokenlen~0 > 0; {2522#true} is VALID [2020-07-10 15:28:37,043 INFO L280 TraceCheckUtils]: 14: Hoare triple {2522#true} assume ~main__scheme~0 >= 0; {2522#true} is VALID [2020-07-10 15:28:37,043 INFO L280 TraceCheckUtils]: 15: Hoare triple {2522#true} assume !(0 == ~main__scheme~0); {2522#true} is VALID [2020-07-10 15:28:37,044 INFO L280 TraceCheckUtils]: 16: Hoare triple {2522#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2522#true} is VALID [2020-07-10 15:28:37,044 INFO L280 TraceCheckUtils]: 17: Hoare triple {2522#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2522#true} is VALID [2020-07-10 15:28:37,044 INFO L280 TraceCheckUtils]: 18: Hoare triple {2522#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {2522#true} is VALID [2020-07-10 15:28:37,045 INFO L280 TraceCheckUtils]: 19: Hoare triple {2522#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2522#true} is VALID [2020-07-10 15:28:37,049 INFO L280 TraceCheckUtils]: 20: Hoare triple {2522#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {2527#(or (and (= 0 main_~__VERIFIER_assert__cond~3) (< main_~main__cp~0 0)) (and (<= 0 main_~main__cp~0) (= 1 main_~__VERIFIER_assert__cond~3)))} is VALID [2020-07-10 15:28:37,051 INFO L280 TraceCheckUtils]: 21: Hoare triple {2527#(or (and (= 0 main_~__VERIFIER_assert__cond~3) (< main_~main__cp~0 0)) (and (<= 0 main_~main__cp~0) (= 1 main_~__VERIFIER_assert__cond~3)))} assume !(0 == ~__VERIFIER_assert__cond~3); {2528#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:37,053 INFO L280 TraceCheckUtils]: 22: Hoare triple {2528#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {2528#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:37,055 INFO L280 TraceCheckUtils]: 23: Hoare triple {2528#(<= 0 main_~main__cp~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {2528#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:37,056 INFO L280 TraceCheckUtils]: 24: Hoare triple {2528#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {2529#(not (= main_~__VERIFIER_assert__cond~17 0))} is VALID [2020-07-10 15:28:37,056 INFO L280 TraceCheckUtils]: 25: Hoare triple {2529#(not (= main_~__VERIFIER_assert__cond~17 0))} assume 0 == ~__VERIFIER_assert__cond~17; {2523#false} is VALID [2020-07-10 15:28:37,057 INFO L280 TraceCheckUtils]: 26: Hoare triple {2523#false} assume !false; {2523#false} is VALID [2020-07-10 15:28:37,058 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-10 15:28:37,058 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568329811] [2020-07-10 15:28:37,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:37,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:37,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58011966] [2020-07-10 15:28:37,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 15:28:37,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:37,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:37,094 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:37,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:37,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:37,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:37,096 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 6 states. [2020-07-10 15:28:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:37,838 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2020-07-10 15:28:37,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:37,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 15:28:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:37,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2020-07-10 15:28:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2020-07-10 15:28:37,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 125 transitions. [2020-07-10 15:28:38,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:38,039 INFO L225 Difference]: With dead ends: 121 [2020-07-10 15:28:38,039 INFO L226 Difference]: Without dead ends: 119 [2020-07-10 15:28:38,040 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-10 15:28:38,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 77. [2020-07-10 15:28:38,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:38,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 77 states. [2020-07-10 15:28:38,092 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 77 states. [2020-07-10 15:28:38,092 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 77 states. [2020-07-10 15:28:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:38,096 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2020-07-10 15:28:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2020-07-10 15:28:38,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:38,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:38,097 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 119 states. [2020-07-10 15:28:38,097 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 119 states. [2020-07-10 15:28:38,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:38,101 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2020-07-10 15:28:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2020-07-10 15:28:38,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:38,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:38,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:38,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-07-10 15:28:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-07-10 15:28:38,105 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 27 [2020-07-10 15:28:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:38,106 INFO L479 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-07-10 15:28:38,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-07-10 15:28:38,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 15:28:38,107 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:38,107 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] [2020-07-10 15:28:38,107 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 15:28:38,107 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:38,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash -291739827, now seen corresponding path program 1 times [2020-07-10 15:28:38,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:38,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558839321] [2020-07-10 15:28:38,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:38,224 INFO L280 TraceCheckUtils]: 0: Hoare triple {3006#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {2998#true} is VALID [2020-07-10 15:28:38,224 INFO L280 TraceCheckUtils]: 1: Hoare triple {2998#true} assume true; {2998#true} is VALID [2020-07-10 15:28:38,224 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2998#true} {2998#true} #223#return; {2998#true} is VALID [2020-07-10 15:28:38,225 INFO L263 TraceCheckUtils]: 0: Hoare triple {2998#true} call ULTIMATE.init(); {3006#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:38,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {3006#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {2998#true} is VALID [2020-07-10 15:28:38,226 INFO L280 TraceCheckUtils]: 2: Hoare triple {2998#true} assume true; {2998#true} is VALID [2020-07-10 15:28:38,226 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2998#true} {2998#true} #223#return; {2998#true} is VALID [2020-07-10 15:28:38,226 INFO L263 TraceCheckUtils]: 4: Hoare triple {2998#true} call #t~ret7 := main(); {2998#true} is VALID [2020-07-10 15:28:38,226 INFO L280 TraceCheckUtils]: 5: Hoare triple {2998#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {2998#true} is VALID [2020-07-10 15:28:38,227 INFO L280 TraceCheckUtils]: 6: Hoare triple {2998#true} assume !!(~main__urilen~0 <= 1000000); {2998#true} is VALID [2020-07-10 15:28:38,227 INFO L280 TraceCheckUtils]: 7: Hoare triple {2998#true} assume !!(~main__urilen~0 >= -1000000); {2998#true} is VALID [2020-07-10 15:28:38,227 INFO L280 TraceCheckUtils]: 8: Hoare triple {2998#true} assume !!(~main__tokenlen~0 <= 1000000); {2998#true} is VALID [2020-07-10 15:28:38,227 INFO L280 TraceCheckUtils]: 9: Hoare triple {2998#true} assume !!(~main__tokenlen~0 >= -1000000); {2998#true} is VALID [2020-07-10 15:28:38,233 INFO L280 TraceCheckUtils]: 10: Hoare triple {2998#true} assume !!(~main__scheme~0 <= 1000000); {2998#true} is VALID [2020-07-10 15:28:38,233 INFO L280 TraceCheckUtils]: 11: Hoare triple {2998#true} assume !!(~main__scheme~0 >= -1000000); {2998#true} is VALID [2020-07-10 15:28:38,233 INFO L280 TraceCheckUtils]: 12: Hoare triple {2998#true} assume ~main__urilen~0 > 0; {2998#true} is VALID [2020-07-10 15:28:38,233 INFO L280 TraceCheckUtils]: 13: Hoare triple {2998#true} assume ~main__tokenlen~0 > 0; {2998#true} is VALID [2020-07-10 15:28:38,234 INFO L280 TraceCheckUtils]: 14: Hoare triple {2998#true} assume ~main__scheme~0 >= 0; {2998#true} is VALID [2020-07-10 15:28:38,234 INFO L280 TraceCheckUtils]: 15: Hoare triple {2998#true} assume !(0 == ~main__scheme~0); {2998#true} is VALID [2020-07-10 15:28:38,234 INFO L280 TraceCheckUtils]: 16: Hoare triple {2998#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {2998#true} is VALID [2020-07-10 15:28:38,235 INFO L280 TraceCheckUtils]: 17: Hoare triple {2998#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {2998#true} is VALID [2020-07-10 15:28:38,235 INFO L280 TraceCheckUtils]: 18: Hoare triple {2998#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {2998#true} is VALID [2020-07-10 15:28:38,235 INFO L280 TraceCheckUtils]: 19: Hoare triple {2998#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {2998#true} is VALID [2020-07-10 15:28:38,242 INFO L280 TraceCheckUtils]: 20: Hoare triple {2998#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3003#(or (and (= 0 main_~__VERIFIER_assert__cond~3) (< main_~main__cp~0 0)) (and (<= 0 main_~main__cp~0) (= 1 main_~__VERIFIER_assert__cond~3)))} is VALID [2020-07-10 15:28:38,243 INFO L280 TraceCheckUtils]: 21: Hoare triple {3003#(or (and (= 0 main_~__VERIFIER_assert__cond~3) (< main_~main__cp~0 0)) (and (<= 0 main_~main__cp~0) (= 1 main_~__VERIFIER_assert__cond~3)))} assume !(0 == ~__VERIFIER_assert__cond~3); {3004#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:38,243 INFO L280 TraceCheckUtils]: 22: Hoare triple {3004#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 != ~main__urilen~0 - 1); {3004#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:38,244 INFO L280 TraceCheckUtils]: 23: Hoare triple {3004#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3004#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:38,245 INFO L280 TraceCheckUtils]: 24: Hoare triple {3004#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3005#(not (= 0 main_~__VERIFIER_assert__cond~5))} is VALID [2020-07-10 15:28:38,245 INFO L280 TraceCheckUtils]: 25: Hoare triple {3005#(not (= 0 main_~__VERIFIER_assert__cond~5))} assume 0 == ~__VERIFIER_assert__cond~5; {2999#false} is VALID [2020-07-10 15:28:38,246 INFO L280 TraceCheckUtils]: 26: Hoare triple {2999#false} assume !false; {2999#false} is VALID [2020-07-10 15:28:38,246 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-10 15:28:38,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558839321] [2020-07-10 15:28:38,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:38,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:38,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520204018] [2020-07-10 15:28:38,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 15:28:38,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:38,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:38,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:38,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:38,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:38,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:38,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:38,281 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 6 states. [2020-07-10 15:28:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:38,827 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-10 15:28:38,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:38,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-07-10 15:28:38,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:38,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2020-07-10 15:28:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:38,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2020-07-10 15:28:38,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2020-07-10 15:28:38,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:38,968 INFO L225 Difference]: With dead ends: 77 [2020-07-10 15:28:38,969 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 15:28:38,969 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 15:28:39,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-07-10 15:28:39,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:39,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2020-07-10 15:28:39,041 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2020-07-10 15:28:39,041 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2020-07-10 15:28:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:39,048 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2020-07-10 15:28:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-07-10 15:28:39,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:39,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:39,049 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2020-07-10 15:28:39,050 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2020-07-10 15:28:39,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:39,053 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2020-07-10 15:28:39,053 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-07-10 15:28:39,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:39,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:39,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:39,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-10 15:28:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-07-10 15:28:39,058 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 27 [2020-07-10 15:28:39,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:39,062 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-07-10 15:28:39,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:39,063 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-07-10 15:28:39,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:28:39,063 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:39,064 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] [2020-07-10 15:28:39,064 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 15:28:39,064 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1188998893, now seen corresponding path program 1 times [2020-07-10 15:28:39,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:39,066 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835895111] [2020-07-10 15:28:39,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:39,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {3343#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {3337#true} is VALID [2020-07-10 15:28:39,182 INFO L280 TraceCheckUtils]: 1: Hoare triple {3337#true} assume true; {3337#true} is VALID [2020-07-10 15:28:39,183 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3337#true} {3337#true} #223#return; {3337#true} is VALID [2020-07-10 15:28:39,185 INFO L263 TraceCheckUtils]: 0: Hoare triple {3337#true} call ULTIMATE.init(); {3343#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:39,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {3343#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {3337#true} is VALID [2020-07-10 15:28:39,186 INFO L280 TraceCheckUtils]: 2: Hoare triple {3337#true} assume true; {3337#true} is VALID [2020-07-10 15:28:39,186 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3337#true} {3337#true} #223#return; {3337#true} is VALID [2020-07-10 15:28:39,186 INFO L263 TraceCheckUtils]: 4: Hoare triple {3337#true} call #t~ret7 := main(); {3337#true} is VALID [2020-07-10 15:28:39,187 INFO L280 TraceCheckUtils]: 5: Hoare triple {3337#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {3337#true} is VALID [2020-07-10 15:28:39,187 INFO L280 TraceCheckUtils]: 6: Hoare triple {3337#true} assume !!(~main__urilen~0 <= 1000000); {3337#true} is VALID [2020-07-10 15:28:39,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {3337#true} assume !!(~main__urilen~0 >= -1000000); {3337#true} is VALID [2020-07-10 15:28:39,188 INFO L280 TraceCheckUtils]: 8: Hoare triple {3337#true} assume !!(~main__tokenlen~0 <= 1000000); {3337#true} is VALID [2020-07-10 15:28:39,188 INFO L280 TraceCheckUtils]: 9: Hoare triple {3337#true} assume !!(~main__tokenlen~0 >= -1000000); {3337#true} is VALID [2020-07-10 15:28:39,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {3337#true} assume !!(~main__scheme~0 <= 1000000); {3337#true} is VALID [2020-07-10 15:28:39,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {3337#true} assume !!(~main__scheme~0 >= -1000000); {3337#true} is VALID [2020-07-10 15:28:39,189 INFO L280 TraceCheckUtils]: 12: Hoare triple {3337#true} assume ~main__urilen~0 > 0; {3337#true} is VALID [2020-07-10 15:28:39,189 INFO L280 TraceCheckUtils]: 13: Hoare triple {3337#true} assume ~main__tokenlen~0 > 0; {3337#true} is VALID [2020-07-10 15:28:39,189 INFO L280 TraceCheckUtils]: 14: Hoare triple {3337#true} assume ~main__scheme~0 >= 0; {3337#true} is VALID [2020-07-10 15:28:39,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {3337#true} assume !(0 == ~main__scheme~0); {3337#true} is VALID [2020-07-10 15:28:39,190 INFO L280 TraceCheckUtils]: 16: Hoare triple {3337#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3337#true} is VALID [2020-07-10 15:28:39,190 INFO L280 TraceCheckUtils]: 17: Hoare triple {3337#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3337#true} is VALID [2020-07-10 15:28:39,191 INFO L280 TraceCheckUtils]: 18: Hoare triple {3337#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {3337#true} is VALID [2020-07-10 15:28:39,191 INFO L280 TraceCheckUtils]: 19: Hoare triple {3337#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3337#true} is VALID [2020-07-10 15:28:39,191 INFO L280 TraceCheckUtils]: 20: Hoare triple {3337#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3337#true} is VALID [2020-07-10 15:28:39,192 INFO L280 TraceCheckUtils]: 21: Hoare triple {3337#true} assume !(0 == ~__VERIFIER_assert__cond~3); {3337#true} is VALID [2020-07-10 15:28:39,196 INFO L280 TraceCheckUtils]: 22: Hoare triple {3337#true} assume !(~main__cp~0 != ~main__urilen~0 - 1); {3342#(= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:39,197 INFO L280 TraceCheckUtils]: 23: Hoare triple {3342#(= (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3342#(= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:39,198 INFO L280 TraceCheckUtils]: 24: Hoare triple {3342#(= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3342#(= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:39,198 INFO L280 TraceCheckUtils]: 25: Hoare triple {3342#(= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {3342#(= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:39,199 INFO L280 TraceCheckUtils]: 26: Hoare triple {3342#(= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3338#false} is VALID [2020-07-10 15:28:39,200 INFO L280 TraceCheckUtils]: 27: Hoare triple {3338#false} assume 0 == ~__VERIFIER_assert__cond~6; {3338#false} is VALID [2020-07-10 15:28:39,200 INFO L280 TraceCheckUtils]: 28: Hoare triple {3338#false} assume !false; {3338#false} is VALID [2020-07-10 15:28:39,202 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-10 15:28:39,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835895111] [2020-07-10 15:28:39,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:39,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:28:39,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570050309] [2020-07-10 15:28:39,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-10 15:28:39,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:39,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:28:39,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:39,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:28:39,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:39,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:28:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:28:39,250 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 4 states. [2020-07-10 15:28:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:39,588 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2020-07-10 15:28:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:28:39,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-10 15:28:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:39,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2020-07-10 15:28:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:28:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2020-07-10 15:28:39,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2020-07-10 15:28:39,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:39,740 INFO L225 Difference]: With dead ends: 115 [2020-07-10 15:28:39,741 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 15:28:39,742 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 15:28:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-07-10 15:28:39,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:39,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 75 states. [2020-07-10 15:28:39,795 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2020-07-10 15:28:39,795 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2020-07-10 15:28:39,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:39,798 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2020-07-10 15:28:39,798 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2020-07-10 15:28:39,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:39,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:39,799 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 75 states. [2020-07-10 15:28:39,799 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 75 states. [2020-07-10 15:28:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:39,801 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2020-07-10 15:28:39,802 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2020-07-10 15:28:39,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:39,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:39,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:39,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:39,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-10 15:28:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2020-07-10 15:28:39,805 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 29 [2020-07-10 15:28:39,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:39,805 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2020-07-10 15:28:39,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:28:39,806 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2020-07-10 15:28:39,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:28:39,806 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:39,807 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-10 15:28:39,807 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 15:28:39,807 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:39,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:39,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1640998784, now seen corresponding path program 1 times [2020-07-10 15:28:39,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:39,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421696840] [2020-07-10 15:28:39,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:39,940 INFO L280 TraceCheckUtils]: 0: Hoare triple {3719#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {3711#true} is VALID [2020-07-10 15:28:39,940 INFO L280 TraceCheckUtils]: 1: Hoare triple {3711#true} assume true; {3711#true} is VALID [2020-07-10 15:28:39,940 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3711#true} {3711#true} #223#return; {3711#true} is VALID [2020-07-10 15:28:39,942 INFO L263 TraceCheckUtils]: 0: Hoare triple {3711#true} call ULTIMATE.init(); {3719#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:39,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {3719#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {3711#true} is VALID [2020-07-10 15:28:39,943 INFO L280 TraceCheckUtils]: 2: Hoare triple {3711#true} assume true; {3711#true} is VALID [2020-07-10 15:28:39,943 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3711#true} {3711#true} #223#return; {3711#true} is VALID [2020-07-10 15:28:39,943 INFO L263 TraceCheckUtils]: 4: Hoare triple {3711#true} call #t~ret7 := main(); {3711#true} is VALID [2020-07-10 15:28:39,944 INFO L280 TraceCheckUtils]: 5: Hoare triple {3711#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {3711#true} is VALID [2020-07-10 15:28:39,944 INFO L280 TraceCheckUtils]: 6: Hoare triple {3711#true} assume !!(~main__urilen~0 <= 1000000); {3711#true} is VALID [2020-07-10 15:28:39,944 INFO L280 TraceCheckUtils]: 7: Hoare triple {3711#true} assume !!(~main__urilen~0 >= -1000000); {3711#true} is VALID [2020-07-10 15:28:39,944 INFO L280 TraceCheckUtils]: 8: Hoare triple {3711#true} assume !!(~main__tokenlen~0 <= 1000000); {3711#true} is VALID [2020-07-10 15:28:39,945 INFO L280 TraceCheckUtils]: 9: Hoare triple {3711#true} assume !!(~main__tokenlen~0 >= -1000000); {3711#true} is VALID [2020-07-10 15:28:39,945 INFO L280 TraceCheckUtils]: 10: Hoare triple {3711#true} assume !!(~main__scheme~0 <= 1000000); {3711#true} is VALID [2020-07-10 15:28:39,945 INFO L280 TraceCheckUtils]: 11: Hoare triple {3711#true} assume !!(~main__scheme~0 >= -1000000); {3711#true} is VALID [2020-07-10 15:28:39,945 INFO L280 TraceCheckUtils]: 12: Hoare triple {3711#true} assume ~main__urilen~0 > 0; {3711#true} is VALID [2020-07-10 15:28:39,945 INFO L280 TraceCheckUtils]: 13: Hoare triple {3711#true} assume ~main__tokenlen~0 > 0; {3711#true} is VALID [2020-07-10 15:28:39,946 INFO L280 TraceCheckUtils]: 14: Hoare triple {3711#true} assume ~main__scheme~0 >= 0; {3711#true} is VALID [2020-07-10 15:28:39,946 INFO L280 TraceCheckUtils]: 15: Hoare triple {3711#true} assume !(0 == ~main__scheme~0); {3711#true} is VALID [2020-07-10 15:28:39,947 INFO L280 TraceCheckUtils]: 16: Hoare triple {3711#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:39,947 INFO L280 TraceCheckUtils]: 17: Hoare triple {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:39,948 INFO L280 TraceCheckUtils]: 18: Hoare triple {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:39,948 INFO L280 TraceCheckUtils]: 19: Hoare triple {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:39,949 INFO L280 TraceCheckUtils]: 20: Hoare triple {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:39,949 INFO L280 TraceCheckUtils]: 21: Hoare triple {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:39,950 INFO L280 TraceCheckUtils]: 22: Hoare triple {3716#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {3717#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= (+ main_~main__cp~0 1) main_~main__urilen~0)))} is VALID [2020-07-10 15:28:39,953 INFO L280 TraceCheckUtils]: 23: Hoare triple {3717#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= (+ main_~main__cp~0 1) main_~main__urilen~0)))} assume !(0 == ~main____CPAchecker_TMP_1~0); {3717#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= (+ main_~main__cp~0 1) main_~main__urilen~0)))} is VALID [2020-07-10 15:28:39,957 INFO L280 TraceCheckUtils]: 24: Hoare triple {3717#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= (+ main_~main__cp~0 1) main_~main__urilen~0)))} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {3717#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= (+ main_~main__cp~0 1) main_~main__urilen~0)))} is VALID [2020-07-10 15:28:39,959 INFO L280 TraceCheckUtils]: 25: Hoare triple {3717#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= (+ main_~main__cp~0 1) main_~main__urilen~0)))} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {3717#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= (+ main_~main__cp~0 1) main_~main__urilen~0)))} is VALID [2020-07-10 15:28:39,959 INFO L280 TraceCheckUtils]: 26: Hoare triple {3717#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= (+ main_~main__cp~0 1) main_~main__urilen~0)))} assume !(0 == ~__VERIFIER_assert__cond~5); {3717#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= (+ main_~main__cp~0 1) main_~main__urilen~0)))} is VALID [2020-07-10 15:28:39,961 INFO L280 TraceCheckUtils]: 27: Hoare triple {3717#(and (<= (+ main_~main__cp~0 1) main_~main__urilen~0) (not (= (+ main_~main__cp~0 1) main_~main__urilen~0)))} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {3718#(not (= 0 main_~__VERIFIER_assert__cond~6))} is VALID [2020-07-10 15:28:39,961 INFO L280 TraceCheckUtils]: 28: Hoare triple {3718#(not (= 0 main_~__VERIFIER_assert__cond~6))} assume 0 == ~__VERIFIER_assert__cond~6; {3712#false} is VALID [2020-07-10 15:28:39,962 INFO L280 TraceCheckUtils]: 29: Hoare triple {3712#false} assume !false; {3712#false} is VALID [2020-07-10 15:28:39,963 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-10 15:28:39,963 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421696840] [2020-07-10 15:28:39,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:39,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:39,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280352014] [2020-07-10 15:28:39,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 15:28:39,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:39,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:40,003 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-10 15:28:40,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:40,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:40,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:40,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:40,005 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 6 states. [2020-07-10 15:28:40,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:40,531 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2020-07-10 15:28:40,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:40,532 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 15:28:40,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:40,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-10 15:28:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 73 transitions. [2020-07-10 15:28:40,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 73 transitions. [2020-07-10 15:28:40,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:40,656 INFO L225 Difference]: With dead ends: 76 [2020-07-10 15:28:40,656 INFO L226 Difference]: Without dead ends: 74 [2020-07-10 15:28:40,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:28:40,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-10 15:28:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2020-07-10 15:28:40,723 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:40,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 73 states. [2020-07-10 15:28:40,723 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 73 states. [2020-07-10 15:28:40,723 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 73 states. [2020-07-10 15:28:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:40,726 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-10 15:28:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 15:28:40,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:40,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:40,726 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 74 states. [2020-07-10 15:28:40,726 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 74 states. [2020-07-10 15:28:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:40,728 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2020-07-10 15:28:40,728 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2020-07-10 15:28:40,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:40,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:40,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:40,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-10 15:28:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2020-07-10 15:28:40,731 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 30 [2020-07-10 15:28:40,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:40,731 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2020-07-10 15:28:40,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2020-07-10 15:28:40,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:28:40,732 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:40,732 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:40,733 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 15:28:40,733 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:40,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:40,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1892106755, now seen corresponding path program 1 times [2020-07-10 15:28:40,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:40,734 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477399394] [2020-07-10 15:28:40,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:40,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:40,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {4056#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {4048#true} is VALID [2020-07-10 15:28:40,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {4048#true} assume true; {4048#true} is VALID [2020-07-10 15:28:40,864 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4048#true} {4048#true} #223#return; {4048#true} is VALID [2020-07-10 15:28:40,865 INFO L263 TraceCheckUtils]: 0: Hoare triple {4048#true} call ULTIMATE.init(); {4056#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:40,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {4056#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {4048#true} is VALID [2020-07-10 15:28:40,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {4048#true} assume true; {4048#true} is VALID [2020-07-10 15:28:40,865 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} #223#return; {4048#true} is VALID [2020-07-10 15:28:40,866 INFO L263 TraceCheckUtils]: 4: Hoare triple {4048#true} call #t~ret7 := main(); {4048#true} is VALID [2020-07-10 15:28:40,866 INFO L280 TraceCheckUtils]: 5: Hoare triple {4048#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {4048#true} is VALID [2020-07-10 15:28:40,866 INFO L280 TraceCheckUtils]: 6: Hoare triple {4048#true} assume !!(~main__urilen~0 <= 1000000); {4048#true} is VALID [2020-07-10 15:28:40,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {4048#true} assume !!(~main__urilen~0 >= -1000000); {4048#true} is VALID [2020-07-10 15:28:40,867 INFO L280 TraceCheckUtils]: 8: Hoare triple {4048#true} assume !!(~main__tokenlen~0 <= 1000000); {4048#true} is VALID [2020-07-10 15:28:40,867 INFO L280 TraceCheckUtils]: 9: Hoare triple {4048#true} assume !!(~main__tokenlen~0 >= -1000000); {4048#true} is VALID [2020-07-10 15:28:40,867 INFO L280 TraceCheckUtils]: 10: Hoare triple {4048#true} assume !!(~main__scheme~0 <= 1000000); {4048#true} is VALID [2020-07-10 15:28:40,867 INFO L280 TraceCheckUtils]: 11: Hoare triple {4048#true} assume !!(~main__scheme~0 >= -1000000); {4048#true} is VALID [2020-07-10 15:28:40,868 INFO L280 TraceCheckUtils]: 12: Hoare triple {4048#true} assume ~main__urilen~0 > 0; {4048#true} is VALID [2020-07-10 15:28:40,868 INFO L280 TraceCheckUtils]: 13: Hoare triple {4048#true} assume ~main__tokenlen~0 > 0; {4048#true} is VALID [2020-07-10 15:28:40,868 INFO L280 TraceCheckUtils]: 14: Hoare triple {4048#true} assume ~main__scheme~0 >= 0; {4048#true} is VALID [2020-07-10 15:28:40,868 INFO L280 TraceCheckUtils]: 15: Hoare triple {4048#true} assume !(0 == ~main__scheme~0); {4048#true} is VALID [2020-07-10 15:28:40,869 INFO L280 TraceCheckUtils]: 16: Hoare triple {4048#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,870 INFO L280 TraceCheckUtils]: 17: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,871 INFO L280 TraceCheckUtils]: 18: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,871 INFO L280 TraceCheckUtils]: 19: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,872 INFO L280 TraceCheckUtils]: 20: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,875 INFO L280 TraceCheckUtils]: 21: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,876 INFO L280 TraceCheckUtils]: 22: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,877 INFO L280 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,878 INFO L280 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,879 INFO L280 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,879 INFO L280 TraceCheckUtils]: 26: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:40,880 INFO L280 TraceCheckUtils]: 27: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4055#(not (= main_~__VERIFIER_assert__cond~16 0))} is VALID [2020-07-10 15:28:40,882 INFO L280 TraceCheckUtils]: 28: Hoare triple {4055#(not (= main_~__VERIFIER_assert__cond~16 0))} assume 0 == ~__VERIFIER_assert__cond~16; {4049#false} is VALID [2020-07-10 15:28:40,882 INFO L280 TraceCheckUtils]: 29: Hoare triple {4049#false} assume !false; {4049#false} is VALID [2020-07-10 15:28:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:28:40,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477399394] [2020-07-10 15:28:40,884 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672971245] [2020-07-10 15:28:40,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:40,983 INFO L264 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:28:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:41,006 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:41,231 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:41,252 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:41,292 INFO L263 TraceCheckUtils]: 0: Hoare triple {4048#true} call ULTIMATE.init(); {4048#true} is VALID [2020-07-10 15:28:41,293 INFO L280 TraceCheckUtils]: 1: Hoare triple {4048#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4048#true} is VALID [2020-07-10 15:28:41,293 INFO L280 TraceCheckUtils]: 2: Hoare triple {4048#true} assume true; {4048#true} is VALID [2020-07-10 15:28:41,293 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4048#true} {4048#true} #223#return; {4048#true} is VALID [2020-07-10 15:28:41,294 INFO L263 TraceCheckUtils]: 4: Hoare triple {4048#true} call #t~ret7 := main(); {4048#true} is VALID [2020-07-10 15:28:41,294 INFO L280 TraceCheckUtils]: 5: Hoare triple {4048#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {4048#true} is VALID [2020-07-10 15:28:41,294 INFO L280 TraceCheckUtils]: 6: Hoare triple {4048#true} assume !!(~main__urilen~0 <= 1000000); {4048#true} is VALID [2020-07-10 15:28:41,294 INFO L280 TraceCheckUtils]: 7: Hoare triple {4048#true} assume !!(~main__urilen~0 >= -1000000); {4048#true} is VALID [2020-07-10 15:28:41,295 INFO L280 TraceCheckUtils]: 8: Hoare triple {4048#true} assume !!(~main__tokenlen~0 <= 1000000); {4048#true} is VALID [2020-07-10 15:28:41,295 INFO L280 TraceCheckUtils]: 9: Hoare triple {4048#true} assume !!(~main__tokenlen~0 >= -1000000); {4048#true} is VALID [2020-07-10 15:28:41,295 INFO L280 TraceCheckUtils]: 10: Hoare triple {4048#true} assume !!(~main__scheme~0 <= 1000000); {4048#true} is VALID [2020-07-10 15:28:41,296 INFO L280 TraceCheckUtils]: 11: Hoare triple {4048#true} assume !!(~main__scheme~0 >= -1000000); {4048#true} is VALID [2020-07-10 15:28:41,296 INFO L280 TraceCheckUtils]: 12: Hoare triple {4048#true} assume ~main__urilen~0 > 0; {4048#true} is VALID [2020-07-10 15:28:41,296 INFO L280 TraceCheckUtils]: 13: Hoare triple {4048#true} assume ~main__tokenlen~0 > 0; {4048#true} is VALID [2020-07-10 15:28:41,296 INFO L280 TraceCheckUtils]: 14: Hoare triple {4048#true} assume ~main__scheme~0 >= 0; {4048#true} is VALID [2020-07-10 15:28:41,297 INFO L280 TraceCheckUtils]: 15: Hoare triple {4048#true} assume !(0 == ~main__scheme~0); {4048#true} is VALID [2020-07-10 15:28:41,298 INFO L280 TraceCheckUtils]: 16: Hoare triple {4048#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,300 INFO L280 TraceCheckUtils]: 17: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,301 INFO L280 TraceCheckUtils]: 18: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,302 INFO L280 TraceCheckUtils]: 19: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,303 INFO L280 TraceCheckUtils]: 20: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,304 INFO L280 TraceCheckUtils]: 21: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,306 INFO L280 TraceCheckUtils]: 22: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,307 INFO L280 TraceCheckUtils]: 23: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,309 INFO L280 TraceCheckUtils]: 24: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,311 INFO L280 TraceCheckUtils]: 25: Hoare triple {4054#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,312 INFO L280 TraceCheckUtils]: 26: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:41,313 INFO L280 TraceCheckUtils]: 27: Hoare triple {4053#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} is VALID [2020-07-10 15:28:41,315 INFO L280 TraceCheckUtils]: 28: Hoare triple {4141#(<= 1 main_~__VERIFIER_assert__cond~16)} assume 0 == ~__VERIFIER_assert__cond~16; {4049#false} is VALID [2020-07-10 15:28:41,315 INFO L280 TraceCheckUtils]: 29: Hoare triple {4049#false} assume !false; {4049#false} is VALID [2020-07-10 15:28:41,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:28:41,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:41,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-10 15:28:41,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736944499] [2020-07-10 15:28:41,319 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-07-10 15:28:41,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:41,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:41,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:41,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:41,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:41,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:41,361 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 7 states. [2020-07-10 15:28:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:42,130 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2020-07-10 15:28:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:42,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2020-07-10 15:28:42,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-10 15:28:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:42,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2020-07-10 15:28:42,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2020-07-10 15:28:42,337 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:42,339 INFO L225 Difference]: With dead ends: 111 [2020-07-10 15:28:42,339 INFO L226 Difference]: Without dead ends: 109 [2020-07-10 15:28:42,340 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:28:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-07-10 15:28:42,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 70. [2020-07-10 15:28:42,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:42,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 70 states. [2020-07-10 15:28:42,410 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 70 states. [2020-07-10 15:28:42,411 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 70 states. [2020-07-10 15:28:42,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:42,413 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-07-10 15:28:42,413 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2020-07-10 15:28:42,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:42,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:42,414 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 109 states. [2020-07-10 15:28:42,414 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 109 states. [2020-07-10 15:28:42,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:42,417 INFO L93 Difference]: Finished difference Result 109 states and 113 transitions. [2020-07-10 15:28:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 113 transitions. [2020-07-10 15:28:42,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:42,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:42,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:42,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-10 15:28:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-07-10 15:28:42,420 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 30 [2020-07-10 15:28:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:42,420 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-07-10 15:28:42,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-07-10 15:28:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:28:42,422 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:42,422 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, 1] [2020-07-10 15:28:42,622 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-10 15:28:42,623 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash 668648404, now seen corresponding path program 1 times [2020-07-10 15:28:42,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:42,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370661397] [2020-07-10 15:28:42,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:42,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {4586#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {4578#true} is VALID [2020-07-10 15:28:42,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {4578#true} assume true; {4578#true} is VALID [2020-07-10 15:28:42,712 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4578#true} {4578#true} #223#return; {4578#true} is VALID [2020-07-10 15:28:42,713 INFO L263 TraceCheckUtils]: 0: Hoare triple {4578#true} call ULTIMATE.init(); {4586#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:42,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {4586#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {4578#true} is VALID [2020-07-10 15:28:42,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {4578#true} assume true; {4578#true} is VALID [2020-07-10 15:28:42,713 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4578#true} {4578#true} #223#return; {4578#true} is VALID [2020-07-10 15:28:42,713 INFO L263 TraceCheckUtils]: 4: Hoare triple {4578#true} call #t~ret7 := main(); {4578#true} is VALID [2020-07-10 15:28:42,714 INFO L280 TraceCheckUtils]: 5: Hoare triple {4578#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {4578#true} is VALID [2020-07-10 15:28:42,714 INFO L280 TraceCheckUtils]: 6: Hoare triple {4578#true} assume !!(~main__urilen~0 <= 1000000); {4578#true} is VALID [2020-07-10 15:28:42,714 INFO L280 TraceCheckUtils]: 7: Hoare triple {4578#true} assume !!(~main__urilen~0 >= -1000000); {4578#true} is VALID [2020-07-10 15:28:42,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {4578#true} assume !!(~main__tokenlen~0 <= 1000000); {4578#true} is VALID [2020-07-10 15:28:42,715 INFO L280 TraceCheckUtils]: 9: Hoare triple {4578#true} assume !!(~main__tokenlen~0 >= -1000000); {4578#true} is VALID [2020-07-10 15:28:42,715 INFO L280 TraceCheckUtils]: 10: Hoare triple {4578#true} assume !!(~main__scheme~0 <= 1000000); {4578#true} is VALID [2020-07-10 15:28:42,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {4578#true} assume !!(~main__scheme~0 >= -1000000); {4578#true} is VALID [2020-07-10 15:28:42,715 INFO L280 TraceCheckUtils]: 12: Hoare triple {4578#true} assume ~main__urilen~0 > 0; {4578#true} is VALID [2020-07-10 15:28:42,715 INFO L280 TraceCheckUtils]: 13: Hoare triple {4578#true} assume ~main__tokenlen~0 > 0; {4578#true} is VALID [2020-07-10 15:28:42,716 INFO L280 TraceCheckUtils]: 14: Hoare triple {4578#true} assume ~main__scheme~0 >= 0; {4583#(<= 0 main_~main__scheme~0)} is VALID [2020-07-10 15:28:42,717 INFO L280 TraceCheckUtils]: 15: Hoare triple {4583#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {4583#(<= 0 main_~main__scheme~0)} is VALID [2020-07-10 15:28:42,718 INFO L280 TraceCheckUtils]: 16: Hoare triple {4583#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,719 INFO L280 TraceCheckUtils]: 17: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,720 INFO L280 TraceCheckUtils]: 18: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,721 INFO L280 TraceCheckUtils]: 19: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,721 INFO L280 TraceCheckUtils]: 20: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,722 INFO L280 TraceCheckUtils]: 21: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,722 INFO L280 TraceCheckUtils]: 22: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,723 INFO L280 TraceCheckUtils]: 23: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,724 INFO L280 TraceCheckUtils]: 24: Hoare triple {4584#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,725 INFO L280 TraceCheckUtils]: 25: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,725 INFO L280 TraceCheckUtils]: 26: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,726 INFO L280 TraceCheckUtils]: 27: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {4584#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:42,727 INFO L280 TraceCheckUtils]: 28: Hoare triple {4584#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {4585#(not (= 0 main_~__VERIFIER_assert__cond~7))} is VALID [2020-07-10 15:28:42,728 INFO L280 TraceCheckUtils]: 29: Hoare triple {4585#(not (= 0 main_~__VERIFIER_assert__cond~7))} assume 0 == ~__VERIFIER_assert__cond~7; {4579#false} is VALID [2020-07-10 15:28:42,728 INFO L280 TraceCheckUtils]: 30: Hoare triple {4579#false} assume !false; {4579#false} is VALID [2020-07-10 15:28:42,730 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-10 15:28:42,730 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370661397] [2020-07-10 15:28:42,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:42,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:42,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808682333] [2020-07-10 15:28:42,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-10 15:28:42,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:42,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:42,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:42,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:42,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:42,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:42,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:42,768 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 6 states. [2020-07-10 15:28:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:43,240 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-10 15:28:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:43,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-10 15:28:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:43,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2020-07-10 15:28:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2020-07-10 15:28:43,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2020-07-10 15:28:43,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:43,354 INFO L225 Difference]: With dead ends: 70 [2020-07-10 15:28:43,354 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 15:28:43,355 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:43,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 15:28:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2020-07-10 15:28:43,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:43,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2020-07-10 15:28:43,423 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-10 15:28:43,423 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-10 15:28:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:43,425 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-07-10 15:28:43,425 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-07-10 15:28:43,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:43,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:43,426 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2020-07-10 15:28:43,426 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2020-07-10 15:28:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:43,428 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-07-10 15:28:43,428 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-07-10 15:28:43,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:43,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:43,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:43,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-10 15:28:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2020-07-10 15:28:43,431 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 31 [2020-07-10 15:28:43,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:43,431 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2020-07-10 15:28:43,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:43,431 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-07-10 15:28:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:28:43,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:43,432 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] [2020-07-10 15:28:43,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 15:28:43,432 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:43,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:43,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1470784207, now seen corresponding path program 1 times [2020-07-10 15:28:43,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:43,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001743872] [2020-07-10 15:28:43,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:43,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {4897#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {4889#true} is VALID [2020-07-10 15:28:43,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {4889#true} assume true; {4889#true} is VALID [2020-07-10 15:28:43,602 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {4889#true} {4889#true} #223#return; {4889#true} is VALID [2020-07-10 15:28:43,604 INFO L263 TraceCheckUtils]: 0: Hoare triple {4889#true} call ULTIMATE.init(); {4897#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:43,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {4897#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {4889#true} is VALID [2020-07-10 15:28:43,604 INFO L280 TraceCheckUtils]: 2: Hoare triple {4889#true} assume true; {4889#true} is VALID [2020-07-10 15:28:43,605 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4889#true} {4889#true} #223#return; {4889#true} is VALID [2020-07-10 15:28:43,605 INFO L263 TraceCheckUtils]: 4: Hoare triple {4889#true} call #t~ret7 := main(); {4889#true} is VALID [2020-07-10 15:28:43,608 INFO L280 TraceCheckUtils]: 5: Hoare triple {4889#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {4889#true} is VALID [2020-07-10 15:28:43,609 INFO L280 TraceCheckUtils]: 6: Hoare triple {4889#true} assume !!(~main__urilen~0 <= 1000000); {4889#true} is VALID [2020-07-10 15:28:43,609 INFO L280 TraceCheckUtils]: 7: Hoare triple {4889#true} assume !!(~main__urilen~0 >= -1000000); {4889#true} is VALID [2020-07-10 15:28:43,609 INFO L280 TraceCheckUtils]: 8: Hoare triple {4889#true} assume !!(~main__tokenlen~0 <= 1000000); {4889#true} is VALID [2020-07-10 15:28:43,609 INFO L280 TraceCheckUtils]: 9: Hoare triple {4889#true} assume !!(~main__tokenlen~0 >= -1000000); {4889#true} is VALID [2020-07-10 15:28:43,609 INFO L280 TraceCheckUtils]: 10: Hoare triple {4889#true} assume !!(~main__scheme~0 <= 1000000); {4889#true} is VALID [2020-07-10 15:28:43,610 INFO L280 TraceCheckUtils]: 11: Hoare triple {4889#true} assume !!(~main__scheme~0 >= -1000000); {4889#true} is VALID [2020-07-10 15:28:43,610 INFO L280 TraceCheckUtils]: 12: Hoare triple {4889#true} assume ~main__urilen~0 > 0; {4889#true} is VALID [2020-07-10 15:28:43,610 INFO L280 TraceCheckUtils]: 13: Hoare triple {4889#true} assume ~main__tokenlen~0 > 0; {4889#true} is VALID [2020-07-10 15:28:43,610 INFO L280 TraceCheckUtils]: 14: Hoare triple {4889#true} assume ~main__scheme~0 >= 0; {4889#true} is VALID [2020-07-10 15:28:43,610 INFO L280 TraceCheckUtils]: 15: Hoare triple {4889#true} assume !(0 == ~main__scheme~0); {4889#true} is VALID [2020-07-10 15:28:43,617 INFO L280 TraceCheckUtils]: 16: Hoare triple {4889#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,618 INFO L280 TraceCheckUtils]: 17: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,620 INFO L280 TraceCheckUtils]: 18: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,623 INFO L280 TraceCheckUtils]: 19: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,626 INFO L280 TraceCheckUtils]: 20: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,627 INFO L280 TraceCheckUtils]: 21: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,628 INFO L280 TraceCheckUtils]: 22: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,629 INFO L280 TraceCheckUtils]: 23: Hoare triple {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,630 INFO L280 TraceCheckUtils]: 24: Hoare triple {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,632 INFO L280 TraceCheckUtils]: 25: Hoare triple {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,632 INFO L280 TraceCheckUtils]: 26: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,633 INFO L280 TraceCheckUtils]: 27: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,634 INFO L280 TraceCheckUtils]: 28: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4896#(not (= 0 main_~__VERIFIER_assert__cond~4))} is VALID [2020-07-10 15:28:43,635 INFO L280 TraceCheckUtils]: 29: Hoare triple {4896#(not (= 0 main_~__VERIFIER_assert__cond~4))} assume 0 == ~__VERIFIER_assert__cond~4; {4890#false} is VALID [2020-07-10 15:28:43,635 INFO L280 TraceCheckUtils]: 30: Hoare triple {4890#false} assume !false; {4890#false} is VALID [2020-07-10 15:28:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:28:43,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001743872] [2020-07-10 15:28:43,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633304252] [2020-07-10 15:28:43,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:43,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 15:28:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:43,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:43,834 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:43,851 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:43,879 INFO L263 TraceCheckUtils]: 0: Hoare triple {4889#true} call ULTIMATE.init(); {4889#true} is VALID [2020-07-10 15:28:43,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {4889#true} ~__return_main~0 := 0;~__return_375~0 := 0; {4889#true} is VALID [2020-07-10 15:28:43,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {4889#true} assume true; {4889#true} is VALID [2020-07-10 15:28:43,881 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {4889#true} {4889#true} #223#return; {4889#true} is VALID [2020-07-10 15:28:43,881 INFO L263 TraceCheckUtils]: 4: Hoare triple {4889#true} call #t~ret7 := main(); {4889#true} is VALID [2020-07-10 15:28:43,881 INFO L280 TraceCheckUtils]: 5: Hoare triple {4889#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {4889#true} is VALID [2020-07-10 15:28:43,882 INFO L280 TraceCheckUtils]: 6: Hoare triple {4889#true} assume !!(~main__urilen~0 <= 1000000); {4889#true} is VALID [2020-07-10 15:28:43,882 INFO L280 TraceCheckUtils]: 7: Hoare triple {4889#true} assume !!(~main__urilen~0 >= -1000000); {4889#true} is VALID [2020-07-10 15:28:43,882 INFO L280 TraceCheckUtils]: 8: Hoare triple {4889#true} assume !!(~main__tokenlen~0 <= 1000000); {4889#true} is VALID [2020-07-10 15:28:43,882 INFO L280 TraceCheckUtils]: 9: Hoare triple {4889#true} assume !!(~main__tokenlen~0 >= -1000000); {4889#true} is VALID [2020-07-10 15:28:43,883 INFO L280 TraceCheckUtils]: 10: Hoare triple {4889#true} assume !!(~main__scheme~0 <= 1000000); {4889#true} is VALID [2020-07-10 15:28:43,883 INFO L280 TraceCheckUtils]: 11: Hoare triple {4889#true} assume !!(~main__scheme~0 >= -1000000); {4889#true} is VALID [2020-07-10 15:28:43,883 INFO L280 TraceCheckUtils]: 12: Hoare triple {4889#true} assume ~main__urilen~0 > 0; {4889#true} is VALID [2020-07-10 15:28:43,883 INFO L280 TraceCheckUtils]: 13: Hoare triple {4889#true} assume ~main__tokenlen~0 > 0; {4889#true} is VALID [2020-07-10 15:28:43,884 INFO L280 TraceCheckUtils]: 14: Hoare triple {4889#true} assume ~main__scheme~0 >= 0; {4889#true} is VALID [2020-07-10 15:28:43,884 INFO L280 TraceCheckUtils]: 15: Hoare triple {4889#true} assume !(0 == ~main__scheme~0); {4889#true} is VALID [2020-07-10 15:28:43,886 INFO L280 TraceCheckUtils]: 16: Hoare triple {4889#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,887 INFO L280 TraceCheckUtils]: 17: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,888 INFO L280 TraceCheckUtils]: 18: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,888 INFO L280 TraceCheckUtils]: 19: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,889 INFO L280 TraceCheckUtils]: 20: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,889 INFO L280 TraceCheckUtils]: 21: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,890 INFO L280 TraceCheckUtils]: 22: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,891 INFO L280 TraceCheckUtils]: 23: Hoare triple {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_1~0);havoc ~__tmp_17~0;~__tmp_17~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~16;~__VERIFIER_assert__cond~16 := ~__tmp_17~0; {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,892 INFO L280 TraceCheckUtils]: 24: Hoare triple {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~16);havoc ~__tmp_18~0;~__tmp_18~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~17;~__VERIFIER_assert__cond~17 := ~__tmp_18~0; {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,893 INFO L280 TraceCheckUtils]: 25: Hoare triple {4895#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~17);~main__cp~0 := 1 + ~main__cp~0; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,893 INFO L280 TraceCheckUtils]: 26: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,894 INFO L280 TraceCheckUtils]: 27: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:43,894 INFO L280 TraceCheckUtils]: 28: Hoare triple {4894#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {4985#(<= 1 main_~__VERIFIER_assert__cond~4)} is VALID [2020-07-10 15:28:43,895 INFO L280 TraceCheckUtils]: 29: Hoare triple {4985#(<= 1 main_~__VERIFIER_assert__cond~4)} assume 0 == ~__VERIFIER_assert__cond~4; {4890#false} is VALID [2020-07-10 15:28:43,895 INFO L280 TraceCheckUtils]: 30: Hoare triple {4890#false} assume !false; {4890#false} is VALID [2020-07-10 15:28:43,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:28:43,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:43,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-10 15:28:43,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544082793] [2020-07-10 15:28:43,898 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-10 15:28:43,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:43,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:43,948 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-10 15:28:43,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:43,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:43,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:43,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:43,950 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 7 states. [2020-07-10 15:28:44,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:44,461 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-07-10 15:28:44,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:44,461 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2020-07-10 15:28:44,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-10 15:28:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2020-07-10 15:28:44,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 67 transitions. [2020-07-10 15:28:44,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:44,575 INFO L225 Difference]: With dead ends: 69 [2020-07-10 15:28:44,575 INFO L226 Difference]: Without dead ends: 67 [2020-07-10 15:28:44,576 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:28:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-07-10 15:28:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2020-07-10 15:28:44,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:44,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 62 states. [2020-07-10 15:28:44,630 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 62 states. [2020-07-10 15:28:44,630 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 62 states. [2020-07-10 15:28:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:44,632 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-07-10 15:28:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2020-07-10 15:28:44,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:44,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:44,633 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 67 states. [2020-07-10 15:28:44,633 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 67 states. [2020-07-10 15:28:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:44,636 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2020-07-10 15:28:44,636 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2020-07-10 15:28:44,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:44,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:44,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:44,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-10 15:28:44,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2020-07-10 15:28:44,640 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 31 [2020-07-10 15:28:44,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:44,641 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2020-07-10 15:28:44,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2020-07-10 15:28:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:28:44,642 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:44,642 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, 1, 1, 1, 1] [2020-07-10 15:28:44,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2020-07-10 15:28:44,857 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:44,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash -350608983, now seen corresponding path program 1 times [2020-07-10 15:28:44,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:44,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677960006] [2020-07-10 15:28:44,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:44,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:45,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {5291#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {5283#true} is VALID [2020-07-10 15:28:45,016 INFO L280 TraceCheckUtils]: 1: Hoare triple {5283#true} assume true; {5283#true} is VALID [2020-07-10 15:28:45,017 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5283#true} {5283#true} #223#return; {5283#true} is VALID [2020-07-10 15:28:45,018 INFO L263 TraceCheckUtils]: 0: Hoare triple {5283#true} call ULTIMATE.init(); {5291#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:45,018 INFO L280 TraceCheckUtils]: 1: Hoare triple {5291#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {5283#true} is VALID [2020-07-10 15:28:45,019 INFO L280 TraceCheckUtils]: 2: Hoare triple {5283#true} assume true; {5283#true} is VALID [2020-07-10 15:28:45,019 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5283#true} {5283#true} #223#return; {5283#true} is VALID [2020-07-10 15:28:45,019 INFO L263 TraceCheckUtils]: 4: Hoare triple {5283#true} call #t~ret7 := main(); {5283#true} is VALID [2020-07-10 15:28:45,019 INFO L280 TraceCheckUtils]: 5: Hoare triple {5283#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {5283#true} is VALID [2020-07-10 15:28:45,020 INFO L280 TraceCheckUtils]: 6: Hoare triple {5283#true} assume !!(~main__urilen~0 <= 1000000); {5283#true} is VALID [2020-07-10 15:28:45,020 INFO L280 TraceCheckUtils]: 7: Hoare triple {5283#true} assume !!(~main__urilen~0 >= -1000000); {5283#true} is VALID [2020-07-10 15:28:45,020 INFO L280 TraceCheckUtils]: 8: Hoare triple {5283#true} assume !!(~main__tokenlen~0 <= 1000000); {5283#true} is VALID [2020-07-10 15:28:45,020 INFO L280 TraceCheckUtils]: 9: Hoare triple {5283#true} assume !!(~main__tokenlen~0 >= -1000000); {5283#true} is VALID [2020-07-10 15:28:45,020 INFO L280 TraceCheckUtils]: 10: Hoare triple {5283#true} assume !!(~main__scheme~0 <= 1000000); {5283#true} is VALID [2020-07-10 15:28:45,021 INFO L280 TraceCheckUtils]: 11: Hoare triple {5283#true} assume !!(~main__scheme~0 >= -1000000); {5283#true} is VALID [2020-07-10 15:28:45,021 INFO L280 TraceCheckUtils]: 12: Hoare triple {5283#true} assume ~main__urilen~0 > 0; {5283#true} is VALID [2020-07-10 15:28:45,021 INFO L280 TraceCheckUtils]: 13: Hoare triple {5283#true} assume ~main__tokenlen~0 > 0; {5283#true} is VALID [2020-07-10 15:28:45,021 INFO L280 TraceCheckUtils]: 14: Hoare triple {5283#true} assume ~main__scheme~0 >= 0; {5283#true} is VALID [2020-07-10 15:28:45,021 INFO L280 TraceCheckUtils]: 15: Hoare triple {5283#true} assume !(0 == ~main__scheme~0); {5283#true} is VALID [2020-07-10 15:28:45,023 INFO L280 TraceCheckUtils]: 16: Hoare triple {5283#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,023 INFO L280 TraceCheckUtils]: 17: Hoare triple {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,024 INFO L280 TraceCheckUtils]: 18: Hoare triple {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,024 INFO L280 TraceCheckUtils]: 19: Hoare triple {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,025 INFO L280 TraceCheckUtils]: 20: Hoare triple {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,026 INFO L280 TraceCheckUtils]: 21: Hoare triple {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,027 INFO L280 TraceCheckUtils]: 22: Hoare triple {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,029 INFO L280 TraceCheckUtils]: 23: Hoare triple {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,029 INFO L280 TraceCheckUtils]: 24: Hoare triple {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,030 INFO L280 TraceCheckUtils]: 25: Hoare triple {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,030 INFO L280 TraceCheckUtils]: 26: Hoare triple {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,031 INFO L280 TraceCheckUtils]: 27: Hoare triple {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,032 INFO L280 TraceCheckUtils]: 28: Hoare triple {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,033 INFO L280 TraceCheckUtils]: 29: Hoare triple {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,034 INFO L280 TraceCheckUtils]: 30: Hoare triple {5289#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:45,035 INFO L280 TraceCheckUtils]: 31: Hoare triple {5288#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5290#(not (= 0 main_~__VERIFIER_assert__cond~8))} is VALID [2020-07-10 15:28:45,036 INFO L280 TraceCheckUtils]: 32: Hoare triple {5290#(not (= 0 main_~__VERIFIER_assert__cond~8))} assume 0 == ~__VERIFIER_assert__cond~8; {5284#false} is VALID [2020-07-10 15:28:45,036 INFO L280 TraceCheckUtils]: 33: Hoare triple {5284#false} assume !false; {5284#false} is VALID [2020-07-10 15:28:45,038 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-10 15:28:45,038 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677960006] [2020-07-10 15:28:45,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:45,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:45,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127856911] [2020-07-10 15:28:45,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-10 15:28:45,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:45,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:45,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:45,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:45,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:45,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:45,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:45,079 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 6 states. [2020-07-10 15:28:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:45,538 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2020-07-10 15:28:45,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:45,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-10 15:28:45,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-10 15:28:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2020-07-10 15:28:45,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2020-07-10 15:28:45,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:45,646 INFO L225 Difference]: With dead ends: 63 [2020-07-10 15:28:45,647 INFO L226 Difference]: Without dead ends: 61 [2020-07-10 15:28:45,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:28:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-10 15:28:45,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2020-07-10 15:28:45,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:45,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 60 states. [2020-07-10 15:28:45,689 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 60 states. [2020-07-10 15:28:45,689 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 60 states. [2020-07-10 15:28:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:45,691 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-10 15:28:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-10 15:28:45,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:45,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:45,692 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 61 states. [2020-07-10 15:28:45,692 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 61 states. [2020-07-10 15:28:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:45,697 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-10 15:28:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-10 15:28:45,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:45,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:45,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:45,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-07-10 15:28:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2020-07-10 15:28:45,700 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 34 [2020-07-10 15:28:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:45,700 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2020-07-10 15:28:45,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2020-07-10 15:28:45,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 15:28:45,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:45,703 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, 1, 1, 1, 1, 1] [2020-07-10 15:28:45,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-10 15:28:45,708 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2016026591, now seen corresponding path program 1 times [2020-07-10 15:28:45,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:45,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54103948] [2020-07-10 15:28:45,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:45,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {5573#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {5564#true} is VALID [2020-07-10 15:28:45,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {5564#true} assume true; {5564#true} is VALID [2020-07-10 15:28:45,840 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5564#true} {5564#true} #223#return; {5564#true} is VALID [2020-07-10 15:28:45,841 INFO L263 TraceCheckUtils]: 0: Hoare triple {5564#true} call ULTIMATE.init(); {5573#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:45,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {5573#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {5564#true} is VALID [2020-07-10 15:28:45,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {5564#true} assume true; {5564#true} is VALID [2020-07-10 15:28:45,842 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5564#true} {5564#true} #223#return; {5564#true} is VALID [2020-07-10 15:28:45,843 INFO L263 TraceCheckUtils]: 4: Hoare triple {5564#true} call #t~ret7 := main(); {5564#true} is VALID [2020-07-10 15:28:45,843 INFO L280 TraceCheckUtils]: 5: Hoare triple {5564#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {5564#true} is VALID [2020-07-10 15:28:45,843 INFO L280 TraceCheckUtils]: 6: Hoare triple {5564#true} assume !!(~main__urilen~0 <= 1000000); {5564#true} is VALID [2020-07-10 15:28:45,843 INFO L280 TraceCheckUtils]: 7: Hoare triple {5564#true} assume !!(~main__urilen~0 >= -1000000); {5564#true} is VALID [2020-07-10 15:28:45,843 INFO L280 TraceCheckUtils]: 8: Hoare triple {5564#true} assume !!(~main__tokenlen~0 <= 1000000); {5564#true} is VALID [2020-07-10 15:28:45,844 INFO L280 TraceCheckUtils]: 9: Hoare triple {5564#true} assume !!(~main__tokenlen~0 >= -1000000); {5564#true} is VALID [2020-07-10 15:28:45,844 INFO L280 TraceCheckUtils]: 10: Hoare triple {5564#true} assume !!(~main__scheme~0 <= 1000000); {5564#true} is VALID [2020-07-10 15:28:45,844 INFO L280 TraceCheckUtils]: 11: Hoare triple {5564#true} assume !!(~main__scheme~0 >= -1000000); {5564#true} is VALID [2020-07-10 15:28:45,844 INFO L280 TraceCheckUtils]: 12: Hoare triple {5564#true} assume ~main__urilen~0 > 0; {5564#true} is VALID [2020-07-10 15:28:45,844 INFO L280 TraceCheckUtils]: 13: Hoare triple {5564#true} assume ~main__tokenlen~0 > 0; {5564#true} is VALID [2020-07-10 15:28:45,845 INFO L280 TraceCheckUtils]: 14: Hoare triple {5564#true} assume ~main__scheme~0 >= 0; {5569#(<= 0 main_~main__scheme~0)} is VALID [2020-07-10 15:28:45,846 INFO L280 TraceCheckUtils]: 15: Hoare triple {5569#(<= 0 main_~main__scheme~0)} assume !(0 == ~main__scheme~0); {5569#(<= 0 main_~main__scheme~0)} is VALID [2020-07-10 15:28:45,847 INFO L280 TraceCheckUtils]: 16: Hoare triple {5569#(<= 0 main_~main__scheme~0)} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,847 INFO L280 TraceCheckUtils]: 17: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,848 INFO L280 TraceCheckUtils]: 18: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,849 INFO L280 TraceCheckUtils]: 19: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,850 INFO L280 TraceCheckUtils]: 20: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,850 INFO L280 TraceCheckUtils]: 21: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,851 INFO L280 TraceCheckUtils]: 22: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,852 INFO L280 TraceCheckUtils]: 23: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,852 INFO L280 TraceCheckUtils]: 24: Hoare triple {5570#(<= 0 main_~main__cp~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,853 INFO L280 TraceCheckUtils]: 25: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,854 INFO L280 TraceCheckUtils]: 26: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,855 INFO L280 TraceCheckUtils]: 27: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,855 INFO L280 TraceCheckUtils]: 28: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,856 INFO L280 TraceCheckUtils]: 29: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {5570#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,858 INFO L280 TraceCheckUtils]: 30: Hoare triple {5570#(<= 0 main_~main__cp~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {5571#(<= 1 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,860 INFO L280 TraceCheckUtils]: 31: Hoare triple {5571#(<= 1 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5571#(<= 1 main_~main__cp~0)} is VALID [2020-07-10 15:28:45,861 INFO L280 TraceCheckUtils]: 32: Hoare triple {5571#(<= 1 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5572#(not (= 0 main_~__VERIFIER_assert__cond~9))} is VALID [2020-07-10 15:28:45,863 INFO L280 TraceCheckUtils]: 33: Hoare triple {5572#(not (= 0 main_~__VERIFIER_assert__cond~9))} assume 0 == ~__VERIFIER_assert__cond~9; {5565#false} is VALID [2020-07-10 15:28:45,863 INFO L280 TraceCheckUtils]: 34: Hoare triple {5565#false} assume !false; {5565#false} is VALID [2020-07-10 15:28:45,864 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-10 15:28:45,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54103948] [2020-07-10 15:28:45,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:45,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:28:45,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151869040] [2020-07-10 15:28:45,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-10 15:28:45,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:45,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:28:45,920 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-10 15:28:45,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:28:45,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:45,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:28:45,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:28:45,921 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 7 states. [2020-07-10 15:28:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:46,521 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2020-07-10 15:28:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:46,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-10 15:28:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2020-07-10 15:28:46,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:28:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2020-07-10 15:28:46,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2020-07-10 15:28:46,641 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:46,643 INFO L225 Difference]: With dead ends: 71 [2020-07-10 15:28:46,644 INFO L226 Difference]: Without dead ends: 69 [2020-07-10 15:28:46,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:28:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-10 15:28:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2020-07-10 15:28:46,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:46,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 58 states. [2020-07-10 15:28:46,699 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 58 states. [2020-07-10 15:28:46,699 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 58 states. [2020-07-10 15:28:46,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:46,701 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-07-10 15:28:46,701 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-07-10 15:28:46,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:46,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:46,702 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 69 states. [2020-07-10 15:28:46,702 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 69 states. [2020-07-10 15:28:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:46,704 INFO L93 Difference]: Finished difference Result 69 states and 72 transitions. [2020-07-10 15:28:46,705 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-07-10 15:28:46,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:46,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:46,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:46,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-07-10 15:28:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2020-07-10 15:28:46,707 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 35 [2020-07-10 15:28:46,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:46,708 INFO L479 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2020-07-10 15:28:46,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:28:46,709 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2020-07-10 15:28:46,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-10 15:28:46,710 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:46,710 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:46,710 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-10 15:28:46,711 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:46,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:46,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1371399406, now seen corresponding path program 1 times [2020-07-10 15:28:46,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:46,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355204048] [2020-07-10 15:28:46,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:46,833 INFO L280 TraceCheckUtils]: 0: Hoare triple {5877#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {5869#true} is VALID [2020-07-10 15:28:46,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {5869#true} assume true; {5869#true} is VALID [2020-07-10 15:28:46,834 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {5869#true} {5869#true} #223#return; {5869#true} is VALID [2020-07-10 15:28:46,835 INFO L263 TraceCheckUtils]: 0: Hoare triple {5869#true} call ULTIMATE.init(); {5877#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:46,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {5877#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {5869#true} is VALID [2020-07-10 15:28:46,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {5869#true} assume true; {5869#true} is VALID [2020-07-10 15:28:46,836 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5869#true} {5869#true} #223#return; {5869#true} is VALID [2020-07-10 15:28:46,836 INFO L263 TraceCheckUtils]: 4: Hoare triple {5869#true} call #t~ret7 := main(); {5869#true} is VALID [2020-07-10 15:28:46,836 INFO L280 TraceCheckUtils]: 5: Hoare triple {5869#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {5869#true} is VALID [2020-07-10 15:28:46,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {5869#true} assume !!(~main__urilen~0 <= 1000000); {5869#true} is VALID [2020-07-10 15:28:46,837 INFO L280 TraceCheckUtils]: 7: Hoare triple {5869#true} assume !!(~main__urilen~0 >= -1000000); {5869#true} is VALID [2020-07-10 15:28:46,837 INFO L280 TraceCheckUtils]: 8: Hoare triple {5869#true} assume !!(~main__tokenlen~0 <= 1000000); {5869#true} is VALID [2020-07-10 15:28:46,837 INFO L280 TraceCheckUtils]: 9: Hoare triple {5869#true} assume !!(~main__tokenlen~0 >= -1000000); {5869#true} is VALID [2020-07-10 15:28:46,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {5869#true} assume !!(~main__scheme~0 <= 1000000); {5869#true} is VALID [2020-07-10 15:28:46,838 INFO L280 TraceCheckUtils]: 11: Hoare triple {5869#true} assume !!(~main__scheme~0 >= -1000000); {5869#true} is VALID [2020-07-10 15:28:46,838 INFO L280 TraceCheckUtils]: 12: Hoare triple {5869#true} assume ~main__urilen~0 > 0; {5869#true} is VALID [2020-07-10 15:28:46,838 INFO L280 TraceCheckUtils]: 13: Hoare triple {5869#true} assume ~main__tokenlen~0 > 0; {5869#true} is VALID [2020-07-10 15:28:46,838 INFO L280 TraceCheckUtils]: 14: Hoare triple {5869#true} assume ~main__scheme~0 >= 0; {5869#true} is VALID [2020-07-10 15:28:46,839 INFO L280 TraceCheckUtils]: 15: Hoare triple {5869#true} assume !(0 == ~main__scheme~0); {5869#true} is VALID [2020-07-10 15:28:46,839 INFO L280 TraceCheckUtils]: 16: Hoare triple {5869#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {5869#true} is VALID [2020-07-10 15:28:46,839 INFO L280 TraceCheckUtils]: 17: Hoare triple {5869#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {5869#true} is VALID [2020-07-10 15:28:46,840 INFO L280 TraceCheckUtils]: 18: Hoare triple {5869#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {5869#true} is VALID [2020-07-10 15:28:46,840 INFO L280 TraceCheckUtils]: 19: Hoare triple {5869#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {5869#true} is VALID [2020-07-10 15:28:46,840 INFO L280 TraceCheckUtils]: 20: Hoare triple {5869#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {5869#true} is VALID [2020-07-10 15:28:46,840 INFO L280 TraceCheckUtils]: 21: Hoare triple {5869#true} assume !(0 == ~__VERIFIER_assert__cond~3); {5869#true} is VALID [2020-07-10 15:28:46,840 INFO L280 TraceCheckUtils]: 22: Hoare triple {5869#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {5869#true} is VALID [2020-07-10 15:28:46,841 INFO L280 TraceCheckUtils]: 23: Hoare triple {5869#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {5869#true} is VALID [2020-07-10 15:28:46,841 INFO L280 TraceCheckUtils]: 24: Hoare triple {5869#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {5869#true} is VALID [2020-07-10 15:28:46,841 INFO L280 TraceCheckUtils]: 25: Hoare triple {5869#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {5869#true} is VALID [2020-07-10 15:28:46,841 INFO L280 TraceCheckUtils]: 26: Hoare triple {5869#true} assume !(0 == ~__VERIFIER_assert__cond~5); {5869#true} is VALID [2020-07-10 15:28:46,841 INFO L280 TraceCheckUtils]: 27: Hoare triple {5869#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {5869#true} is VALID [2020-07-10 15:28:46,842 INFO L280 TraceCheckUtils]: 28: Hoare triple {5869#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {5869#true} is VALID [2020-07-10 15:28:46,842 INFO L280 TraceCheckUtils]: 29: Hoare triple {5869#true} assume !(0 == ~__VERIFIER_assert__cond~7); {5869#true} is VALID [2020-07-10 15:28:46,842 INFO L280 TraceCheckUtils]: 30: Hoare triple {5869#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {5869#true} is VALID [2020-07-10 15:28:46,844 INFO L280 TraceCheckUtils]: 31: Hoare triple {5869#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {5874#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= 0 main_~__VERIFIER_assert__cond~8)) (and (< main_~main__cp~0 main_~main__urilen~0) (= 1 main_~__VERIFIER_assert__cond~8)))} is VALID [2020-07-10 15:28:46,845 INFO L280 TraceCheckUtils]: 32: Hoare triple {5874#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= 0 main_~__VERIFIER_assert__cond~8)) (and (< main_~main__cp~0 main_~main__urilen~0) (= 1 main_~__VERIFIER_assert__cond~8)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {5875#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:46,846 INFO L280 TraceCheckUtils]: 33: Hoare triple {5875#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {5875#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:46,846 INFO L280 TraceCheckUtils]: 34: Hoare triple {5875#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {5875#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:46,847 INFO L280 TraceCheckUtils]: 35: Hoare triple {5875#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {5876#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2020-07-10 15:28:46,848 INFO L280 TraceCheckUtils]: 36: Hoare triple {5876#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {5870#false} is VALID [2020-07-10 15:28:46,848 INFO L280 TraceCheckUtils]: 37: Hoare triple {5870#false} assume !false; {5870#false} is VALID [2020-07-10 15:28:46,850 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-10 15:28:46,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355204048] [2020-07-10 15:28:46,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:46,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:46,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828255892] [2020-07-10 15:28:46,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 15:28:46,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:46,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:46,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:46,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:46,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:46,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:46,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:46,899 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2020-07-10 15:28:47,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:47,713 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2020-07-10 15:28:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:28:47,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2020-07-10 15:28:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:47,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2020-07-10 15:28:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2020-07-10 15:28:47,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 95 transitions. [2020-07-10 15:28:47,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:47,874 INFO L225 Difference]: With dead ends: 91 [2020-07-10 15:28:47,874 INFO L226 Difference]: Without dead ends: 89 [2020-07-10 15:28:47,875 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:28:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-07-10 15:28:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2020-07-10 15:28:47,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:47,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 61 states. [2020-07-10 15:28:47,931 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 61 states. [2020-07-10 15:28:47,932 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 61 states. [2020-07-10 15:28:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:47,934 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2020-07-10 15:28:47,934 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2020-07-10 15:28:47,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:47,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:47,935 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 89 states. [2020-07-10 15:28:47,935 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 89 states. [2020-07-10 15:28:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:47,938 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2020-07-10 15:28:47,938 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2020-07-10 15:28:47,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:47,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:47,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:47,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-10 15:28:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-07-10 15:28:47,944 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 38 [2020-07-10 15:28:47,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:47,944 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-07-10 15:28:47,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:47,944 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-07-10 15:28:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-10 15:28:47,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:47,945 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:47,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-10 15:28:47,948 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:47,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:47,948 INFO L82 PathProgramCache]: Analyzing trace with hash 436294569, now seen corresponding path program 1 times [2020-07-10 15:28:47,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:47,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568640849] [2020-07-10 15:28:47,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:48,070 INFO L280 TraceCheckUtils]: 0: Hoare triple {6250#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {6242#true} is VALID [2020-07-10 15:28:48,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {6242#true} assume true; {6242#true} is VALID [2020-07-10 15:28:48,071 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6242#true} {6242#true} #223#return; {6242#true} is VALID [2020-07-10 15:28:48,072 INFO L263 TraceCheckUtils]: 0: Hoare triple {6242#true} call ULTIMATE.init(); {6250#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:48,072 INFO L280 TraceCheckUtils]: 1: Hoare triple {6250#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {6242#true} is VALID [2020-07-10 15:28:48,072 INFO L280 TraceCheckUtils]: 2: Hoare triple {6242#true} assume true; {6242#true} is VALID [2020-07-10 15:28:48,073 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6242#true} {6242#true} #223#return; {6242#true} is VALID [2020-07-10 15:28:48,073 INFO L263 TraceCheckUtils]: 4: Hoare triple {6242#true} call #t~ret7 := main(); {6242#true} is VALID [2020-07-10 15:28:48,073 INFO L280 TraceCheckUtils]: 5: Hoare triple {6242#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {6242#true} is VALID [2020-07-10 15:28:48,073 INFO L280 TraceCheckUtils]: 6: Hoare triple {6242#true} assume !!(~main__urilen~0 <= 1000000); {6242#true} is VALID [2020-07-10 15:28:48,073 INFO L280 TraceCheckUtils]: 7: Hoare triple {6242#true} assume !!(~main__urilen~0 >= -1000000); {6242#true} is VALID [2020-07-10 15:28:48,074 INFO L280 TraceCheckUtils]: 8: Hoare triple {6242#true} assume !!(~main__tokenlen~0 <= 1000000); {6242#true} is VALID [2020-07-10 15:28:48,074 INFO L280 TraceCheckUtils]: 9: Hoare triple {6242#true} assume !!(~main__tokenlen~0 >= -1000000); {6242#true} is VALID [2020-07-10 15:28:48,074 INFO L280 TraceCheckUtils]: 10: Hoare triple {6242#true} assume !!(~main__scheme~0 <= 1000000); {6242#true} is VALID [2020-07-10 15:28:48,074 INFO L280 TraceCheckUtils]: 11: Hoare triple {6242#true} assume !!(~main__scheme~0 >= -1000000); {6242#true} is VALID [2020-07-10 15:28:48,074 INFO L280 TraceCheckUtils]: 12: Hoare triple {6242#true} assume ~main__urilen~0 > 0; {6242#true} is VALID [2020-07-10 15:28:48,075 INFO L280 TraceCheckUtils]: 13: Hoare triple {6242#true} assume ~main__tokenlen~0 > 0; {6242#true} is VALID [2020-07-10 15:28:48,075 INFO L280 TraceCheckUtils]: 14: Hoare triple {6242#true} assume ~main__scheme~0 >= 0; {6242#true} is VALID [2020-07-10 15:28:48,075 INFO L280 TraceCheckUtils]: 15: Hoare triple {6242#true} assume !(0 == ~main__scheme~0); {6242#true} is VALID [2020-07-10 15:28:48,075 INFO L280 TraceCheckUtils]: 16: Hoare triple {6242#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6242#true} is VALID [2020-07-10 15:28:48,075 INFO L280 TraceCheckUtils]: 17: Hoare triple {6242#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6242#true} is VALID [2020-07-10 15:28:48,076 INFO L280 TraceCheckUtils]: 18: Hoare triple {6242#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {6242#true} is VALID [2020-07-10 15:28:48,076 INFO L280 TraceCheckUtils]: 19: Hoare triple {6242#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6242#true} is VALID [2020-07-10 15:28:48,076 INFO L280 TraceCheckUtils]: 20: Hoare triple {6242#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6242#true} is VALID [2020-07-10 15:28:48,076 INFO L280 TraceCheckUtils]: 21: Hoare triple {6242#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6242#true} is VALID [2020-07-10 15:28:48,076 INFO L280 TraceCheckUtils]: 22: Hoare triple {6242#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {6242#true} is VALID [2020-07-10 15:28:48,077 INFO L280 TraceCheckUtils]: 23: Hoare triple {6242#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6242#true} is VALID [2020-07-10 15:28:48,077 INFO L280 TraceCheckUtils]: 24: Hoare triple {6242#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6242#true} is VALID [2020-07-10 15:28:48,077 INFO L280 TraceCheckUtils]: 25: Hoare triple {6242#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6242#true} is VALID [2020-07-10 15:28:48,077 INFO L280 TraceCheckUtils]: 26: Hoare triple {6242#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6242#true} is VALID [2020-07-10 15:28:48,077 INFO L280 TraceCheckUtils]: 27: Hoare triple {6242#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6242#true} is VALID [2020-07-10 15:28:48,078 INFO L280 TraceCheckUtils]: 28: Hoare triple {6242#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6242#true} is VALID [2020-07-10 15:28:48,078 INFO L280 TraceCheckUtils]: 29: Hoare triple {6242#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6242#true} is VALID [2020-07-10 15:28:48,078 INFO L280 TraceCheckUtils]: 30: Hoare triple {6242#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {6242#true} is VALID [2020-07-10 15:28:48,078 INFO L280 TraceCheckUtils]: 31: Hoare triple {6242#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6242#true} is VALID [2020-07-10 15:28:48,080 INFO L280 TraceCheckUtils]: 32: Hoare triple {6242#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6247#(or (and (<= 0 main_~main__cp~0) (= 1 main_~__VERIFIER_assert__cond~9)) (and (= 0 main_~__VERIFIER_assert__cond~9) (< main_~main__cp~0 0)))} is VALID [2020-07-10 15:28:48,081 INFO L280 TraceCheckUtils]: 33: Hoare triple {6247#(or (and (<= 0 main_~main__cp~0) (= 1 main_~__VERIFIER_assert__cond~9)) (and (= 0 main_~__VERIFIER_assert__cond~9) (< main_~main__cp~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~9); {6248#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:48,082 INFO L280 TraceCheckUtils]: 34: Hoare triple {6248#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {6248#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:48,083 INFO L280 TraceCheckUtils]: 35: Hoare triple {6248#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6248#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:48,084 INFO L280 TraceCheckUtils]: 36: Hoare triple {6248#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6249#(not (= main_~__VERIFIER_assert__cond~11 0))} is VALID [2020-07-10 15:28:48,085 INFO L280 TraceCheckUtils]: 37: Hoare triple {6249#(not (= main_~__VERIFIER_assert__cond~11 0))} assume 0 == ~__VERIFIER_assert__cond~11; {6243#false} is VALID [2020-07-10 15:28:48,085 INFO L280 TraceCheckUtils]: 38: Hoare triple {6243#false} assume !false; {6243#false} is VALID [2020-07-10 15:28:48,087 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-10 15:28:48,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568640849] [2020-07-10 15:28:48,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:48,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:48,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33709738] [2020-07-10 15:28:48,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-07-10 15:28:48,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:48,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:48,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:48,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:48,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:48,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:48,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:48,132 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2020-07-10 15:28:48,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:48,646 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2020-07-10 15:28:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:48,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2020-07-10 15:28:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:48,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:28:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:48,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-10 15:28:48,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-10 15:28:48,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:48,742 INFO L225 Difference]: With dead ends: 61 [2020-07-10 15:28:48,743 INFO L226 Difference]: Without dead ends: 59 [2020-07-10 15:28:48,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-10 15:28:48,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2020-07-10 15:28:48,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:48,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2020-07-10 15:28:48,809 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-10 15:28:48,809 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-10 15:28:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:48,811 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-10 15:28:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-10 15:28:48,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:48,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:48,811 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2020-07-10 15:28:48,812 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2020-07-10 15:28:48,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:48,813 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2020-07-10 15:28:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-10 15:28:48,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:48,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:48,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:48,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 15:28:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2020-07-10 15:28:48,816 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 39 [2020-07-10 15:28:48,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:48,817 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2020-07-10 15:28:48,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2020-07-10 15:28:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 15:28:48,818 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:48,818 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:48,818 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-10 15:28:48,819 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:48,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1627614740, now seen corresponding path program 1 times [2020-07-10 15:28:48,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:48,820 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873675917] [2020-07-10 15:28:48,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:48,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {6523#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {6515#true} is VALID [2020-07-10 15:28:48,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {6515#true} assume true; {6515#true} is VALID [2020-07-10 15:28:48,901 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6515#true} {6515#true} #223#return; {6515#true} is VALID [2020-07-10 15:28:48,902 INFO L263 TraceCheckUtils]: 0: Hoare triple {6515#true} call ULTIMATE.init(); {6523#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:48,902 INFO L280 TraceCheckUtils]: 1: Hoare triple {6523#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {6515#true} is VALID [2020-07-10 15:28:48,903 INFO L280 TraceCheckUtils]: 2: Hoare triple {6515#true} assume true; {6515#true} is VALID [2020-07-10 15:28:48,903 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6515#true} {6515#true} #223#return; {6515#true} is VALID [2020-07-10 15:28:48,903 INFO L263 TraceCheckUtils]: 4: Hoare triple {6515#true} call #t~ret7 := main(); {6515#true} is VALID [2020-07-10 15:28:48,903 INFO L280 TraceCheckUtils]: 5: Hoare triple {6515#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {6515#true} is VALID [2020-07-10 15:28:48,904 INFO L280 TraceCheckUtils]: 6: Hoare triple {6515#true} assume !!(~main__urilen~0 <= 1000000); {6515#true} is VALID [2020-07-10 15:28:48,904 INFO L280 TraceCheckUtils]: 7: Hoare triple {6515#true} assume !!(~main__urilen~0 >= -1000000); {6515#true} is VALID [2020-07-10 15:28:48,904 INFO L280 TraceCheckUtils]: 8: Hoare triple {6515#true} assume !!(~main__tokenlen~0 <= 1000000); {6515#true} is VALID [2020-07-10 15:28:48,904 INFO L280 TraceCheckUtils]: 9: Hoare triple {6515#true} assume !!(~main__tokenlen~0 >= -1000000); {6515#true} is VALID [2020-07-10 15:28:48,904 INFO L280 TraceCheckUtils]: 10: Hoare triple {6515#true} assume !!(~main__scheme~0 <= 1000000); {6515#true} is VALID [2020-07-10 15:28:48,905 INFO L280 TraceCheckUtils]: 11: Hoare triple {6515#true} assume !!(~main__scheme~0 >= -1000000); {6515#true} is VALID [2020-07-10 15:28:48,905 INFO L280 TraceCheckUtils]: 12: Hoare triple {6515#true} assume ~main__urilen~0 > 0; {6515#true} is VALID [2020-07-10 15:28:48,905 INFO L280 TraceCheckUtils]: 13: Hoare triple {6515#true} assume ~main__tokenlen~0 > 0; {6515#true} is VALID [2020-07-10 15:28:48,906 INFO L280 TraceCheckUtils]: 14: Hoare triple {6515#true} assume ~main__scheme~0 >= 0; {6515#true} is VALID [2020-07-10 15:28:48,906 INFO L280 TraceCheckUtils]: 15: Hoare triple {6515#true} assume !(0 == ~main__scheme~0); {6515#true} is VALID [2020-07-10 15:28:48,906 INFO L280 TraceCheckUtils]: 16: Hoare triple {6515#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6515#true} is VALID [2020-07-10 15:28:48,906 INFO L280 TraceCheckUtils]: 17: Hoare triple {6515#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6515#true} is VALID [2020-07-10 15:28:48,906 INFO L280 TraceCheckUtils]: 18: Hoare triple {6515#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {6515#true} is VALID [2020-07-10 15:28:48,907 INFO L280 TraceCheckUtils]: 19: Hoare triple {6515#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6515#true} is VALID [2020-07-10 15:28:48,907 INFO L280 TraceCheckUtils]: 20: Hoare triple {6515#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6515#true} is VALID [2020-07-10 15:28:48,907 INFO L280 TraceCheckUtils]: 21: Hoare triple {6515#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6515#true} is VALID [2020-07-10 15:28:48,907 INFO L280 TraceCheckUtils]: 22: Hoare triple {6515#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {6515#true} is VALID [2020-07-10 15:28:48,907 INFO L280 TraceCheckUtils]: 23: Hoare triple {6515#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6515#true} is VALID [2020-07-10 15:28:48,908 INFO L280 TraceCheckUtils]: 24: Hoare triple {6515#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6515#true} is VALID [2020-07-10 15:28:48,908 INFO L280 TraceCheckUtils]: 25: Hoare triple {6515#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6515#true} is VALID [2020-07-10 15:28:48,908 INFO L280 TraceCheckUtils]: 26: Hoare triple {6515#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6515#true} is VALID [2020-07-10 15:28:48,909 INFO L280 TraceCheckUtils]: 27: Hoare triple {6515#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6515#true} is VALID [2020-07-10 15:28:48,909 INFO L280 TraceCheckUtils]: 28: Hoare triple {6515#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6515#true} is VALID [2020-07-10 15:28:48,909 INFO L280 TraceCheckUtils]: 29: Hoare triple {6515#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6515#true} is VALID [2020-07-10 15:28:48,909 INFO L280 TraceCheckUtils]: 30: Hoare triple {6515#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {6515#true} is VALID [2020-07-10 15:28:48,911 INFO L280 TraceCheckUtils]: 31: Hoare triple {6515#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6520#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:48,912 INFO L280 TraceCheckUtils]: 32: Hoare triple {6520#(= 0 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6520#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:48,912 INFO L280 TraceCheckUtils]: 33: Hoare triple {6520#(= 0 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {6520#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:48,913 INFO L280 TraceCheckUtils]: 34: Hoare triple {6520#(= 0 main_~main__c~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {6520#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:48,914 INFO L280 TraceCheckUtils]: 35: Hoare triple {6520#(= 0 main_~main__c~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6521#(and (= 0 main_~main__c~0) (<= (+ main_~main__c~0 2) main_~main__tokenlen~0))} is VALID [2020-07-10 15:28:48,916 INFO L280 TraceCheckUtils]: 36: Hoare triple {6521#(and (= 0 main_~main__c~0) (<= (+ main_~main__c~0 2) main_~main__tokenlen~0))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6521#(and (= 0 main_~main__c~0) (<= (+ main_~main__c~0 2) main_~main__tokenlen~0))} is VALID [2020-07-10 15:28:48,917 INFO L280 TraceCheckUtils]: 37: Hoare triple {6521#(and (= 0 main_~main__c~0) (<= (+ main_~main__c~0 2) main_~main__tokenlen~0))} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {6521#(and (= 0 main_~main__c~0) (<= (+ main_~main__c~0 2) main_~main__tokenlen~0))} is VALID [2020-07-10 15:28:48,919 INFO L280 TraceCheckUtils]: 38: Hoare triple {6521#(and (= 0 main_~main__c~0) (<= (+ main_~main__c~0 2) main_~main__tokenlen~0))} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6522#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2020-07-10 15:28:48,920 INFO L280 TraceCheckUtils]: 39: Hoare triple {6522#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {6516#false} is VALID [2020-07-10 15:28:48,920 INFO L280 TraceCheckUtils]: 40: Hoare triple {6516#false} assume !false; {6516#false} is VALID [2020-07-10 15:28:48,922 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-10 15:28:48,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873675917] [2020-07-10 15:28:48,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:48,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:48,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682962810] [2020-07-10 15:28:48,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2020-07-10 15:28:48,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:48,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:48,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:48,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:48,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:48,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:48,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:48,976 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 6 states. [2020-07-10 15:28:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:49,496 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2020-07-10 15:28:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:49,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2020-07-10 15:28:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:49,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-10 15:28:49,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2020-07-10 15:28:49,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2020-07-10 15:28:49,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:49,603 INFO L225 Difference]: With dead ends: 70 [2020-07-10 15:28:49,603 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 15:28:49,604 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:49,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 15:28:49,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-07-10 15:28:49,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:49,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 66 states. [2020-07-10 15:28:49,694 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 66 states. [2020-07-10 15:28:49,694 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 66 states. [2020-07-10 15:28:49,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:49,696 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-07-10 15:28:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-07-10 15:28:49,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:49,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:49,697 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 68 states. [2020-07-10 15:28:49,697 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 68 states. [2020-07-10 15:28:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:49,699 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-07-10 15:28:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2020-07-10 15:28:49,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:49,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:49,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:49,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-10 15:28:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2020-07-10 15:28:49,702 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 41 [2020-07-10 15:28:49,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:49,702 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2020-07-10 15:28:49,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-07-10 15:28:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 15:28:49,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:49,704 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:49,704 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-10 15:28:49,704 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:49,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:49,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1083553822, now seen corresponding path program 1 times [2020-07-10 15:28:49,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:49,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156927157] [2020-07-10 15:28:49,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:49,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {6834#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {6826#true} is VALID [2020-07-10 15:28:49,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {6826#true} assume true; {6826#true} is VALID [2020-07-10 15:28:49,816 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {6826#true} {6826#true} #223#return; {6826#true} is VALID [2020-07-10 15:28:49,825 INFO L263 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6834#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:49,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {6834#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {6826#true} is VALID [2020-07-10 15:28:49,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2020-07-10 15:28:49,826 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #223#return; {6826#true} is VALID [2020-07-10 15:28:49,826 INFO L263 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2020-07-10 15:28:49,827 INFO L280 TraceCheckUtils]: 5: Hoare triple {6826#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {6826#true} is VALID [2020-07-10 15:28:49,827 INFO L280 TraceCheckUtils]: 6: Hoare triple {6826#true} assume !!(~main__urilen~0 <= 1000000); {6826#true} is VALID [2020-07-10 15:28:49,827 INFO L280 TraceCheckUtils]: 7: Hoare triple {6826#true} assume !!(~main__urilen~0 >= -1000000); {6826#true} is VALID [2020-07-10 15:28:49,827 INFO L280 TraceCheckUtils]: 8: Hoare triple {6826#true} assume !!(~main__tokenlen~0 <= 1000000); {6826#true} is VALID [2020-07-10 15:28:49,828 INFO L280 TraceCheckUtils]: 9: Hoare triple {6826#true} assume !!(~main__tokenlen~0 >= -1000000); {6826#true} is VALID [2020-07-10 15:28:49,828 INFO L280 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !!(~main__scheme~0 <= 1000000); {6826#true} is VALID [2020-07-10 15:28:49,828 INFO L280 TraceCheckUtils]: 11: Hoare triple {6826#true} assume !!(~main__scheme~0 >= -1000000); {6826#true} is VALID [2020-07-10 15:28:49,828 INFO L280 TraceCheckUtils]: 12: Hoare triple {6826#true} assume ~main__urilen~0 > 0; {6826#true} is VALID [2020-07-10 15:28:49,828 INFO L280 TraceCheckUtils]: 13: Hoare triple {6826#true} assume ~main__tokenlen~0 > 0; {6826#true} is VALID [2020-07-10 15:28:49,829 INFO L280 TraceCheckUtils]: 14: Hoare triple {6826#true} assume ~main__scheme~0 >= 0; {6826#true} is VALID [2020-07-10 15:28:49,829 INFO L280 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~main__scheme~0); {6826#true} is VALID [2020-07-10 15:28:49,829 INFO L280 TraceCheckUtils]: 16: Hoare triple {6826#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {6826#true} is VALID [2020-07-10 15:28:49,829 INFO L280 TraceCheckUtils]: 17: Hoare triple {6826#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {6826#true} is VALID [2020-07-10 15:28:49,829 INFO L280 TraceCheckUtils]: 18: Hoare triple {6826#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {6826#true} is VALID [2020-07-10 15:28:49,829 INFO L280 TraceCheckUtils]: 19: Hoare triple {6826#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {6826#true} is VALID [2020-07-10 15:28:49,830 INFO L280 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {6826#true} is VALID [2020-07-10 15:28:49,830 INFO L280 TraceCheckUtils]: 21: Hoare triple {6826#true} assume !(0 == ~__VERIFIER_assert__cond~3); {6826#true} is VALID [2020-07-10 15:28:49,830 INFO L280 TraceCheckUtils]: 22: Hoare triple {6826#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {6826#true} is VALID [2020-07-10 15:28:49,830 INFO L280 TraceCheckUtils]: 23: Hoare triple {6826#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {6826#true} is VALID [2020-07-10 15:28:49,831 INFO L280 TraceCheckUtils]: 24: Hoare triple {6826#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {6826#true} is VALID [2020-07-10 15:28:49,831 INFO L280 TraceCheckUtils]: 25: Hoare triple {6826#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {6826#true} is VALID [2020-07-10 15:28:49,831 INFO L280 TraceCheckUtils]: 26: Hoare triple {6826#true} assume !(0 == ~__VERIFIER_assert__cond~5); {6826#true} is VALID [2020-07-10 15:28:49,831 INFO L280 TraceCheckUtils]: 27: Hoare triple {6826#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {6826#true} is VALID [2020-07-10 15:28:49,831 INFO L280 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {6826#true} is VALID [2020-07-10 15:28:49,832 INFO L280 TraceCheckUtils]: 29: Hoare triple {6826#true} assume !(0 == ~__VERIFIER_assert__cond~7); {6826#true} is VALID [2020-07-10 15:28:49,832 INFO L280 TraceCheckUtils]: 30: Hoare triple {6826#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {6826#true} is VALID [2020-07-10 15:28:49,836 INFO L280 TraceCheckUtils]: 31: Hoare triple {6826#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {6831#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:49,837 INFO L280 TraceCheckUtils]: 32: Hoare triple {6831#(= 0 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {6831#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:49,838 INFO L280 TraceCheckUtils]: 33: Hoare triple {6831#(= 0 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {6831#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:49,839 INFO L280 TraceCheckUtils]: 34: Hoare triple {6831#(= 0 main_~main__c~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {6831#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:49,839 INFO L280 TraceCheckUtils]: 35: Hoare triple {6831#(= 0 main_~main__c~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {6831#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:49,840 INFO L280 TraceCheckUtils]: 36: Hoare triple {6831#(= 0 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {6831#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:49,841 INFO L280 TraceCheckUtils]: 37: Hoare triple {6831#(= 0 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {6831#(= 0 main_~main__c~0)} is VALID [2020-07-10 15:28:49,842 INFO L280 TraceCheckUtils]: 38: Hoare triple {6831#(= 0 main_~main__c~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {6832#(<= 1 main_~main__c~0)} is VALID [2020-07-10 15:28:49,843 INFO L280 TraceCheckUtils]: 39: Hoare triple {6832#(<= 1 main_~main__c~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {6833#(not (= main_~__VERIFIER_assert__cond~13 0))} is VALID [2020-07-10 15:28:49,844 INFO L280 TraceCheckUtils]: 40: Hoare triple {6833#(not (= main_~__VERIFIER_assert__cond~13 0))} assume 0 == ~__VERIFIER_assert__cond~13; {6827#false} is VALID [2020-07-10 15:28:49,844 INFO L280 TraceCheckUtils]: 41: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2020-07-10 15:28:49,846 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-10 15:28:49,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156927157] [2020-07-10 15:28:49,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:49,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:49,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254994160] [2020-07-10 15:28:49,848 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-10 15:28:49,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:49,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:49,902 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:49,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:49,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:49,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:49,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:49,903 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2020-07-10 15:28:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:50,476 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2020-07-10 15:28:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:50,476 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-10 15:28:50,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:50,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2020-07-10 15:28:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2020-07-10 15:28:50,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2020-07-10 15:28:50,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:50,574 INFO L225 Difference]: With dead ends: 68 [2020-07-10 15:28:50,574 INFO L226 Difference]: Without dead ends: 66 [2020-07-10 15:28:50,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-07-10 15:28:50,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-07-10 15:28:50,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:50,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 64 states. [2020-07-10 15:28:50,670 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 64 states. [2020-07-10 15:28:50,670 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 64 states. [2020-07-10 15:28:50,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:50,672 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-07-10 15:28:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-07-10 15:28:50,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:50,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:50,674 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 66 states. [2020-07-10 15:28:50,674 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 66 states. [2020-07-10 15:28:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:50,676 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2020-07-10 15:28:50,676 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-07-10 15:28:50,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:50,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:50,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:50,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-10 15:28:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2020-07-10 15:28:50,679 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 42 [2020-07-10 15:28:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:50,680 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2020-07-10 15:28:50,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:50,680 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2020-07-10 15:28:50,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-07-10 15:28:50,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:50,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:50,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-10 15:28:50,681 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:50,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:50,682 INFO L82 PathProgramCache]: Analyzing trace with hash -769566670, now seen corresponding path program 1 times [2020-07-10 15:28:50,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:50,682 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100680422] [2020-07-10 15:28:50,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:50,789 INFO L280 TraceCheckUtils]: 0: Hoare triple {7137#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {7129#true} is VALID [2020-07-10 15:28:50,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {7129#true} assume true; {7129#true} is VALID [2020-07-10 15:28:50,790 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7129#true} {7129#true} #223#return; {7129#true} is VALID [2020-07-10 15:28:50,791 INFO L263 TraceCheckUtils]: 0: Hoare triple {7129#true} call ULTIMATE.init(); {7137#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:50,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {7137#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {7129#true} is VALID [2020-07-10 15:28:50,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {7129#true} assume true; {7129#true} is VALID [2020-07-10 15:28:50,792 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7129#true} {7129#true} #223#return; {7129#true} is VALID [2020-07-10 15:28:50,792 INFO L263 TraceCheckUtils]: 4: Hoare triple {7129#true} call #t~ret7 := main(); {7129#true} is VALID [2020-07-10 15:28:50,793 INFO L280 TraceCheckUtils]: 5: Hoare triple {7129#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {7129#true} is VALID [2020-07-10 15:28:50,793 INFO L280 TraceCheckUtils]: 6: Hoare triple {7129#true} assume !!(~main__urilen~0 <= 1000000); {7129#true} is VALID [2020-07-10 15:28:50,793 INFO L280 TraceCheckUtils]: 7: Hoare triple {7129#true} assume !!(~main__urilen~0 >= -1000000); {7129#true} is VALID [2020-07-10 15:28:50,793 INFO L280 TraceCheckUtils]: 8: Hoare triple {7129#true} assume !!(~main__tokenlen~0 <= 1000000); {7129#true} is VALID [2020-07-10 15:28:50,793 INFO L280 TraceCheckUtils]: 9: Hoare triple {7129#true} assume !!(~main__tokenlen~0 >= -1000000); {7129#true} is VALID [2020-07-10 15:28:50,794 INFO L280 TraceCheckUtils]: 10: Hoare triple {7129#true} assume !!(~main__scheme~0 <= 1000000); {7129#true} is VALID [2020-07-10 15:28:50,794 INFO L280 TraceCheckUtils]: 11: Hoare triple {7129#true} assume !!(~main__scheme~0 >= -1000000); {7129#true} is VALID [2020-07-10 15:28:50,794 INFO L280 TraceCheckUtils]: 12: Hoare triple {7129#true} assume ~main__urilen~0 > 0; {7129#true} is VALID [2020-07-10 15:28:50,794 INFO L280 TraceCheckUtils]: 13: Hoare triple {7129#true} assume ~main__tokenlen~0 > 0; {7129#true} is VALID [2020-07-10 15:28:50,795 INFO L280 TraceCheckUtils]: 14: Hoare triple {7129#true} assume ~main__scheme~0 >= 0; {7129#true} is VALID [2020-07-10 15:28:50,795 INFO L280 TraceCheckUtils]: 15: Hoare triple {7129#true} assume !(0 == ~main__scheme~0); {7129#true} is VALID [2020-07-10 15:28:50,795 INFO L280 TraceCheckUtils]: 16: Hoare triple {7129#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7129#true} is VALID [2020-07-10 15:28:50,795 INFO L280 TraceCheckUtils]: 17: Hoare triple {7129#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7129#true} is VALID [2020-07-10 15:28:50,796 INFO L280 TraceCheckUtils]: 18: Hoare triple {7129#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {7129#true} is VALID [2020-07-10 15:28:50,796 INFO L280 TraceCheckUtils]: 19: Hoare triple {7129#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7129#true} is VALID [2020-07-10 15:28:50,796 INFO L280 TraceCheckUtils]: 20: Hoare triple {7129#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7129#true} is VALID [2020-07-10 15:28:50,796 INFO L280 TraceCheckUtils]: 21: Hoare triple {7129#true} assume !(0 == ~__VERIFIER_assert__cond~3); {7129#true} is VALID [2020-07-10 15:28:50,796 INFO L280 TraceCheckUtils]: 22: Hoare triple {7129#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {7129#true} is VALID [2020-07-10 15:28:50,797 INFO L280 TraceCheckUtils]: 23: Hoare triple {7129#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {7129#true} is VALID [2020-07-10 15:28:50,797 INFO L280 TraceCheckUtils]: 24: Hoare triple {7129#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7129#true} is VALID [2020-07-10 15:28:50,797 INFO L280 TraceCheckUtils]: 25: Hoare triple {7129#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7129#true} is VALID [2020-07-10 15:28:50,798 INFO L280 TraceCheckUtils]: 26: Hoare triple {7129#true} assume !(0 == ~__VERIFIER_assert__cond~5); {7129#true} is VALID [2020-07-10 15:28:50,798 INFO L280 TraceCheckUtils]: 27: Hoare triple {7129#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7129#true} is VALID [2020-07-10 15:28:50,798 INFO L280 TraceCheckUtils]: 28: Hoare triple {7129#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7129#true} is VALID [2020-07-10 15:28:50,798 INFO L280 TraceCheckUtils]: 29: Hoare triple {7129#true} assume !(0 == ~__VERIFIER_assert__cond~7); {7129#true} is VALID [2020-07-10 15:28:50,799 INFO L280 TraceCheckUtils]: 30: Hoare triple {7129#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {7129#true} is VALID [2020-07-10 15:28:50,802 INFO L280 TraceCheckUtils]: 31: Hoare triple {7129#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7134#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= 0 main_~__VERIFIER_assert__cond~8)) (and (< main_~main__cp~0 main_~main__urilen~0) (= 1 main_~__VERIFIER_assert__cond~8)))} is VALID [2020-07-10 15:28:50,804 INFO L280 TraceCheckUtils]: 32: Hoare triple {7134#(or (and (<= main_~main__urilen~0 main_~main__cp~0) (= 0 main_~__VERIFIER_assert__cond~8)) (and (< main_~main__cp~0 main_~main__urilen~0) (= 1 main_~__VERIFIER_assert__cond~8)))} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7135#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:50,805 INFO L280 TraceCheckUtils]: 33: Hoare triple {7135#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7135#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:50,806 INFO L280 TraceCheckUtils]: 34: Hoare triple {7135#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7135#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:50,806 INFO L280 TraceCheckUtils]: 35: Hoare triple {7135#(< main_~main__cp~0 main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7135#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:50,807 INFO L280 TraceCheckUtils]: 36: Hoare triple {7135#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7135#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:50,808 INFO L280 TraceCheckUtils]: 37: Hoare triple {7135#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7135#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:50,808 INFO L280 TraceCheckUtils]: 38: Hoare triple {7135#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {7135#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:50,809 INFO L280 TraceCheckUtils]: 39: Hoare triple {7135#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {7135#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:50,810 INFO L280 TraceCheckUtils]: 40: Hoare triple {7135#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {7136#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2020-07-10 15:28:50,811 INFO L280 TraceCheckUtils]: 41: Hoare triple {7136#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {7130#false} is VALID [2020-07-10 15:28:50,811 INFO L280 TraceCheckUtils]: 42: Hoare triple {7130#false} assume !false; {7130#false} is VALID [2020-07-10 15:28:50,813 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-10 15:28:50,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100680422] [2020-07-10 15:28:50,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:50,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:50,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614107655] [2020-07-10 15:28:50,816 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-10 15:28:50,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:50,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:50,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:50,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:50,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:50,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:50,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:50,872 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2020-07-10 15:28:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:51,767 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2020-07-10 15:28:51,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:28:51,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-07-10 15:28:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:51,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:51,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2020-07-10 15:28:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2020-07-10 15:28:51,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 95 transitions. [2020-07-10 15:28:51,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:51,910 INFO L225 Difference]: With dead ends: 90 [2020-07-10 15:28:51,910 INFO L226 Difference]: Without dead ends: 88 [2020-07-10 15:28:51,911 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:28:51,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-07-10 15:28:51,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2020-07-10 15:28:51,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:51,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 69 states. [2020-07-10 15:28:51,998 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 69 states. [2020-07-10 15:28:51,998 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 69 states. [2020-07-10 15:28:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:52,002 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2020-07-10 15:28:52,002 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2020-07-10 15:28:52,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:52,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:52,003 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 88 states. [2020-07-10 15:28:52,003 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 88 states. [2020-07-10 15:28:52,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:52,006 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2020-07-10 15:28:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2020-07-10 15:28:52,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:52,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:52,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:52,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:52,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-10 15:28:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2020-07-10 15:28:52,009 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 43 [2020-07-10 15:28:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:52,009 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2020-07-10 15:28:52,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2020-07-10 15:28:52,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 15:28:52,010 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:52,010 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:52,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-10 15:28:52,011 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:52,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:52,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1913240228, now seen corresponding path program 1 times [2020-07-10 15:28:52,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:52,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776483680] [2020-07-10 15:28:52,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:52,101 INFO L280 TraceCheckUtils]: 0: Hoare triple {7520#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {7512#true} is VALID [2020-07-10 15:28:52,102 INFO L280 TraceCheckUtils]: 1: Hoare triple {7512#true} assume true; {7512#true} is VALID [2020-07-10 15:28:52,102 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7512#true} {7512#true} #223#return; {7512#true} is VALID [2020-07-10 15:28:52,103 INFO L263 TraceCheckUtils]: 0: Hoare triple {7512#true} call ULTIMATE.init(); {7520#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:52,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {7520#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {7512#true} is VALID [2020-07-10 15:28:52,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {7512#true} assume true; {7512#true} is VALID [2020-07-10 15:28:52,104 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7512#true} {7512#true} #223#return; {7512#true} is VALID [2020-07-10 15:28:52,104 INFO L263 TraceCheckUtils]: 4: Hoare triple {7512#true} call #t~ret7 := main(); {7512#true} is VALID [2020-07-10 15:28:52,105 INFO L280 TraceCheckUtils]: 5: Hoare triple {7512#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {7512#true} is VALID [2020-07-10 15:28:52,105 INFO L280 TraceCheckUtils]: 6: Hoare triple {7512#true} assume !!(~main__urilen~0 <= 1000000); {7512#true} is VALID [2020-07-10 15:28:52,105 INFO L280 TraceCheckUtils]: 7: Hoare triple {7512#true} assume !!(~main__urilen~0 >= -1000000); {7512#true} is VALID [2020-07-10 15:28:52,106 INFO L280 TraceCheckUtils]: 8: Hoare triple {7512#true} assume !!(~main__tokenlen~0 <= 1000000); {7512#true} is VALID [2020-07-10 15:28:52,106 INFO L280 TraceCheckUtils]: 9: Hoare triple {7512#true} assume !!(~main__tokenlen~0 >= -1000000); {7512#true} is VALID [2020-07-10 15:28:52,106 INFO L280 TraceCheckUtils]: 10: Hoare triple {7512#true} assume !!(~main__scheme~0 <= 1000000); {7512#true} is VALID [2020-07-10 15:28:52,106 INFO L280 TraceCheckUtils]: 11: Hoare triple {7512#true} assume !!(~main__scheme~0 >= -1000000); {7512#true} is VALID [2020-07-10 15:28:52,107 INFO L280 TraceCheckUtils]: 12: Hoare triple {7512#true} assume ~main__urilen~0 > 0; {7512#true} is VALID [2020-07-10 15:28:52,107 INFO L280 TraceCheckUtils]: 13: Hoare triple {7512#true} assume ~main__tokenlen~0 > 0; {7512#true} is VALID [2020-07-10 15:28:52,107 INFO L280 TraceCheckUtils]: 14: Hoare triple {7512#true} assume ~main__scheme~0 >= 0; {7512#true} is VALID [2020-07-10 15:28:52,107 INFO L280 TraceCheckUtils]: 15: Hoare triple {7512#true} assume !(0 == ~main__scheme~0); {7512#true} is VALID [2020-07-10 15:28:52,108 INFO L280 TraceCheckUtils]: 16: Hoare triple {7512#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7512#true} is VALID [2020-07-10 15:28:52,108 INFO L280 TraceCheckUtils]: 17: Hoare triple {7512#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7512#true} is VALID [2020-07-10 15:28:52,108 INFO L280 TraceCheckUtils]: 18: Hoare triple {7512#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {7512#true} is VALID [2020-07-10 15:28:52,108 INFO L280 TraceCheckUtils]: 19: Hoare triple {7512#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7512#true} is VALID [2020-07-10 15:28:52,109 INFO L280 TraceCheckUtils]: 20: Hoare triple {7512#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7512#true} is VALID [2020-07-10 15:28:52,109 INFO L280 TraceCheckUtils]: 21: Hoare triple {7512#true} assume !(0 == ~__VERIFIER_assert__cond~3); {7512#true} is VALID [2020-07-10 15:28:52,109 INFO L280 TraceCheckUtils]: 22: Hoare triple {7512#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {7512#true} is VALID [2020-07-10 15:28:52,109 INFO L280 TraceCheckUtils]: 23: Hoare triple {7512#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {7512#true} is VALID [2020-07-10 15:28:52,110 INFO L280 TraceCheckUtils]: 24: Hoare triple {7512#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7512#true} is VALID [2020-07-10 15:28:52,110 INFO L280 TraceCheckUtils]: 25: Hoare triple {7512#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7512#true} is VALID [2020-07-10 15:28:52,110 INFO L280 TraceCheckUtils]: 26: Hoare triple {7512#true} assume !(0 == ~__VERIFIER_assert__cond~5); {7512#true} is VALID [2020-07-10 15:28:52,110 INFO L280 TraceCheckUtils]: 27: Hoare triple {7512#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7512#true} is VALID [2020-07-10 15:28:52,111 INFO L280 TraceCheckUtils]: 28: Hoare triple {7512#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7512#true} is VALID [2020-07-10 15:28:52,111 INFO L280 TraceCheckUtils]: 29: Hoare triple {7512#true} assume !(0 == ~__VERIFIER_assert__cond~7); {7512#true} is VALID [2020-07-10 15:28:52,111 INFO L280 TraceCheckUtils]: 30: Hoare triple {7512#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {7512#true} is VALID [2020-07-10 15:28:52,112 INFO L280 TraceCheckUtils]: 31: Hoare triple {7512#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7512#true} is VALID [2020-07-10 15:28:52,113 INFO L280 TraceCheckUtils]: 32: Hoare triple {7512#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7517#(or (and (<= 0 main_~main__cp~0) (= 1 main_~__VERIFIER_assert__cond~9)) (and (= 0 main_~__VERIFIER_assert__cond~9) (< main_~main__cp~0 0)))} is VALID [2020-07-10 15:28:52,114 INFO L280 TraceCheckUtils]: 33: Hoare triple {7517#(or (and (<= 0 main_~main__cp~0) (= 1 main_~__VERIFIER_assert__cond~9)) (and (= 0 main_~__VERIFIER_assert__cond~9) (< main_~main__cp~0 0)))} assume !(0 == ~__VERIFIER_assert__cond~9); {7518#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:52,115 INFO L280 TraceCheckUtils]: 34: Hoare triple {7518#(<= 0 main_~main__cp~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7518#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:52,115 INFO L280 TraceCheckUtils]: 35: Hoare triple {7518#(<= 0 main_~main__cp~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7518#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:52,116 INFO L280 TraceCheckUtils]: 36: Hoare triple {7518#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7518#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:52,117 INFO L280 TraceCheckUtils]: 37: Hoare triple {7518#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7518#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:52,117 INFO L280 TraceCheckUtils]: 38: Hoare triple {7518#(<= 0 main_~main__cp~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {7518#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:52,118 INFO L280 TraceCheckUtils]: 39: Hoare triple {7518#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {7518#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:52,119 INFO L280 TraceCheckUtils]: 40: Hoare triple {7518#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {7518#(<= 0 main_~main__cp~0)} is VALID [2020-07-10 15:28:52,120 INFO L280 TraceCheckUtils]: 41: Hoare triple {7518#(<= 0 main_~main__cp~0)} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {7519#(not (= main_~__VERIFIER_assert__cond~15 0))} is VALID [2020-07-10 15:28:52,121 INFO L280 TraceCheckUtils]: 42: Hoare triple {7519#(not (= main_~__VERIFIER_assert__cond~15 0))} assume 0 == ~__VERIFIER_assert__cond~15; {7513#false} is VALID [2020-07-10 15:28:52,121 INFO L280 TraceCheckUtils]: 43: Hoare triple {7513#false} assume !false; {7513#false} is VALID [2020-07-10 15:28:52,124 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-10 15:28:52,124 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776483680] [2020-07-10 15:28:52,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:52,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:52,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393228321] [2020-07-10 15:28:52,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-07-10 15:28:52,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:52,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:52,182 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:52,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:52,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:52,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:52,183 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 6 states. [2020-07-10 15:28:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:52,806 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2020-07-10 15:28:52,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:52,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-07-10 15:28:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:52,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2020-07-10 15:28:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2020-07-10 15:28:52,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2020-07-10 15:28:52,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:52,930 INFO L225 Difference]: With dead ends: 75 [2020-07-10 15:28:52,931 INFO L226 Difference]: Without dead ends: 73 [2020-07-10 15:28:52,931 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:28:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-10 15:28:53,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2020-07-10 15:28:53,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:53,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 67 states. [2020-07-10 15:28:53,052 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 67 states. [2020-07-10 15:28:53,053 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 67 states. [2020-07-10 15:28:53,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:53,059 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2020-07-10 15:28:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2020-07-10 15:28:53,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:53,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:53,060 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 73 states. [2020-07-10 15:28:53,060 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 73 states. [2020-07-10 15:28:53,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:53,063 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2020-07-10 15:28:53,063 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2020-07-10 15:28:53,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:53,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:53,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:53,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:53,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-10 15:28:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2020-07-10 15:28:53,067 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 44 [2020-07-10 15:28:53,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:53,067 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2020-07-10 15:28:53,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:53,068 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2020-07-10 15:28:53,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 15:28:53,069 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:53,069 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:53,069 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-07-10 15:28:53,072 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:53,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:53,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1562566919, now seen corresponding path program 1 times [2020-07-10 15:28:53,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:53,073 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415241436] [2020-07-10 15:28:53,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:53,320 INFO L280 TraceCheckUtils]: 0: Hoare triple {7848#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {7839#true} is VALID [2020-07-10 15:28:53,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {7839#true} assume true; {7839#true} is VALID [2020-07-10 15:28:53,321 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {7839#true} {7839#true} #223#return; {7839#true} is VALID [2020-07-10 15:28:53,322 INFO L263 TraceCheckUtils]: 0: Hoare triple {7839#true} call ULTIMATE.init(); {7848#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:53,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {7848#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {7839#true} is VALID [2020-07-10 15:28:53,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {7839#true} assume true; {7839#true} is VALID [2020-07-10 15:28:53,324 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7839#true} {7839#true} #223#return; {7839#true} is VALID [2020-07-10 15:28:53,324 INFO L263 TraceCheckUtils]: 4: Hoare triple {7839#true} call #t~ret7 := main(); {7839#true} is VALID [2020-07-10 15:28:53,324 INFO L280 TraceCheckUtils]: 5: Hoare triple {7839#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {7839#true} is VALID [2020-07-10 15:28:53,324 INFO L280 TraceCheckUtils]: 6: Hoare triple {7839#true} assume !!(~main__urilen~0 <= 1000000); {7839#true} is VALID [2020-07-10 15:28:53,325 INFO L280 TraceCheckUtils]: 7: Hoare triple {7839#true} assume !!(~main__urilen~0 >= -1000000); {7839#true} is VALID [2020-07-10 15:28:53,325 INFO L280 TraceCheckUtils]: 8: Hoare triple {7839#true} assume !!(~main__tokenlen~0 <= 1000000); {7839#true} is VALID [2020-07-10 15:28:53,325 INFO L280 TraceCheckUtils]: 9: Hoare triple {7839#true} assume !!(~main__tokenlen~0 >= -1000000); {7839#true} is VALID [2020-07-10 15:28:53,325 INFO L280 TraceCheckUtils]: 10: Hoare triple {7839#true} assume !!(~main__scheme~0 <= 1000000); {7839#true} is VALID [2020-07-10 15:28:53,326 INFO L280 TraceCheckUtils]: 11: Hoare triple {7839#true} assume !!(~main__scheme~0 >= -1000000); {7839#true} is VALID [2020-07-10 15:28:53,326 INFO L280 TraceCheckUtils]: 12: Hoare triple {7839#true} assume ~main__urilen~0 > 0; {7839#true} is VALID [2020-07-10 15:28:53,326 INFO L280 TraceCheckUtils]: 13: Hoare triple {7839#true} assume ~main__tokenlen~0 > 0; {7839#true} is VALID [2020-07-10 15:28:53,326 INFO L280 TraceCheckUtils]: 14: Hoare triple {7839#true} assume ~main__scheme~0 >= 0; {7839#true} is VALID [2020-07-10 15:28:53,326 INFO L280 TraceCheckUtils]: 15: Hoare triple {7839#true} assume !(0 == ~main__scheme~0); {7839#true} is VALID [2020-07-10 15:28:53,327 INFO L280 TraceCheckUtils]: 16: Hoare triple {7839#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,328 INFO L280 TraceCheckUtils]: 17: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,329 INFO L280 TraceCheckUtils]: 18: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,330 INFO L280 TraceCheckUtils]: 19: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,330 INFO L280 TraceCheckUtils]: 20: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,331 INFO L280 TraceCheckUtils]: 21: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,332 INFO L280 TraceCheckUtils]: 22: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,333 INFO L280 TraceCheckUtils]: 23: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,334 INFO L280 TraceCheckUtils]: 24: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,334 INFO L280 TraceCheckUtils]: 25: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,335 INFO L280 TraceCheckUtils]: 26: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,335 INFO L280 TraceCheckUtils]: 27: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,336 INFO L280 TraceCheckUtils]: 28: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,337 INFO L280 TraceCheckUtils]: 29: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,338 INFO L280 TraceCheckUtils]: 30: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,339 INFO L280 TraceCheckUtils]: 31: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,339 INFO L280 TraceCheckUtils]: 32: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,340 INFO L280 TraceCheckUtils]: 33: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,341 INFO L280 TraceCheckUtils]: 34: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,341 INFO L280 TraceCheckUtils]: 35: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,342 INFO L280 TraceCheckUtils]: 36: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,343 INFO L280 TraceCheckUtils]: 37: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7846#(or (<= (+ main_~main__cp~0 2) main_~main__urilen~0) (not (= 0 main_~main____CPAchecker_TMP_3~0)))} is VALID [2020-07-10 15:28:53,344 INFO L280 TraceCheckUtils]: 38: Hoare triple {7846#(or (<= (+ main_~main__cp~0 2) main_~main__urilen~0) (not (= 0 main_~main____CPAchecker_TMP_3~0)))} assume !!(0 == ~main____CPAchecker_TMP_3~0); {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,345 INFO L280 TraceCheckUtils]: 39: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,347 INFO L280 TraceCheckUtils]: 40: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,348 INFO L280 TraceCheckUtils]: 41: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7847#(not (= main_~__VERIFIER_assert__cond~10 0))} is VALID [2020-07-10 15:28:53,349 INFO L280 TraceCheckUtils]: 42: Hoare triple {7847#(not (= main_~__VERIFIER_assert__cond~10 0))} assume 0 == ~__VERIFIER_assert__cond~10; {7840#false} is VALID [2020-07-10 15:28:53,350 INFO L280 TraceCheckUtils]: 43: Hoare triple {7840#false} assume !false; {7840#false} is VALID [2020-07-10 15:28:53,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:53,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415241436] [2020-07-10 15:28:53,354 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162689513] [2020-07-10 15:28:53,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:28:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:53,401 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:28:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:53,415 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:28:53,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:28:53,671 INFO L263 TraceCheckUtils]: 0: Hoare triple {7839#true} call ULTIMATE.init(); {7839#true} is VALID [2020-07-10 15:28:53,671 INFO L280 TraceCheckUtils]: 1: Hoare triple {7839#true} ~__return_main~0 := 0;~__return_375~0 := 0; {7839#true} is VALID [2020-07-10 15:28:53,671 INFO L280 TraceCheckUtils]: 2: Hoare triple {7839#true} assume true; {7839#true} is VALID [2020-07-10 15:28:53,672 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7839#true} {7839#true} #223#return; {7839#true} is VALID [2020-07-10 15:28:53,672 INFO L263 TraceCheckUtils]: 4: Hoare triple {7839#true} call #t~ret7 := main(); {7839#true} is VALID [2020-07-10 15:28:53,672 INFO L280 TraceCheckUtils]: 5: Hoare triple {7839#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {7839#true} is VALID [2020-07-10 15:28:53,672 INFO L280 TraceCheckUtils]: 6: Hoare triple {7839#true} assume !!(~main__urilen~0 <= 1000000); {7839#true} is VALID [2020-07-10 15:28:53,673 INFO L280 TraceCheckUtils]: 7: Hoare triple {7839#true} assume !!(~main__urilen~0 >= -1000000); {7839#true} is VALID [2020-07-10 15:28:53,673 INFO L280 TraceCheckUtils]: 8: Hoare triple {7839#true} assume !!(~main__tokenlen~0 <= 1000000); {7839#true} is VALID [2020-07-10 15:28:53,673 INFO L280 TraceCheckUtils]: 9: Hoare triple {7839#true} assume !!(~main__tokenlen~0 >= -1000000); {7839#true} is VALID [2020-07-10 15:28:53,674 INFO L280 TraceCheckUtils]: 10: Hoare triple {7839#true} assume !!(~main__scheme~0 <= 1000000); {7839#true} is VALID [2020-07-10 15:28:53,674 INFO L280 TraceCheckUtils]: 11: Hoare triple {7839#true} assume !!(~main__scheme~0 >= -1000000); {7839#true} is VALID [2020-07-10 15:28:53,674 INFO L280 TraceCheckUtils]: 12: Hoare triple {7839#true} assume ~main__urilen~0 > 0; {7839#true} is VALID [2020-07-10 15:28:53,675 INFO L280 TraceCheckUtils]: 13: Hoare triple {7839#true} assume ~main__tokenlen~0 > 0; {7839#true} is VALID [2020-07-10 15:28:53,675 INFO L280 TraceCheckUtils]: 14: Hoare triple {7839#true} assume ~main__scheme~0 >= 0; {7839#true} is VALID [2020-07-10 15:28:53,675 INFO L280 TraceCheckUtils]: 15: Hoare triple {7839#true} assume !(0 == ~main__scheme~0); {7839#true} is VALID [2020-07-10 15:28:53,677 INFO L280 TraceCheckUtils]: 16: Hoare triple {7839#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,678 INFO L280 TraceCheckUtils]: 17: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,679 INFO L280 TraceCheckUtils]: 18: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,680 INFO L280 TraceCheckUtils]: 19: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,681 INFO L280 TraceCheckUtils]: 20: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,682 INFO L280 TraceCheckUtils]: 21: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~3); {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,684 INFO L280 TraceCheckUtils]: 22: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,685 INFO L280 TraceCheckUtils]: 23: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_1~0); {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,686 INFO L280 TraceCheckUtils]: 24: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,687 INFO L280 TraceCheckUtils]: 25: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,688 INFO L280 TraceCheckUtils]: 26: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~5); {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,689 INFO L280 TraceCheckUtils]: 27: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,690 INFO L280 TraceCheckUtils]: 28: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,690 INFO L280 TraceCheckUtils]: 29: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~7); {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,692 INFO L280 TraceCheckUtils]: 30: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,694 INFO L280 TraceCheckUtils]: 31: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,695 INFO L280 TraceCheckUtils]: 32: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,695 INFO L280 TraceCheckUtils]: 33: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~9); {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,696 INFO L280 TraceCheckUtils]: 34: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,696 INFO L280 TraceCheckUtils]: 35: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,697 INFO L280 TraceCheckUtils]: 36: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,697 INFO L280 TraceCheckUtils]: 37: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,698 INFO L280 TraceCheckUtils]: 38: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} assume !!(0 == ~main____CPAchecker_TMP_3~0); {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,699 INFO L280 TraceCheckUtils]: 39: Hoare triple {7845#(< (+ main_~main__cp~0 1) main_~main__urilen~0)} ~main__cp~0 := 1 + ~main__cp~0; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,700 INFO L280 TraceCheckUtils]: 40: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__cp~0 != ~main__urilen~0 - 1; {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} is VALID [2020-07-10 15:28:53,701 INFO L280 TraceCheckUtils]: 41: Hoare triple {7844#(<= (+ main_~main__cp~0 1) main_~main__urilen~0)} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {7975#(<= 1 main_~__VERIFIER_assert__cond~10)} is VALID [2020-07-10 15:28:53,702 INFO L280 TraceCheckUtils]: 42: Hoare triple {7975#(<= 1 main_~__VERIFIER_assert__cond~10)} assume 0 == ~__VERIFIER_assert__cond~10; {7840#false} is VALID [2020-07-10 15:28:53,703 INFO L280 TraceCheckUtils]: 43: Hoare triple {7840#false} assume !false; {7840#false} is VALID [2020-07-10 15:28:53,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:53,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:28:53,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-07-10 15:28:53,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244130202] [2020-07-10 15:28:53,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-10 15:28:53,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:53,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:28:53,781 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-10 15:28:53,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:28:53,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:53,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:28:53,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:53,782 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 8 states. [2020-07-10 15:28:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:54,314 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2020-07-10 15:28:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:28:54,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 44 [2020-07-10 15:28:54,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2020-07-10 15:28:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:28:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 56 transitions. [2020-07-10 15:28:54,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 56 transitions. [2020-07-10 15:28:54,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:54,408 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:28:54,408 INFO L226 Difference]: Without dead ends: 65 [2020-07-10 15:28:54,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:28:54,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-10 15:28:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-07-10 15:28:54,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:54,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2020-07-10 15:28:54,508 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-10 15:28:54,509 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-10 15:28:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:54,511 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-10 15:28:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-10 15:28:54,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:54,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:54,512 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2020-07-10 15:28:54,512 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2020-07-10 15:28:54,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:54,513 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-10 15:28:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-10 15:28:54,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:54,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:54,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:54,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-07-10 15:28:54,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2020-07-10 15:28:54,516 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 44 [2020-07-10 15:28:54,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:54,516 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2020-07-10 15:28:54,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:28:54,516 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-10 15:28:54,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-07-10 15:28:54,517 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:54,517 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-10 15:28:54,728 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2020-07-10 15:28:54,729 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:54,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:54,730 INFO L82 PathProgramCache]: Analyzing trace with hash 790604971, now seen corresponding path program 1 times [2020-07-10 15:28:54,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:54,731 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770325946] [2020-07-10 15:28:54,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:54,844 INFO L280 TraceCheckUtils]: 0: Hoare triple {8281#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {8273#true} is VALID [2020-07-10 15:28:54,845 INFO L280 TraceCheckUtils]: 1: Hoare triple {8273#true} assume true; {8273#true} is VALID [2020-07-10 15:28:54,845 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8273#true} {8273#true} #223#return; {8273#true} is VALID [2020-07-10 15:28:54,846 INFO L263 TraceCheckUtils]: 0: Hoare triple {8273#true} call ULTIMATE.init(); {8281#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:54,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {8281#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {8273#true} is VALID [2020-07-10 15:28:54,847 INFO L280 TraceCheckUtils]: 2: Hoare triple {8273#true} assume true; {8273#true} is VALID [2020-07-10 15:28:54,847 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8273#true} {8273#true} #223#return; {8273#true} is VALID [2020-07-10 15:28:54,848 INFO L263 TraceCheckUtils]: 4: Hoare triple {8273#true} call #t~ret7 := main(); {8273#true} is VALID [2020-07-10 15:28:54,848 INFO L280 TraceCheckUtils]: 5: Hoare triple {8273#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {8273#true} is VALID [2020-07-10 15:28:54,848 INFO L280 TraceCheckUtils]: 6: Hoare triple {8273#true} assume !!(~main__urilen~0 <= 1000000); {8273#true} is VALID [2020-07-10 15:28:54,848 INFO L280 TraceCheckUtils]: 7: Hoare triple {8273#true} assume !!(~main__urilen~0 >= -1000000); {8273#true} is VALID [2020-07-10 15:28:54,849 INFO L280 TraceCheckUtils]: 8: Hoare triple {8273#true} assume !!(~main__tokenlen~0 <= 1000000); {8273#true} is VALID [2020-07-10 15:28:54,849 INFO L280 TraceCheckUtils]: 9: Hoare triple {8273#true} assume !!(~main__tokenlen~0 >= -1000000); {8273#true} is VALID [2020-07-10 15:28:54,849 INFO L280 TraceCheckUtils]: 10: Hoare triple {8273#true} assume !!(~main__scheme~0 <= 1000000); {8273#true} is VALID [2020-07-10 15:28:54,849 INFO L280 TraceCheckUtils]: 11: Hoare triple {8273#true} assume !!(~main__scheme~0 >= -1000000); {8273#true} is VALID [2020-07-10 15:28:54,850 INFO L280 TraceCheckUtils]: 12: Hoare triple {8273#true} assume ~main__urilen~0 > 0; {8273#true} is VALID [2020-07-10 15:28:54,850 INFO L280 TraceCheckUtils]: 13: Hoare triple {8273#true} assume ~main__tokenlen~0 > 0; {8273#true} is VALID [2020-07-10 15:28:54,850 INFO L280 TraceCheckUtils]: 14: Hoare triple {8273#true} assume ~main__scheme~0 >= 0; {8273#true} is VALID [2020-07-10 15:28:54,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {8273#true} assume !(0 == ~main__scheme~0); {8273#true} is VALID [2020-07-10 15:28:54,851 INFO L280 TraceCheckUtils]: 16: Hoare triple {8273#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8273#true} is VALID [2020-07-10 15:28:54,851 INFO L280 TraceCheckUtils]: 17: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8273#true} is VALID [2020-07-10 15:28:54,851 INFO L280 TraceCheckUtils]: 18: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {8273#true} is VALID [2020-07-10 15:28:54,851 INFO L280 TraceCheckUtils]: 19: Hoare triple {8273#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8273#true} is VALID [2020-07-10 15:28:54,851 INFO L280 TraceCheckUtils]: 20: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8273#true} is VALID [2020-07-10 15:28:54,852 INFO L280 TraceCheckUtils]: 21: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8273#true} is VALID [2020-07-10 15:28:54,852 INFO L280 TraceCheckUtils]: 22: Hoare triple {8273#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {8273#true} is VALID [2020-07-10 15:28:54,852 INFO L280 TraceCheckUtils]: 23: Hoare triple {8273#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8273#true} is VALID [2020-07-10 15:28:54,853 INFO L280 TraceCheckUtils]: 24: Hoare triple {8273#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8273#true} is VALID [2020-07-10 15:28:54,853 INFO L280 TraceCheckUtils]: 25: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8273#true} is VALID [2020-07-10 15:28:54,853 INFO L280 TraceCheckUtils]: 26: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8273#true} is VALID [2020-07-10 15:28:54,853 INFO L280 TraceCheckUtils]: 27: Hoare triple {8273#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8273#true} is VALID [2020-07-10 15:28:54,853 INFO L280 TraceCheckUtils]: 28: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8273#true} is VALID [2020-07-10 15:28:54,854 INFO L280 TraceCheckUtils]: 29: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8273#true} is VALID [2020-07-10 15:28:54,854 INFO L280 TraceCheckUtils]: 30: Hoare triple {8273#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {8273#true} is VALID [2020-07-10 15:28:54,854 INFO L280 TraceCheckUtils]: 31: Hoare triple {8273#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8273#true} is VALID [2020-07-10 15:28:54,854 INFO L280 TraceCheckUtils]: 32: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8273#true} is VALID [2020-07-10 15:28:54,854 INFO L280 TraceCheckUtils]: 33: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~9); {8273#true} is VALID [2020-07-10 15:28:54,855 INFO L280 TraceCheckUtils]: 34: Hoare triple {8273#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8273#true} is VALID [2020-07-10 15:28:54,855 INFO L280 TraceCheckUtils]: 35: Hoare triple {8273#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8273#true} is VALID [2020-07-10 15:28:54,855 INFO L280 TraceCheckUtils]: 36: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8273#true} is VALID [2020-07-10 15:28:54,855 INFO L280 TraceCheckUtils]: 37: Hoare triple {8273#true} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {8273#true} is VALID [2020-07-10 15:28:54,855 INFO L280 TraceCheckUtils]: 38: Hoare triple {8273#true} assume !!(0 == ~main____CPAchecker_TMP_3~0); {8273#true} is VALID [2020-07-10 15:28:54,856 INFO L280 TraceCheckUtils]: 39: Hoare triple {8273#true} ~main__cp~0 := 1 + ~main__cp~0; {8273#true} is VALID [2020-07-10 15:28:54,856 INFO L280 TraceCheckUtils]: 40: Hoare triple {8273#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8273#true} is VALID [2020-07-10 15:28:54,858 INFO L280 TraceCheckUtils]: 41: Hoare triple {8273#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8278#(or (and (= main_~__VERIFIER_assert__cond~10 1) (< main_~main__cp~0 main_~main__urilen~0)) (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~10 0)))} is VALID [2020-07-10 15:28:54,859 INFO L280 TraceCheckUtils]: 42: Hoare triple {8278#(or (and (= main_~__VERIFIER_assert__cond~10 1) (< main_~main__cp~0 main_~main__urilen~0)) (and (<= main_~main__urilen~0 main_~main__cp~0) (= main_~__VERIFIER_assert__cond~10 0)))} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8279#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:54,860 INFO L280 TraceCheckUtils]: 43: Hoare triple {8279#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {8279#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:54,860 INFO L280 TraceCheckUtils]: 44: Hoare triple {8279#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8279#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:54,861 INFO L280 TraceCheckUtils]: 45: Hoare triple {8279#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8279#(< main_~main__cp~0 main_~main__urilen~0)} is VALID [2020-07-10 15:28:54,862 INFO L280 TraceCheckUtils]: 46: Hoare triple {8279#(< main_~main__cp~0 main_~main__urilen~0)} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {8280#(not (= main_~__VERIFIER_assert__cond~14 0))} is VALID [2020-07-10 15:28:54,862 INFO L280 TraceCheckUtils]: 47: Hoare triple {8280#(not (= main_~__VERIFIER_assert__cond~14 0))} assume 0 == ~__VERIFIER_assert__cond~14; {8274#false} is VALID [2020-07-10 15:28:54,863 INFO L280 TraceCheckUtils]: 48: Hoare triple {8274#false} assume !false; {8274#false} is VALID [2020-07-10 15:28:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:54,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770325946] [2020-07-10 15:28:54,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:54,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:28:54,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824147849] [2020-07-10 15:28:54,867 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 15:28:54,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:54,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:28:54,924 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:54,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:28:54,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:54,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:28:54,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:28:54,925 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 6 states. [2020-07-10 15:28:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:55,631 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2020-07-10 15:28:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:28:55,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2020-07-10 15:28:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:55,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-10 15:28:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:28:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2020-07-10 15:28:55,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 73 transitions. [2020-07-10 15:28:55,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:55,753 INFO L225 Difference]: With dead ends: 77 [2020-07-10 15:28:55,754 INFO L226 Difference]: Without dead ends: 75 [2020-07-10 15:28:55,755 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:28:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-07-10 15:28:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 55. [2020-07-10 15:28:55,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:55,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand 55 states. [2020-07-10 15:28:55,860 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 55 states. [2020-07-10 15:28:55,860 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 55 states. [2020-07-10 15:28:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:55,861 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2020-07-10 15:28:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-07-10 15:28:55,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:55,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:55,862 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 75 states. [2020-07-10 15:28:55,862 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 75 states. [2020-07-10 15:28:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:55,864 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2020-07-10 15:28:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-07-10 15:28:55,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:55,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:55,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:55,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 15:28:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2020-07-10 15:28:55,867 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 49 [2020-07-10 15:28:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:55,867 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2020-07-10 15:28:55,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:28:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2020-07-10 15:28:55,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 15:28:55,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:55,868 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-10 15:28:55,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-07-10 15:28:55,868 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr17ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:55,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:55,869 INFO L82 PathProgramCache]: Analyzing trace with hash 705971477, now seen corresponding path program 1 times [2020-07-10 15:28:55,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:55,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977155130] [2020-07-10 15:28:55,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:55,955 INFO L280 TraceCheckUtils]: 0: Hoare triple {8611#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {8604#true} is VALID [2020-07-10 15:28:55,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {8604#true} assume true; {8604#true} is VALID [2020-07-10 15:28:55,955 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {8604#true} {8604#true} #223#return; {8604#true} is VALID [2020-07-10 15:28:55,957 INFO L263 TraceCheckUtils]: 0: Hoare triple {8604#true} call ULTIMATE.init(); {8611#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} is VALID [2020-07-10 15:28:55,957 INFO L280 TraceCheckUtils]: 1: Hoare triple {8611#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|))} ~__return_main~0 := 0;~__return_375~0 := 0; {8604#true} is VALID [2020-07-10 15:28:55,957 INFO L280 TraceCheckUtils]: 2: Hoare triple {8604#true} assume true; {8604#true} is VALID [2020-07-10 15:28:55,958 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {8604#true} {8604#true} #223#return; {8604#true} is VALID [2020-07-10 15:28:55,958 INFO L263 TraceCheckUtils]: 4: Hoare triple {8604#true} call #t~ret7 := main(); {8604#true} is VALID [2020-07-10 15:28:55,958 INFO L280 TraceCheckUtils]: 5: Hoare triple {8604#true} havoc ~main__scheme~0;havoc ~main__urilen~0;havoc ~main__tokenlen~0;havoc ~main__cp~0;havoc ~main__c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__urilen~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~main__tokenlen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~main__scheme~0 := #t~nondet2;havoc #t~nondet2; {8604#true} is VALID [2020-07-10 15:28:55,958 INFO L280 TraceCheckUtils]: 6: Hoare triple {8604#true} assume !!(~main__urilen~0 <= 1000000); {8604#true} is VALID [2020-07-10 15:28:55,958 INFO L280 TraceCheckUtils]: 7: Hoare triple {8604#true} assume !!(~main__urilen~0 >= -1000000); {8604#true} is VALID [2020-07-10 15:28:55,959 INFO L280 TraceCheckUtils]: 8: Hoare triple {8604#true} assume !!(~main__tokenlen~0 <= 1000000); {8604#true} is VALID [2020-07-10 15:28:55,959 INFO L280 TraceCheckUtils]: 9: Hoare triple {8604#true} assume !!(~main__tokenlen~0 >= -1000000); {8604#true} is VALID [2020-07-10 15:28:55,959 INFO L280 TraceCheckUtils]: 10: Hoare triple {8604#true} assume !!(~main__scheme~0 <= 1000000); {8604#true} is VALID [2020-07-10 15:28:55,959 INFO L280 TraceCheckUtils]: 11: Hoare triple {8604#true} assume !!(~main__scheme~0 >= -1000000); {8604#true} is VALID [2020-07-10 15:28:55,959 INFO L280 TraceCheckUtils]: 12: Hoare triple {8604#true} assume ~main__urilen~0 > 0; {8604#true} is VALID [2020-07-10 15:28:55,960 INFO L280 TraceCheckUtils]: 13: Hoare triple {8604#true} assume ~main__tokenlen~0 > 0; {8604#true} is VALID [2020-07-10 15:28:55,960 INFO L280 TraceCheckUtils]: 14: Hoare triple {8604#true} assume ~main__scheme~0 >= 0; {8604#true} is VALID [2020-07-10 15:28:55,960 INFO L280 TraceCheckUtils]: 15: Hoare triple {8604#true} assume !(0 == ~main__scheme~0); {8604#true} is VALID [2020-07-10 15:28:55,960 INFO L280 TraceCheckUtils]: 16: Hoare triple {8604#true} assume !(~main__urilen~0 - 1 < ~main__scheme~0);~main__cp~0 := ~main__scheme~0;havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__cp~0 - 1 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {8604#true} is VALID [2020-07-10 15:28:55,960 INFO L280 TraceCheckUtils]: 17: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~0);havoc ~__tmp_2~0;~__tmp_2~0 := (if 0 <= ~main__cp~0 - 1 then 1 else 0);havoc ~__VERIFIER_assert__cond~1;~__VERIFIER_assert__cond~1 := ~__tmp_2~0; {8604#true} is VALID [2020-07-10 15:28:55,961 INFO L280 TraceCheckUtils]: 18: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~1);havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet3;havoc #t~nondet3; {8604#true} is VALID [2020-07-10 15:28:55,961 INFO L280 TraceCheckUtils]: 19: Hoare triple {8604#true} assume !(0 == ~main____CPAchecker_TMP_0~0);havoc ~__tmp_3~0;~__tmp_3~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~2;~__VERIFIER_assert__cond~2 := ~__tmp_3~0; {8604#true} is VALID [2020-07-10 15:28:55,961 INFO L280 TraceCheckUtils]: 20: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~2);havoc ~__tmp_4~0;~__tmp_4~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~3;~__VERIFIER_assert__cond~3 := ~__tmp_4~0; {8604#true} is VALID [2020-07-10 15:28:55,961 INFO L280 TraceCheckUtils]: 21: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~3); {8604#true} is VALID [2020-07-10 15:28:55,962 INFO L280 TraceCheckUtils]: 22: Hoare triple {8604#true} assume ~main__cp~0 != ~main__urilen~0 - 1;havoc ~main____CPAchecker_TMP_1~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main____CPAchecker_TMP_1~0 := #t~nondet4;havoc #t~nondet4; {8604#true} is VALID [2020-07-10 15:28:55,962 INFO L280 TraceCheckUtils]: 23: Hoare triple {8604#true} assume !(0 == ~main____CPAchecker_TMP_1~0); {8604#true} is VALID [2020-07-10 15:28:55,962 INFO L280 TraceCheckUtils]: 24: Hoare triple {8604#true} havoc ~__tmp_5~0;~__tmp_5~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~4;~__VERIFIER_assert__cond~4 := ~__tmp_5~0; {8604#true} is VALID [2020-07-10 15:28:55,963 INFO L280 TraceCheckUtils]: 25: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~4);havoc ~__tmp_6~0;~__tmp_6~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~5;~__VERIFIER_assert__cond~5 := ~__tmp_6~0; {8604#true} is VALID [2020-07-10 15:28:55,963 INFO L280 TraceCheckUtils]: 26: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~5); {8604#true} is VALID [2020-07-10 15:28:55,963 INFO L280 TraceCheckUtils]: 27: Hoare triple {8604#true} assume !(~main__cp~0 == ~main__urilen~0 - 1);havoc ~__tmp_7~0;~__tmp_7~0 := (if 1 + ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~6;~__VERIFIER_assert__cond~6 := ~__tmp_7~0; {8604#true} is VALID [2020-07-10 15:28:55,963 INFO L280 TraceCheckUtils]: 28: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~6);havoc ~__tmp_8~0;~__tmp_8~0 := (if 0 <= 1 + ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~7;~__VERIFIER_assert__cond~7 := ~__tmp_8~0; {8604#true} is VALID [2020-07-10 15:28:55,963 INFO L280 TraceCheckUtils]: 29: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~7); {8604#true} is VALID [2020-07-10 15:28:55,964 INFO L280 TraceCheckUtils]: 30: Hoare triple {8604#true} assume !(1 + ~main__cp~0 == ~main__urilen~0 - 1);~main__cp~0 := 1 + ~main__cp~0;~main__scheme~0 := ~main__cp~0;havoc ~main____CPAchecker_TMP_2~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_2~0 := #t~nondet5;havoc #t~nondet5; {8604#true} is VALID [2020-07-10 15:28:55,964 INFO L280 TraceCheckUtils]: 31: Hoare triple {8604#true} assume !(0 == ~main____CPAchecker_TMP_2~0);~main__c~0 := 0;havoc ~__tmp_9~0;~__tmp_9~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~8;~__VERIFIER_assert__cond~8 := ~__tmp_9~0; {8604#true} is VALID [2020-07-10 15:28:55,964 INFO L280 TraceCheckUtils]: 32: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~8);havoc ~__tmp_10~0;~__tmp_10~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~9;~__VERIFIER_assert__cond~9 := ~__tmp_10~0; {8604#true} is VALID [2020-07-10 15:28:55,965 INFO L280 TraceCheckUtils]: 33: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~9); {8604#true} is VALID [2020-07-10 15:28:55,965 INFO L280 TraceCheckUtils]: 34: Hoare triple {8604#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8604#true} is VALID [2020-07-10 15:28:55,965 INFO L280 TraceCheckUtils]: 35: Hoare triple {8604#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8604#true} is VALID [2020-07-10 15:28:55,965 INFO L280 TraceCheckUtils]: 36: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8604#true} is VALID [2020-07-10 15:28:55,966 INFO L280 TraceCheckUtils]: 37: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {8604#true} is VALID [2020-07-10 15:28:55,966 INFO L280 TraceCheckUtils]: 38: Hoare triple {8604#true} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8604#true} is VALID [2020-07-10 15:28:55,966 INFO L280 TraceCheckUtils]: 39: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~12);havoc ~__tmp_14~0;~__tmp_14~0 := (if 0 <= ~main__c~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~13;~__VERIFIER_assert__cond~13 := ~__tmp_14~0; {8604#true} is VALID [2020-07-10 15:28:55,967 INFO L280 TraceCheckUtils]: 40: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~13);havoc ~__tmp_15~0;~__tmp_15~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~14;~__VERIFIER_assert__cond~14 := ~__tmp_15~0; {8604#true} is VALID [2020-07-10 15:28:55,967 INFO L280 TraceCheckUtils]: 41: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~14);havoc ~__tmp_16~0;~__tmp_16~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~15;~__VERIFIER_assert__cond~15 := ~__tmp_16~0; {8604#true} is VALID [2020-07-10 15:28:55,967 INFO L280 TraceCheckUtils]: 42: Hoare triple {8604#true} assume !(0 == ~__VERIFIER_assert__cond~15); {8604#true} is VALID [2020-07-10 15:28:55,967 INFO L280 TraceCheckUtils]: 43: Hoare triple {8604#true} ~main__cp~0 := 1 + ~main__cp~0; {8604#true} is VALID [2020-07-10 15:28:55,968 INFO L280 TraceCheckUtils]: 44: Hoare triple {8604#true} assume ~main__cp~0 != ~main__urilen~0 - 1; {8604#true} is VALID [2020-07-10 15:28:55,969 INFO L280 TraceCheckUtils]: 45: Hoare triple {8604#true} assume ~main__c~0 < ~main__tokenlen~0 - 1;havoc ~__tmp_11~0;~__tmp_11~0 := (if ~main__cp~0 < ~main__urilen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~10;~__VERIFIER_assert__cond~10 := ~__tmp_11~0; {8609#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} is VALID [2020-07-10 15:28:55,971 INFO L280 TraceCheckUtils]: 46: Hoare triple {8609#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~10);havoc ~__tmp_12~0;~__tmp_12~0 := (if 0 <= ~main__cp~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~11;~__VERIFIER_assert__cond~11 := ~__tmp_12~0; {8609#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} is VALID [2020-07-10 15:28:55,972 INFO L280 TraceCheckUtils]: 47: Hoare triple {8609#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} assume !(0 == ~__VERIFIER_assert__cond~11);havoc ~main____CPAchecker_TMP_3~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_3~0 := #t~nondet6;havoc #t~nondet6; {8609#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} is VALID [2020-07-10 15:28:55,973 INFO L280 TraceCheckUtils]: 48: Hoare triple {8609#(<= (+ main_~main__c~0 2) main_~main__tokenlen~0)} assume !(0 == ~main____CPAchecker_TMP_3~0);~main__c~0 := 1 + ~main__c~0;havoc ~__tmp_13~0;~__tmp_13~0 := (if ~main__c~0 < ~main__tokenlen~0 then 1 else 0);havoc ~__VERIFIER_assert__cond~12;~__VERIFIER_assert__cond~12 := ~__tmp_13~0; {8610#(not (= main_~__VERIFIER_assert__cond~12 0))} is VALID [2020-07-10 15:28:55,974 INFO L280 TraceCheckUtils]: 49: Hoare triple {8610#(not (= main_~__VERIFIER_assert__cond~12 0))} assume 0 == ~__VERIFIER_assert__cond~12; {8605#false} is VALID [2020-07-10 15:28:55,974 INFO L280 TraceCheckUtils]: 50: Hoare triple {8605#false} assume !false; {8605#false} is VALID [2020-07-10 15:28:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 15:28:55,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977155130] [2020-07-10 15:28:55,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:55,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:28:55,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772331879] [2020-07-10 15:28:55,979 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-07-10 15:28:55,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:55,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:28:56,034 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-10 15:28:56,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:28:56,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:56,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:28:56,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:28:56,036 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 5 states. [2020-07-10 15:28:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:56,536 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2020-07-10 15:28:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:28:56,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-07-10 15:28:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:28:56,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-10 15:28:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:28:56,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2020-07-10 15:28:56,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 62 transitions. [2020-07-10 15:28:56,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:56,630 INFO L225 Difference]: With dead ends: 60 [2020-07-10 15:28:56,630 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:28:56,631 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:56,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:28:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:28:56,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:28:56,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:56,632 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:56,632 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:56,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:56,633 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:56,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:56,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:56,634 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:56,634 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:28:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:28:56,634 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:28:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:56,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:56,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:28:56,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:28:56,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:28:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:28:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:28:56,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2020-07-10 15:28:56,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:28:56,636 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:28:56,636 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:28:56,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:28:56,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:28:56,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-07-10 15:28:56,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:28:56,855 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 102 [2020-07-10 15:28:56,985 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2020-07-10 15:28:57,234 WARN L193 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 33 [2020-07-10 15:28:57,734 WARN L193 SmtUtils]: Spent 475.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 72 [2020-07-10 15:28:57,977 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 31 [2020-07-10 15:28:58,307 WARN L193 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 75 [2020-07-10 15:28:58,315 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:58,315 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_375~0 |old(~__return_375~0)|)) [2020-07-10 15:28:58,316 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:58,316 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:28:58,316 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:28:58,316 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:28:58,316 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:28:58,316 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:28:58,316 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 15:28:58,316 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:28:58,316 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed. [2020-07-10 15:28:58,316 INFO L268 CegarLoopResult]: For program point L192(lines 192 352) no Hoare annotation was computed. [2020-07-10 15:28:58,316 INFO L268 CegarLoopResult]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 123) no Hoare annotation was computed. [2020-07-10 15:28:58,317 INFO L268 CegarLoopResult]: For program point L382(lines 382 391) no Hoare annotation was computed. [2020-07-10 15:28:58,317 INFO L268 CegarLoopResult]: For program point L93(lines 93 410) no Hoare annotation was computed. [2020-07-10 15:28:58,317 INFO L268 CegarLoopResult]: For program point L27(lines 27 435) no Hoare annotation was computed. [2020-07-10 15:28:58,317 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 437) no Hoare annotation was computed. [2020-07-10 15:28:58,317 INFO L268 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-07-10 15:28:58,317 INFO L264 CegarLoopResult]: At program point L399(lines 129 400) the Hoare annotation is: (and (< main_~main__cp~0 main_~main__urilen~0) (= |old(~__return_375~0)| ~__return_375~0) (= 1 main_~__VERIFIER_assert__cond~3) (let ((.cse0 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse1 (<= 1 main_~main__cp~0)) (.cse2 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse3 (< 0 main_~main__scheme~0))) (or (and (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse0 (not (= main_~__VERIFIER_assert__cond~16 0)) .cse1 .cse2 .cse3) (and (= 1 main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3)))) [2020-07-10 15:28:58,317 INFO L268 CegarLoopResult]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 253) no Hoare annotation was computed. [2020-07-10 15:28:58,318 INFO L268 CegarLoopResult]: For program point L102(lines 102 409) no Hoare annotation was computed. [2020-07-10 15:28:58,318 INFO L268 CegarLoopResult]: For program point L69(lines 69 414) no Hoare annotation was computed. [2020-07-10 15:28:58,318 INFO L264 CegarLoopResult]: At program point L325(lines 260 326) the Hoare annotation is: (let ((.cse19 (+ main_~main__cp~0 1))) (let ((.cse0 (= 1 main_~__VERIFIER_assert__cond~9)) (.cse1 (not (= 0 main_~__VERIFIER_assert__cond~8))) (.cse2 (not (= 0 main_~__VERIFIER_assert__cond~2))) (.cse3 (not (= 0 main_~__VERIFIER_assert__cond~5))) (.cse4 (not (= .cse19 main_~main__urilen~0))) (.cse5 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (= 1 main_~__VERIFIER_assert__cond~3)) (.cse8 (not (= 0 main_~__VERIFIER_assert__cond~6))) (.cse9 (= main_~__VERIFIER_assert__cond~10 1)) (.cse10 (not (= 0 main_~__VERIFIER_assert__cond~7))) (.cse11 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse12 (not (= main_~__VERIFIER_assert__cond~10 0))) (.cse13 (not (= 0 main_~__VERIFIER_assert__cond~9))) (.cse14 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse15 (<= .cse19 main_~main__urilen~0)) (.cse16 (<= 1 main_~main__cp~0)) (.cse17 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse18 (< 0 main_~main__scheme~0))) (or (and .cse0 .cse1 .cse2 (= 0 main_~main__c~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~14 0)) .cse3 .cse4 (not (= main_~__VERIFIER_assert__cond~15 0)) .cse5 .cse6 .cse7 .cse8 .cse9 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= main_~__VERIFIER_assert__cond~12 0)) (<= 1 main_~main__c~0))))) [2020-07-10 15:28:58,318 INFO L268 CegarLoopResult]: For program point L292(lines 292 316) no Hoare annotation was computed. [2020-07-10 15:28:58,318 INFO L268 CegarLoopResult]: For program point L160(lines 160 357) no Hoare annotation was computed. [2020-07-10 15:28:58,318 INFO L268 CegarLoopResult]: For program point L61(lines 61 420) no Hoare annotation was computed. [2020-07-10 15:28:58,318 INFO L268 CegarLoopResult]: For program point L251(lines 251 327) no Hoare annotation was computed. [2020-07-10 15:28:58,318 INFO L268 CegarLoopResult]: For program point L185(lines 185 353) no Hoare annotation was computed. [2020-07-10 15:28:58,319 INFO L268 CegarLoopResult]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2020-07-10 15:28:58,319 INFO L264 CegarLoopResult]: At program point L408(lines 102 409) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~0)) (= |old(~__return_375~0)| ~__return_375~0)) [2020-07-10 15:28:58,319 INFO L268 CegarLoopResult]: For program point L210(lines 210 344) no Hoare annotation was computed. [2020-07-10 15:28:58,319 INFO L268 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2020-07-10 15:28:58,319 INFO L268 CegarLoopResult]: For program point L45(lines 45 432) no Hoare annotation was computed. [2020-07-10 15:28:58,319 INFO L268 CegarLoopResult]: For program point L268(lines 268 320) no Hoare annotation was computed. [2020-07-10 15:28:58,319 INFO L268 CegarLoopResult]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 294) no Hoare annotation was computed. [2020-07-10 15:28:58,319 INFO L268 CegarLoopResult]: For program point L202(lines 202 351) no Hoare annotation was computed. [2020-07-10 15:28:58,319 INFO L268 CegarLoopResult]: For program point L260(lines 260 326) no Hoare annotation was computed. [2020-07-10 15:28:58,320 INFO L268 CegarLoopResult]: For program point L384(line 384) no Hoare annotation was computed. [2020-07-10 15:28:58,320 INFO L268 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-07-10 15:28:58,320 INFO L268 CegarLoopResult]: For program point L153(lines 153 358) no Hoare annotation was computed. [2020-07-10 15:28:58,320 INFO L268 CegarLoopResult]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 155) no Hoare annotation was computed. [2020-07-10 15:28:58,320 INFO L268 CegarLoopResult]: For program point L21(lines 21 436) no Hoare annotation was computed. [2020-07-10 15:28:58,320 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 437) no Hoare annotation was computed. [2020-07-10 15:28:58,320 INFO L268 CegarLoopResult]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 282) no Hoare annotation was computed. [2020-07-10 15:28:58,320 INFO L268 CegarLoopResult]: For program point L294(line 294) no Hoare annotation was computed. [2020-07-10 15:28:58,320 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point L63(lines 63 415) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 437) the Hoare annotation is: (= |old(~__return_375~0)| ~__return_375~0) [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point L253(line 253) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point L187(line 187) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point L121(lines 121 401) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point L270(line 270) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 212) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point L39(lines 39 433) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 372) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-07-10 15:28:58,321 INFO L268 CegarLoopResult]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 187) no Hoare annotation was computed. [2020-07-10 15:28:58,322 INFO L268 CegarLoopResult]: For program point L370(lines 370 393) no Hoare annotation was computed. [2020-07-10 15:28:58,322 INFO L268 CegarLoopResult]: For program point L81(lines 81 412) no Hoare annotation was computed. [2020-07-10 15:28:58,322 INFO L268 CegarLoopResult]: For program point L304(lines 304 314) no Hoare annotation was computed. [2020-07-10 15:28:58,322 INFO L268 CegarLoopResult]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 306) no Hoare annotation was computed. [2020-07-10 15:28:58,322 INFO L268 CegarLoopResult]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 111) no Hoare annotation was computed. [2020-07-10 15:28:58,322 INFO L268 CegarLoopResult]: For program point L222(lines 222 342) no Hoare annotation was computed. [2020-07-10 15:28:58,322 INFO L268 CegarLoopResult]: For program point L123(line 123) no Hoare annotation was computed. [2020-07-10 15:28:58,322 INFO L268 CegarLoopResult]: For program point L57(lines 57 430) no Hoare annotation was computed. [2020-07-10 15:28:58,323 INFO L264 CegarLoopResult]: At program point L313(lines 228 342) the Hoare annotation is: (let ((.cse17 (+ main_~main__cp~0 1))) (let ((.cse3 (= 0 main_~main__c~0)) (.cse0 (= 1 main_~__VERIFIER_assert__cond~9)) (.cse1 (not (= 0 main_~__VERIFIER_assert__cond~8))) (.cse2 (not (= 0 main_~__VERIFIER_assert__cond~2))) (.cse4 (not (= 0 main_~__VERIFIER_assert__cond~5))) (.cse5 (<= 1 main_~__VERIFIER_assert__cond~4)) (.cse6 (= |old(~__return_375~0)| ~__return_375~0)) (.cse7 (= 1 main_~__VERIFIER_assert__cond~3)) (.cse8 (not (= 0 main_~__VERIFIER_assert__cond~6))) (.cse9 (not (= 0 main_~__VERIFIER_assert__cond~7))) (.cse10 (<= 1 main_~__VERIFIER_assert__cond~10)) (.cse11 (not (= main_~__VERIFIER_assert__cond~11 0))) (.cse12 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse13 (<= .cse17 main_~main__urilen~0)) (.cse15 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse14 (<= 1 main_~main__cp~0)) (.cse16 (< 0 main_~main__scheme~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ main_~main__c~0 2) main_~main__tokenlen~0) .cse14 .cse15 .cse16) (and (< .cse17 main_~main__urilen~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= 1 main_~__VERIFIER_assert__cond~8) .cse8 .cse9 .cse12 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 (not (= main_~__VERIFIER_assert__cond~14 0)) .cse4 (not (= main_~__VERIFIER_assert__cond~15 0)) .cse5 .cse6 .cse7 .cse8 (not (= main_~__VERIFIER_assert__cond~13 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 (not (= main_~__VERIFIER_assert__cond~12 0)) (<= 1 main_~main__c~0))))) [2020-07-10 15:28:58,323 INFO L268 CegarLoopResult]: For program point L280(lines 280 318) no Hoare annotation was computed. [2020-07-10 15:28:58,323 INFO L268 CegarLoopResult]: For program point L239(lines 239 329) no Hoare annotation was computed. [2020-07-10 15:28:58,323 INFO L268 CegarLoopResult]: For program point L173(lines 173 355) no Hoare annotation was computed. [2020-07-10 15:28:58,323 INFO L268 CegarLoopResult]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 241) no Hoare annotation was computed. [2020-07-10 15:28:58,323 INFO L268 CegarLoopResult]: For program point L33(lines 33 434) no Hoare annotation was computed. [2020-07-10 15:28:58,323 INFO L268 CegarLoopResult]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2020-07-10 15:28:58,324 INFO L268 CegarLoopResult]: For program point L372(line 372) no Hoare annotation was computed. [2020-07-10 15:28:58,324 INFO L268 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-07-10 15:28:58,324 INFO L268 CegarLoopResult]: For program point L306(line 306) no Hoare annotation was computed. [2020-07-10 15:28:58,324 INFO L268 CegarLoopResult]: For program point L141(lines 141 360) no Hoare annotation was computed. [2020-07-10 15:28:58,324 INFO L268 CegarLoopResult]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 224) no Hoare annotation was computed. [2020-07-10 15:28:58,324 INFO L268 CegarLoopResult]: For program point L232(lines 232 336) no Hoare annotation was computed. [2020-07-10 15:28:58,324 INFO L268 CegarLoopResult]: For program point mainErr17ASSERT_VIOLATIONERROR_FUNCTION(line 384) no Hoare annotation was computed. [2020-07-10 15:28:58,324 INFO L268 CegarLoopResult]: For program point L133(lines 133 395) no Hoare annotation was computed. [2020-07-10 15:28:58,325 INFO L268 CegarLoopResult]: For program point L224(line 224) no Hoare annotation was computed. [2020-07-10 15:28:58,325 INFO L268 CegarLoopResult]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 143) no Hoare annotation was computed. [2020-07-10 15:28:58,325 INFO L268 CegarLoopResult]: For program point L59(lines 59 425) no Hoare annotation was computed. [2020-07-10 15:28:58,325 INFO L268 CegarLoopResult]: For program point L282(line 282) no Hoare annotation was computed. [2020-07-10 15:28:58,325 INFO L268 CegarLoopResult]: For program point L51(lines 51 431) no Hoare annotation was computed. [2020-07-10 15:28:58,325 INFO L268 CegarLoopResult]: For program point L241(line 241) no Hoare annotation was computed. [2020-07-10 15:28:58,325 INFO L268 CegarLoopResult]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 270) no Hoare annotation was computed. [2020-07-10 15:28:58,325 INFO L268 CegarLoopResult]: For program point L175(line 175) no Hoare annotation was computed. [2020-07-10 15:28:58,325 INFO L268 CegarLoopResult]: For program point L109(lines 109 403) no Hoare annotation was computed. [2020-07-10 15:28:58,326 INFO L264 CegarLoopResult]: At program point L390(lines 127 401) the Hoare annotation is: (and (let ((.cse0 (<= (+ main_~main__cp~0 1) main_~main__urilen~0)) (.cse1 (not (= 0 main_~__VERIFIER_assert__cond~0))) (.cse2 (= 1 main_~__VERIFIER_assert__cond~3)) (.cse3 (<= 1 main_~main__cp~0)) (.cse4 (not (= 0 main_~__VERIFIER_assert__cond~1))) (.cse5 (< 0 main_~main__scheme~0))) (or (and (= 1 main_~__VERIFIER_assert__cond~2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (<= 1 main_~__VERIFIER_assert__cond~16) (not (= 0 main_~__VERIFIER_assert__cond~2)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= main_~__VERIFIER_assert__cond~17 0))))) (= |old(~__return_375~0)| ~__return_375~0)) [2020-07-10 15:28:58,331 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:58,332 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:28:58,332 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:28:58,332 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:28:58,332 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:58,333 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:28:58,333 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 15:28:58,333 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:28:58,333 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:28:58,333 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:28:58,333 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:28:58,333 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:28:58,334 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2020-07-10 15:28:58,335 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2020-07-10 15:28:58,336 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2020-07-10 15:28:58,337 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2020-07-10 15:28:58,337 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2020-07-10 15:28:58,337 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2020-07-10 15:28:58,339 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2020-07-10 15:28:58,339 WARN L170 areAnnotationChecker]: L133 has no Hoare annotation [2020-07-10 15:28:58,339 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2020-07-10 15:28:58,339 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L370 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L372 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L382 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L382 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2020-07-10 15:28:58,340 WARN L170 areAnnotationChecker]: L384 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L155 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L173 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L175 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L185 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2020-07-10 15:28:58,341 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L202 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L210 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L212 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L222 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L224 has no Hoare annotation [2020-07-10 15:28:58,342 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2020-07-10 15:28:58,344 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L232 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L239 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L239 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L241 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L251 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L251 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L253 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2020-07-10 15:28:58,345 WARN L170 areAnnotationChecker]: L260 has no Hoare annotation [2020-07-10 15:28:58,346 WARN L170 areAnnotationChecker]: L268 has no Hoare annotation [2020-07-10 15:28:58,346 WARN L170 areAnnotationChecker]: L268 has no Hoare annotation [2020-07-10 15:28:58,350 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2020-07-10 15:28:58,350 WARN L170 areAnnotationChecker]: L270 has no Hoare annotation [2020-07-10 15:28:58,350 WARN L170 areAnnotationChecker]: L280 has no Hoare annotation [2020-07-10 15:28:58,350 WARN L170 areAnnotationChecker]: L280 has no Hoare annotation [2020-07-10 15:28:58,350 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2020-07-10 15:28:58,350 WARN L170 areAnnotationChecker]: L282 has no Hoare annotation [2020-07-10 15:28:58,350 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2020-07-10 15:28:58,350 WARN L170 areAnnotationChecker]: L292 has no Hoare annotation [2020-07-10 15:28:58,351 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2020-07-10 15:28:58,351 WARN L170 areAnnotationChecker]: L294 has no Hoare annotation [2020-07-10 15:28:58,351 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2020-07-10 15:28:58,351 WARN L170 areAnnotationChecker]: L304 has no Hoare annotation [2020-07-10 15:28:58,351 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2020-07-10 15:28:58,351 WARN L170 areAnnotationChecker]: L306 has no Hoare annotation [2020-07-10 15:28:58,351 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:28:58,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:28:58 BoogieIcfgContainer [2020-07-10 15:28:58,379 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:28:58,382 INFO L168 Benchmark]: Toolchain (without parser) took 30368.23 ms. Allocated memory was 137.4 MB in the beginning and 446.7 MB in the end (delta: 309.3 MB). Free memory was 102.1 MB in the beginning and 262.3 MB in the end (delta: -160.2 MB). Peak memory consumption was 149.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:58,383 INFO L168 Benchmark]: CDTParser took 2.29 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-10 15:28:58,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.39 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 87.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:58,384 INFO L168 Benchmark]: Boogie Preprocessor took 148.58 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 87.6 MB in the beginning and 178.7 MB in the end (delta: -91.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:58,384 INFO L168 Benchmark]: RCFGBuilder took 909.02 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 130.6 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:58,385 INFO L168 Benchmark]: TraceAbstraction took 28912.07 ms. Allocated memory was 201.3 MB in the beginning and 446.7 MB in the end (delta: 245.4 MB). Free memory was 130.6 MB in the beginning and 262.3 MB in the end (delta: -131.7 MB). Peak memory consumption was 113.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:28:58,387 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 2.29 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 390.39 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 87.6 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.58 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 87.6 MB in the beginning and 178.7 MB in the end (delta: -91.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 909.02 ms. Allocated memory is still 201.3 MB. Free memory was 178.7 MB in the beginning and 130.6 MB in the end (delta: 48.1 MB). Peak memory consumption was 48.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28912.07 ms. Allocated memory was 201.3 MB in the beginning and 446.7 MB in the end (delta: 245.4 MB). Free memory was 130.6 MB in the beginning and 262.3 MB in the end (delta: -131.7 MB). Peak memory consumption was 113.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 83]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 306]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 372]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 187]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 212]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 282]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 224]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 241]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 294]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 270]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 143]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 253]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 384]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 111]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 155]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 123]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 95]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 18 specifications checked. All of them hold - InvariantResult [Line: 127]: Loop Invariant Derived loop invariant: (((((((1 == __VERIFIER_assert__cond && main__cp + 1 <= main__urilen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) || ((((((((1 <= __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && !(0 == __VERIFIER_assert__cond)) && 1 == __VERIFIER_assert__cond) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0))) && \old(__return_375) == __return_375 - InvariantResult [Line: 102]: Loop Invariant Derived loop invariant: !(0 == __VERIFIER_assert__cond) && \old(__return_375) == __return_375 - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: ((((((((((((((((((1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 == main__c) && !(0 == __VERIFIER_assert__cond)) && 1 <= __VERIFIER_assert__cond) && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && main__c + 2 <= main__tokenlen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) || ((((((((((((((((main__cp + 1 < main__urilen && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 == main__c) && !(0 == __VERIFIER_assert__cond)) && 1 <= __VERIFIER_assert__cond) && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme)) || ((((((((((((((((((((1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && 1 <= __VERIFIER_assert__cond) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c) - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: ((main__cp < main__urilen && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && ((((((!(0 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) || ((((1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme)) - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && 0 == main__c) && !(0 == __VERIFIER_assert__cond)) && !(main__cp + 1 == main__urilen)) && 1 <= __VERIFIER_assert__cond) && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && main__c + 2 <= main__tokenlen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) || (((((((((((((((((((((((1 == __VERIFIER_assert__cond && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && !(main__cp + 1 == main__urilen)) && !(__VERIFIER_assert__cond == 0)) && 1 <= __VERIFIER_assert__cond) && \old(__return_375) == __return_375) && 1 == __VERIFIER_assert__cond) && !(0 == __VERIFIER_assert__cond)) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && !(__VERIFIER_assert__cond == 0)) && !(__VERIFIER_assert__cond == 0)) && !(0 == __VERIFIER_assert__cond)) && !(0 == __VERIFIER_assert__cond)) && main__cp + 1 <= main__urilen) && 1 <= main__cp) && !(0 == __VERIFIER_assert__cond)) && 0 < main__scheme) && !(__VERIFIER_assert__cond == 0)) && 1 <= main__c) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 18 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.0s, OverallIterations: 24, TraceHistogramMax: 2, AutomataDifference: 18.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1392 SDtfs, 3945 SDslu, 358 SDs, 0 SdLazy, 2606 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 179 SyntacticMatches, 7 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 288 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 17 NumberOfFragments, 520 HoareAnnotationTreeSize, 9 FomulaSimplifications, 66188 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 9 FomulaSimplificationsInter, 12655 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 906 NumberOfCodeBlocks, 906 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 879 ConstructedInterpolants, 0 QuantifiedInterpolants, 69166 SizeOfPredicates, 15 NumberOfNonLiveVariables, 359 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 27 InterpolantComputations, 21 PerfectInterpolantSequences, 15/27 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...