/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 09:26:59,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 09:26:59,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 09:26:59,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 09:26:59,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 09:26:59,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 09:26:59,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 09:26:59,488 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 09:26:59,489 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 09:26:59,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 09:26:59,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 09:26:59,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 09:26:59,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 09:26:59,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 09:26:59,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 09:26:59,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 09:26:59,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 09:26:59,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 09:26:59,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 09:26:59,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 09:26:59,506 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 09:26:59,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 09:26:59,507 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 09:26:59,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 09:26:59,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 09:26:59,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 09:26:59,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 09:26:59,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 09:26:59,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 09:26:59,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 09:26:59,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 09:26:59,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 09:26:59,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 09:26:59,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 09:26:59,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 09:26:59,519 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 09:26:59,519 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 09:26:59,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 09:26:59,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 09:26:59,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 09:26:59,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 09:26:59,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 09:26:59,522 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 09:26:59,529 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 09:26:59,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 09:26:59,530 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 09:26:59,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 09:26:59,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 09:26:59,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 09:26:59,531 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 09:26:59,531 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 09:26:59,531 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 09:26:59,532 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 09:26:59,532 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 09:26:59,532 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 09:26:59,532 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 09:26:59,532 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 09:26:59,532 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 09:26:59,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:26:59,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 09:26:59,533 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 09:26:59,533 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 09:26:59,533 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 09:26:59,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 09:26:59,533 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 09:26:59,533 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 09:26:59,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 09:26:59,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 09:26:59,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 09:26:59,744 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 09:26:59,745 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 09:26:59,746 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-04-08 09:26:59,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb93511fc/d89b6cda468f4652a84f5eb8c78fdc94/FLAGc09dfbde1 [2022-04-08 09:27:00,156 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 09:27:00,156 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i [2022-04-08 09:27:00,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb93511fc/d89b6cda468f4652a84f5eb8c78fdc94/FLAGc09dfbde1 [2022-04-08 09:27:00,179 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb93511fc/d89b6cda468f4652a84f5eb8c78fdc94 [2022-04-08 09:27:00,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 09:27:00,182 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 09:27:00,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 09:27:00,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 09:27:00,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 09:27:00,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:27:00" (1/1) ... [2022-04-08 09:27:00,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25285b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00, skipping insertion in model container [2022-04-08 09:27:00,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 09:27:00" (1/1) ... [2022-04-08 09:27:00,192 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 09:27:00,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 09:27:00,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2022-04-08 09:27:00,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:27:00,406 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 09:27:00,421 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/apache-escape-absolute.i[893,906] [2022-04-08 09:27:00,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 09:27:00,447 INFO L208 MainTranslator]: Completed translation [2022-04-08 09:27:00,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00 WrapperNode [2022-04-08 09:27:00,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 09:27:00,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 09:27:00,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 09:27:00,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 09:27:00,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00" (1/1) ... [2022-04-08 09:27:00,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00" (1/1) ... [2022-04-08 09:27:00,467 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00" (1/1) ... [2022-04-08 09:27:00,468 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00" (1/1) ... [2022-04-08 09:27:00,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00" (1/1) ... [2022-04-08 09:27:00,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00" (1/1) ... [2022-04-08 09:27:00,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00" (1/1) ... [2022-04-08 09:27:00,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 09:27:00,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 09:27:00,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 09:27:00,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 09:27:00,490 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00" (1/1) ... [2022-04-08 09:27:00,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 09:27:00,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 09:27:00,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 09:27:00,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 09:27:00,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 09:27:00,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 09:27:00,545 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 09:27:00,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 09:27:00,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 09:27:00,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 09:27:00,546 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 09:27:00,546 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 09:27:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 09:27:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 09:27:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 09:27:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 09:27:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 09:27:00,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 09:27:00,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 09:27:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 09:27:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 09:27:00,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 09:27:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 09:27:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 09:27:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 09:27:00,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 09:27:00,629 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 09:27:00,630 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 09:27:00,834 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 09:27:00,839 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 09:27:00,839 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 09:27:00,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:27:00 BoogieIcfgContainer [2022-04-08 09:27:00,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 09:27:00,842 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 09:27:00,842 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 09:27:00,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 09:27:00,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 09:27:00" (1/3) ... [2022-04-08 09:27:00,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796dcc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:27:00, skipping insertion in model container [2022-04-08 09:27:00,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 09:27:00" (2/3) ... [2022-04-08 09:27:00,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796dcc3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 09:27:00, skipping insertion in model container [2022-04-08 09:27:00,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 09:27:00" (3/3) ... [2022-04-08 09:27:00,867 INFO L111 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2022-04-08 09:27:00,870 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 09:27:00,871 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 09:27:00,897 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 09:27:00,902 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 09:27:00,902 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 09:27:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 09:27:00,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 09:27:00,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:00,931 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:00,931 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:27:00,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash -494472251, now seen corresponding path program 1 times [2022-04-08 09:27:00,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:00,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1507984603] [2022-04-08 09:27:00,955 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:00,956 INFO L85 PathProgramCache]: Analyzing trace with hash -494472251, now seen corresponding path program 2 times [2022-04-08 09:27:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:00,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620433673] [2022-04-08 09:27:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:00,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:01,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:01,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {57#true} is VALID [2022-04-08 09:27:01,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-08 09:27:01,190 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57#true} {57#true} #184#return; {57#true} is VALID [2022-04-08 09:27:01,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:01,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {65#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {57#true} is VALID [2022-04-08 09:27:01,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2022-04-08 09:27:01,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #184#return; {57#true} is VALID [2022-04-08 09:27:01,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret12 := main(); {57#true} is VALID [2022-04-08 09:27:01,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {57#true} is VALID [2022-04-08 09:27:01,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {57#true} is VALID [2022-04-08 09:27:01,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {57#true} is VALID [2022-04-08 09:27:01,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {57#true} is VALID [2022-04-08 09:27:01,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {57#true} assume ~urilen~0 > 0; {57#true} is VALID [2022-04-08 09:27:01,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {57#true} assume ~tokenlen~0 > 0; {57#true} is VALID [2022-04-08 09:27:01,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {57#true} assume ~scheme~0 >= 0; {57#true} is VALID [2022-04-08 09:27:01,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {57#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {62#(<= (+ main_~cp~0 1) main_~urilen~0)} is VALID [2022-04-08 09:27:01,198 INFO L272 TraceCheckUtils]: 13: Hoare triple {62#(<= (+ main_~cp~0 1) main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {63#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:27:01,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {63#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {64#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:27:01,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {64#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {58#false} is VALID [2022-04-08 09:27:01,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-04-08 09:27:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:01,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:01,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620433673] [2022-04-08 09:27:01,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620433673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:01,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:01,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:01,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:01,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1507984603] [2022-04-08 09:27:01,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1507984603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:01,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:01,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 09:27:01,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097735056] [2022-04-08 09:27:01,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:01,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:27:01,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:01,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:01,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:01,230 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 09:27:01,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:01,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 09:27:01,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 09:27:01,252 INFO L87 Difference]: Start difference. First operand has 54 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 33 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:02,140 INFO L93 Difference]: Finished difference Result 112 states and 207 transitions. [2022-04-08 09:27:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 09:27:02,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-08 09:27:02,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-08 09:27:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 207 transitions. [2022-04-08 09:27:02,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 207 transitions. [2022-04-08 09:27:02,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:02,327 INFO L225 Difference]: With dead ends: 112 [2022-04-08 09:27:02,327 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 09:27:02,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 09:27:02,334 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 70 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:02,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 82 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 09:27:02,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 09:27:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2022-04-08 09:27:02,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:02,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:02,375 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:02,376 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:02,387 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-08 09:27:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-08 09:27:02,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:02,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:02,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 64 states. [2022-04-08 09:27:02,389 INFO L87 Difference]: Start difference. First operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 64 states. [2022-04-08 09:27:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:02,393 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2022-04-08 09:27:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-04-08 09:27:02,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:02,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:02,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:02,394 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2022-04-08 09:27:02,401 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 17 [2022-04-08 09:27:02,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:02,402 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2022-04-08 09:27:02,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 09:27:02,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 80 transitions. [2022-04-08 09:27:02,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2022-04-08 09:27:02,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 09:27:02,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:02,473 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:02,473 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 09:27:02,474 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:27:02,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:02,474 INFO L85 PathProgramCache]: Analyzing trace with hash -730438524, now seen corresponding path program 1 times [2022-04-08 09:27:02,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:02,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1811192718] [2022-04-08 09:27:02,475 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:02,475 INFO L85 PathProgramCache]: Analyzing trace with hash -730438524, now seen corresponding path program 2 times [2022-04-08 09:27:02,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:02,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276264967] [2022-04-08 09:27:02,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:02,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:02,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {542#true} is VALID [2022-04-08 09:27:02,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 09:27:02,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {542#true} {542#true} #184#return; {542#true} is VALID [2022-04-08 09:27:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 09:27:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:02,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {542#true} ~cond := #in~cond; {542#true} is VALID [2022-04-08 09:27:02,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {542#true} assume !(0 == ~cond); {542#true} is VALID [2022-04-08 09:27:02,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 09:27:02,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {548#(<= 1 main_~cp~0)} #148#return; {548#(<= 1 main_~cp~0)} is VALID [2022-04-08 09:27:02,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {542#true} call ULTIMATE.init(); {555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:02,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {555#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {542#true} is VALID [2022-04-08 09:27:02,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 09:27:02,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {542#true} {542#true} #184#return; {542#true} is VALID [2022-04-08 09:27:02,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {542#true} call #t~ret12 := main(); {542#true} is VALID [2022-04-08 09:27:02,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {542#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {542#true} is VALID [2022-04-08 09:27:02,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {542#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {542#true} is VALID [2022-04-08 09:27:02,548 INFO L290 TraceCheckUtils]: 7: Hoare triple {542#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {542#true} is VALID [2022-04-08 09:27:02,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {542#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {542#true} is VALID [2022-04-08 09:27:02,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {542#true} assume ~urilen~0 > 0; {542#true} is VALID [2022-04-08 09:27:02,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {542#true} assume ~tokenlen~0 > 0; {542#true} is VALID [2022-04-08 09:27:02,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {542#true} assume ~scheme~0 >= 0; {547#(< 0 (+ main_~scheme~0 1))} is VALID [2022-04-08 09:27:02,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#(< 0 (+ main_~scheme~0 1))} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {548#(<= 1 main_~cp~0)} is VALID [2022-04-08 09:27:02,550 INFO L272 TraceCheckUtils]: 13: Hoare triple {548#(<= 1 main_~cp~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {542#true} is VALID [2022-04-08 09:27:02,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {542#true} ~cond := #in~cond; {542#true} is VALID [2022-04-08 09:27:02,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {542#true} assume !(0 == ~cond); {542#true} is VALID [2022-04-08 09:27:02,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {542#true} assume true; {542#true} is VALID [2022-04-08 09:27:02,551 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {542#true} {548#(<= 1 main_~cp~0)} #148#return; {548#(<= 1 main_~cp~0)} is VALID [2022-04-08 09:27:02,551 INFO L272 TraceCheckUtils]: 18: Hoare triple {548#(<= 1 main_~cp~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {553#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:27:02,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {553#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {554#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:27:02,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {554#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {543#false} is VALID [2022-04-08 09:27:02,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {543#false} assume !false; {543#false} is VALID [2022-04-08 09:27:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 09:27:02,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:02,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276264967] [2022-04-08 09:27:02,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276264967] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:02,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:02,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:02,553 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:02,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1811192718] [2022-04-08 09:27:02,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1811192718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:02,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:02,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:02,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734434220] [2022-04-08 09:27:02,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:02,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-08 09:27:02,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:02,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:27:02,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:02,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:02,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:02,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:02,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:02,568 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:27:03,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:03,311 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2022-04-08 09:27:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:03,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-08 09:27:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:27:03,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-08 09:27:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:27:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-08 09:27:03,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-08 09:27:03,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:03,383 INFO L225 Difference]: With dead ends: 63 [2022-04-08 09:27:03,383 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 09:27:03,384 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:27:03,385 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 54 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:03,385 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 66 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 09:27:03,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 09:27:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 09:27:03,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:03,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:03,439 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:03,439 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:03,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:03,443 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-08 09:27:03,443 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-08 09:27:03,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:03,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:03,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-08 09:27:03,445 INFO L87 Difference]: Start difference. First operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-08 09:27:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:03,449 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-04-08 09:27:03,449 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-08 09:27:03,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:03,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:03,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:03,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 38 states have internal predecessors, (40), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2022-04-08 09:27:03,454 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 22 [2022-04-08 09:27:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:03,454 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2022-04-08 09:27:03,454 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 09:27:03,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 83 transitions. [2022-04-08 09:27:03,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2022-04-08 09:27:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 09:27:03,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:03,553 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:03,554 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 09:27:03,554 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:27:03,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:03,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1977228752, now seen corresponding path program 1 times [2022-04-08 09:27:03,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:03,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039252261] [2022-04-08 09:27:03,555 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1977228752, now seen corresponding path program 2 times [2022-04-08 09:27:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:03,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455703743] [2022-04-08 09:27:03,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:03,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:03,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:03,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {938#true} is VALID [2022-04-08 09:27:03,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {938#true} {938#true} #184#return; {938#true} is VALID [2022-04-08 09:27:03,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 09:27:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:03,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #148#return; {938#true} is VALID [2022-04-08 09:27:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 09:27:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:03,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #150#return; {938#true} is VALID [2022-04-08 09:27:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:27:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:03,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #152#return; {938#true} is VALID [2022-04-08 09:27:03,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 09:27:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:03,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #154#return; {938#true} is VALID [2022-04-08 09:27:03,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-08 09:27:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:03,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #160#return; {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-08 09:27:03,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-08 09:27:03,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:03,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #162#return; {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-08 09:27:03,682 INFO L272 TraceCheckUtils]: 0: Hoare triple {938#true} call ULTIMATE.init(); {968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:03,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {938#true} is VALID [2022-04-08 09:27:03,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {938#true} {938#true} #184#return; {938#true} is VALID [2022-04-08 09:27:03,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {938#true} call #t~ret12 := main(); {938#true} is VALID [2022-04-08 09:27:03,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {938#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {938#true} is VALID [2022-04-08 09:27:03,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {938#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {938#true} is VALID [2022-04-08 09:27:03,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {938#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {938#true} is VALID [2022-04-08 09:27:03,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {938#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {938#true} is VALID [2022-04-08 09:27:03,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {938#true} assume ~urilen~0 > 0; {938#true} is VALID [2022-04-08 09:27:03,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {938#true} assume ~tokenlen~0 > 0; {938#true} is VALID [2022-04-08 09:27:03,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {938#true} assume ~scheme~0 >= 0; {938#true} is VALID [2022-04-08 09:27:03,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {938#true} is VALID [2022-04-08 09:27:03,684 INFO L272 TraceCheckUtils]: 13: Hoare triple {938#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {938#true} is VALID [2022-04-08 09:27:03,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,685 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {938#true} {938#true} #148#return; {938#true} is VALID [2022-04-08 09:27:03,685 INFO L272 TraceCheckUtils]: 18: Hoare triple {938#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {938#true} is VALID [2022-04-08 09:27:03,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,686 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {938#true} {938#true} #150#return; {938#true} is VALID [2022-04-08 09:27:03,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {938#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {938#true} is VALID [2022-04-08 09:27:03,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {938#true} assume 0 != #t~nondet4;havoc #t~nondet4; {938#true} is VALID [2022-04-08 09:27:03,686 INFO L272 TraceCheckUtils]: 25: Hoare triple {938#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {938#true} is VALID [2022-04-08 09:27:03,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,687 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {938#true} {938#true} #152#return; {938#true} is VALID [2022-04-08 09:27:03,687 INFO L272 TraceCheckUtils]: 30: Hoare triple {938#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {938#true} is VALID [2022-04-08 09:27:03,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,688 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {938#true} {938#true} #154#return; {938#true} is VALID [2022-04-08 09:27:03,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {938#true} assume !(~cp~0 != ~urilen~0 - 1); {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-08 09:27:03,688 INFO L272 TraceCheckUtils]: 36: Hoare triple {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {938#true} is VALID [2022-04-08 09:27:03,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,689 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {938#true} {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #160#return; {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-08 09:27:03,690 INFO L272 TraceCheckUtils]: 41: Hoare triple {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {938#true} is VALID [2022-04-08 09:27:03,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {938#true} ~cond := #in~cond; {938#true} is VALID [2022-04-08 09:27:03,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {938#true} assume !(0 == ~cond); {938#true} is VALID [2022-04-08 09:27:03,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {938#true} assume true; {938#true} is VALID [2022-04-08 09:27:03,690 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {938#true} {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} #162#return; {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} is VALID [2022-04-08 09:27:03,691 INFO L290 TraceCheckUtils]: 46: Hoare triple {959#(= (+ (- 1) (* (- 1) main_~cp~0) main_~urilen~0) 0)} assume !(~cp~0 == ~urilen~0 - 1); {939#false} is VALID [2022-04-08 09:27:03,691 INFO L272 TraceCheckUtils]: 47: Hoare triple {939#false} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {939#false} is VALID [2022-04-08 09:27:03,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {939#false} ~cond := #in~cond; {939#false} is VALID [2022-04-08 09:27:03,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {939#false} assume 0 == ~cond; {939#false} is VALID [2022-04-08 09:27:03,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {939#false} assume !false; {939#false} is VALID [2022-04-08 09:27:03,692 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 09:27:03,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:03,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455703743] [2022-04-08 09:27:03,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455703743] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:03,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:03,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:27:03,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:03,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039252261] [2022-04-08 09:27:03,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039252261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:03,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:03,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 09:27:03,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709430166] [2022-04-08 09:27:03,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:03,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2022-04-08 09:27:03,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:03,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 09:27:03,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:03,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 09:27:03,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:03,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 09:27:03,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 09:27:03,717 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 09:27:03,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:03,998 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2022-04-08 09:27:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 09:27:03,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 51 [2022-04-08 09:27:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:03,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 09:27:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-08 09:27:04,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 09:27:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-08 09:27:04,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-08 09:27:04,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:04,084 INFO L225 Difference]: With dead ends: 90 [2022-04-08 09:27:04,084 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 09:27:04,084 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 09:27:04,085 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:04,086 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 58 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 09:27:04,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 09:27:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-08 09:27:04,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:04,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:04,140 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:04,142 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:04,147 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-08 09:27:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-08 09:27:04,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:04,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:04,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-08 09:27:04,149 INFO L87 Difference]: Start difference. First operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 61 states. [2022-04-08 09:27:04,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:04,156 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-08 09:27:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-08 09:27:04,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:04,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:04,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:04,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:04,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 38 states have internal predecessors, (38), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:04,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-04-08 09:27:04,162 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 51 [2022-04-08 09:27:04,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:04,163 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-04-08 09:27:04,163 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 09:27:04,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 81 transitions. [2022-04-08 09:27:04,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-08 09:27:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-08 09:27:04,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:04,240 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:04,240 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 09:27:04,240 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:27:04,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1335676676, now seen corresponding path program 1 times [2022-04-08 09:27:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:04,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1910656557] [2022-04-08 09:27:04,241 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:04,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1335676676, now seen corresponding path program 2 times [2022-04-08 09:27:04,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:04,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928333185] [2022-04-08 09:27:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {1430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1397#true} is VALID [2022-04-08 09:27:04,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1397#true} {1397#true} #184#return; {1397#true} is VALID [2022-04-08 09:27:04,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 09:27:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #148#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 09:27:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #150#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:27:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #152#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 09:27:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #154#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-08 09:27:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #160#return; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-08 09:27:04,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-08 09:27:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:04,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #162#return; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-08 09:27:04,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {1397#true} call ULTIMATE.init(); {1430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:04,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1397#true} is VALID [2022-04-08 09:27:04,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1397#true} {1397#true} #184#return; {1397#true} is VALID [2022-04-08 09:27:04,414 INFO L272 TraceCheckUtils]: 4: Hoare triple {1397#true} call #t~ret12 := main(); {1397#true} is VALID [2022-04-08 09:27:04,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {1397#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {1397#true} is VALID [2022-04-08 09:27:04,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {1397#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1397#true} is VALID [2022-04-08 09:27:04,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {1397#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1397#true} is VALID [2022-04-08 09:27:04,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {1397#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1397#true} is VALID [2022-04-08 09:27:04,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {1397#true} assume ~urilen~0 > 0; {1397#true} is VALID [2022-04-08 09:27:04,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {1397#true} assume ~tokenlen~0 > 0; {1397#true} is VALID [2022-04-08 09:27:04,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {1397#true} assume ~scheme~0 >= 0; {1397#true} is VALID [2022-04-08 09:27:04,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {1397#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,416 INFO L272 TraceCheckUtils]: 13: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1397#true} is VALID [2022-04-08 09:27:04,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,425 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #148#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,425 INFO L272 TraceCheckUtils]: 18: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1397#true} is VALID [2022-04-08 09:27:04,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,426 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #150#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,427 INFO L290 TraceCheckUtils]: 23: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} assume 0 != #t~nondet4;havoc #t~nondet4; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,427 INFO L272 TraceCheckUtils]: 25: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1397#true} is VALID [2022-04-08 09:27:04,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,428 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #152#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,428 INFO L272 TraceCheckUtils]: 30: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1397#true} is VALID [2022-04-08 09:27:04,428 INFO L290 TraceCheckUtils]: 31: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,429 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1397#true} {1402#(< main_~cp~0 main_~urilen~0)} #154#return; {1402#(< main_~cp~0 main_~urilen~0)} is VALID [2022-04-08 09:27:04,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {1402#(< main_~cp~0 main_~urilen~0)} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-08 09:27:04,430 INFO L290 TraceCheckUtils]: 36: Hoare triple {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} assume 0 != #t~nondet5;havoc #t~nondet5; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-08 09:27:04,430 INFO L272 TraceCheckUtils]: 37: Hoare triple {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1397#true} is VALID [2022-04-08 09:27:04,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,430 INFO L290 TraceCheckUtils]: 39: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,431 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1397#true} {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #160#return; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-08 09:27:04,431 INFO L272 TraceCheckUtils]: 42: Hoare triple {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1397#true} is VALID [2022-04-08 09:27:04,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {1397#true} ~cond := #in~cond; {1397#true} is VALID [2022-04-08 09:27:04,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {1397#true} assume !(0 == ~cond); {1397#true} is VALID [2022-04-08 09:27:04,438 INFO L290 TraceCheckUtils]: 45: Hoare triple {1397#true} assume true; {1397#true} is VALID [2022-04-08 09:27:04,440 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1397#true} {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} #162#return; {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-08 09:27:04,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} assume !(~cp~0 == ~urilen~0 - 1); {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} is VALID [2022-04-08 09:27:04,441 INFO L272 TraceCheckUtils]: 48: Hoare triple {1419#(and (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))))} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:27:04,442 INFO L290 TraceCheckUtils]: 49: Hoare triple {1428#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1429#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:27:04,442 INFO L290 TraceCheckUtils]: 50: Hoare triple {1429#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1398#false} is VALID [2022-04-08 09:27:04,442 INFO L290 TraceCheckUtils]: 51: Hoare triple {1398#false} assume !false; {1398#false} is VALID [2022-04-08 09:27:04,442 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 09:27:04,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:04,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928333185] [2022-04-08 09:27:04,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928333185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:04,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:04,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:04,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:04,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1910656557] [2022-04-08 09:27:04,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1910656557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:04,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:04,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:04,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525402183] [2022-04-08 09:27:04,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:04,444 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-08 09:27:04,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:04,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 09:27:04,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:04,467 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:04,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:04,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:04,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:04,467 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 09:27:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:05,050 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-04-08 09:27:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:05,050 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2022-04-08 09:27:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 09:27:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-08 09:27:05,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 09:27:05,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2022-04-08 09:27:05,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 74 transitions. [2022-04-08 09:27:05,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:05,139 INFO L225 Difference]: With dead ends: 68 [2022-04-08 09:27:05,139 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 09:27:05,139 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:27:05,140 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:05,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 64 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:27:05,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 09:27:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-04-08 09:27:05,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:05,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:05,223 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:05,223 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:05,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:05,229 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-08 09:27:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-08 09:27:05,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:05,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:05,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 66 states. [2022-04-08 09:27:05,231 INFO L87 Difference]: Start difference. First operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 66 states. [2022-04-08 09:27:05,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:05,235 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2022-04-08 09:27:05,235 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2022-04-08 09:27:05,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:05,236 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:05,236 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:05,236 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 41 states have internal predecessors, (41), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 84 transitions. [2022-04-08 09:27:05,240 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 84 transitions. Word has length 52 [2022-04-08 09:27:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:05,240 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 84 transitions. [2022-04-08 09:27:05,241 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-08 09:27:05,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 84 transitions. [2022-04-08 09:27:05,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:05,319 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 84 transitions. [2022-04-08 09:27:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-08 09:27:05,320 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:05,320 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:05,321 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 09:27:05,321 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:27:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:05,321 INFO L85 PathProgramCache]: Analyzing trace with hash -296574164, now seen corresponding path program 1 times [2022-04-08 09:27:05,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:05,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1628836729] [2022-04-08 09:27:05,322 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash -296574164, now seen corresponding path program 2 times [2022-04-08 09:27:05,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:05,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316132652] [2022-04-08 09:27:05,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:05,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:05,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {1899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1842#true} is VALID [2022-04-08 09:27:05,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1842#true} {1842#true} #184#return; {1842#true} is VALID [2022-04-08 09:27:05,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 09:27:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #148#return; {1842#true} is VALID [2022-04-08 09:27:05,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 09:27:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #150#return; {1842#true} is VALID [2022-04-08 09:27:05,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:27:05,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #152#return; {1842#true} is VALID [2022-04-08 09:27:05,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 09:27:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #154#return; {1842#true} is VALID [2022-04-08 09:27:05,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-08 09:27:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #160#return; {1842#true} is VALID [2022-04-08 09:27:05,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-08 09:27:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #162#return; {1842#true} is VALID [2022-04-08 09:27:05,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 09:27:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #164#return; {1842#true} is VALID [2022-04-08 09:27:05,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 09:27:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #166#return; {1842#true} is VALID [2022-04-08 09:27:05,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:27:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #168#return; {1842#true} is VALID [2022-04-08 09:27:05,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:27:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,475 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #170#return; {1842#true} is VALID [2022-04-08 09:27:05,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-08 09:27:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} #172#return; {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-08 09:27:05,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-08 09:27:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:05,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} #174#return; {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-08 09:27:05,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {1842#true} call ULTIMATE.init(); {1899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:05,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {1899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1842#true} is VALID [2022-04-08 09:27:05,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1842#true} {1842#true} #184#return; {1842#true} is VALID [2022-04-08 09:27:05,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {1842#true} call #t~ret12 := main(); {1842#true} is VALID [2022-04-08 09:27:05,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {1842#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {1842#true} is VALID [2022-04-08 09:27:05,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {1842#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {1842#true} is VALID [2022-04-08 09:27:05,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {1842#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {1842#true} is VALID [2022-04-08 09:27:05,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {1842#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {1842#true} is VALID [2022-04-08 09:27:05,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {1842#true} assume ~urilen~0 > 0; {1842#true} is VALID [2022-04-08 09:27:05,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {1842#true} assume ~tokenlen~0 > 0; {1842#true} is VALID [2022-04-08 09:27:05,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {1842#true} assume ~scheme~0 >= 0; {1842#true} is VALID [2022-04-08 09:27:05,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {1842#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L272 TraceCheckUtils]: 13: Hoare triple {1842#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1842#true} {1842#true} #148#return; {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L272 TraceCheckUtils]: 18: Hoare triple {1842#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1842#true} {1842#true} #150#return; {1842#true} is VALID [2022-04-08 09:27:05,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {1842#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1842#true} is VALID [2022-04-08 09:27:05,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {1842#true} assume 0 != #t~nondet4;havoc #t~nondet4; {1842#true} is VALID [2022-04-08 09:27:05,486 INFO L272 TraceCheckUtils]: 25: Hoare triple {1842#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,486 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1842#true} {1842#true} #152#return; {1842#true} is VALID [2022-04-08 09:27:05,486 INFO L272 TraceCheckUtils]: 30: Hoare triple {1842#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,486 INFO L290 TraceCheckUtils]: 31: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,486 INFO L290 TraceCheckUtils]: 32: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1842#true} {1842#true} #154#return; {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {1842#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {1842#true} assume 0 != #t~nondet5;havoc #t~nondet5; {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L272 TraceCheckUtils]: 37: Hoare triple {1842#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1842#true} {1842#true} #160#return; {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L272 TraceCheckUtils]: 42: Hoare triple {1842#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L290 TraceCheckUtils]: 43: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,487 INFO L290 TraceCheckUtils]: 44: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,488 INFO L290 TraceCheckUtils]: 45: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,488 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1842#true} {1842#true} #162#return; {1842#true} is VALID [2022-04-08 09:27:05,488 INFO L290 TraceCheckUtils]: 47: Hoare triple {1842#true} assume !(~cp~0 == ~urilen~0 - 1); {1842#true} is VALID [2022-04-08 09:27:05,488 INFO L272 TraceCheckUtils]: 48: Hoare triple {1842#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,488 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {1842#true} {1842#true} #164#return; {1842#true} is VALID [2022-04-08 09:27:05,489 INFO L272 TraceCheckUtils]: 53: Hoare triple {1842#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,489 INFO L290 TraceCheckUtils]: 56: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,489 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {1842#true} {1842#true} #166#return; {1842#true} is VALID [2022-04-08 09:27:05,489 INFO L290 TraceCheckUtils]: 58: Hoare triple {1842#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre7 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre7;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {1842#true} is VALID [2022-04-08 09:27:05,489 INFO L290 TraceCheckUtils]: 59: Hoare triple {1842#true} assume 0 != #t~nondet8;havoc #t~nondet8;~c~0 := 0; {1842#true} is VALID [2022-04-08 09:27:05,489 INFO L272 TraceCheckUtils]: 60: Hoare triple {1842#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,490 INFO L290 TraceCheckUtils]: 63: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,490 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1842#true} {1842#true} #168#return; {1842#true} is VALID [2022-04-08 09:27:05,490 INFO L272 TraceCheckUtils]: 65: Hoare triple {1842#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,490 INFO L290 TraceCheckUtils]: 66: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,490 INFO L290 TraceCheckUtils]: 67: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,490 INFO L290 TraceCheckUtils]: 68: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,490 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {1842#true} {1842#true} #170#return; {1842#true} is VALID [2022-04-08 09:27:05,491 INFO L290 TraceCheckUtils]: 70: Hoare triple {1842#true} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-08 09:27:05,491 INFO L272 TraceCheckUtils]: 71: Hoare triple {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,491 INFO L290 TraceCheckUtils]: 72: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,491 INFO L290 TraceCheckUtils]: 73: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,491 INFO L290 TraceCheckUtils]: 74: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,492 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {1842#true} {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} #172#return; {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-08 09:27:05,492 INFO L272 TraceCheckUtils]: 76: Hoare triple {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {1842#true} is VALID [2022-04-08 09:27:05,492 INFO L290 TraceCheckUtils]: 77: Hoare triple {1842#true} ~cond := #in~cond; {1842#true} is VALID [2022-04-08 09:27:05,492 INFO L290 TraceCheckUtils]: 78: Hoare triple {1842#true} assume !(0 == ~cond); {1842#true} is VALID [2022-04-08 09:27:05,492 INFO L290 TraceCheckUtils]: 79: Hoare triple {1842#true} assume true; {1842#true} is VALID [2022-04-08 09:27:05,493 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {1842#true} {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} #174#return; {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-08 09:27:05,493 INFO L290 TraceCheckUtils]: 81: Hoare triple {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} is VALID [2022-04-08 09:27:05,494 INFO L290 TraceCheckUtils]: 82: Hoare triple {1887#(<= (+ main_~c~0 2) main_~tokenlen~0)} assume 0 != #t~nondet9;havoc #t~nondet9;#t~pre10 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre10; {1896#(<= (+ main_~c~0 1) main_~tokenlen~0)} is VALID [2022-04-08 09:27:05,494 INFO L272 TraceCheckUtils]: 83: Hoare triple {1896#(<= (+ main_~c~0 1) main_~tokenlen~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {1897#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:27:05,495 INFO L290 TraceCheckUtils]: 84: Hoare triple {1897#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1898#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:27:05,495 INFO L290 TraceCheckUtils]: 85: Hoare triple {1898#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1843#false} is VALID [2022-04-08 09:27:05,495 INFO L290 TraceCheckUtils]: 86: Hoare triple {1843#false} assume !false; {1843#false} is VALID [2022-04-08 09:27:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 09:27:05,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:05,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316132652] [2022-04-08 09:27:05,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316132652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:05,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:05,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:05,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:05,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1628836729] [2022-04-08 09:27:05,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1628836729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:05,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:05,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923732148] [2022-04-08 09:27:05,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:05,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-08 09:27:05,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:05,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 09:27:05,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:05,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:05,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:05,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:05,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:05,538 INFO L87 Difference]: Start difference. First operand 65 states and 84 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 09:27:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:06,130 INFO L93 Difference]: Finished difference Result 74 states and 92 transitions. [2022-04-08 09:27:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:06,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 87 [2022-04-08 09:27:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 09:27:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-08 09:27:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 09:27:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 76 transitions. [2022-04-08 09:27:06,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 76 transitions. [2022-04-08 09:27:06,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:06,192 INFO L225 Difference]: With dead ends: 74 [2022-04-08 09:27:06,192 INFO L226 Difference]: Without dead ends: 72 [2022-04-08 09:27:06,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:27:06,193 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:06,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 72 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 09:27:06,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-08 09:27:06,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-04-08 09:27:06,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:06,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:06,261 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:06,261 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:06,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:06,263 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-08 09:27:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-08 09:27:06,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:06,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:06,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 72 states. [2022-04-08 09:27:06,264 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) Second operand 72 states. [2022-04-08 09:27:06,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:06,266 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2022-04-08 09:27:06,266 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2022-04-08 09:27:06,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:06,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:06,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:06,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:06,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 09:27:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-04-08 09:27:06,269 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 87 [2022-04-08 09:27:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:06,269 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-04-08 09:27:06,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-04-08 09:27:06,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 87 transitions. [2022-04-08 09:27:06,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-04-08 09:27:06,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-08 09:27:06,350 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 09:27:06,351 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 09:27:06,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 09:27:06,351 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 09:27:06,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 09:27:06,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1057322499, now seen corresponding path program 1 times [2022-04-08 09:27:06,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:06,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039063464] [2022-04-08 09:27:06,352 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 09:27:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1057322499, now seen corresponding path program 2 times [2022-04-08 09:27:06,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 09:27:06,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669604160] [2022-04-08 09:27:06,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 09:27:06,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 09:27:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 09:27:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {2403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2342#true} is VALID [2022-04-08 09:27:06,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2342#true} {2342#true} #184#return; {2342#true} is VALID [2022-04-08 09:27:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-08 09:27:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #148#return; {2342#true} is VALID [2022-04-08 09:27:06,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-08 09:27:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #150#return; {2342#true} is VALID [2022-04-08 09:27:06,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-08 09:27:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #152#return; {2342#true} is VALID [2022-04-08 09:27:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-08 09:27:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #154#return; {2342#true} is VALID [2022-04-08 09:27:06,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-04-08 09:27:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #160#return; {2342#true} is VALID [2022-04-08 09:27:06,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-08 09:27:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #162#return; {2342#true} is VALID [2022-04-08 09:27:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-04-08 09:27:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #164#return; {2342#true} is VALID [2022-04-08 09:27:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-04-08 09:27:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #166#return; {2342#true} is VALID [2022-04-08 09:27:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-04-08 09:27:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #168#return; {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-08 09:27:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #170#return; {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-04-08 09:27:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #172#return; {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-04-08 09:27:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #174#return; {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-04-08 09:27:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 09:27:06,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2396#(<= 1 main_~c~0)} #176#return; {2396#(<= 1 main_~c~0)} is VALID [2022-04-08 09:27:06,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {2342#true} call ULTIMATE.init(); {2403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {2403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2342#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2342#true} {2342#true} #184#return; {2342#true} is VALID [2022-04-08 09:27:06,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {2342#true} call #t~ret12 := main(); {2342#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {2342#true} havoc ~scheme~0;havoc ~urilen~0;havoc ~tokenlen~0;havoc ~cp~0;havoc ~c~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~urilen~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~tokenlen~0 := #t~nondet2;havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;~scheme~0 := #t~nondet3;havoc #t~nondet3; {2342#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {2342#true} assume !!(~urilen~0 <= 1000000 && ~urilen~0 >= -1000000); {2342#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {2342#true} assume !!(~tokenlen~0 <= 1000000 && ~tokenlen~0 >= -1000000); {2342#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {2342#true} assume !!(~scheme~0 <= 1000000 && ~scheme~0 >= -1000000); {2342#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {2342#true} assume ~urilen~0 > 0; {2342#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {2342#true} assume ~tokenlen~0 > 0; {2342#true} is VALID [2022-04-08 09:27:06,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {2342#true} assume ~scheme~0 >= 0; {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {2342#true} assume !(0 == ~scheme~0 || ~urilen~0 - 1 < ~scheme~0);~cp~0 := ~scheme~0; {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L272 TraceCheckUtils]: 13: Hoare triple {2342#true} call __VERIFIER_assert((if ~cp~0 - 1 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2342#true} {2342#true} #148#return; {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L272 TraceCheckUtils]: 18: Hoare triple {2342#true} call __VERIFIER_assert((if 0 <= ~cp~0 - 1 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,489 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2342#true} {2342#true} #150#return; {2342#true} is VALID [2022-04-08 09:27:06,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {2342#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {2342#true} is VALID [2022-04-08 09:27:06,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {2342#true} assume 0 != #t~nondet4;havoc #t~nondet4; {2342#true} is VALID [2022-04-08 09:27:06,490 INFO L272 TraceCheckUtils]: 25: Hoare triple {2342#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,490 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2342#true} {2342#true} #152#return; {2342#true} is VALID [2022-04-08 09:27:06,490 INFO L272 TraceCheckUtils]: 30: Hoare triple {2342#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2342#true} {2342#true} #154#return; {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {2342#true} assume !!(~cp~0 != ~urilen~0 - 1);assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L290 TraceCheckUtils]: 36: Hoare triple {2342#true} assume 0 != #t~nondet5;havoc #t~nondet5; {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L272 TraceCheckUtils]: 37: Hoare triple {2342#true} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L290 TraceCheckUtils]: 39: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L290 TraceCheckUtils]: 40: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2342#true} {2342#true} #160#return; {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L272 TraceCheckUtils]: 42: Hoare triple {2342#true} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2342#true} {2342#true} #162#return; {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {2342#true} assume !(~cp~0 == ~urilen~0 - 1); {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L272 TraceCheckUtils]: 48: Hoare triple {2342#true} call __VERIFIER_assert((if 1 + ~cp~0 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {2342#true} {2342#true} #164#return; {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L272 TraceCheckUtils]: 53: Hoare triple {2342#true} call __VERIFIER_assert((if 0 <= 1 + ~cp~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 56: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,493 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {2342#true} {2342#true} #166#return; {2342#true} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 58: Hoare triple {2342#true} assume !(1 + ~cp~0 == ~urilen~0 - 1);#t~pre7 := 1 + ~cp~0;~cp~0 := 1 + ~cp~0;havoc #t~pre7;~scheme~0 := ~cp~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {2342#true} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 59: Hoare triple {2342#true} assume 0 != #t~nondet8;havoc #t~nondet8;~c~0 := 0; {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,493 INFO L272 TraceCheckUtils]: 60: Hoare triple {2379#(= main_~c~0 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,494 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #168#return; {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,494 INFO L272 TraceCheckUtils]: 65: Hoare triple {2379#(= main_~c~0 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,494 INFO L290 TraceCheckUtils]: 66: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,494 INFO L290 TraceCheckUtils]: 67: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,494 INFO L290 TraceCheckUtils]: 68: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,495 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #170#return; {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,495 INFO L290 TraceCheckUtils]: 70: Hoare triple {2379#(= main_~c~0 0)} assume !!(~cp~0 != ~urilen~0 - 1 && ~c~0 < ~tokenlen~0 - 1); {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,495 INFO L272 TraceCheckUtils]: 71: Hoare triple {2379#(= main_~c~0 0)} call __VERIFIER_assert((if ~cp~0 < ~urilen~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,495 INFO L290 TraceCheckUtils]: 72: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,495 INFO L290 TraceCheckUtils]: 73: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,495 INFO L290 TraceCheckUtils]: 74: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,496 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #172#return; {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,496 INFO L272 TraceCheckUtils]: 76: Hoare triple {2379#(= main_~c~0 0)} call __VERIFIER_assert((if 0 <= ~cp~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,496 INFO L290 TraceCheckUtils]: 77: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,496 INFO L290 TraceCheckUtils]: 78: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,496 INFO L290 TraceCheckUtils]: 79: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,497 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {2342#true} {2379#(= main_~c~0 0)} #174#return; {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,497 INFO L290 TraceCheckUtils]: 81: Hoare triple {2379#(= main_~c~0 0)} assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647; {2379#(= main_~c~0 0)} is VALID [2022-04-08 09:27:06,497 INFO L290 TraceCheckUtils]: 82: Hoare triple {2379#(= main_~c~0 0)} assume 0 != #t~nondet9;havoc #t~nondet9;#t~pre10 := 1 + ~c~0;~c~0 := 1 + ~c~0;havoc #t~pre10; {2396#(<= 1 main_~c~0)} is VALID [2022-04-08 09:27:06,497 INFO L272 TraceCheckUtils]: 83: Hoare triple {2396#(<= 1 main_~c~0)} call __VERIFIER_assert((if ~c~0 < ~tokenlen~0 then 1 else 0)); {2342#true} is VALID [2022-04-08 09:27:06,497 INFO L290 TraceCheckUtils]: 84: Hoare triple {2342#true} ~cond := #in~cond; {2342#true} is VALID [2022-04-08 09:27:06,498 INFO L290 TraceCheckUtils]: 85: Hoare triple {2342#true} assume !(0 == ~cond); {2342#true} is VALID [2022-04-08 09:27:06,498 INFO L290 TraceCheckUtils]: 86: Hoare triple {2342#true} assume true; {2342#true} is VALID [2022-04-08 09:27:06,498 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {2342#true} {2396#(<= 1 main_~c~0)} #176#return; {2396#(<= 1 main_~c~0)} is VALID [2022-04-08 09:27:06,499 INFO L272 TraceCheckUtils]: 88: Hoare triple {2396#(<= 1 main_~c~0)} call __VERIFIER_assert((if 0 <= ~c~0 then 1 else 0)); {2401#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 09:27:06,499 INFO L290 TraceCheckUtils]: 89: Hoare triple {2401#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2402#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 09:27:06,499 INFO L290 TraceCheckUtils]: 90: Hoare triple {2402#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2343#false} is VALID [2022-04-08 09:27:06,499 INFO L290 TraceCheckUtils]: 91: Hoare triple {2343#false} assume !false; {2343#false} is VALID [2022-04-08 09:27:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 09:27:06,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 09:27:06,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669604160] [2022-04-08 09:27:06,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669604160] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:06,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:06,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:06,500 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 09:27:06,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039063464] [2022-04-08 09:27:06,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039063464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 09:27:06,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 09:27:06,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 09:27:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357707637] [2022-04-08 09:27:06,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 09:27:06,501 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2022-04-08 09:27:06,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 09:27:06,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 09:27:06,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:06,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 09:27:06,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 09:27:06,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 09:27:06,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 09:27:06,533 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 09:27:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:07,223 INFO L93 Difference]: Finished difference Result 75 states and 96 transitions. [2022-04-08 09:27:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 09:27:07,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 92 [2022-04-08 09:27:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 09:27:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 09:27:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-08 09:27:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 09:27:07,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 80 transitions. [2022-04-08 09:27:07,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 80 transitions. [2022-04-08 09:27:07,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:07,292 INFO L225 Difference]: With dead ends: 75 [2022-04-08 09:27:07,292 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 09:27:07,293 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-08 09:27:07,293 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 09:27:07,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 74 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 09:27:07,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 09:27:07,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 09:27:07,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 09:27:07,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:07,294 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:07,295 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:07,295 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:27:07,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:27:07,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:07,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:07,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:27:07,295 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 09:27:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 09:27:07,295 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 09:27:07,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:27:07,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:07,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 09:27:07,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 09:27:07,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 09:27:07,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 09:27:07,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 09:27:07,296 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2022-04-08 09:27:07,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 09:27:07,296 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 09:27:07,297 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 09:27:07,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 09:27:07,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 09:27:07,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 09:27:07,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 09:27:07,299 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 09:27:07,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 09:27:07,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 09:27:07,855 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-08 09:27:07,855 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-08 09:27:07,855 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-08 09:27:07,855 INFO L882 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-04-08 09:27:07,855 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:27:07,855 INFO L882 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:27:07,855 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-04-08 09:27:07,855 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 24 83) the Hoare annotation is: true [2022-04-08 09:27:07,855 INFO L878 garLoopResultBuilder]: At program point L44(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,856 INFO L878 garLoopResultBuilder]: At program point L69(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-08 09:27:07,856 INFO L885 garLoopResultBuilder]: At program point L36(lines 25 83) the Hoare annotation is: true [2022-04-08 09:27:07,856 INFO L878 garLoopResultBuilder]: At program point L69-1(lines 69 75) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 1) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4) (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4))) [2022-04-08 09:27:07,856 INFO L878 garLoopResultBuilder]: At program point L61(lines 61 79) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,856 INFO L878 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,856 INFO L878 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,856 INFO L878 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,856 INFO L878 garLoopResultBuilder]: At program point L37(lines 25 83) the Hoare annotation is: (< 0 (+ main_~scheme~0 1)) [2022-04-08 09:27:07,856 INFO L878 garLoopResultBuilder]: At program point L54(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,856 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 24 83) the Hoare annotation is: true [2022-04-08 09:27:07,856 INFO L878 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,857 INFO L878 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,857 INFO L878 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,857 INFO L878 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (= main_~c~0 0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,857 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 24 83) the Hoare annotation is: true [2022-04-08 09:27:07,857 INFO L878 garLoopResultBuilder]: At program point L47-1(lines 46 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,857 INFO L878 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,857 INFO L878 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,857 INFO L878 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,857 INFO L878 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,857 INFO L885 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2022-04-08 09:27:07,857 INFO L878 garLoopResultBuilder]: At program point L48(line 48) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,857 INFO L878 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= 1 main_~c~0) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= (+ main_~c~0 1) main_~tokenlen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,858 INFO L885 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-04-08 09:27:07,858 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 64 77) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (<= 1 main_~cp~0))) (or (and .cse0 .cse1 (= main_~c~0 0) .cse2) (and .cse0 (<= 1 main_~c~0) .cse1 .cse2))) [2022-04-08 09:27:07,858 INFO L878 garLoopResultBuilder]: At program point L57(lines 44 80) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,858 INFO L878 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,858 INFO L878 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,858 INFO L885 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: true [2022-04-08 09:27:07,858 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (< main_~cp~0 main_~urilen~0) (not (= main_~urilen~0 (+ main_~cp~0 1))) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,858 INFO L878 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,858 INFO L878 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,858 INFO L878 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-08 09:27:07,858 INFO L885 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: true [2022-04-08 09:27:07,858 INFO L878 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-08 09:27:07,858 INFO L878 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: (and (< 0 (+ main_~scheme~0 1)) (<= (+ main_~cp~0 1) main_~urilen~0) (<= 1 main_~cp~0)) [2022-04-08 09:27:07,859 INFO L878 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse0 (< 0 (+ main_~scheme~0 1))) (.cse1 (< main_~cp~0 main_~urilen~0)) (.cse2 (not (= main_~urilen~0 (+ main_~cp~0 1)))) (.cse3 (<= (+ main_~c~0 2) main_~tokenlen~0)) (.cse4 (<= 1 main_~cp~0))) (or (and .cse0 (<= 1 main_~c~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= main_~c~0 0) .cse4))) [2022-04-08 09:27:07,859 INFO L885 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: true [2022-04-08 09:27:07,859 INFO L885 garLoopResultBuilder]: At program point L35-1(lines 25 83) the Hoare annotation is: true [2022-04-08 09:27:07,859 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:27:07,859 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 09:27:07,859 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:27:07,859 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 09:27:07,859 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 09:27:07,859 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 09:27:07,859 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 09:27:07,859 INFO L878 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:27:07,859 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-04-08 09:27:07,859 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:27:07,860 INFO L878 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:27:07,860 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-08 09:27:07,860 INFO L878 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-08 09:27:07,862 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2] [2022-04-08 09:27:07,863 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 09:27:07,865 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:27:07,865 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 09:27:07,865 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 09:27:07,866 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-08 09:27:07,866 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:27:07,866 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-04-08 09:27:07,867 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-04-08 09:27:07,892 INFO L163 areAnnotationChecker]: CFG has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 09:27:07,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 09:27:07 BoogieIcfgContainer [2022-04-08 09:27:07,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 09:27:07,901 INFO L158 Benchmark]: Toolchain (without parser) took 7719.37ms. Allocated memory was 199.2MB in the beginning and 416.3MB in the end (delta: 217.1MB). Free memory was 147.5MB in the beginning and 265.7MB in the end (delta: -118.1MB). Peak memory consumption was 99.8MB. Max. memory is 8.0GB. [2022-04-08 09:27:07,901 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 199.2MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 09:27:07,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.01ms. Allocated memory was 199.2MB in the beginning and 312.5MB in the end (delta: 113.2MB). Free memory was 147.4MB in the beginning and 286.7MB in the end (delta: -139.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. [2022-04-08 09:27:07,902 INFO L158 Benchmark]: Boogie Preprocessor took 34.70ms. Allocated memory is still 312.5MB. Free memory was 286.7MB in the beginning and 285.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 09:27:07,902 INFO L158 Benchmark]: RCFGBuilder took 357.69ms. Allocated memory is still 312.5MB. Free memory was 285.1MB in the beginning and 268.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-08 09:27:07,902 INFO L158 Benchmark]: TraceAbstraction took 7058.61ms. Allocated memory was 312.5MB in the beginning and 416.3MB in the end (delta: 103.8MB). Free memory was 267.9MB in the beginning and 265.7MB in the end (delta: 2.2MB). Peak memory consumption was 105.4MB. Max. memory is 8.0GB. [2022-04-08 09:27:07,903 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 199.2MB. Free memory is still 164.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.01ms. Allocated memory was 199.2MB in the beginning and 312.5MB in the end (delta: 113.2MB). Free memory was 147.4MB in the beginning and 286.7MB in the end (delta: -139.4MB). Peak memory consumption was 11.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.70ms. Allocated memory is still 312.5MB. Free memory was 286.7MB in the beginning and 285.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 357.69ms. Allocated memory is still 312.5MB. Free memory was 285.1MB in the beginning and 268.5MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7058.61ms. Allocated memory was 312.5MB in the beginning and 416.3MB in the end (delta: 103.8MB). Free memory was 267.9MB in the beginning and 265.7MB in the end (delta: 2.2MB). Peak memory consumption was 105.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 322 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 116 mSDsCounter, 306 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1338 IncrementalHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 306 mSolverCounterUnsat, 300 mSDtfsCounter, 1338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 354 PreInvPairs, 452 NumberOfFragments, 779 HoareAnnotationTreeSize, 354 FomulaSimplifications, 38 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 54 FomulaSimplificationsInter, 397 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((0 < scheme + 1 && cp < urilen) && c == 0) && 1 <= cp) || (((0 < scheme + 1 && 1 <= c) && cp < urilen) && 1 <= cp) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (0 < scheme + 1 && cp + 1 <= urilen) && 1 <= cp - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-08 09:27:07,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...