/usr/bin/java -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/openssl-simplified/s3_srvr_8.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 00:50:26,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 00:50:26,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 00:50:26,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 00:50:26,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 00:50:26,656 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 00:50:26,657 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 00:50:26,658 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 00:50:26,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 00:50:26,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 00:50:26,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 00:50:26,661 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 00:50:26,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 00:50:26,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 00:50:26,663 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 00:50:26,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 00:50:26,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 00:50:26,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 00:50:26,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 00:50:26,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 00:50:26,667 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 00:50:26,671 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 00:50:26,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 00:50:26,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 00:50:26,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 00:50:26,678 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 00:50:26,679 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 00:50:26,679 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 00:50:26,679 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 00:50:26,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 00:50:26,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 00:50:26,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 00:50:26,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 00:50:26,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 00:50:26,681 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 00:50:26,682 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 00:50:26,682 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 00:50:26,682 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 00:50:26,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 00:50:26,683 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 00:50:26,683 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 00:50:26,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 00:50:26,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-07 00:50:26,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 00:50:26,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 00:50:26,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 00:50:26,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 00:50:26,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 00:50:26,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 00:50:26,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 00:50:26,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 00:50:26,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 00:50:26,695 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 00:50:26,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 00:50:26,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 00:50:26,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 00:50:26,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 00:50:26,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 00:50:26,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:50:26,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 00:50:26,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-07 00:50:26,697 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-07 00:50:26,697 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-07 00:50:26,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 00:50:26,697 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-07 00:50:26,697 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-07 00:50:26,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 00:50:26,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 00:50:26,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 00:50:26,899 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 00:50:26,899 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 00:50:26,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_8.cil.c [2022-04-07 00:50:26,941 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce08b6fe8/7bd38140aa0c4435b24c2d7c42852dd1/FLAG21a051d34 [2022-04-07 00:50:27,253 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 00:50:27,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_8.cil.c [2022-04-07 00:50:27,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce08b6fe8/7bd38140aa0c4435b24c2d7c42852dd1/FLAG21a051d34 [2022-04-07 00:50:27,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce08b6fe8/7bd38140aa0c4435b24c2d7c42852dd1 [2022-04-07 00:50:27,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 00:50:27,674 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 00:50:27,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 00:50:27,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 00:50:27,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 00:50:27,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:50:27" (1/1) ... [2022-04-07 00:50:27,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7543bcf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27, skipping insertion in model container [2022-04-07 00:50:27,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 12:50:27" (1/1) ... [2022-04-07 00:50:27,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 00:50:27,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 00:50:27,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_8.cil.c[44970,44983] [2022-04-07 00:50:27,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:50:27,891 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 00:50:27,920 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_8.cil.c[44970,44983] [2022-04-07 00:50:27,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 00:50:27,930 INFO L208 MainTranslator]: Completed translation [2022-04-07 00:50:27,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27 WrapperNode [2022-04-07 00:50:27,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 00:50:27,931 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 00:50:27,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 00:50:27,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 00:50:27,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27" (1/1) ... [2022-04-07 00:50:27,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27" (1/1) ... [2022-04-07 00:50:27,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27" (1/1) ... [2022-04-07 00:50:27,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27" (1/1) ... [2022-04-07 00:50:27,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27" (1/1) ... [2022-04-07 00:50:27,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27" (1/1) ... [2022-04-07 00:50:27,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27" (1/1) ... [2022-04-07 00:50:27,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 00:50:27,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 00:50:27,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 00:50:27,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 00:50:27,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27" (1/1) ... [2022-04-07 00:50:27,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 00:50:27,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:27,983 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-07 00:50:27,988 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-07 00:50:28,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 00:50:28,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 00:50:28,015 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 00:50:28,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2022-04-07 00:50:28,016 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 00:50:28,016 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 00:50:28,016 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 00:50:28,016 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 00:50:28,016 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 00:50:28,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-07 00:50:28,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 00:50:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-07 00:50:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2022-04-07 00:50:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 00:50:28,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 00:50:28,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 00:50:28,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 00:50:28,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 00:50:28,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 00:50:28,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 00:50:28,078 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 00:50:28,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 00:50:28,153 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-07 00:50:28,508 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2022-04-07 00:50:28,509 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2022-04-07 00:50:28,513 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 00:50:28,518 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 00:50:28,518 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 00:50:28,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:50:28 BoogieIcfgContainer [2022-04-07 00:50:28,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 00:50:28,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 00:50:28,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 00:50:28,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 00:50:28,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 12:50:27" (1/3) ... [2022-04-07 00:50:28,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779b8483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:50:28, skipping insertion in model container [2022-04-07 00:50:28,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 12:50:27" (2/3) ... [2022-04-07 00:50:28,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@779b8483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 12:50:28, skipping insertion in model container [2022-04-07 00:50:28,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 12:50:28" (3/3) ... [2022-04-07 00:50:28,524 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_8.cil.c [2022-04-07 00:50:28,527 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-07 00:50:28,527 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 00:50:28,555 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 00:50:28,559 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-07 00:50:28,559 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 00:50:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 156 states, 148 states have (on average 1.722972972972973) internal successors, (255), 149 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-07 00:50:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-07 00:50:28,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:28,581 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:28,581 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash 855317168, now seen corresponding path program 1 times [2022-04-07 00:50:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:28,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1382949222] [2022-04-07 00:50:28,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-07 00:50:28,597 INFO L85 PathProgramCache]: Analyzing trace with hash 855317168, now seen corresponding path program 2 times [2022-04-07 00:50:28,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:28,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287380137] [2022-04-07 00:50:28,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:28,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:28,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:28,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:28,886 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-07 00:50:28,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:28,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287380137] [2022-04-07 00:50:28,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287380137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:28,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:28,890 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:28,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1382949222] [2022-04-07 00:50:28,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1382949222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:28,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:28,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:28,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621676981] [2022-04-07 00:50:28,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:28,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:28,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:28,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:28,920 INFO L87 Difference]: Start difference. First operand has 156 states, 148 states have (on average 1.722972972972973) internal successors, (255), 149 states have internal predecessors, (255), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (3), 2 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-07 00:50:29,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:29,288 INFO L93 Difference]: Finished difference Result 432 states and 737 transitions. [2022-04-07 00:50:29,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:29,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (3), 2 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 48 [2022-04-07 00:50:29,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:29,304 INFO L225 Difference]: With dead ends: 432 [2022-04-07 00:50:29,305 INFO L226 Difference]: Without dead ends: 263 [2022-04-07 00:50:29,308 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 00:50:29,311 INFO L913 BasicCegarLoop]: 246 mSDtfsCounter, 660 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:29,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 255 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:50:29,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-07 00:50:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2022-04-07 00:50:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 258 states have (on average 1.5232558139534884) internal successors, (393), 258 states have internal predecessors, (393), 3 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-07 00:50:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 397 transitions. [2022-04-07 00:50:29,381 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 397 transitions. Word has length 48 [2022-04-07 00:50:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:29,381 INFO L478 AbstractCegarLoop]: Abstraction has 263 states and 397 transitions. [2022-04-07 00:50:29,381 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (3), 2 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-07 00:50:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 397 transitions. [2022-04-07 00:50:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-07 00:50:29,389 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:29,390 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:29,390 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 00:50:29,390 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:29,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash 940901327, now seen corresponding path program 1 times [2022-04-07 00:50:29,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:29,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [123343684] [2022-04-07 00:50:29,405 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:29,406 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash 940901327, now seen corresponding path program 2 times [2022-04-07 00:50:29,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:29,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148046483] [2022-04-07 00:50:29,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:29,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:29,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:29,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:29,502 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 00:50:29,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:29,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148046483] [2022-04-07 00:50:29,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148046483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:29,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:29,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:29,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:29,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [123343684] [2022-04-07 00:50:29,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [123343684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:29,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:29,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961173049] [2022-04-07 00:50:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:29,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:29,505 INFO L87 Difference]: Start difference. First operand 263 states and 397 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 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-07 00:50:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:29,731 INFO L93 Difference]: Finished difference Result 418 states and 642 transitions. [2022-04-07 00:50:29,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:29,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 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 64 [2022-04-07 00:50:29,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:29,733 INFO L225 Difference]: With dead ends: 418 [2022-04-07 00:50:29,733 INFO L226 Difference]: Without dead ends: 292 [2022-04-07 00:50:29,734 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:29,735 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 227 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:29,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [227 Valid, 232 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-04-07 00:50:29,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 284. [2022-04-07 00:50:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 279 states have (on average 1.5017921146953406) internal successors, (419), 279 states have internal predecessors, (419), 3 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-07 00:50:29,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 423 transitions. [2022-04-07 00:50:29,748 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 423 transitions. Word has length 64 [2022-04-07 00:50:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:29,748 INFO L478 AbstractCegarLoop]: Abstraction has 284 states and 423 transitions. [2022-04-07 00:50:29,748 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (3), 2 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-07 00:50:29,748 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 423 transitions. [2022-04-07 00:50:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-07 00:50:29,749 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:29,749 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:29,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 00:50:29,750 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:29,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:29,750 INFO L85 PathProgramCache]: Analyzing trace with hash -269565157, now seen corresponding path program 1 times [2022-04-07 00:50:29,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:29,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [664592882] [2022-04-07 00:50:29,754 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:29,754 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:29,754 INFO L85 PathProgramCache]: Analyzing trace with hash -269565157, now seen corresponding path program 2 times [2022-04-07 00:50:29,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:29,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557766043] [2022-04-07 00:50:29,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:29,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:29,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-07 00:50:29,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557766043] [2022-04-07 00:50:29,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557766043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:29,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:29,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:29,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:29,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [664592882] [2022-04-07 00:50:29,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [664592882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:29,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:29,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:29,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190282339] [2022-04-07 00:50:29,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:29,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:29,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:29,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:29,806 INFO L87 Difference]: Start difference. First operand 284 states and 423 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 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-07 00:50:30,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:30,041 INFO L93 Difference]: Finished difference Result 664 states and 1020 transitions. [2022-04-07 00:50:30,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:30,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 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 85 [2022-04-07 00:50:30,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:30,045 INFO L225 Difference]: With dead ends: 664 [2022-04-07 00:50:30,045 INFO L226 Difference]: Without dead ends: 394 [2022-04-07 00:50:30,048 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:30,050 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 264 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:30,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 231 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:30,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-07 00:50:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 366. [2022-04-07 00:50:30,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 361 states have (on average 1.4321329639889198) internal successors, (517), 361 states have internal predecessors, (517), 3 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-07 00:50:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 521 transitions. [2022-04-07 00:50:30,092 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 521 transitions. Word has length 85 [2022-04-07 00:50:30,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:30,092 INFO L478 AbstractCegarLoop]: Abstraction has 366 states and 521 transitions. [2022-04-07 00:50:30,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 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-07 00:50:30,093 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 521 transitions. [2022-04-07 00:50:30,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-07 00:50:30,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:30,094 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:30,094 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-07 00:50:30,094 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:30,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:30,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1641372455, now seen corresponding path program 1 times [2022-04-07 00:50:30,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1623031687] [2022-04-07 00:50:30,097 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:30,097 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1641372455, now seen corresponding path program 2 times [2022-04-07 00:50:30,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:30,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615593944] [2022-04-07 00:50:30,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-07 00:50:30,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:30,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615593944] [2022-04-07 00:50:30,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615593944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:30,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:30,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:30,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:30,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1623031687] [2022-04-07 00:50:30,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1623031687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:30,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:30,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744282381] [2022-04-07 00:50:30,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:30,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:30,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:30,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:30,158 INFO L87 Difference]: Start difference. First operand 366 states and 521 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 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-07 00:50:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:30,358 INFO L93 Difference]: Finished difference Result 772 states and 1118 transitions. [2022-04-07 00:50:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:30,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 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 85 [2022-04-07 00:50:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:30,360 INFO L225 Difference]: With dead ends: 772 [2022-04-07 00:50:30,360 INFO L226 Difference]: Without dead ends: 420 [2022-04-07 00:50:30,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:30,361 INFO L913 BasicCegarLoop]: 226 mSDtfsCounter, 226 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:30,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 233 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-07 00:50:30,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 412. [2022-04-07 00:50:30,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 407 states have (on average 1.4078624078624078) internal successors, (573), 407 states have internal predecessors, (573), 3 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-07 00:50:30,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 577 transitions. [2022-04-07 00:50:30,378 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 577 transitions. Word has length 85 [2022-04-07 00:50:30,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:30,379 INFO L478 AbstractCegarLoop]: Abstraction has 412 states and 577 transitions. [2022-04-07 00:50:30,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 3 states have internal predecessors, (71), 1 states have call successors, (3), 2 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-07 00:50:30,379 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 577 transitions. [2022-04-07 00:50:30,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-07 00:50:30,380 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:30,380 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:30,380 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 00:50:30,380 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:30,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:30,381 INFO L85 PathProgramCache]: Analyzing trace with hash 37705706, now seen corresponding path program 1 times [2022-04-07 00:50:30,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905460534] [2022-04-07 00:50:30,384 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:30,384 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:30,384 INFO L85 PathProgramCache]: Analyzing trace with hash 37705706, now seen corresponding path program 2 times [2022-04-07 00:50:30,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:30,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872824478] [2022-04-07 00:50:30,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:30,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:30,422 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-07 00:50:30,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:30,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872824478] [2022-04-07 00:50:30,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872824478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:30,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:30,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:30,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:30,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905460534] [2022-04-07 00:50:30,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905460534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:30,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:30,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:30,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083799313] [2022-04-07 00:50:30,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:30,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:30,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:30,424 INFO L87 Difference]: Start difference. First operand 412 states and 577 transitions. Second operand has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (3), 2 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-07 00:50:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:30,599 INFO L93 Difference]: Finished difference Result 1006 states and 1433 transitions. [2022-04-07 00:50:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:30,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (3), 2 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 98 [2022-04-07 00:50:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:30,601 INFO L225 Difference]: With dead ends: 1006 [2022-04-07 00:50:30,602 INFO L226 Difference]: Without dead ends: 602 [2022-04-07 00:50:30,602 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:30,603 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 352 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:30,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [352 Valid, 231 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:30,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-04-07 00:50:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 588. [2022-04-07 00:50:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 583 states have (on average 1.41852487135506) internal successors, (827), 583 states have internal predecessors, (827), 3 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-07 00:50:30,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 831 transitions. [2022-04-07 00:50:30,627 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 831 transitions. Word has length 98 [2022-04-07 00:50:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:30,627 INFO L478 AbstractCegarLoop]: Abstraction has 588 states and 831 transitions. [2022-04-07 00:50:30,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.0) internal successors, (84), 3 states have internal predecessors, (84), 1 states have call successors, (3), 2 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-07 00:50:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 831 transitions. [2022-04-07 00:50:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-07 00:50:30,628 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:30,629 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:30,629 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-07 00:50:30,629 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:30,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1001250365, now seen corresponding path program 1 times [2022-04-07 00:50:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1047420495] [2022-04-07 00:50:30,632 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:30,632 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1001250365, now seen corresponding path program 2 times [2022-04-07 00:50:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:30,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000010528] [2022-04-07 00:50:30,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:30,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:30,668 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-07 00:50:30,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:30,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000010528] [2022-04-07 00:50:30,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000010528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:30,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:30,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:30,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:30,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1047420495] [2022-04-07 00:50:30,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1047420495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:30,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:30,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:30,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116489948] [2022-04-07 00:50:30,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:30,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:30,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:30,670 INFO L87 Difference]: Start difference. First operand 588 states and 831 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 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-07 00:50:30,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:30,890 INFO L93 Difference]: Finished difference Result 1238 states and 1772 transitions. [2022-04-07 00:50:30,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:30,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 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 106 [2022-04-07 00:50:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:30,894 INFO L225 Difference]: With dead ends: 1238 [2022-04-07 00:50:30,894 INFO L226 Difference]: Without dead ends: 664 [2022-04-07 00:50:30,895 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:30,897 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 258 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:30,897 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 232 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:30,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-04-07 00:50:30,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 638. [2022-04-07 00:50:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 633 states have (on average 1.401263823064771) internal successors, (887), 633 states have internal predecessors, (887), 3 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-07 00:50:30,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 891 transitions. [2022-04-07 00:50:30,926 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 891 transitions. Word has length 106 [2022-04-07 00:50:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:30,927 INFO L478 AbstractCegarLoop]: Abstraction has 638 states and 891 transitions. [2022-04-07 00:50:30,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 3 states have internal predecessors, (77), 1 states have call successors, (3), 2 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-07 00:50:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 891 transitions. [2022-04-07 00:50:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-07 00:50:30,929 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:30,929 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:30,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-07 00:50:30,929 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:30,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash -2134649007, now seen corresponding path program 1 times [2022-04-07 00:50:30,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [310901877] [2022-04-07 00:50:30,938 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:30,938 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash -2134649007, now seen corresponding path program 2 times [2022-04-07 00:50:30,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:30,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437824790] [2022-04-07 00:50:30,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:30,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:30,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:30,972 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-04-07 00:50:30,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:30,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437824790] [2022-04-07 00:50:30,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437824790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:30,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:30,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:30,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:30,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [310901877] [2022-04-07 00:50:30,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [310901877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:30,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:30,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:30,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462686606] [2022-04-07 00:50:30,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:30,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:30,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:30,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:30,974 INFO L87 Difference]: Start difference. First operand 638 states and 891 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 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-07 00:50:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:31,202 INFO L93 Difference]: Finished difference Result 1872 states and 2611 transitions. [2022-04-07 00:50:31,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:31,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 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 132 [2022-04-07 00:50:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:31,206 INFO L225 Difference]: With dead ends: 1872 [2022-04-07 00:50:31,206 INFO L226 Difference]: Without dead ends: 1248 [2022-04-07 00:50:31,207 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:31,207 INFO L913 BasicCegarLoop]: 386 mSDtfsCounter, 397 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:31,208 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [397 Valid, 393 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-04-07 00:50:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 640. [2022-04-07 00:50:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 635 states have (on average 1.4) internal successors, (889), 635 states have internal predecessors, (889), 3 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-07 00:50:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 893 transitions. [2022-04-07 00:50:31,254 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 893 transitions. Word has length 132 [2022-04-07 00:50:31,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:31,255 INFO L478 AbstractCegarLoop]: Abstraction has 640 states and 893 transitions. [2022-04-07 00:50:31,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 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-07 00:50:31,255 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 893 transitions. [2022-04-07 00:50:31,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-07 00:50:31,256 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:31,256 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:31,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-07 00:50:31,257 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:31,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:31,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1533920050, now seen corresponding path program 1 times [2022-04-07 00:50:31,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:31,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [557945665] [2022-04-07 00:50:31,261 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:31,261 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:31,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1533920050, now seen corresponding path program 2 times [2022-04-07 00:50:31,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:31,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323112888] [2022-04-07 00:50:31,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:31,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:31,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:31,305 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-04-07 00:50:31,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:31,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323112888] [2022-04-07 00:50:31,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323112888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:31,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:31,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:31,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:31,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [557945665] [2022-04-07 00:50:31,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [557945665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:31,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:31,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:31,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913228879] [2022-04-07 00:50:31,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:31,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:31,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:31,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:31,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:31,307 INFO L87 Difference]: Start difference. First operand 640 states and 893 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 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-07 00:50:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:31,518 INFO L93 Difference]: Finished difference Result 1336 states and 1888 transitions. [2022-04-07 00:50:31,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:31,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 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 132 [2022-04-07 00:50:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:31,520 INFO L225 Difference]: With dead ends: 1336 [2022-04-07 00:50:31,520 INFO L226 Difference]: Without dead ends: 710 [2022-04-07 00:50:31,522 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:31,522 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 239 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:31,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 232 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-04-07 00:50:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 694. [2022-04-07 00:50:31,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 689 states have (on average 1.3831640058055152) internal successors, (953), 689 states have internal predecessors, (953), 3 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-07 00:50:31,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 957 transitions. [2022-04-07 00:50:31,554 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 957 transitions. Word has length 132 [2022-04-07 00:50:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:31,554 INFO L478 AbstractCegarLoop]: Abstraction has 694 states and 957 transitions. [2022-04-07 00:50:31,554 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 1 states have call successors, (3), 2 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-07 00:50:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 957 transitions. [2022-04-07 00:50:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-07 00:50:31,556 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:31,556 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:31,556 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-07 00:50:31,556 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:31,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1281320483, now seen corresponding path program 1 times [2022-04-07 00:50:31,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:31,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142802186] [2022-04-07 00:50:31,560 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:31,561 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:31,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1281320483, now seen corresponding path program 2 times [2022-04-07 00:50:31,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:31,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78426492] [2022-04-07 00:50:31,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:31,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:31,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-07 00:50:31,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:31,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78426492] [2022-04-07 00:50:31,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78426492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:31,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:31,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:31,589 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:31,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142802186] [2022-04-07 00:50:31,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142802186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:31,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:31,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:31,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421529713] [2022-04-07 00:50:31,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:31,590 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:31,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:31,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:31,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:31,591 INFO L87 Difference]: Start difference. First operand 694 states and 957 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 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-07 00:50:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:31,818 INFO L93 Difference]: Finished difference Result 1394 states and 1925 transitions. [2022-04-07 00:50:31,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:31,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 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 138 [2022-04-07 00:50:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:31,820 INFO L225 Difference]: With dead ends: 1394 [2022-04-07 00:50:31,820 INFO L226 Difference]: Without dead ends: 712 [2022-04-07 00:50:31,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:31,822 INFO L913 BasicCegarLoop]: 224 mSDtfsCounter, 359 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:31,822 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 231 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-04-07 00:50:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 700. [2022-04-07 00:50:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 695 states have (on average 1.376978417266187) internal successors, (957), 695 states have internal predecessors, (957), 3 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-07 00:50:31,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 961 transitions. [2022-04-07 00:50:31,864 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 961 transitions. Word has length 138 [2022-04-07 00:50:31,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:31,864 INFO L478 AbstractCegarLoop]: Abstraction has 700 states and 961 transitions. [2022-04-07 00:50:31,864 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (3), 2 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-07 00:50:31,864 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 961 transitions. [2022-04-07 00:50:31,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-07 00:50:31,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:31,866 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:31,866 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-07 00:50:31,866 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:31,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:31,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1736531642, now seen corresponding path program 1 times [2022-04-07 00:50:31,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:31,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2117916091] [2022-04-07 00:50:31,871 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:31,871 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:31,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1736531642, now seen corresponding path program 2 times [2022-04-07 00:50:31,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:31,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861804338] [2022-04-07 00:50:31,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:31,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:31,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:31,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:31,905 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-07 00:50:31,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:31,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861804338] [2022-04-07 00:50:31,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861804338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:31,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:31,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:31,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:31,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2117916091] [2022-04-07 00:50:31,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2117916091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:31,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:31,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:31,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250630492] [2022-04-07 00:50:31,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:31,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:31,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:31,906 INFO L87 Difference]: Start difference. First operand 700 states and 961 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 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-07 00:50:32,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:32,151 INFO L93 Difference]: Finished difference Result 1448 states and 2010 transitions. [2022-04-07 00:50:32,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:32,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 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 155 [2022-04-07 00:50:32,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:32,154 INFO L225 Difference]: With dead ends: 1448 [2022-04-07 00:50:32,154 INFO L226 Difference]: Without dead ends: 762 [2022-04-07 00:50:32,155 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:32,155 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 220 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:32,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 232 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:32,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2022-04-07 00:50:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 758. [2022-04-07 00:50:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 753 states have (on average 1.3612217795484727) internal successors, (1025), 753 states have internal predecessors, (1025), 3 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-07 00:50:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1029 transitions. [2022-04-07 00:50:32,217 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1029 transitions. Word has length 155 [2022-04-07 00:50:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:32,217 INFO L478 AbstractCegarLoop]: Abstraction has 758 states and 1029 transitions. [2022-04-07 00:50:32,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (3), 2 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-07 00:50:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1029 transitions. [2022-04-07 00:50:32,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-07 00:50:32,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:32,219 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:32,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-07 00:50:32,219 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:32,220 INFO L85 PathProgramCache]: Analyzing trace with hash -314709509, now seen corresponding path program 1 times [2022-04-07 00:50:32,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:32,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1811692140] [2022-04-07 00:50:32,226 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:32,226 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash -314709509, now seen corresponding path program 2 times [2022-04-07 00:50:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:32,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755598557] [2022-04-07 00:50:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:32,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-07 00:50:32,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:32,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755598557] [2022-04-07 00:50:32,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755598557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:32,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:32,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:32,270 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:32,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1811692140] [2022-04-07 00:50:32,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1811692140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:32,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:32,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065411167] [2022-04-07 00:50:32,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:32,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:32,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:32,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:32,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:32,272 INFO L87 Difference]: Start difference. First operand 758 states and 1029 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 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-07 00:50:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:32,503 INFO L93 Difference]: Finished difference Result 1564 states and 2150 transitions. [2022-04-07 00:50:32,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:32,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 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 160 [2022-04-07 00:50:32,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:32,506 INFO L225 Difference]: With dead ends: 1564 [2022-04-07 00:50:32,506 INFO L226 Difference]: Without dead ends: 820 [2022-04-07 00:50:32,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:32,509 INFO L913 BasicCegarLoop]: 213 mSDtfsCounter, 234 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:32,509 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 220 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:32,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-04-07 00:50:32,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 820. [2022-04-07 00:50:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 815 states have (on average 1.3460122699386503) internal successors, (1097), 815 states have internal predecessors, (1097), 3 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-07 00:50:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1101 transitions. [2022-04-07 00:50:32,551 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1101 transitions. Word has length 160 [2022-04-07 00:50:32,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:32,552 INFO L478 AbstractCegarLoop]: Abstraction has 820 states and 1101 transitions. [2022-04-07 00:50:32,552 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 1 states have call successors, (3), 2 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-07 00:50:32,552 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1101 transitions. [2022-04-07 00:50:32,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2022-04-07 00:50:32,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:32,554 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:32,554 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-07 00:50:32,555 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:32,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:32,555 INFO L85 PathProgramCache]: Analyzing trace with hash -613871370, now seen corresponding path program 1 times [2022-04-07 00:50:32,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:32,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [668550614] [2022-04-07 00:50:32,561 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:32,561 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash -613871370, now seen corresponding path program 2 times [2022-04-07 00:50:32,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:32,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952866806] [2022-04-07 00:50:32,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:32,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:32,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:32,613 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 174 proven. 26 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-07 00:50:32,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952866806] [2022-04-07 00:50:32,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952866806] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:50:32,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91139640] [2022-04-07 00:50:32,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:50:32,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:32,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:32,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 00:50:32,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 00:50:32,718 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:50:32,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:50:32,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-07 00:50:32,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:50:33,125 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2022-04-07 00:50:33,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 00:50:33,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91139640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:33,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 00:50:33,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-07 00:50:33,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:33,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [668550614] [2022-04-07 00:50:33,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [668550614] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:33,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:33,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 00:50:33,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078362055] [2022-04-07 00:50:33,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:33,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 00:50:33,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:33,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 00:50:33,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 00:50:33,128 INFO L87 Difference]: Start difference. First operand 820 states and 1101 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 1 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-07 00:50:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:33,222 INFO L93 Difference]: Finished difference Result 1648 states and 2222 transitions. [2022-04-07 00:50:33,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 00:50:33,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 1 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 188 [2022-04-07 00:50:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:33,226 INFO L225 Difference]: With dead ends: 1648 [2022-04-07 00:50:33,226 INFO L226 Difference]: Without dead ends: 1233 [2022-04-07 00:50:33,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 00:50:33,227 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 134 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:33,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 381 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:50:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2022-04-07 00:50:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1233. [2022-04-07 00:50:33,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 1228 states have (on average 1.3428338762214984) internal successors, (1649), 1228 states have internal predecessors, (1649), 3 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-07 00:50:33,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1653 transitions. [2022-04-07 00:50:33,292 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1653 transitions. Word has length 188 [2022-04-07 00:50:33,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:33,292 INFO L478 AbstractCegarLoop]: Abstraction has 1233 states and 1653 transitions. [2022-04-07 00:50:33,292 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (3), 1 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-07 00:50:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1653 transitions. [2022-04-07 00:50:33,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-07 00:50:33,295 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:33,295 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:33,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-07 00:50:33,516 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-07 00:50:33,516 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:33,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash 807305420, now seen corresponding path program 1 times [2022-04-07 00:50:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:33,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1820528414] [2022-04-07 00:50:33,522 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:33,522 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash 807305420, now seen corresponding path program 2 times [2022-04-07 00:50:33,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:33,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635437280] [2022-04-07 00:50:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:33,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:33,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-07 00:50:33,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:33,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635437280] [2022-04-07 00:50:33,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635437280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:33,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:33,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:33,588 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:33,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1820528414] [2022-04-07 00:50:33,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1820528414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:33,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:33,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964572924] [2022-04-07 00:50:33,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:33,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:33,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:33,589 INFO L87 Difference]: Start difference. First operand 1233 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 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-07 00:50:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:33,852 INFO L93 Difference]: Finished difference Result 3590 states and 4827 transitions. [2022-04-07 00:50:33,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:33,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 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 195 [2022-04-07 00:50:33,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:33,859 INFO L225 Difference]: With dead ends: 3590 [2022-04-07 00:50:33,859 INFO L226 Difference]: Without dead ends: 2371 [2022-04-07 00:50:33,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:33,862 INFO L913 BasicCegarLoop]: 392 mSDtfsCounter, 363 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:33,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [363 Valid, 399 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 00:50:33,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2022-04-07 00:50:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2369. [2022-04-07 00:50:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2369 states, 2364 states have (on average 1.344331641285956) internal successors, (3178), 2364 states have internal predecessors, (3178), 3 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-07 00:50:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2369 states to 2369 states and 3182 transitions. [2022-04-07 00:50:34,030 INFO L78 Accepts]: Start accepts. Automaton has 2369 states and 3182 transitions. Word has length 195 [2022-04-07 00:50:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:34,030 INFO L478 AbstractCegarLoop]: Abstraction has 2369 states and 3182 transitions. [2022-04-07 00:50:34,031 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 3 states have internal predecessors, (122), 1 states have call successors, (3), 2 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-07 00:50:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2369 states and 3182 transitions. [2022-04-07 00:50:34,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-07 00:50:34,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:34,034 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:34,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-07 00:50:34,035 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash -146634738, now seen corresponding path program 1 times [2022-04-07 00:50:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:34,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [169688897] [2022-04-07 00:50:34,040 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:34,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash -146634738, now seen corresponding path program 2 times [2022-04-07 00:50:34,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:34,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033691048] [2022-04-07 00:50:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-04-07 00:50:34,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:34,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033691048] [2022-04-07 00:50:34,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033691048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:34,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:34,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:34,081 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:34,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [169688897] [2022-04-07 00:50:34,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [169688897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:34,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:34,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:34,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106162395] [2022-04-07 00:50:34,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:34,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:34,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:34,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:34,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:34,082 INFO L87 Difference]: Start difference. First operand 2369 states and 3182 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (3), 2 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-07 00:50:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:34,537 INFO L93 Difference]: Finished difference Result 4719 states and 6363 transitions. [2022-04-07 00:50:34,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:34,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (3), 2 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 195 [2022-04-07 00:50:34,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:34,545 INFO L225 Difference]: With dead ends: 4719 [2022-04-07 00:50:34,546 INFO L226 Difference]: Without dead ends: 3119 [2022-04-07 00:50:34,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:34,549 INFO L913 BasicCegarLoop]: 382 mSDtfsCounter, 345 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:34,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 389 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:34,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3119 states. [2022-04-07 00:50:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3119 to 3119. [2022-04-07 00:50:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3119 states, 3114 states have (on average 1.344251766217084) internal successors, (4186), 3114 states have internal predecessors, (4186), 3 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-07 00:50:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 4190 transitions. [2022-04-07 00:50:34,724 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 4190 transitions. Word has length 195 [2022-04-07 00:50:34,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:34,725 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 4190 transitions. [2022-04-07 00:50:34,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 1 states have call successors, (3), 2 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-07 00:50:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 4190 transitions. [2022-04-07 00:50:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-04-07 00:50:34,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:34,729 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:34,729 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-07 00:50:34,729 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:34,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:34,730 INFO L85 PathProgramCache]: Analyzing trace with hash -794427515, now seen corresponding path program 1 times [2022-04-07 00:50:34,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:34,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1087217500] [2022-04-07 00:50:34,736 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:34,736 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:34,736 INFO L85 PathProgramCache]: Analyzing trace with hash -794427515, now seen corresponding path program 2 times [2022-04-07 00:50:34,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:34,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177224200] [2022-04-07 00:50:34,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:34,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:34,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-07 00:50:34,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:34,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177224200] [2022-04-07 00:50:34,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177224200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:34,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:34,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:34,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:34,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1087217500] [2022-04-07 00:50:34,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1087217500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:34,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:34,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:34,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803605774] [2022-04-07 00:50:34,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:34,770 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:34,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:34,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:34,771 INFO L87 Difference]: Start difference. First operand 3119 states and 4190 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (3), 2 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-07 00:50:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:35,114 INFO L93 Difference]: Finished difference Result 5571 states and 7477 transitions. [2022-04-07 00:50:35,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:35,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (3), 2 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 196 [2022-04-07 00:50:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:35,123 INFO L225 Difference]: With dead ends: 5571 [2022-04-07 00:50:35,123 INFO L226 Difference]: Without dead ends: 3221 [2022-04-07 00:50:35,127 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:35,127 INFO L913 BasicCegarLoop]: 267 mSDtfsCounter, 225 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:35,127 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 274 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:35,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3221 states. [2022-04-07 00:50:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3221 to 3221. [2022-04-07 00:50:35,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3221 states, 3216 states have (on average 1.337686567164179) internal successors, (4302), 3216 states have internal predecessors, (4302), 3 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-07 00:50:35,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3221 states to 3221 states and 4306 transitions. [2022-04-07 00:50:35,281 INFO L78 Accepts]: Start accepts. Automaton has 3221 states and 4306 transitions. Word has length 196 [2022-04-07 00:50:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:35,281 INFO L478 AbstractCegarLoop]: Abstraction has 3221 states and 4306 transitions. [2022-04-07 00:50:35,281 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (3), 2 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-07 00:50:35,282 INFO L276 IsEmpty]: Start isEmpty. Operand 3221 states and 4306 transitions. [2022-04-07 00:50:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-04-07 00:50:35,286 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:35,286 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:35,286 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-07 00:50:35,286 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:35,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:35,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1336228310, now seen corresponding path program 1 times [2022-04-07 00:50:35,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:35,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [627498033] [2022-04-07 00:50:35,292 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-07 00:50:35,292 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:35,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1336228310, now seen corresponding path program 2 times [2022-04-07 00:50:35,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:35,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913831507] [2022-04-07 00:50:35,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:35,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:35,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-04-07 00:50:35,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:35,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913831507] [2022-04-07 00:50:35,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913831507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:35,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:35,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:35,345 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:35,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [627498033] [2022-04-07 00:50:35,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [627498033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:35,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:35,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:35,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649837672] [2022-04-07 00:50:35,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:35,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:35,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:35,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:35,346 INFO L87 Difference]: Start difference. First operand 3221 states and 4306 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 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-07 00:50:35,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:35,738 INFO L93 Difference]: Finished difference Result 6748 states and 9170 transitions. [2022-04-07 00:50:35,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:35,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 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 233 [2022-04-07 00:50:35,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:35,744 INFO L225 Difference]: With dead ends: 6748 [2022-04-07 00:50:35,744 INFO L226 Difference]: Without dead ends: 2025 [2022-04-07 00:50:35,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:35,751 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 220 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:35,751 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 232 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:35,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2022-04-07 00:50:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 2025. [2022-04-07 00:50:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2025 states, 2020 states have (on average 1.3321782178217823) internal successors, (2691), 2020 states have internal predecessors, (2691), 3 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-07 00:50:35,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2695 transitions. [2022-04-07 00:50:35,864 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2695 transitions. Word has length 233 [2022-04-07 00:50:35,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:35,865 INFO L478 AbstractCegarLoop]: Abstraction has 2025 states and 2695 transitions. [2022-04-07 00:50:35,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 3 states have internal predecessors, (113), 1 states have call successors, (3), 2 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-07 00:50:35,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2695 transitions. [2022-04-07 00:50:35,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2022-04-07 00:50:35,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:35,871 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:35,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-07 00:50:35,871 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:35,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:35,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1179061176, now seen corresponding path program 1 times [2022-04-07 00:50:35,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:35,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758439795] [2022-04-07 00:50:38,387 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1179061176, now seen corresponding path program 2 times [2022-04-07 00:50:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:38,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027031700] [2022-04-07 00:50:38,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:38,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:38,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 1192 proven. 26 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2022-04-07 00:50:38,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:38,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027031700] [2022-04-07 00:50:38,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027031700] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:50:38,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524535507] [2022-04-07 00:50:38,438 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:50:38,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:38,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:38,456 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 00:50:38,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 00:50:38,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:50:38,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:50:38,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjunts are in the unsatisfiable core [2022-04-07 00:50:38,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:50:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2004 backedges. 582 proven. 0 refuted. 0 times theorem prover too weak. 1422 trivial. 0 not checked. [2022-04-07 00:50:39,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 00:50:39,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524535507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:39,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 00:50:39,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-07 00:50:39,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:39,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758439795] [2022-04-07 00:50:39,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758439795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:39,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:39,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 00:50:39,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896471341] [2022-04-07 00:50:39,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:39,069 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 00:50:39,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:39,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 00:50:39,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 00:50:39,070 INFO L87 Difference]: Start difference. First operand 2025 states and 2695 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 1 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-07 00:50:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:39,237 INFO L93 Difference]: Finished difference Result 4442 states and 5926 transitions. [2022-04-07 00:50:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 00:50:39,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 1 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 448 [2022-04-07 00:50:39,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:39,246 INFO L225 Difference]: With dead ends: 4442 [2022-04-07 00:50:39,246 INFO L226 Difference]: Without dead ends: 2435 [2022-04-07 00:50:39,250 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 00:50:39,250 INFO L913 BasicCegarLoop]: 192 mSDtfsCounter, 149 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:39,251 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 370 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:50:39,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2022-04-07 00:50:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2435. [2022-04-07 00:50:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2435 states, 2430 states have (on average 1.3325102880658437) internal successors, (3238), 2430 states have internal predecessors, (3238), 3 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-07 00:50:39,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 3242 transitions. [2022-04-07 00:50:39,387 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 3242 transitions. Word has length 448 [2022-04-07 00:50:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:39,388 INFO L478 AbstractCegarLoop]: Abstraction has 2435 states and 3242 transitions. [2022-04-07 00:50:39,388 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (3), 1 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-07 00:50:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 3242 transitions. [2022-04-07 00:50:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2022-04-07 00:50:39,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:39,393 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:39,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 00:50:39,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-07 00:50:39,604 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:39,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash 584091305, now seen corresponding path program 1 times [2022-04-07 00:50:39,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:39,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [344682067] [2022-04-07 00:50:42,792 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:42,793 INFO L85 PathProgramCache]: Analyzing trace with hash 584091305, now seen corresponding path program 2 times [2022-04-07 00:50:42,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:42,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778800458] [2022-04-07 00:50:42,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:42,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:42,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-04-07 00:50:42,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:42,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778800458] [2022-04-07 00:50:42,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778800458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:50:42,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229510638] [2022-04-07 00:50:42,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:50:42,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:42,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:42,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 00:50:42,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 00:50:43,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:50:43,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:50:43,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:50:43,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:50:43,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-04-07 00:50:43,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:50:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3649 backedges. 1775 proven. 26 refuted. 0 times theorem prover too weak. 1848 trivial. 0 not checked. [2022-04-07 00:50:44,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229510638] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:50:44,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:50:44,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-07 00:50:44,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:44,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [344682067] [2022-04-07 00:50:44,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [344682067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:44,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:44,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:50:44,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540776244] [2022-04-07 00:50:44,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:44,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:50:44,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:44,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:50:44,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 00:50:44,274 INFO L87 Difference]: Start difference. First operand 2435 states and 3242 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 1 states have call successors, (3), 2 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-07 00:50:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:44,894 INFO L93 Difference]: Finished difference Result 6050 states and 8186 transitions. [2022-04-07 00:50:44,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 00:50:44,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 1 states have call successors, (3), 2 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 601 [2022-04-07 00:50:44,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:44,903 INFO L225 Difference]: With dead ends: 6050 [2022-04-07 00:50:44,904 INFO L226 Difference]: Without dead ends: 3499 [2022-04-07 00:50:44,907 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 1213 GetRequests, 1205 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-07 00:50:44,908 INFO L913 BasicCegarLoop]: 328 mSDtfsCounter, 525 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:44,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 340 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-07 00:50:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3499 states. [2022-04-07 00:50:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3499 to 2626. [2022-04-07 00:50:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2621 states have (on average 1.3445249904616559) internal successors, (3524), 2621 states have internal predecessors, (3524), 3 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-07 00:50:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 3528 transitions. [2022-04-07 00:50:45,054 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 3528 transitions. Word has length 601 [2022-04-07 00:50:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:45,055 INFO L478 AbstractCegarLoop]: Abstraction has 2626 states and 3528 transitions. [2022-04-07 00:50:45,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 4 states have internal predecessors, (190), 1 states have call successors, (3), 2 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-07 00:50:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 3528 transitions. [2022-04-07 00:50:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2022-04-07 00:50:45,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:45,065 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 19, 19, 18, 18, 17, 17, 16, 16, 16, 16, 12, 9, 9, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:45,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 00:50:45,274 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-07 00:50:45,274 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:45,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:45,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2091965358, now seen corresponding path program 1 times [2022-04-07 00:50:45,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:45,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [918293450] [2022-04-07 00:50:48,141 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:48,141 INFO L85 PathProgramCache]: Analyzing trace with hash -2091965358, now seen corresponding path program 2 times [2022-04-07 00:50:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:48,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862200257] [2022-04-07 00:50:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:48,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5044 backedges. 2335 proven. 0 refuted. 0 times theorem prover too weak. 2709 trivial. 0 not checked. [2022-04-07 00:50:48,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:48,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862200257] [2022-04-07 00:50:48,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862200257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:48,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:48,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:48,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:48,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [918293450] [2022-04-07 00:50:48,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [918293450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:48,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:48,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:48,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501790770] [2022-04-07 00:50:48,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:48,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:48,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:48,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:48,224 INFO L87 Difference]: Start difference. First operand 2626 states and 3528 transitions. Second operand has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 1 states have call successors, (3), 2 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-07 00:50:48,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:48,582 INFO L93 Difference]: Finished difference Result 5526 states and 7534 transitions. [2022-04-07 00:50:48,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:48,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 1 states have call successors, (3), 2 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 694 [2022-04-07 00:50:48,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:48,591 INFO L225 Difference]: With dead ends: 5526 [2022-04-07 00:50:48,591 INFO L226 Difference]: Without dead ends: 2914 [2022-04-07 00:50:48,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:48,596 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 217 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:48,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 229 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2022-04-07 00:50:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2898. [2022-04-07 00:50:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2898 states, 2893 states have (on average 1.3259592118907708) internal successors, (3836), 2893 states have internal predecessors, (3836), 3 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-07 00:50:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2898 states to 2898 states and 3840 transitions. [2022-04-07 00:50:48,749 INFO L78 Accepts]: Start accepts. Automaton has 2898 states and 3840 transitions. Word has length 694 [2022-04-07 00:50:48,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:48,750 INFO L478 AbstractCegarLoop]: Abstraction has 2898 states and 3840 transitions. [2022-04-07 00:50:48,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.75) internal successors, (175), 3 states have internal predecessors, (175), 1 states have call successors, (3), 2 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-07 00:50:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2898 states and 3840 transitions. [2022-04-07 00:50:48,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2022-04-07 00:50:48,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:48,756 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 22, 22, 21, 21, 20, 20, 19, 19, 19, 19, 15, 12, 12, 9, 9, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:48,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-07 00:50:48,756 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1466473237, now seen corresponding path program 1 times [2022-04-07 00:50:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:48,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [928289940] [2022-04-07 00:50:51,661 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:51,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1466473237, now seen corresponding path program 2 times [2022-04-07 00:50:51,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:51,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755954745] [2022-04-07 00:50:51,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:51,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:51,746 INFO L134 CoverageAnalysis]: Checked inductivity of 6736 backedges. 3144 proven. 0 refuted. 0 times theorem prover too weak. 3592 trivial. 0 not checked. [2022-04-07 00:50:51,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:51,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755954745] [2022-04-07 00:50:51,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755954745] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:51,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:51,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:51,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:51,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [928289940] [2022-04-07 00:50:51,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [928289940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:51,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:51,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:51,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253989704] [2022-04-07 00:50:51,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:51,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:51,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:51,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:51,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:51,759 INFO L87 Difference]: Start difference. First operand 2898 states and 3840 transitions. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 1 states have call successors, (3), 2 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-07 00:50:52,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:52,157 INFO L93 Difference]: Finished difference Result 6086 states and 8190 transitions. [2022-04-07 00:50:52,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:52,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 1 states have call successors, (3), 2 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 787 [2022-04-07 00:50:52,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:52,165 INFO L225 Difference]: With dead ends: 6086 [2022-04-07 00:50:52,165 INFO L226 Difference]: Without dead ends: 3202 [2022-04-07 00:50:52,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:52,169 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 217 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:52,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 229 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2022-04-07 00:50:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3186. [2022-04-07 00:50:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3186 states, 3181 states have (on average 1.3090223200251494) internal successors, (4164), 3181 states have internal predecessors, (4164), 3 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-07 00:50:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3186 states to 3186 states and 4168 transitions. [2022-04-07 00:50:52,340 INFO L78 Accepts]: Start accepts. Automaton has 3186 states and 4168 transitions. Word has length 787 [2022-04-07 00:50:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:52,341 INFO L478 AbstractCegarLoop]: Abstraction has 3186 states and 4168 transitions. [2022-04-07 00:50:52,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 3 states have internal predecessors, (185), 1 states have call successors, (3), 2 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-07 00:50:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 3186 states and 4168 transitions. [2022-04-07 00:50:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2022-04-07 00:50:52,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:52,347 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 25, 25, 24, 24, 23, 23, 22, 22, 22, 22, 18, 15, 15, 12, 12, 9, 9, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:52,348 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-07 00:50:52,348 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:52,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:52,348 INFO L85 PathProgramCache]: Analyzing trace with hash -822827219, now seen corresponding path program 1 times [2022-04-07 00:50:52,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:52,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1718279784] [2022-04-07 00:50:55,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash -822827219, now seen corresponding path program 2 times [2022-04-07 00:50:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:55,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292025778] [2022-04-07 00:50:55,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:55,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:55,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 8749 backedges. 4095 proven. 0 refuted. 0 times theorem prover too weak. 4654 trivial. 0 not checked. [2022-04-07 00:50:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:55,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292025778] [2022-04-07 00:50:55,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292025778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:55,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:55,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:55,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:50:55,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1718279784] [2022-04-07 00:50:55,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1718279784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:50:55,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:50:55,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 00:50:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500963444] [2022-04-07 00:50:55,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:50:55,652 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 00:50:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 00:50:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 00:50:55,652 INFO L87 Difference]: Start difference. First operand 3186 states and 4168 transitions. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 1 states have call successors, (3), 2 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-07 00:50:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:50:56,008 INFO L93 Difference]: Finished difference Result 6310 states and 8256 transitions. [2022-04-07 00:50:56,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 00:50:56,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 1 states have call successors, (3), 2 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 886 [2022-04-07 00:50:56,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:50:56,014 INFO L225 Difference]: With dead ends: 6310 [2022-04-07 00:50:56,014 INFO L226 Difference]: Without dead ends: 3138 [2022-04-07 00:50:56,019 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-07 00:50:56,019 INFO L913 BasicCegarLoop]: 222 mSDtfsCounter, 231 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 00:50:56,019 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [231 Valid, 229 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 00:50:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2022-04-07 00:50:56,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2902. [2022-04-07 00:50:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2897 states have (on average 1.2561270279599586) internal successors, (3639), 2897 states have internal predecessors, (3639), 3 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-07 00:50:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 3643 transitions. [2022-04-07 00:50:56,205 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 3643 transitions. Word has length 886 [2022-04-07 00:50:56,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:50:56,205 INFO L478 AbstractCegarLoop]: Abstraction has 2902 states and 3643 transitions. [2022-04-07 00:50:56,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 3 states have internal predecessors, (195), 1 states have call successors, (3), 2 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-07 00:50:56,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 3643 transitions. [2022-04-07 00:50:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2022-04-07 00:50:56,212 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:50:56,212 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 26, 26, 25, 25, 24, 24, 23, 23, 23, 23, 19, 16, 16, 13, 13, 10, 10, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:50:56,213 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-07 00:50:56,213 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:50:56,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:50:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash 124198490, now seen corresponding path program 1 times [2022-04-07 00:50:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:50:56,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1251102762] [2022-04-07 00:50:59,576 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:50:59,577 INFO L85 PathProgramCache]: Analyzing trace with hash 124198490, now seen corresponding path program 2 times [2022-04-07 00:50:59,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:50:59,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264345237] [2022-04-07 00:50:59,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:50:59,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:50:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:59,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:50:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:50:59,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9513 backedges. 5427 proven. 26 refuted. 0 times theorem prover too weak. 4060 trivial. 0 not checked. [2022-04-07 00:50:59,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:50:59,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264345237] [2022-04-07 00:50:59,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264345237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:50:59,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2295093] [2022-04-07 00:50:59,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:50:59,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:50:59,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:50:59,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 00:50:59,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 00:50:59,850 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:50:59,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:50:59,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:50:59,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:51:01,033 INFO L134 CoverageAnalysis]: Checked inductivity of 9513 backedges. 2021 proven. 0 refuted. 0 times theorem prover too weak. 7492 trivial. 0 not checked. [2022-04-07 00:51:01,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 00:51:01,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2295093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:51:01,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 00:51:01,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-04-07 00:51:01,043 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:51:01,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1251102762] [2022-04-07 00:51:01,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1251102762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:51:01,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:51:01,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 00:51:01,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000636838] [2022-04-07 00:51:01,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:51:01,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 00:51:01,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:51:01,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 00:51:01,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 00:51:01,045 INFO L87 Difference]: Start difference. First operand 2902 states and 3643 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (3), 1 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-07 00:51:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:51:01,230 INFO L93 Difference]: Finished difference Result 3300 states and 4129 transitions. [2022-04-07 00:51:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 00:51:01,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (3), 1 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 926 [2022-04-07 00:51:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:51:01,236 INFO L225 Difference]: With dead ends: 3300 [2022-04-07 00:51:01,236 INFO L226 Difference]: Without dead ends: 2734 [2022-04-07 00:51:01,237 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 927 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 00:51:01,238 INFO L913 BasicCegarLoop]: 372 mSDtfsCounter, 80 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 00:51:01,238 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 563 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 00:51:01,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2734 states. [2022-04-07 00:51:01,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2734 to 2338. [2022-04-07 00:51:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2338 states, 2333 states have (on average 1.2456065152164595) internal successors, (2906), 2333 states have internal predecessors, (2906), 3 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-07 00:51:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 2910 transitions. [2022-04-07 00:51:01,368 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 2910 transitions. Word has length 926 [2022-04-07 00:51:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:51:01,369 INFO L478 AbstractCegarLoop]: Abstraction has 2338 states and 2910 transitions. [2022-04-07 00:51:01,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 1 states have call successors, (3), 1 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-07 00:51:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 2910 transitions. [2022-04-07 00:51:01,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1022 [2022-04-07 00:51:01,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 00:51:01,376 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 29, 29, 28, 28, 27, 27, 26, 26, 26, 26, 22, 18, 18, 14, 14, 10, 10, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 00:51:01,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 00:51:01,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:51:01,583 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 00:51:01,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 00:51:01,584 INFO L85 PathProgramCache]: Analyzing trace with hash 977491508, now seen corresponding path program 1 times [2022-04-07 00:51:01,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-07 00:51:01,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [811554489] [2022-04-07 00:51:04,894 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-07 00:51:04,895 INFO L85 PathProgramCache]: Analyzing trace with hash 977491508, now seen corresponding path program 2 times [2022-04-07 00:51:04,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 00:51:04,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705701926] [2022-04-07 00:51:04,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 00:51:04,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 00:51:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:51:05,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 00:51:05,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 00:51:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-04-07 00:51:05,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 00:51:05,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705701926] [2022-04-07 00:51:05,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705701926] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 00:51:05,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290665239] [2022-04-07 00:51:05,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 00:51:05,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 00:51:05,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 00:51:05,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 00:51:05,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 00:51:05,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 00:51:05,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 00:51:05,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 1550 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-07 00:51:05,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 00:51:06,170 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-04-07 00:51:06,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 00:51:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11822 backedges. 6447 proven. 26 refuted. 0 times theorem prover too weak. 5349 trivial. 0 not checked. [2022-04-07 00:51:07,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290665239] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 00:51:07,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 00:51:07,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-04-07 00:51:07,181 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-07 00:51:07,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [811554489] [2022-04-07 00:51:07,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [811554489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 00:51:07,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 00:51:07,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 00:51:07,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080185652] [2022-04-07 00:51:07,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 00:51:07,182 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 00:51:07,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-07 00:51:07,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 00:51:07,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-07 00:51:07,183 INFO L87 Difference]: Start difference. First operand 2338 states and 2910 transitions. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (3), 2 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-07 00:51:07,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 00:51:07,551 INFO L93 Difference]: Finished difference Result 3484 states and 4344 transitions. [2022-04-07 00:51:07,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 00:51:07,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (3), 2 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 1021 [2022-04-07 00:51:07,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 00:51:07,552 INFO L225 Difference]: With dead ends: 3484 [2022-04-07 00:51:07,552 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 00:51:07,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 2051 GetRequests, 2042 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-04-07 00:51:07,561 INFO L913 BasicCegarLoop]: 251 mSDtfsCounter, 218 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-07 00:51:07,561 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 263 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-07 00:51:07,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 00:51:07,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 00:51:07,562 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-07 00:51:07,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 00:51:07,562 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1021 [2022-04-07 00:51:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 00:51:07,562 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 00:51:07,562 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (3), 2 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-07 00:51:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 00:51:07,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 00:51:07,564 INFO L788 garLoopResultBuilder]: Registering result SAFE for location ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 00:51:07,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 00:51:07,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-07 00:51:07,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-07 00:51:38,654 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-07 00:51:38,654 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-07 00:51:38,655 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-07 00:51:38,655 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 646 657) the Hoare annotation is: true [2022-04-07 00:51:38,655 INFO L885 garLoopResultBuilder]: At program point L653(line 653) the Hoare annotation is: true [2022-04-07 00:51:38,655 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 646 657) the Hoare annotation is: true [2022-04-07 00:51:38,655 INFO L885 garLoopResultBuilder]: At program point L653-1(line 653) the Hoare annotation is: true [2022-04-07 00:51:38,655 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 646 657) the Hoare annotation is: true [2022-04-07 00:51:38,655 INFO L885 garLoopResultBuilder]: At program point L564(lines 564 570) the Hoare annotation is: true [2022-04-07 00:51:38,655 INFO L878 garLoopResultBuilder]: At program point L531(lines 531 534) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)) .cse1) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse2 .cse1) (and .cse0 .cse2 .cse1 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:38,655 INFO L885 garLoopResultBuilder]: At program point L564-1(lines 564 570) the Hoare annotation is: true [2022-04-07 00:51:38,655 INFO L878 garLoopResultBuilder]: At program point L399(lines 399 417) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,655 INFO L878 garLoopResultBuilder]: At program point L201(lines 197 585) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__state~0 8640) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2022-04-07 00:51:38,655 INFO L878 garLoopResultBuilder]: At program point L168(lines 164 596) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,655 INFO L878 garLoopResultBuilder]: At program point L135(lines 134 606) the Hoare annotation is: (<= ssl3_accept_~s__state~0 8656) [2022-04-07 00:51:38,655 INFO L878 garLoopResultBuilder]: At program point L102(lines 102 104) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:38,655 INFO L878 garLoopResultBuilder]: At program point L400(lines 400 406) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,655 INFO L878 garLoopResultBuilder]: At program point L500(lines 500 504) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and .cse0 (not (= ssl3_accept_~s__hit~0 0))) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__state~0 8640) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L500-2(lines 500 504) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse1 (<= ssl3_accept_~s__state~0 8656)) (.cse2 (= ssl3_accept_~s__hit~0 0))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0 .cse1 .cse2) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576) .cse2) (and (not .cse2) (= ssl3_accept_~s__state~0 3)))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L203(lines 203 583) the Hoare annotation is: (let ((.cse2 (<= ssl3_accept_~s__state~0 8576)) (.cse3 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 (= 3 ssl3_accept_~blastFlag~0)) (= ssl3_accept_~blastFlag~0 0) (and .cse2 .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse3) (and .cse2 .cse3) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L170(lines 170 594) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L137(lines 137 605) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,656 INFO L885 garLoopResultBuilder]: At program point L633(lines 109 634) the Hoare annotation is: true [2022-04-07 00:51:38,656 INFO L885 garLoopResultBuilder]: At program point L567(lines 567 569) the Hoare annotation is: true [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L468(lines 468 470) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L270(lines 270 272) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L237(lines 237 248) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L237-2(lines 219 576) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L304(lines 304 308) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L304-2(lines 304 308) the Hoare annotation is: (let ((.cse0 (= ssl3_accept_~s__hit~0 0))) (or (and (<= 8656 ssl3_accept_~s__state~0) (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not .cse0)) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__state~0 8512) .cse0))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L437-1(lines 437 445) the Hoare annotation is: (let ((.cse0 (= 8448 ssl3_accept_~s__state~0))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (= ssl3_accept_~blastFlag~0 0) .cse0))) [2022-04-07 00:51:38,656 INFO L878 garLoopResultBuilder]: At program point L239(lines 239 242) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,657 INFO L878 garLoopResultBuilder]: At program point L206(lines 206 582) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 (= 3 ssl3_accept_~blastFlag~0)) (= ssl3_accept_~blastFlag~0 0) (<= ssl3_accept_~s__state~0 8656) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1))) [2022-04-07 00:51:38,657 INFO L878 garLoopResultBuilder]: At program point L173(lines 173 593) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,657 INFO L878 garLoopResultBuilder]: At program point L140(lines 140 604) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,657 INFO L878 garLoopResultBuilder]: At program point L207(lines 203 583) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)) .cse1) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse2 .cse1) (and .cse0 .cse2 .cse1 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:38,657 INFO L878 garLoopResultBuilder]: At program point L174(lines 170 594) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,657 INFO L885 garLoopResultBuilder]: At program point L638(lines 638 640) the Hoare annotation is: true [2022-04-07 00:51:38,657 INFO L885 garLoopResultBuilder]: At program point ssl3_acceptENTRY(lines 22 645) the Hoare annotation is: true [2022-04-07 00:51:38,657 INFO L885 garLoopResultBuilder]: At program point L638-2(lines 638 640) the Hoare annotation is: true [2022-04-07 00:51:38,657 INFO L878 garLoopResultBuilder]: At program point L539(lines 539 549) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1))) [2022-04-07 00:51:38,657 INFO L878 garLoopResultBuilder]: At program point L440(lines 440 443) the Hoare annotation is: (let ((.cse0 (= 8448 ssl3_accept_~s__state~0))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (= ssl3_accept_~blastFlag~0 0) .cse0))) [2022-04-07 00:51:38,657 INFO L878 garLoopResultBuilder]: At program point L341(lines 341 379) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,657 INFO L878 garLoopResultBuilder]: At program point L209(lines 209 581) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and .cse0 .cse1 (= 3 ssl3_accept_~blastFlag~0)) (= ssl3_accept_~blastFlag~0 0) (<= ssl3_accept_~s__state~0 8656) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L176(lines 176 592) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L143(lines 143 603) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L110-2(lines 110 632) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L408(lines 399 417) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L243(lines 243 246) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L177(lines 176 592) the Hoare annotation is: (let ((.cse0 (= 8448 ssl3_accept_~s__state~0))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and .cse0 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (= ssl3_accept_~blastFlag~0 0) .cse0))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L144(lines 137 605) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L111(line 111) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L542(lines 542 548) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L344(lines 344 378) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L344-1(lines 344 378) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L212(lines 212 580) the Hoare annotation is: (or (= ssl3_accept_~blastFlag~0 0) (<= ssl3_accept_~s__state~0 8672) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L179(lines 179 591) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse2 .cse1 .cse3) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L146(lines 146 602) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,658 INFO L878 garLoopResultBuilder]: At program point L113(lines 113 613) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L510(lines 510 513) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)) .cse1) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse2 .cse1) (and .cse0 .cse2 .cse1 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L477(lines 477 479) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L411(lines 411 413) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L345(lines 345 375) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L213(lines 209 581) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 .cse1 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L114(lines 113 613) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (= ssl3_accept_~blastFlag~0 0) .cse0))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L577(lines 110 632) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L545(lines 545 547) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L545-2(lines 219 576) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1))) [2022-04-07 00:51:38,659 INFO L885 garLoopResultBuilder]: At program point L215(lines 215 579) the Hoare annotation is: true [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L182(lines 182 590) the Hoare annotation is: (let ((.cse1 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and (<= ssl3_accept_~blastFlag~0 7) .cse5) (and .cse1 .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse5) (and .cse0 .cse2 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse2 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse2) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L149(lines 149 601) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L116(lines 116 612) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L315(lines 315 322) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,659 INFO L878 garLoopResultBuilder]: At program point L315-2(lines 315 322) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,659 INFO L885 garLoopResultBuilder]: At program point L216(lines 215 579) the Hoare annotation is: true [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L183(lines 179 591) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L150(lines 146 602) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L614(lines 614 630) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L515(lines 515 525) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)) .cse1) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse2 .cse1) (and .cse0 .cse2 .cse1 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L350(lines 350 373) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,660 INFO L885 garLoopResultBuilder]: At program point L218(lines 217 579) the Hoare annotation is: true [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L185(lines 185 589) the Hoare annotation is: (let ((.cse1 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and (<= ssl3_accept_~blastFlag~0 7) .cse5) (and .cse1 .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse5) (and .cse0 .cse2 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse2 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse2) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L152(lines 152 600) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L119(lines 119 611) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L615(lines 615 629) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L285(lines 285 287) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L285-2(lines 219 576) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L616(lines 616 621) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L616-2(lines 615 629) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L451(lines 451 453) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,660 INFO L878 garLoopResultBuilder]: At program point L319(lines 319 321) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L518(lines 518 524) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)) .cse1) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse2 .cse1) (and .cse0 .cse2 .cse1 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L353(lines 353 357) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L353-2(lines 353 357) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L254(lines 254 264) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L188(lines 188 588) the Hoare annotation is: (let ((.cse1 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and (<= ssl3_accept_~blastFlag~0 7) .cse5) (and .cse1 .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse5) (and .cse0 .cse2 (= ssl3_accept_~s__state~0 8608)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse2) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L155(lines 155 599) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L122(lines 122 610) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L618(lines 618 620) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,661 INFO L885 garLoopResultBuilder]: At program point ssl3_acceptEXIT(lines 22 645) the Hoare annotation is: true [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L486(lines 486 496) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__state~0 8640) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L387(lines 387 419) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L255(lines 255 258) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L222(lines 116 612) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L189(lines 185 589) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L156(lines 152 600) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L454(lines 454 463) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L388(lines 388 394) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,661 INFO L878 garLoopResultBuilder]: At program point L554(lines 554 558) the Hoare annotation is: (let ((.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 4)))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L521(lines 521 523) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)) .cse1) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse2 .cse1) (and .cse0 .cse2 .cse1 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L554-2(lines 554 558) the Hoare annotation is: (let ((.cse0 (= 8448 ssl3_accept_~s__state~0)) (.cse1 (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0))) (or (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse0 .cse1 (= ssl3_accept_~blastFlag~0 4)) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L521-2(lines 219 576) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse1 (<= ssl3_accept_~s__state~0 8672))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0 .cse1) (and .cse0 (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)) .cse1) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse2 .cse1) (and .cse0 .cse2 .cse1 (= 3 ssl3_accept_~blastFlag~0)))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L191(lines 191 587) the Hoare annotation is: (let ((.cse1 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and (<= ssl3_accept_~blastFlag~0 7) .cse5) (and .cse1 .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse5) (and .cse0 .cse2 (= ssl3_accept_~s__state~0 8608)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse2) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L158(lines 158 598) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L125(lines 125 609) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,662 INFO L885 garLoopResultBuilder]: At program point ssl3_acceptFINAL(lines 22 645) the Hoare annotation is: true [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L489(lines 489 495) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__state~0 8640) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L489-2(lines 219 576) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and .cse0 (not (= ssl3_accept_~s__hit~0 0))) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__state~0 8640) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L93(lines 93 99) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L623(lines 623 627) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L458(lines 458 460) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L227(lines 227 229) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L194(lines 194 586) the Hoare annotation is: (let ((.cse1 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and (<= ssl3_accept_~blastFlag~0 7) .cse5) (and .cse1 .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse2) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L161(lines 161 597) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,662 INFO L878 garLoopResultBuilder]: At program point L227-2(lines 227 229) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L128(lines 128 608) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L492(lines 492 494) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (= ssl3_accept_~s__state~0 8640) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L195(lines 191 587) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8656))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) .cse0 (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L162(lines 158 598) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L96(lines 96 98) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L96-2(lines 93 99) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L493(lines 83 644) the Hoare annotation is: false [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L361(lines 361 369) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L362(lines 338 380) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L197(lines 197 585) the Hoare annotation is: (let ((.cse1 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse4 (<= ssl3_accept_~s__state~0 8576)) (.cse5 (not (= ssl3_accept_~s__hit~0 0))) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse2 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (= ssl3_accept_~blastFlag~0 0) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse2) (and (<= ssl3_accept_~blastFlag~0 7) .cse5) (and .cse1 .cse2 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse4 .cse5) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse2) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L164(lines 164 596) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L131(lines 131 607) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION(line 642) the Hoare annotation is: false [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L429(lines 429 431) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L396(lines 387 419) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L132(lines 128 608) the Hoare annotation is: (let ((.cse0 (<= ssl3_accept_~s__state~0 8576))) (or (and (<= ssl3_accept_~blastFlag~0 2) .cse0 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (and (= ssl3_accept_~blastFlag~0 0) .cse0) (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))))) [2022-04-07 00:51:38,663 INFO L878 garLoopResultBuilder]: At program point L364(lines 364 366) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,664 INFO L878 garLoopResultBuilder]: At program point L298(lines 298 300) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,664 INFO L878 garLoopResultBuilder]: At program point L232(lines 232 234) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576) (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0)))) [2022-04-07 00:51:38,664 INFO L878 garLoopResultBuilder]: At program point L298-2(lines 219 576) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,664 INFO L878 garLoopResultBuilder]: At program point L332(lines 332 336) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,664 INFO L878 garLoopResultBuilder]: At program point L332-2(lines 219 576) the Hoare annotation is: (or (and (<= ssl3_accept_~blastFlag~0 7) (<= ssl3_accept_~s__state~0 8656) (not (= ssl3_accept_~s__hit~0 0))) (and (<= ssl3_accept_~blastFlag~0 2) (<= ssl3_accept_~s__state~0 8576))) [2022-04-07 00:51:38,664 INFO L878 garLoopResultBuilder]: At program point L200(lines 200 584) the Hoare annotation is: (let ((.cse0 (<= 8656 ssl3_accept_~s__state~0)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse2 (<= ssl3_accept_~s__state~0 8672)) (.cse3 (<= ssl3_accept_~s__state~0 8576)) (.cse4 (not (= ssl3_accept_~s__hit~0 0)))) (or (= ssl3_accept_~blastFlag~0 0) (and (<= ssl3_accept_~blastFlag~0 2) .cse0 .cse1 .cse2) (and .cse3 .cse1) (and (<= ssl3_accept_~blastFlag~0 7) .cse4) (and .cse0 .cse1 .cse2 (= 3 ssl3_accept_~blastFlag~0)) (and .cse3 .cse4) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,664 INFO L878 garLoopResultBuilder]: At program point L167(lines 167 595) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse0 (<= ssl3_accept_~blastFlag~0 2)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576))) (or (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,664 INFO L878 garLoopResultBuilder]: At program point L134(lines 134 606) the Hoare annotation is: (let ((.cse2 (<= 8656 ssl3_accept_~s__state~0)) (.cse3 (<= ssl3_accept_~s__state~0 8672)) (.cse1 (<= ssl3_accept_~s__s3__tmp__next_state___0~0 8576)) (.cse0 (<= ssl3_accept_~blastFlag~0 2))) (or (and .cse0 (= 8496 ssl3_accept_~s__state~0)) (and .cse0 (<= ssl3_accept_~s__state~0 8576) .cse1) (= ssl3_accept_~blastFlag~0 0) (and .cse0 (= ssl3_accept_~s__state~0 8544)) (and .cse0 (= 8560 ssl3_accept_~s__state~0)) (and .cse0 .cse2 .cse1 .cse3) (and (= 8448 ssl3_accept_~s__state~0) (= 3 ssl3_accept_~s__s3__tmp__next_state___0~0) (= ssl3_accept_~blastFlag~0 4)) (and .cse0 (= ssl3_accept_~s__state~0 8512)) (and (<= ssl3_accept_~blastFlag~0 7) (not (= ssl3_accept_~s__hit~0 0))) (and .cse2 .cse1 .cse3 (= 3 ssl3_accept_~blastFlag~0)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8608)) (and .cse0 .cse1 (= ssl3_accept_~s__state~0 8592)) (and .cse0 (= ssl3_accept_~s__state~0 8640) .cse1) (and .cse0 (= ssl3_accept_~s__state~0 8528)) (= ssl3_accept_~s__state~0 3))) [2022-04-07 00:51:38,664 INFO L878 garLoopResultBuilder]: At program point L101(lines 101 105) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:38,664 INFO L878 garLoopResultBuilder]: At program point L101-1(lines 83 644) the Hoare annotation is: (= ssl3_accept_~blastFlag~0 0) [2022-04-07 00:51:38,664 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:51:38,664 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-07 00:51:38,664 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:51:38,664 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-07 00:51:38,664 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-07 00:51:38,664 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-07 00:51:38,664 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-07 00:51:38,666 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-07 00:51:38,667 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 00:51:38,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 12:51:38 BoogieIcfgContainer [2022-04-07 00:51:38,681 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 00:51:38,681 INFO L158 Benchmark]: Toolchain (without parser) took 71006.65ms. Allocated memory was 189.8MB in the beginning and 692.1MB in the end (delta: 502.3MB). Free memory was 140.6MB in the beginning and 403.2MB in the end (delta: -262.6MB). Peak memory consumption was 412.9MB. Max. memory is 8.0GB. [2022-04-07 00:51:38,681 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory was 157.1MB in the beginning and 157.0MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 00:51:38,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.42ms. Allocated memory is still 189.8MB. Free memory was 140.5MB in the beginning and 161.1MB in the end (delta: -20.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 00:51:38,681 INFO L158 Benchmark]: Boogie Preprocessor took 28.74ms. Allocated memory is still 189.8MB. Free memory was 161.1MB in the beginning and 158.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 00:51:38,682 INFO L158 Benchmark]: RCFGBuilder took 559.62ms. Allocated memory is still 189.8MB. Free memory was 158.8MB in the beginning and 130.7MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. [2022-04-07 00:51:38,682 INFO L158 Benchmark]: TraceAbstraction took 70159.97ms. Allocated memory was 189.8MB in the beginning and 692.1MB in the end (delta: 502.3MB). Free memory was 130.1MB in the beginning and 403.2MB in the end (delta: -273.1MB). Peak memory consumption was 403.7MB. Max. memory is 8.0GB. [2022-04-07 00:51:38,683 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory was 157.1MB in the beginning and 157.0MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 254.42ms. Allocated memory is still 189.8MB. Free memory was 140.5MB in the beginning and 161.1MB in the end (delta: -20.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.74ms. Allocated memory is still 189.8MB. Free memory was 161.1MB in the beginning and 158.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 559.62ms. Allocated memory is still 189.8MB. Free memory was 158.8MB in the beginning and 130.7MB in the end (delta: 28.1MB). Peak memory consumption was 28.3MB. Max. memory is 8.0GB. * TraceAbstraction took 70159.97ms. Allocated memory was 189.8MB in the beginning and 692.1MB in the end (delta: 502.3MB). Free memory was 130.1MB in the beginning and 403.2MB in the end (delta: -273.1MB). Peak memory consumption was 403.7MB. 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: 642]: 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 5 procedures, 159 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.1s, OverallIterations: 23, TraceHistogramMax: 31, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 30.9s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6362 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6360 mSDsluCounter, 6620 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 702 mSDsCounter, 524 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5031 IncrementalHoareTripleChecker+Invalid, 5555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 524 mSolverCounterUnsat, 5918 mSDtfsCounter, 5031 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4966 GetRequests, 4883 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3221occurred in iteration=15, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 2263 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 156 LocationsWithAnnotation, 156 PreInvPairs, 3468 NumberOfFragments, 6623 HoareAnnotationTreeSize, 156 FomulaSimplifications, 29661 FormulaSimplificationTreeSizeReduction, 10.3s HoareSimplificationTime, 156 FomulaSimplificationsInter, 118044 FormulaSimplificationTreeSizeReductionInter, 20.5s 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: 83]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8496 == s__state) || ((blastFlag <= 2 && s__state <= 8576) && s__s3__tmp__next_state___0 <= 8576)) || blastFlag == 0) || (blastFlag <= 2 && s__state == 8544)) || (blastFlag <= 2 && 8560 == s__state)) || (((blastFlag <= 2 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || ((8448 == s__state && 3 == s__s3__tmp__next_state___0) && blastFlag == 4)) || (blastFlag <= 2 && s__state == 8512)) || (blastFlag <= 7 && !(s__hit == 0))) || (((8656 <= s__state && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 3 == blastFlag)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || ((blastFlag <= 2 && s__state == 8640) && s__s3__tmp__next_state___0 <= 8576)) || (blastFlag <= 2 && s__state == 8528)) || s__state == 3 - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8576) || (blastFlag == 0 && s__state <= 8656)) || ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) - InvariantResult [Line: 338]: Loop Invariant Derived loop invariant: ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) || (blastFlag <= 2 && s__state <= 8576) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) || (blastFlag <= 2 && s__state <= 8576) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) || (blastFlag <= 2 && s__state <= 8576) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((8448 == s__state && blastFlag <= 7) && !(s__hit == 0)) || ((blastFlag <= 2 && 8448 == s__state) && s__s3__tmp__next_state___0 <= 8576)) || ((8448 == s__state && 3 == s__s3__tmp__next_state___0) && blastFlag == 4)) || (blastFlag == 0 && 8448 == s__state) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 8576) && s__s3__tmp__next_state___0 <= 8576) || (blastFlag == 0 && s__state <= 8576)) || ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8576) || (blastFlag == 0 && s__state <= 8656)) || ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) || (blastFlag <= 2 && s__state <= 8576) - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: ((blastFlag == 0 && s__state <= 8656) || ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0))) || ((blastFlag <= 2 && s__state == 8640) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((8656 <= s__state && s__s3__tmp__next_state___0 <= 8576) && 3 == blastFlag) || ((8656 <= s__state && blastFlag <= 7) && !(s__hit == 0))) || (blastFlag == 0 && 8656 <= s__state)) || ((blastFlag <= 2 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: s__state <= 8656 - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((blastFlag == 0 && 8656 <= s__state) && s__state <= 8672) || (((8656 <= s__state && blastFlag <= 7) && !(s__hit == 0)) && s__state <= 8672)) || (((blastFlag <= 2 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || (((8656 <= s__state && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 3 == blastFlag) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 8576) && s__s3__tmp__next_state___0 <= 8576) || (blastFlag == 0 && s__state <= 8576)) || ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) - InvariantResult [Line: 164]: Loop Invariant Derived loop invariant: ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) || (blastFlag <= 2 && s__state <= 8576) - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) || (blastFlag <= 2 && s__state <= 8576) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) || (blastFlag <= 2 && s__state <= 8576) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((8656 <= s__state && blastFlag <= 7) && !(s__hit == 0)) || (blastFlag == 0 && 8656 <= s__state) - InvariantResult [Line: 116]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 8576) && s__s3__tmp__next_state___0 <= 8576) || blastFlag == 0) || (blastFlag <= 7 && !(s__hit == 0)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 8656) && s__s3__tmp__next_state___0 <= 8576) || (blastFlag == 0 && s__state <= 8656)) || ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: ((((((((((((((blastFlag <= 2 && 8496 == s__state) || ((blastFlag <= 2 && s__state <= 8576) && s__s3__tmp__next_state___0 <= 8576)) || blastFlag == 0) || (blastFlag <= 2 && s__state == 8544)) || (blastFlag <= 2 && 8560 == s__state)) || (((blastFlag <= 2 && 8656 <= s__state) && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672)) || ((8448 == s__state && 3 == s__s3__tmp__next_state___0) && blastFlag == 4)) || (blastFlag <= 2 && s__state == 8512)) || (blastFlag <= 7 && !(s__hit == 0))) || (((8656 <= s__state && s__s3__tmp__next_state___0 <= 8576) && s__state <= 8672) && 3 == blastFlag)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8608)) || ((blastFlag <= 2 && s__s3__tmp__next_state___0 <= 8576) && s__state == 8592)) || ((blastFlag <= 2 && s__state == 8640) && s__s3__tmp__next_state___0 <= 8576)) || (blastFlag <= 2 && s__state == 8528)) || s__state == 3 - InvariantResult [Line: 158]: Loop Invariant Derived loop invariant: ((blastFlag <= 7 && s__state <= 8656) && !(s__hit == 0)) || (blastFlag <= 2 && s__state <= 8576) - ProcedureContractResult [Line: 646]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for ssl3_accept Derived contract for procedure ssl3_accept: 1 RESULT: Ultimate proved your program to be correct! [2022-04-07 00:51:38,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...