/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 11:16:21,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 11:16:21,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 11:16:21,491 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 11:16:21,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 11:16:21,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 11:16:21,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 11:16:21,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 11:16:21,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 11:16:21,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 11:16:21,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 11:16:21,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 11:16:21,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 11:16:21,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 11:16:21,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 11:16:21,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 11:16:21,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 11:16:21,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 11:16:21,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 11:16:21,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 11:16:21,522 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 11:16:21,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 11:16:21,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 11:16:21,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 11:16:21,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 11:16:21,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 11:16:21,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 11:16:21,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 11:16:21,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 11:16:21,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 11:16:21,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 11:16:21,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 11:16:21,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 11:16:21,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 11:16:21,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 11:16:21,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 11:16:21,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 11:16:21,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 11:16:21,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 11:16:21,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 11:16:21,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 11:16:21,541 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 11:16:21,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 11:16:21,551 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 11:16:21,551 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 11:16:21,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 11:16:21,552 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 11:16:21,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 11:16:21,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 11:16:21,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 11:16:21,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 11:16:21,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 11:16:21,554 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 11:16:21,554 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 11:16:21,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 11:16:21,554 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 11:16:21,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 11:16:21,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 11:16:21,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 11:16:21,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 11:16:21,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 11:16:21,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:16:21,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 11:16:21,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 11:16:21,556 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 11:16:21,556 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 11:16:21,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 11:16:21,556 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 11:16:21,556 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-15 11:16:21,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 11:16:21,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 11:16:21,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 11:16:21,780 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 11:16:21,781 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 11:16:21,782 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-15 11:16:21,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00adbb5bd/ef0c438a49ff4b56b2fc4feeec6a8408/FLAGfcf3b2660 [2022-04-15 11:16:22,192 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 11:16:22,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-15 11:16:22,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00adbb5bd/ef0c438a49ff4b56b2fc4feeec6a8408/FLAGfcf3b2660 [2022-04-15 11:16:22,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00adbb5bd/ef0c438a49ff4b56b2fc4feeec6a8408 [2022-04-15 11:16:22,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 11:16:22,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 11:16:22,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 11:16:22,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 11:16:22,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 11:16:22,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:16:22" (1/1) ... [2022-04-15 11:16:22,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51875c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22, skipping insertion in model container [2022-04-15 11:16:22,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 11:16:22" (1/1) ... [2022-04-15 11:16:22,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 11:16:22,246 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 11:16:22,405 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_1a.cil.c[14184,14197] [2022-04-15 11:16:22,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:16:22,414 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 11:16:22,437 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_1a.cil.c[14184,14197] [2022-04-15 11:16:22,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 11:16:22,447 INFO L208 MainTranslator]: Completed translation [2022-04-15 11:16:22,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22 WrapperNode [2022-04-15 11:16:22,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 11:16:22,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 11:16:22,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 11:16:22,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 11:16:22,456 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22" (1/1) ... [2022-04-15 11:16:22,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22" (1/1) ... [2022-04-15 11:16:22,461 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22" (1/1) ... [2022-04-15 11:16:22,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22" (1/1) ... [2022-04-15 11:16:22,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22" (1/1) ... [2022-04-15 11:16:22,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22" (1/1) ... [2022-04-15 11:16:22,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22" (1/1) ... [2022-04-15 11:16:22,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 11:16:22,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 11:16:22,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 11:16:22,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 11:16:22,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22" (1/1) ... [2022-04-15 11:16:22,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 11:16:22,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:16:22,504 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-15 11:16:22,507 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-15 11:16:22,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 11:16:22,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 11:16:22,531 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 11:16:22,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 11:16:22,531 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 11:16:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 11:16:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 11:16:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 11:16:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-15 11:16:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 11:16:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-15 11:16:22,532 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 11:16:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 11:16:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 11:16:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 11:16:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 11:16:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 11:16:22,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 11:16:22,583 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 11:16:22,585 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 11:16:22,768 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 11:16:22,774 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 11:16:22,774 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 11:16:22,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:16:22 BoogieIcfgContainer [2022-04-15 11:16:22,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 11:16:22,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 11:16:22,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 11:16:22,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 11:16:22,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 11:16:22" (1/3) ... [2022-04-15 11:16:22,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40de0311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:16:22, skipping insertion in model container [2022-04-15 11:16:22,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 11:16:22" (2/3) ... [2022-04-15 11:16:22,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40de0311 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 11:16:22, skipping insertion in model container [2022-04-15 11:16:22,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 11:16:22" (3/3) ... [2022-04-15 11:16:22,791 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2022-04-15 11:16:22,812 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 11:16:22,812 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 11:16:22,850 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 11:16:22,857 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-15 11:16:22,858 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 11:16:22,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 46 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 11:16:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 11:16:22,892 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:22,893 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:22,893 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 1 times [2022-04-15 11:16:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:22,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [851850711] [2022-04-15 11:16:22,912 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 11:16:22,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 2 times [2022-04-15 11:16:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:22,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452577378] [2022-04-15 11:16:22,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:23,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:23,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-15 11:16:23,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-15 11:16:23,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-15 11:16:23,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:23,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {54#true} is VALID [2022-04-15 11:16:23,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-15 11:16:23,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-15 11:16:23,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret9 := main(); {54#true} is VALID [2022-04-15 11:16:23,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {59#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:23,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {59#(= main_~blastFlag~0 0)} assume !false; {59#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:23,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {59#(= main_~blastFlag~0 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {55#false} is VALID [2022-04-15 11:16:23,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-15 11:16:23,179 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-15 11:16:23,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:23,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452577378] [2022-04-15 11:16:23,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452577378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:23,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:23,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:23,183 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:23,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [851850711] [2022-04-15 11:16:23,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [851850711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:23,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:23,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 11:16:23,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659398962] [2022-04-15 11:16:23,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:23,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 11:16:23,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:23,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:23,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 11:16:23,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:23,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 11:16:23,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 11:16:23,229 INFO L87 Difference]: Start difference. First operand has 51 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 46 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:23,603 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2022-04-15 11:16:23,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 11:16:23,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 11:16:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-15 11:16:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-15 11:16:23,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 224 transitions. [2022-04-15 11:16:23,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:23,888 INFO L225 Difference]: With dead ends: 136 [2022-04-15 11:16:23,889 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 11:16:23,891 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-15 11:16:23,897 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 187 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:23,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 79 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:16:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 11:16:23,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-15 11:16:23,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:23,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,942 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,944 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:23,951 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-15 11:16:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-15 11:16:23,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:23,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:23,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 11:16:23,954 INFO L87 Difference]: Start difference. First operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 11:16:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:23,970 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-15 11:16:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-15 11:16:23,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:23,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:23,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:23,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 79 states have (on average 1.5443037974683544) internal successors, (122), 79 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2022-04-15 11:16:23,982 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 9 [2022-04-15 11:16:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:23,982 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2022-04-15 11:16:23,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:23,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 125 transitions. [2022-04-15 11:16:24,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-15 11:16:24,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 11:16:24,112 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:24,115 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 11:16:24,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 11:16:24,121 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:24,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 1 times [2022-04-15 11:16:24,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:24,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1767652021] [2022-04-15 11:16:24,337 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:24,374 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:24,374 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:16:24,375 INFO L85 PathProgramCache]: Analyzing trace with hash 162574473, now seen corresponding path program 1 times [2022-04-15 11:16:24,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:24,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006560231] [2022-04-15 11:16:24,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:24,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:24,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:24,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-15 11:16:24,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-15 11:16:24,461 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-15 11:16:24,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:24,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-15 11:16:24,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-15 11:16:24,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-15 11:16:24,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret9 := main(); {669#true} is VALID [2022-04-15 11:16:24,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {674#(and (= main_~blastFlag~0 0) (= (+ (- 8466) main_~s__state~0) 0))} is VALID [2022-04-15 11:16:24,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(and (= main_~blastFlag~0 0) (= (+ (- 8466) main_~s__state~0) 0))} [204] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_48 v_main_~s__state~0_47)) (.cse3 (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) (.cse2 (= v_main_~blastFlag~0_23 0)) (.cse1 (= v_main_~s__state~0_48 8466))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3) (and .cse0 .cse3) (and .cse2 (= v_main_~s__state~0_47 8496) .cse1 (= v_main_~blastFlag~0_22 1)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:24,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [205] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:24,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [206] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_48 v_main_~s__state~0_47) (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:24,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [203] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:24,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {670#false} is VALID [2022-04-15 11:16:24,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-15 11:16:24,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 11:16:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:24,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006560231] [2022-04-15 11:16:24,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006560231] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:16:24,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514526831] [2022-04-15 11:16:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:24,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:16:24,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:16:24,479 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-15 11:16:24,493 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-15 11:16:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:24,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 11:16:24,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:24,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:16:24,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {669#true} is VALID [2022-04-15 11:16:24,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-15 11:16:24,725 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-15 11:16:24,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-15 11:16:24,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret9 := main(); {669#true} is VALID [2022-04-15 11:16:24,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {674#(and (= main_~blastFlag~0 0) (= (+ (- 8466) main_~s__state~0) 0))} is VALID [2022-04-15 11:16:24,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(and (= main_~blastFlag~0 0) (= (+ (- 8466) main_~s__state~0) 0))} [204] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_48 v_main_~s__state~0_47)) (.cse3 (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) (.cse2 (= v_main_~blastFlag~0_23 0)) (.cse1 (= v_main_~s__state~0_48 8466))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3) (and .cse0 .cse3) (and .cse2 (= v_main_~s__state~0_47 8496) .cse1 (= v_main_~blastFlag~0_22 1)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:24,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [205] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:24,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {675#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [206] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_48 v_main_~s__state~0_47) (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {704#(<= main_~blastFlag~0 1)} is VALID [2022-04-15 11:16:24,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {704#(<= main_~blastFlag~0 1)} [203] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= main_~blastFlag~0 1)} is VALID [2022-04-15 11:16:24,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {704#(<= main_~blastFlag~0 1)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {670#false} is VALID [2022-04-15 11:16:24,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-15 11:16:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 11:16:24,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:16:24,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#false} assume !false; {670#false} is VALID [2022-04-15 11:16:24,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#(not (< 2 main_~blastFlag~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {670#false} is VALID [2022-04-15 11:16:24,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {717#(not (< 2 main_~blastFlag~0))} [203] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {717#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:24,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {717#(not (< 2 main_~blastFlag~0))} [206] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_48 v_main_~s__state~0_47) (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {717#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:24,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#(not (< 2 main_~blastFlag~0))} [205] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {717#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:24,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {717#(not (< 2 main_~blastFlag~0))} [204] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_48 v_main_~s__state~0_47)) (.cse3 (= v_main_~blastFlag~0_23 v_main_~blastFlag~0_22)) (.cse2 (= v_main_~blastFlag~0_23 0)) (.cse1 (= v_main_~s__state~0_48 8466))) (or (and .cse0 (or (not .cse1) (not .cse2)) .cse3) (and .cse0 .cse3) (and .cse2 (= v_main_~s__state~0_47 8496) .cse1 (= v_main_~blastFlag~0_22 1)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_23, main_~s__state~0=v_main_~s__state~0_48} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_22, main_~s__state~0=v_main_~s__state~0_47} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {717#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:24,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {669#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {717#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:24,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret9 := main(); {669#true} is VALID [2022-04-15 11:16:24,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #200#return; {669#true} is VALID [2022-04-15 11:16:24,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2022-04-15 11:16:24,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {669#true} is VALID [2022-04-15 11:16:24,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {669#true} is VALID [2022-04-15 11:16:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 11:16:24,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514526831] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 11:16:24,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 11:16:24,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 7 [2022-04-15 11:16:24,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:24,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1767652021] [2022-04-15 11:16:24,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1767652021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:24,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:24,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 11:16:24,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095226900] [2022-04-15 11:16:24,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:24,887 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 11:16:24,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:24,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:24,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:24,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 11:16:24,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:24,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 11:16:24,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:16:24,900 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:25,341 INFO L93 Difference]: Finished difference Result 175 states and 273 transitions. [2022-04-15 11:16:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 11:16:25,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 11:16:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2022-04-15 11:16:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2022-04-15 11:16:25,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 213 transitions. [2022-04-15 11:16:25,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:25,535 INFO L225 Difference]: With dead ends: 175 [2022-04-15 11:16:25,535 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 11:16:25,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-15 11:16:25,539 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 62 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:25,542 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 160 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 11:16:25,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 11:16:25,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-15 11:16:25,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:25,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:25,593 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:25,594 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:25,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:25,599 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-15 11:16:25,599 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-15 11:16:25,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:25,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:25,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-15 11:16:25,606 INFO L87 Difference]: Start difference. First operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 98 states. [2022-04-15 11:16:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:25,614 INFO L93 Difference]: Finished difference Result 98 states and 143 transitions. [2022-04-15 11:16:25,614 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 143 transitions. [2022-04-15 11:16:25,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:25,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:25,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:25,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:25,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2022-04-15 11:16:25,624 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 14 [2022-04-15 11:16:25,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:25,625 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2022-04-15 11:16:25,625 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:25,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 142 transitions. [2022-04-15 11:16:25,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:25,758 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2022-04-15 11:16:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 11:16:25,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:25,758 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 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] [2022-04-15 11:16:25,795 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-15 11:16:25,976 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:16:25,977 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:25,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:25,977 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 1 times [2022-04-15 11:16:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:25,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1730712987] [2022-04-15 11:16:26,105 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:26,216 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:26,248 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:26,357 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:26,481 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:26,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:26,517 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:16:26,518 INFO L85 PathProgramCache]: Analyzing trace with hash 893692037, now seen corresponding path program 1 times [2022-04-15 11:16:26,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:26,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611013506] [2022-04-15 11:16:26,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:26,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:26,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {1501#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-15 11:16:26,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-15 11:16:26,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1493#true} {1493#true} #200#return; {1493#true} is VALID [2022-04-15 11:16:26,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1501#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:26,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {1501#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-15 11:16:26,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-15 11:16:26,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #200#return; {1493#true} is VALID [2022-04-15 11:16:26,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret9 := main(); {1493#true} is VALID [2022-04-15 11:16:26,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} [208] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} [209] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} [210] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} [211] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} [212] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_65 v_main_~s__state~0_64) (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} [213] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {1498#(and (<= main_~s__state~0 8466) (<= 8466 main_~s__state~0) (= main_~blastFlag~0 0))} [214] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_41 0)) (.cse1 (= v_main_~s__state~0_65 8466)) (.cse2 (= v_main_~s__state~0_65 v_main_~s__state~0_64)) (.cse3 (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40))) (or (and .cse0 (= v_main_~s__state~0_64 8496) .cse1 (= v_main_~blastFlag~0_40 1)) (and .cse2 (or (not .cse0) (not .cse1)) .cse3) (and .cse2 .cse3))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1499#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:26,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [215] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1499#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:26,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [216] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_67 v_main_~s__state~0_66)) (.cse3 (= v_main_~s__state~0_67 8496)) (.cse4 (= v_main_~blastFlag~0_43 1)) (.cse2 (= v_main_~s__hit~0_9 0)) (.cse1 (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_9 v_main_~s__hit~0_9)) (and .cse2 .cse3 (= 2 v_main_~blastFlag~0_42) (= v_main_~s__state~0_66 8512) .cse4) (and .cse0 (or (not .cse3) (not .cse4) (not .cse2)) .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_67, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_43} OutVars{main_~s__state~0=v_main_~s__state~0_66, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_42} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:26,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [217] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:26,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [218] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_67 v_main_~s__state~0_66) (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_43, main_~s__state~0=v_main_~s__state~0_67} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_42, main_~s__state~0=v_main_~s__state~0_66} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:26,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [207] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:26,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1494#false} is VALID [2022-04-15 11:16:26,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-15 11:16:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 11:16:26,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:26,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611013506] [2022-04-15 11:16:26,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611013506] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:16:26,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543338455] [2022-04-15 11:16:26,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:26,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:16:26,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:16:26,711 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-15 11:16:26,712 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-15 11:16:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:26,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 11:16:26,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:26,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:16:26,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1493#true} is VALID [2022-04-15 11:16:26,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-15 11:16:26,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-15 11:16:26,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #200#return; {1493#true} is VALID [2022-04-15 11:16:26,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret9 := main(); {1493#true} is VALID [2022-04-15 11:16:26,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1520#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {1520#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [208] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1520#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {1520#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [209] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1520#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {1520#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [210] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1530#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:26,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {1530#(= main_~blastFlag~0 0)} [211] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:26,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {1530#(= main_~blastFlag~0 0)} [212] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_65 v_main_~s__state~0_64) (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1530#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:26,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {1530#(= main_~blastFlag~0 0)} [213] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1530#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:26,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {1530#(= main_~blastFlag~0 0)} [214] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_41 0)) (.cse1 (= v_main_~s__state~0_65 8466)) (.cse2 (= v_main_~s__state~0_65 v_main_~s__state~0_64)) (.cse3 (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40))) (or (and .cse0 (= v_main_~s__state~0_64 8496) .cse1 (= v_main_~blastFlag~0_40 1)) (and .cse2 (or (not .cse0) (not .cse1)) .cse3) (and .cse2 .cse3))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1543#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {1543#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [215] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1543#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:26,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {1543#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [216] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_67 v_main_~s__state~0_66)) (.cse3 (= v_main_~s__state~0_67 8496)) (.cse4 (= v_main_~blastFlag~0_43 1)) (.cse2 (= v_main_~s__hit~0_9 0)) (.cse1 (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_9 v_main_~s__hit~0_9)) (and .cse2 .cse3 (= 2 v_main_~blastFlag~0_42) (= v_main_~s__state~0_66 8512) .cse4) (and .cse0 (or (not .cse3) (not .cse4) (not .cse2)) .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_67, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_43} OutVars{main_~s__state~0=v_main_~s__state~0_66, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_42} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:26,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [217] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:26,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {1500#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [218] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_67 v_main_~s__state~0_66) (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_43, main_~s__state~0=v_main_~s__state~0_67} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_42, main_~s__state~0=v_main_~s__state~0_66} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:26,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {1556#(<= main_~blastFlag~0 2)} [207] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:26,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {1556#(<= main_~blastFlag~0 2)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1494#false} is VALID [2022-04-15 11:16:26,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-15 11:16:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 11:16:26,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:16:27,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {1494#false} assume !false; {1494#false} is VALID [2022-04-15 11:16:27,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {1556#(<= main_~blastFlag~0 2)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1494#false} is VALID [2022-04-15 11:16:27,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {1556#(<= main_~blastFlag~0 2)} [207] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:27,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {1556#(<= main_~blastFlag~0 2)} [218] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_67 v_main_~s__state~0_66) (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_43, main_~s__state~0=v_main_~s__state~0_67} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_42, main_~s__state~0=v_main_~s__state~0_66} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:27,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {1556#(<= main_~blastFlag~0 2)} [217] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:27,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {1556#(<= main_~blastFlag~0 2)} [216] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_67 v_main_~s__state~0_66)) (.cse3 (= v_main_~s__state~0_67 8496)) (.cse4 (= v_main_~blastFlag~0_43 1)) (.cse2 (= v_main_~s__hit~0_9 0)) (.cse1 (= v_main_~blastFlag~0_43 v_main_~blastFlag~0_42))) (or (and .cse0 .cse1 (= v_main_~s__hit~0_9 v_main_~s__hit~0_9)) (and .cse2 .cse3 (= 2 v_main_~blastFlag~0_42) (= v_main_~s__state~0_66 8512) .cse4) (and .cse0 (or (not .cse3) (not .cse4) (not .cse2)) .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_67, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_43} OutVars{main_~s__state~0=v_main_~s__state~0_66, main_~s__hit~0=v_main_~s__hit~0_9, main_~blastFlag~0=v_main_~blastFlag~0_42} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:27,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {1556#(<= main_~blastFlag~0 2)} [215] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:27,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {1556#(<= main_~blastFlag~0 2)} [214] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_41 0)) (.cse1 (= v_main_~s__state~0_65 8466)) (.cse2 (= v_main_~s__state~0_65 v_main_~s__state~0_64)) (.cse3 (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40))) (or (and .cse0 (= v_main_~s__state~0_64 8496) .cse1 (= v_main_~blastFlag~0_40 1)) (and .cse2 (or (not .cse0) (not .cse1)) .cse3) (and .cse2 .cse3))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:27,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {1556#(<= main_~blastFlag~0 2)} [213] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:27,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {1556#(<= main_~blastFlag~0 2)} [212] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_65 v_main_~s__state~0_64) (= v_main_~blastFlag~0_41 v_main_~blastFlag~0_40)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_41, main_~s__state~0=v_main_~s__state~0_65} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_40, main_~s__state~0=v_main_~s__state~0_64} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:27,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {1556#(<= main_~blastFlag~0 2)} [211] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:27,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {1599#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [210] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1556#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:27,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {1599#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [209] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1599#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:27,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {1599#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [208] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_63 v_main_~s__state~0_62)) (.cse2 (= v_main_~s__state~0_63 8656)) (.cse1 (= 2 v_main_~blastFlag~0_39))) (or (and .cse0 (or (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_38 v_main_~blastFlag~0_39)) (and .cse0 (= v_main_~blastFlag~0_39 v_main_~blastFlag~0_38)) (and (= 3 v_main_~blastFlag~0_38) .cse2 .cse1 (= v_main_~s__state~0_62 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_39, main_~s__state~0=v_main_~s__state~0_63} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_38, main_~s__state~0=v_main_~s__state~0_62} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {1599#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:27,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {1493#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {1599#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:27,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {1493#true} call #t~ret9 := main(); {1493#true} is VALID [2022-04-15 11:16:27,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1493#true} {1493#true} #200#return; {1493#true} is VALID [2022-04-15 11:16:27,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {1493#true} assume true; {1493#true} is VALID [2022-04-15 11:16:27,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {1493#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {1493#true} is VALID [2022-04-15 11:16:27,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {1493#true} call ULTIMATE.init(); {1493#true} is VALID [2022-04-15 11:16:27,272 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-15 11:16:27,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543338455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:16:27,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 11:16:27,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 4] total 11 [2022-04-15 11:16:27,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:27,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1730712987] [2022-04-15 11:16:27,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1730712987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:27,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:27,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 11:16:27,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808221128] [2022-04-15 11:16:27,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:27,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 11:16:27,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:27,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:27,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:27,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 11:16:27,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:27,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 11:16:27,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-04-15 11:16:27,436 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:28,328 INFO L93 Difference]: Finished difference Result 197 states and 291 transitions. [2022-04-15 11:16:28,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 11:16:28,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 11:16:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:28,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:28,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2022-04-15 11:16:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 214 transitions. [2022-04-15 11:16:28,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 214 transitions. [2022-04-15 11:16:28,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:28,519 INFO L225 Difference]: With dead ends: 197 [2022-04-15 11:16:28,519 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 11:16:28,520 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2022-04-15 11:16:28,521 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 208 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:28,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 90 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 11:16:28,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 11:16:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2022-04-15 11:16:28,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:28,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:28,577 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:28,578 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:28,581 INFO L93 Difference]: Finished difference Result 110 states and 156 transitions. [2022-04-15 11:16:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2022-04-15 11:16:28,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:28,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:28,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-15 11:16:28,581 INFO L87 Difference]: Start difference. First operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-15 11:16:28,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:28,584 INFO L93 Difference]: Finished difference Result 110 states and 156 transitions. [2022-04-15 11:16:28,584 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2022-04-15 11:16:28,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:28,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:28,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:28,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 105 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2022-04-15 11:16:28,589 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 35 [2022-04-15 11:16:28,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:28,589 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2022-04-15 11:16:28,589 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:28,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 155 transitions. [2022-04-15 11:16:28,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2022-04-15 11:16:28,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 11:16:28,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:28,740 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 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] [2022-04-15 11:16:28,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 11:16:28,940 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,SelfDestructingSolverStorable2 [2022-04-15 11:16:28,941 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:28,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:28,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 1 times [2022-04-15 11:16:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:28,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [657423501] [2022-04-15 11:16:29,052 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:29,148 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:29,244 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:29,269 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:29,389 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:29,427 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:29,427 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:16:29,428 INFO L85 PathProgramCache]: Analyzing trace with hash 637718917, now seen corresponding path program 1 times [2022-04-15 11:16:29,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:29,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332582792] [2022-04-15 11:16:29,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:29,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:29,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:29,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:29,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {2483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2474#true} is VALID [2022-04-15 11:16:29,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {2474#true} assume true; {2474#true} is VALID [2022-04-15 11:16:29,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2474#true} {2474#true} #200#return; {2474#true} is VALID [2022-04-15 11:16:29,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {2474#true} call ULTIMATE.init(); {2483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:29,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {2483#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2474#true} is VALID [2022-04-15 11:16:29,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {2474#true} assume true; {2474#true} is VALID [2022-04-15 11:16:29,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2474#true} {2474#true} #200#return; {2474#true} is VALID [2022-04-15 11:16:29,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {2474#true} call #t~ret9 := main(); {2474#true} is VALID [2022-04-15 11:16:29,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {2474#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:29,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [220] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_104 8656)) (.cse3 (= 2 v_main_~blastFlag~0_82)) (.cse0 (= v_main_~s__state~0_104 v_main_~s__state~0_103)) (.cse1 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81))) (or (and .cse0 .cse1) (and .cse2 (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_103 8672) .cse3) (and (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_104} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_103} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2480#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:29,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {2480#(= main_~blastFlag~0 0)} [221] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2480#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:29,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {2480#(= main_~blastFlag~0 0)} [222] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_104 8656)) (.cse3 (= 2 v_main_~blastFlag~0_82)) (.cse0 (= v_main_~s__state~0_104 v_main_~s__state~0_103)) (.cse1 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81))) (or (and .cse0 .cse1) (and .cse2 (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_103 8672) .cse3) (and (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_104} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_103} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2480#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:29,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {2480#(= main_~blastFlag~0 0)} [223] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2480#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:29,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {2480#(= main_~blastFlag~0 0)} [224] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83)) (.cse1 (= v_main_~s__state~0_106 v_main_~s__state~0_105)) (.cse3 (= 8466 v_main_~s__state~0_106)) (.cse2 (= v_main_~blastFlag~0_84 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 8496 v_main_~s__state~0_105) (= v_main_~blastFlag~0_83 1)) (and .cse0 .cse1 (or (not .cse3) (not .cse2))))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_106} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_105} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:29,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [225] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:29,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [226] L188-->L35_primed: Formula: (and (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83) (= v_main_~s__state~0_106 v_main_~s__state~0_105)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_106} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_105} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:29,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [227] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:29,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [228] L188-->L35_primed: Formula: (let ((.cse4 (= v_main_~blastFlag~0_86 1)) (.cse2 (= v_main_~s__hit~0_13 0)) (.cse3 (= 8496 v_main_~s__state~0_108)) (.cse0 (= v_main_~s__state~0_108 v_main_~s__state~0_107)) (.cse1 (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85))) (or (and .cse0 .cse1 (or .cse2 (not .cse3) (not .cse4))) (and (= 2 v_main_~blastFlag~0_85) (= v_main_~s__state~0_107 8656) .cse4 (not .cse2) .cse3) (and (= v_main_~s__hit~0_13 v_main_~s__hit~0_13) .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_108, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_86} OutVars{main_~s__state~0=v_main_~s__state~0_107, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_85} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (<= 8656 main_~s__state~0))} is VALID [2022-04-15 11:16:29,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (<= 8656 main_~s__state~0))} [229] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (<= 8656 main_~s__state~0))} is VALID [2022-04-15 11:16:29,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (<= 8656 main_~s__state~0))} [230] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_108 v_main_~s__state~0_107) (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_86, main_~s__state~0=v_main_~s__state~0_108} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_85, main_~s__state~0=v_main_~s__state~0_107} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (<= 8656 main_~s__state~0))} is VALID [2022-04-15 11:16:29,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (<= 8656 main_~s__state~0))} [219] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (<= 8656 main_~s__state~0))} is VALID [2022-04-15 11:16:29,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {2482#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (<= 8656 main_~s__state~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2475#false} is VALID [2022-04-15 11:16:29,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#false} assume !false; {2475#false} is VALID [2022-04-15 11:16:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-15 11:16:29,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:29,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332582792] [2022-04-15 11:16:29,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332582792] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:16:29,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080787612] [2022-04-15 11:16:29,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:29,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:16:29,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:16:29,571 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-15 11:16:29,572 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-15 11:16:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:29,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 11:16:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:29,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:16:29,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {2474#true} call ULTIMATE.init(); {2474#true} is VALID [2022-04-15 11:16:29,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {2474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2474#true} is VALID [2022-04-15 11:16:29,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {2474#true} assume true; {2474#true} is VALID [2022-04-15 11:16:29,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2474#true} {2474#true} #200#return; {2474#true} is VALID [2022-04-15 11:16:29,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {2474#true} call #t~ret9 := main(); {2474#true} is VALID [2022-04-15 11:16:29,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {2474#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:29,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [220] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_104 8656)) (.cse3 (= 2 v_main_~blastFlag~0_82)) (.cse0 (= v_main_~s__state~0_104 v_main_~s__state~0_103)) (.cse1 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81))) (or (and .cse0 .cse1) (and .cse2 (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_103 8672) .cse3) (and (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_104} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_103} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:29,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [221] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:29,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [222] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_104 8656)) (.cse3 (= 2 v_main_~blastFlag~0_82)) (.cse0 (= v_main_~s__state~0_104 v_main_~s__state~0_103)) (.cse1 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81))) (or (and .cse0 .cse1) (and .cse2 (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_103 8672) .cse3) (and (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_104} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_103} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:29,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [223] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:29,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {2479#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [224] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83)) (.cse1 (= v_main_~s__state~0_106 v_main_~s__state~0_105)) (.cse3 (= 8466 v_main_~s__state~0_106)) (.cse2 (= v_main_~blastFlag~0_84 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 8496 v_main_~s__state~0_105) (= v_main_~blastFlag~0_83 1)) (and .cse0 .cse1 (or (not .cse3) (not .cse2))))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_106} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_105} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:29,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [225] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:29,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [226] L188-->L35_primed: Formula: (and (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83) (= v_main_~s__state~0_106 v_main_~s__state~0_105)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_106} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_105} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:29,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [227] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:29,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {2481#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [228] L188-->L35_primed: Formula: (let ((.cse4 (= v_main_~blastFlag~0_86 1)) (.cse2 (= v_main_~s__hit~0_13 0)) (.cse3 (= 8496 v_main_~s__state~0_108)) (.cse0 (= v_main_~s__state~0_108 v_main_~s__state~0_107)) (.cse1 (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85))) (or (and .cse0 .cse1 (or .cse2 (not .cse3) (not .cse4))) (and (= 2 v_main_~blastFlag~0_85) (= v_main_~s__state~0_107 8656) .cse4 (not .cse2) .cse3) (and (= v_main_~s__hit~0_13 v_main_~s__hit~0_13) .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_108, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_86} OutVars{main_~s__state~0=v_main_~s__state~0_107, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_85} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2529#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:29,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {2529#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [229] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2529#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:29,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {2529#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [230] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_108 v_main_~s__state~0_107) (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_86, main_~s__state~0=v_main_~s__state~0_108} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_85, main_~s__state~0=v_main_~s__state~0_107} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2536#(or (<= main_~blastFlag~0 1) (and (<= main_~blastFlag~0 2) (<= 8656 main_~s__state~0)))} is VALID [2022-04-15 11:16:29,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {2536#(or (<= main_~blastFlag~0 1) (and (<= main_~blastFlag~0 2) (<= 8656 main_~s__state~0)))} [219] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2536#(or (<= main_~blastFlag~0 1) (and (<= main_~blastFlag~0 2) (<= 8656 main_~s__state~0)))} is VALID [2022-04-15 11:16:29,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {2536#(or (<= main_~blastFlag~0 1) (and (<= main_~blastFlag~0 2) (<= 8656 main_~s__state~0)))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2475#false} is VALID [2022-04-15 11:16:29,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#false} assume !false; {2475#false} is VALID [2022-04-15 11:16:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 11:16:29,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:16:30,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {2475#false} assume !false; {2475#false} is VALID [2022-04-15 11:16:30,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {2549#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2475#false} is VALID [2022-04-15 11:16:30,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {2549#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [219] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2549#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-15 11:16:30,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {2549#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [230] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_108 v_main_~s__state~0_107) (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_86, main_~s__state~0=v_main_~s__state~0_108} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_85, main_~s__state~0=v_main_~s__state~0_107} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2549#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-15 11:16:30,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {2549#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [229] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2549#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-15 11:16:30,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {2562#(<= main_~blastFlag~0 2)} [228] L188-->L35_primed: Formula: (let ((.cse4 (= v_main_~blastFlag~0_86 1)) (.cse2 (= v_main_~s__hit~0_13 0)) (.cse3 (= 8496 v_main_~s__state~0_108)) (.cse0 (= v_main_~s__state~0_108 v_main_~s__state~0_107)) (.cse1 (= v_main_~blastFlag~0_86 v_main_~blastFlag~0_85))) (or (and .cse0 .cse1 (or .cse2 (not .cse3) (not .cse4))) (and (= 2 v_main_~blastFlag~0_85) (= v_main_~s__state~0_107 8656) .cse4 (not .cse2) .cse3) (and (= v_main_~s__hit~0_13 v_main_~s__hit~0_13) .cse0 .cse1))) InVars {main_~s__state~0=v_main_~s__state~0_108, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_86} OutVars{main_~s__state~0=v_main_~s__state~0_107, main_~s__hit~0=v_main_~s__hit~0_13, main_~blastFlag~0=v_main_~blastFlag~0_85} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2549#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-15 11:16:30,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {2562#(<= main_~blastFlag~0 2)} [227] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2562#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:30,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {2562#(<= main_~blastFlag~0 2)} [226] L188-->L35_primed: Formula: (and (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83) (= v_main_~s__state~0_106 v_main_~s__state~0_105)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_106} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_105} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2562#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:30,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {2562#(<= main_~blastFlag~0 2)} [225] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2562#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:30,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {2562#(<= main_~blastFlag~0 2)} [224] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_84 v_main_~blastFlag~0_83)) (.cse1 (= v_main_~s__state~0_106 v_main_~s__state~0_105)) (.cse3 (= 8466 v_main_~s__state~0_106)) (.cse2 (= v_main_~blastFlag~0_84 0))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 8496 v_main_~s__state~0_105) (= v_main_~blastFlag~0_83 1)) (and .cse0 .cse1 (or (not .cse3) (not .cse2))))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_84, main_~s__state~0=v_main_~s__state~0_106} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_83, main_~s__state~0=v_main_~s__state~0_105} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2562#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:30,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {2562#(<= main_~blastFlag~0 2)} [223] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2562#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:30,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {2581#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [222] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_104 8656)) (.cse3 (= 2 v_main_~blastFlag~0_82)) (.cse0 (= v_main_~s__state~0_104 v_main_~s__state~0_103)) (.cse1 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81))) (or (and .cse0 .cse1) (and .cse2 (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_103 8672) .cse3) (and (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_104} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_103} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2562#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:30,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {2581#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [221] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2581#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:30,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {2581#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [220] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_104 8656)) (.cse3 (= 2 v_main_~blastFlag~0_82)) (.cse0 (= v_main_~s__state~0_104 v_main_~s__state~0_103)) (.cse1 (= v_main_~blastFlag~0_82 v_main_~blastFlag~0_81))) (or (and .cse0 .cse1) (and .cse2 (= 3 v_main_~blastFlag~0_81) (= v_main_~s__state~0_103 8672) .cse3) (and (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_82, main_~s__state~0=v_main_~s__state~0_104} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_81, main_~s__state~0=v_main_~s__state~0_103} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {2581#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:30,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {2474#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {2581#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:30,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {2474#true} call #t~ret9 := main(); {2474#true} is VALID [2022-04-15 11:16:30,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2474#true} {2474#true} #200#return; {2474#true} is VALID [2022-04-15 11:16:30,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {2474#true} assume true; {2474#true} is VALID [2022-04-15 11:16:30,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {2474#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {2474#true} is VALID [2022-04-15 11:16:30,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {2474#true} call ULTIMATE.init(); {2474#true} is VALID [2022-04-15 11:16:30,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 11:16:30,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080787612] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:16:30,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 11:16:30,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 12 [2022-04-15 11:16:30,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:30,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [657423501] [2022-04-15 11:16:30,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [657423501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:30,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:30,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 11:16:30,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755498063] [2022-04-15 11:16:30,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:30,468 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 11:16:30,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:30,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:30,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:30,493 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 11:16:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:30,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 11:16:30,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2022-04-15 11:16:30,494 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:32,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:32,136 INFO L93 Difference]: Finished difference Result 296 states and 454 transitions. [2022-04-15 11:16:32,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 11:16:32,137 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 11:16:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:32,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2022-04-15 11:16:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:32,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 260 transitions. [2022-04-15 11:16:32,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 260 transitions. [2022-04-15 11:16:32,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:32,334 INFO L225 Difference]: With dead ends: 296 [2022-04-15 11:16:32,334 INFO L226 Difference]: Without dead ends: 209 [2022-04-15 11:16:32,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2022-04-15 11:16:32,335 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 160 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:32,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 106 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 11:16:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-15 11:16:32,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 142. [2022-04-15 11:16:32,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:32,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 142 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 138 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:32,425 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 142 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 138 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:32,425 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 142 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 138 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:32,431 INFO L93 Difference]: Finished difference Result 209 states and 295 transitions. [2022-04-15 11:16:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 295 transitions. [2022-04-15 11:16:32,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:32,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:32,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 138 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 209 states. [2022-04-15 11:16:32,432 INFO L87 Difference]: Start difference. First operand has 142 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 138 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 209 states. [2022-04-15 11:16:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:32,438 INFO L93 Difference]: Finished difference Result 209 states and 295 transitions. [2022-04-15 11:16:32,438 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 295 transitions. [2022-04-15 11:16:32,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:32,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:32,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:32,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 138 states have (on average 1.3405797101449275) internal successors, (185), 138 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 188 transitions. [2022-04-15 11:16:32,443 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 188 transitions. Word has length 35 [2022-04-15 11:16:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:32,443 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 188 transitions. [2022-04-15 11:16:32,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:32,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 188 transitions. [2022-04-15 11:16:32,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:32,649 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 188 transitions. [2022-04-15 11:16:32,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 11:16:32,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:32,650 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 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] [2022-04-15 11:16:32,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 11:16:32,855 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:16:32,856 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:32,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:32,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1646162945, now seen corresponding path program 1 times [2022-04-15 11:16:32,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:32,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1395283671] [2022-04-15 11:16:32,975 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:33,090 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:33,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:33,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:33,241 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:33,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:33,355 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:33,449 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:33,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:33,557 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:33,557 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:16:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2142772609, now seen corresponding path program 1 times [2022-04-15 11:16:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:33,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450830000] [2022-04-15 11:16:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:33,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:33,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {3934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3925#true} is VALID [2022-04-15 11:16:33,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {3925#true} assume true; {3925#true} is VALID [2022-04-15 11:16:33,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3925#true} {3925#true} #200#return; {3925#true} is VALID [2022-04-15 11:16:33,717 INFO L272 TraceCheckUtils]: 0: Hoare triple {3925#true} call ULTIMATE.init(); {3934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:33,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {3934#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3925#true} is VALID [2022-04-15 11:16:33,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {3925#true} assume true; {3925#true} is VALID [2022-04-15 11:16:33,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3925#true} {3925#true} #200#return; {3925#true} is VALID [2022-04-15 11:16:33,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {3925#true} call #t~ret9 := main(); {3925#true} is VALID [2022-04-15 11:16:33,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {3925#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {3930#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:33,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {3930#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [232] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_126 v_main_~blastFlag~0_125)) (.cse1 (= v_main_~s__state~0_147 v_main_~s__state~0_146)) (.cse3 (= v_main_~blastFlag~0_126 2)) (.cse2 (= v_main_~s__state~0_147 8656))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse3 .cse2 (= v_main_~blastFlag~0_125 3) (= v_main_~s__state~0_146 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_126, main_~s__state~0=v_main_~s__state~0_147} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_125, main_~s__state~0=v_main_~s__state~0_146} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3931#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:33,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {3931#(= main_~blastFlag~0 0)} [233] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3931#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:33,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {3931#(= main_~blastFlag~0 0)} [234] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_126 v_main_~blastFlag~0_125)) (.cse1 (= v_main_~s__state~0_147 v_main_~s__state~0_146)) (.cse3 (= v_main_~blastFlag~0_126 2)) (.cse2 (= v_main_~s__state~0_147 8656))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse3 .cse2 (= v_main_~blastFlag~0_125 3) (= v_main_~s__state~0_146 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_126, main_~s__state~0=v_main_~s__state~0_147} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_125, main_~s__state~0=v_main_~s__state~0_146} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3931#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:33,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {3931#(= main_~blastFlag~0 0)} [235] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3931#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:33,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {3931#(= main_~blastFlag~0 0)} [236] L188-->L35_primed: Formula: (and (= v_main_~blastFlag~0_128 v_main_~blastFlag~0_127) (= v_main_~s__state~0_149 v_main_~s__state~0_148)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_128, main_~s__state~0=v_main_~s__state~0_149} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_127, main_~s__state~0=v_main_~s__state~0_148} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3931#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:33,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {3931#(= main_~blastFlag~0 0)} [237] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3931#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:33,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {3931#(= main_~blastFlag~0 0)} [238] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~blastFlag~0_128 v_main_~blastFlag~0_127)) (.cse3 (= v_main_~s__state~0_149 v_main_~s__state~0_148)) (.cse1 (= 8466 v_main_~s__state~0_149)) (.cse0 (= v_main_~blastFlag~0_128 0))) (or (and (= v_main_~blastFlag~0_127 1) .cse0 (= 8496 v_main_~s__state~0_148) .cse1) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not .cse0))))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_128, main_~s__state~0=v_main_~s__state~0_149} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_127, main_~s__state~0=v_main_~s__state~0_148} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [239] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [240] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_151 v_main_~s__state~0_150) (= v_main_~blastFlag~0_130 v_main_~blastFlag~0_129)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_130, main_~s__state~0=v_main_~s__state~0_151} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_129, main_~s__state~0=v_main_~s__state~0_150} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [241] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [242] L188-->L35_primed: Formula: (let ((.cse3 (= v_main_~blastFlag~0_130 1)) (.cse1 (= 8496 v_main_~s__state~0_151)) (.cse2 (= v_main_~s__hit~0_17 0)) (.cse0 (= v_main_~s__state~0_151 v_main_~s__state~0_150)) (.cse4 (= v_main_~blastFlag~0_130 v_main_~blastFlag~0_129))) (or (and .cse0 (or (not .cse1) (not .cse2) (not .cse3)) .cse4) (and (= v_main_~blastFlag~0_129 2) .cse3 .cse1 .cse2 (= v_main_~s__state~0_150 8512)) (and (= v_main_~s__hit~0_17 v_main_~s__hit~0_17) .cse0 .cse4))) InVars {main_~s__state~0=v_main_~s__state~0_151, main_~s__hit~0=v_main_~s__hit~0_17, main_~blastFlag~0=v_main_~blastFlag~0_130} OutVars{main_~s__state~0=v_main_~s__state~0_150, main_~s__hit~0=v_main_~s__hit~0_17, main_~blastFlag~0=v_main_~blastFlag~0_129} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [243] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [244] L188-->L35_primed: Formula: (= v_main_~s__state~0_153 v_main_~s__state~0_152) InVars {main_~s__state~0=v_main_~s__state~0_153} OutVars{main_~s__state~0=v_main_~s__state~0_152} AuxVars[] AssignedVars[main_~s__state~0] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [245] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [246] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_153 v_main_~s__state~0_152)) (.cse0 (<= v_main_~blastFlag~0_131 2)) (.cse1 (= v_main_~s__state~0_153 8512))) (or (and (= v_main_~s__state~0_152 8528) .cse0 .cse1) (and .cse2 (= v_main_~blastFlag~0_131 v_main_~blastFlag~0_131)) (and .cse2 (or (not .cse0) (not .cse1))))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_131, main_~s__state~0=v_main_~s__state~0_153} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_131, main_~s__state~0=v_main_~s__state~0_152} AuxVars[] AssignedVars[main_~s__state~0] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [247] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [248] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_155 v_main_~s__state~0_154)) (.cse1 (<= v_main_~blastFlag~0_132 2)) (.cse2 (= 8466 v_main_~s__state~0_155)) (.cse3 (= v_main_~blastFlag~0_132 0))) (or (and (= v_main_~blastFlag~0_132 v_main_~blastFlag~0_132) .cse0) (and (or (not .cse1) (not .cse2) .cse3) .cse0) (and (= 8496 v_main_~s__state~0_154) .cse1 .cse2 (not .cse3)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_132, main_~s__state~0=v_main_~s__state~0_155} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_132, main_~s__state~0=v_main_~s__state~0_154} AuxVars[] AssignedVars[main_~s__state~0] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [249] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [250] L188-->L35_primed: Formula: (= v_main_~s__state~0_155 v_main_~s__state~0_154) InVars {main_~s__state~0=v_main_~s__state~0_155} OutVars{main_~s__state~0=v_main_~s__state~0_154} AuxVars[] AssignedVars[main_~s__state~0] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [231] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {3926#false} is VALID [2022-04-15 11:16:33,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {3926#false} assume !false; {3926#false} is VALID [2022-04-15 11:16:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 11:16:33,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450830000] [2022-04-15 11:16:33,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450830000] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:16:33,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382009056] [2022-04-15 11:16:33,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:33,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:16:33,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:16:33,740 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-15 11:16:33,741 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-15 11:16:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:33,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 11:16:33,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:33,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:16:33,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {3925#true} call ULTIMATE.init(); {3925#true} is VALID [2022-04-15 11:16:33,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {3925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3925#true} is VALID [2022-04-15 11:16:33,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {3925#true} assume true; {3925#true} is VALID [2022-04-15 11:16:33,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3925#true} {3925#true} #200#return; {3925#true} is VALID [2022-04-15 11:16:33,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {3925#true} call #t~ret9 := main(); {3925#true} is VALID [2022-04-15 11:16:33,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {3925#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {3930#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:33,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {3930#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [232] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_126 v_main_~blastFlag~0_125)) (.cse1 (= v_main_~s__state~0_147 v_main_~s__state~0_146)) (.cse3 (= v_main_~blastFlag~0_126 2)) (.cse2 (= v_main_~s__state~0_147 8656))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse3 .cse2 (= v_main_~blastFlag~0_125 3) (= v_main_~s__state~0_146 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_126, main_~s__state~0=v_main_~s__state~0_147} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_125, main_~s__state~0=v_main_~s__state~0_146} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3930#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:33,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {3930#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [233] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3930#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:33,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {3930#(and (<= main_~s__state~0 8466) (= main_~blastFlag~0 0))} [234] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_126 v_main_~blastFlag~0_125)) (.cse1 (= v_main_~s__state~0_147 v_main_~s__state~0_146)) (.cse3 (= v_main_~blastFlag~0_126 2)) (.cse2 (= v_main_~s__state~0_147 8656))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse3 .cse2 (= v_main_~blastFlag~0_125 3) (= v_main_~s__state~0_146 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_126, main_~s__state~0=v_main_~s__state~0_147} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_125, main_~s__state~0=v_main_~s__state~0_146} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3931#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:33,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {3931#(= main_~blastFlag~0 0)} [235] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3931#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:33,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {3931#(= main_~blastFlag~0 0)} [236] L188-->L35_primed: Formula: (and (= v_main_~blastFlag~0_128 v_main_~blastFlag~0_127) (= v_main_~s__state~0_149 v_main_~s__state~0_148)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_128, main_~s__state~0=v_main_~s__state~0_149} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_127, main_~s__state~0=v_main_~s__state~0_148} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3931#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:33,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {3931#(= main_~blastFlag~0 0)} [237] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3931#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:33,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {3931#(= main_~blastFlag~0 0)} [238] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~blastFlag~0_128 v_main_~blastFlag~0_127)) (.cse3 (= v_main_~s__state~0_149 v_main_~s__state~0_148)) (.cse1 (= 8466 v_main_~s__state~0_149)) (.cse0 (= v_main_~blastFlag~0_128 0))) (or (and (= v_main_~blastFlag~0_127 1) .cse0 (= 8496 v_main_~s__state~0_148) .cse1) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not .cse0))))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_128, main_~s__state~0=v_main_~s__state~0_149} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_127, main_~s__state~0=v_main_~s__state~0_148} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [239] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [240] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_151 v_main_~s__state~0_150) (= v_main_~blastFlag~0_130 v_main_~blastFlag~0_129)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_130, main_~s__state~0=v_main_~s__state~0_151} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_129, main_~s__state~0=v_main_~s__state~0_150} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [241] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {3932#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [242] L188-->L35_primed: Formula: (let ((.cse3 (= v_main_~blastFlag~0_130 1)) (.cse1 (= 8496 v_main_~s__state~0_151)) (.cse2 (= v_main_~s__hit~0_17 0)) (.cse0 (= v_main_~s__state~0_151 v_main_~s__state~0_150)) (.cse4 (= v_main_~blastFlag~0_130 v_main_~blastFlag~0_129))) (or (and .cse0 (or (not .cse1) (not .cse2) (not .cse3)) .cse4) (and (= v_main_~blastFlag~0_129 2) .cse3 .cse1 .cse2 (= v_main_~s__state~0_150 8512)) (and (= v_main_~s__hit~0_17 v_main_~s__hit~0_17) .cse0 .cse4))) InVars {main_~s__state~0=v_main_~s__state~0_151, main_~s__hit~0=v_main_~s__hit~0_17, main_~blastFlag~0=v_main_~blastFlag~0_130} OutVars{main_~s__state~0=v_main_~s__state~0_150, main_~s__hit~0=v_main_~s__hit~0_17, main_~blastFlag~0=v_main_~blastFlag~0_129} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [243] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [244] L188-->L35_primed: Formula: (= v_main_~s__state~0_153 v_main_~s__state~0_152) InVars {main_~s__state~0=v_main_~s__state~0_153} OutVars{main_~s__state~0=v_main_~s__state~0_152} AuxVars[] AssignedVars[main_~s__state~0] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [245] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,995 INFO L290 TraceCheckUtils]: 20: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [246] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_153 v_main_~s__state~0_152)) (.cse0 (<= v_main_~blastFlag~0_131 2)) (.cse1 (= v_main_~s__state~0_153 8512))) (or (and (= v_main_~s__state~0_152 8528) .cse0 .cse1) (and .cse2 (= v_main_~blastFlag~0_131 v_main_~blastFlag~0_131)) (and .cse2 (or (not .cse0) (not .cse1))))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_131, main_~s__state~0=v_main_~s__state~0_153} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_131, main_~s__state~0=v_main_~s__state~0_152} AuxVars[] AssignedVars[main_~s__state~0] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [247] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [248] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_155 v_main_~s__state~0_154)) (.cse1 (<= v_main_~blastFlag~0_132 2)) (.cse2 (= 8466 v_main_~s__state~0_155)) (.cse3 (= v_main_~blastFlag~0_132 0))) (or (and (= v_main_~blastFlag~0_132 v_main_~blastFlag~0_132) .cse0) (and (or (not .cse1) (not .cse2) .cse3) .cse0) (and (= 8496 v_main_~s__state~0_154) .cse1 .cse2 (not .cse3)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_132, main_~s__state~0=v_main_~s__state~0_155} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_132, main_~s__state~0=v_main_~s__state~0_154} AuxVars[] AssignedVars[main_~s__state~0] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [249] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [250] L188-->L35_primed: Formula: (= v_main_~s__state~0_155 v_main_~s__state~0_154) InVars {main_~s__state~0=v_main_~s__state~0_155} OutVars{main_~s__state~0=v_main_~s__state~0_154} AuxVars[] AssignedVars[main_~s__state~0] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [231] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:33,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {3933#(or (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {3926#false} is VALID [2022-04-15 11:16:33,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {3926#false} assume !false; {3926#false} is VALID [2022-04-15 11:16:34,000 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 11:16:34,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:16:34,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {3926#false} assume !false; {3926#false} is VALID [2022-04-15 11:16:34,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {3926#false} is VALID [2022-04-15 11:16:34,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [231] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [250] L188-->L35_primed: Formula: (= v_main_~s__state~0_155 v_main_~s__state~0_154) InVars {main_~s__state~0=v_main_~s__state~0_155} OutVars{main_~s__state~0=v_main_~s__state~0_154} AuxVars[] AssignedVars[main_~s__state~0] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [249] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [248] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_155 v_main_~s__state~0_154)) (.cse1 (<= v_main_~blastFlag~0_132 2)) (.cse2 (= 8466 v_main_~s__state~0_155)) (.cse3 (= v_main_~blastFlag~0_132 0))) (or (and (= v_main_~blastFlag~0_132 v_main_~blastFlag~0_132) .cse0) (and (or (not .cse1) (not .cse2) .cse3) .cse0) (and (= 8496 v_main_~s__state~0_154) .cse1 .cse2 (not .cse3)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_132, main_~s__state~0=v_main_~s__state~0_155} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_132, main_~s__state~0=v_main_~s__state~0_154} AuxVars[] AssignedVars[main_~s__state~0] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [247] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [246] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~s__state~0_153 v_main_~s__state~0_152)) (.cse0 (<= v_main_~blastFlag~0_131 2)) (.cse1 (= v_main_~s__state~0_153 8512))) (or (and (= v_main_~s__state~0_152 8528) .cse0 .cse1) (and .cse2 (= v_main_~blastFlag~0_131 v_main_~blastFlag~0_131)) (and .cse2 (or (not .cse0) (not .cse1))))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_131, main_~s__state~0=v_main_~s__state~0_153} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_131, main_~s__state~0=v_main_~s__state~0_152} AuxVars[] AssignedVars[main_~s__state~0] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [245] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [244] L188-->L35_primed: Formula: (= v_main_~s__state~0_153 v_main_~s__state~0_152) InVars {main_~s__state~0=v_main_~s__state~0_153} OutVars{main_~s__state~0=v_main_~s__state~0_152} AuxVars[] AssignedVars[main_~s__state~0] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [243] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [242] L188-->L35_primed: Formula: (let ((.cse3 (= v_main_~blastFlag~0_130 1)) (.cse1 (= 8496 v_main_~s__state~0_151)) (.cse2 (= v_main_~s__hit~0_17 0)) (.cse0 (= v_main_~s__state~0_151 v_main_~s__state~0_150)) (.cse4 (= v_main_~blastFlag~0_130 v_main_~blastFlag~0_129))) (or (and .cse0 (or (not .cse1) (not .cse2) (not .cse3)) .cse4) (and (= v_main_~blastFlag~0_129 2) .cse3 .cse1 .cse2 (= v_main_~s__state~0_150 8512)) (and (= v_main_~s__hit~0_17 v_main_~s__hit~0_17) .cse0 .cse4))) InVars {main_~s__state~0=v_main_~s__state~0_151, main_~s__hit~0=v_main_~s__hit~0_17, main_~blastFlag~0=v_main_~blastFlag~0_130} OutVars{main_~s__state~0=v_main_~s__state~0_150, main_~s__hit~0=v_main_~s__hit~0_17, main_~blastFlag~0=v_main_~blastFlag~0_129} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [241] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [240] L188-->L35_primed: Formula: (and (= v_main_~s__state~0_151 v_main_~s__state~0_150) (= v_main_~blastFlag~0_130 v_main_~blastFlag~0_129)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_130, main_~s__state~0=v_main_~s__state~0_151} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_129, main_~s__state~0=v_main_~s__state~0_150} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [239] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,260 INFO L290 TraceCheckUtils]: 12: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [238] L188-->L35_primed: Formula: (let ((.cse2 (= v_main_~blastFlag~0_128 v_main_~blastFlag~0_127)) (.cse3 (= v_main_~s__state~0_149 v_main_~s__state~0_148)) (.cse1 (= 8466 v_main_~s__state~0_149)) (.cse0 (= v_main_~blastFlag~0_128 0))) (or (and (= v_main_~blastFlag~0_127 1) .cse0 (= 8496 v_main_~s__state~0_148) .cse1) (and .cse2 .cse3) (and .cse2 .cse3 (or (not .cse1) (not .cse0))))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_128, main_~s__state~0=v_main_~s__state~0_149} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_127, main_~s__state~0=v_main_~s__state~0_148} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [237] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [236] L188-->L35_primed: Formula: (and (= v_main_~blastFlag~0_128 v_main_~blastFlag~0_127) (= v_main_~s__state~0_149 v_main_~s__state~0_148)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_128, main_~s__state~0=v_main_~s__state~0_149} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_127, main_~s__state~0=v_main_~s__state~0_148} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {4022#(not (< 2 main_~blastFlag~0))} [235] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {4077#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [234] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_126 v_main_~blastFlag~0_125)) (.cse1 (= v_main_~s__state~0_147 v_main_~s__state~0_146)) (.cse3 (= v_main_~blastFlag~0_126 2)) (.cse2 (= v_main_~s__state~0_147 8656))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse3 .cse2 (= v_main_~blastFlag~0_125 3) (= v_main_~s__state~0_146 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_126, main_~s__state~0=v_main_~s__state~0_147} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_125, main_~s__state~0=v_main_~s__state~0_146} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {4022#(not (< 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:34,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {4077#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [233] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4077#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:34,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {4077#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [232] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_126 v_main_~blastFlag~0_125)) (.cse1 (= v_main_~s__state~0_147 v_main_~s__state~0_146)) (.cse3 (= v_main_~blastFlag~0_126 2)) (.cse2 (= v_main_~s__state~0_147 8656))) (or (and .cse0 .cse1) (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse3 .cse2 (= v_main_~blastFlag~0_125 3) (= v_main_~s__state~0_146 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_126, main_~s__state~0=v_main_~s__state~0_147} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_125, main_~s__state~0=v_main_~s__state~0_146} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {4077#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:34,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {3925#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {4077#(and (not (< 2 main_~blastFlag~0)) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:34,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {3925#true} call #t~ret9 := main(); {3925#true} is VALID [2022-04-15 11:16:34,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3925#true} {3925#true} #200#return; {3925#true} is VALID [2022-04-15 11:16:34,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {3925#true} assume true; {3925#true} is VALID [2022-04-15 11:16:34,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {3925#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {3925#true} is VALID [2022-04-15 11:16:34,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {3925#true} call ULTIMATE.init(); {3925#true} is VALID [2022-04-15 11:16:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-04-15 11:16:34,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382009056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:16:34,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 11:16:34,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 4] total 9 [2022-04-15 11:16:34,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:34,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1395283671] [2022-04-15 11:16:34,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1395283671] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:34,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:34,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 11:16:34,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444960099] [2022-04-15 11:16:34,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:34,415 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 11:16:34,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:34,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:34,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:34,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 11:16:34,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:34,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 11:16:34,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-04-15 11:16:34,444 INFO L87 Difference]: Start difference. First operand 142 states and 188 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:35,434 INFO L93 Difference]: Finished difference Result 239 states and 334 transitions. [2022-04-15 11:16:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 11:16:35,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 11:16:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 11:16:35,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 222 transitions. [2022-04-15 11:16:35,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:35,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 222 transitions. [2022-04-15 11:16:35,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 222 transitions. [2022-04-15 11:16:35,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:35,626 INFO L225 Difference]: With dead ends: 239 [2022-04-15 11:16:35,626 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 11:16:35,627 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-04-15 11:16:35,627 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 213 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 11:16:35,627 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 90 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 11:16:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 11:16:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-04-15 11:16:35,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 11:16:35,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 149 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:35,742 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 149 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:35,742 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 149 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:35,746 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2022-04-15 11:16:35,746 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 196 transitions. [2022-04-15 11:16:35,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:35,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:35,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states. [2022-04-15 11:16:35,747 INFO L87 Difference]: Start difference. First operand has 149 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 150 states. [2022-04-15 11:16:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 11:16:35,750 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2022-04-15 11:16:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 196 transitions. [2022-04-15 11:16:35,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 11:16:35,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 11:16:35,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 11:16:35,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 11:16:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 145 states have (on average 1.3241379310344827) internal successors, (192), 145 states have internal predecessors, (192), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 195 transitions. [2022-04-15 11:16:35,755 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 195 transitions. Word has length 46 [2022-04-15 11:16:35,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 11:16:35,755 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 195 transitions. [2022-04-15 11:16:35,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:35,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 195 transitions. [2022-04-15 11:16:35,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 11:16:35,932 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 195 transitions. [2022-04-15 11:16:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 11:16:35,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 11:16:35,932 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 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] [2022-04-15 11:16:35,952 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-15 11:16:36,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:16:36,147 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 11:16:36,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 11:16:36,148 INFO L85 PathProgramCache]: Analyzing trace with hash 446239409, now seen corresponding path program 1 times [2022-04-15 11:16:36,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 11:16:36,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [691268695] [2022-04-15 11:16:36,255 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:36,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:36,435 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:36,522 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:36,553 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:36,675 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:36,771 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:36,794 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 11:16:36,794 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 11:16:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1713985539, now seen corresponding path program 1 times [2022-04-15 11:16:36,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 11:16:36,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676838901] [2022-04-15 11:16:36,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:36,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 11:16:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:36,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 11:16:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:36,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {5208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5200#true} is VALID [2022-04-15 11:16:36,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {5200#true} assume true; {5200#true} is VALID [2022-04-15 11:16:36,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5200#true} {5200#true} #200#return; {5200#true} is VALID [2022-04-15 11:16:36,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {5200#true} call ULTIMATE.init(); {5208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 11:16:36,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {5208#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5200#true} is VALID [2022-04-15 11:16:36,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {5200#true} assume true; {5200#true} is VALID [2022-04-15 11:16:36,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5200#true} {5200#true} #200#return; {5200#true} is VALID [2022-04-15 11:16:36,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {5200#true} call #t~ret9 := main(); {5200#true} is VALID [2022-04-15 11:16:36,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {5200#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {5205#(= main_~blastFlag~0 0)} [252] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_212 v_main_~s__state~0_211)) (.cse3 (= v_main_~s__hit~0_21 0)) (.cse1 (= v_main_~s__state~0_212 8672)) (.cse2 (<= v_main_~blastFlag~0_175 2))) (or (and .cse0 (= v_main_~s__hit~0_21 v_main_~s__hit~0_21) (= v_main_~blastFlag~0_175 v_main_~blastFlag~0_175)) (and .cse0 (or (not .cse1) (not .cse2) .cse3)) (and (= v_main_~s__state~0_211 8640) (not .cse3) .cse1 .cse2))) InVars {main_~s__state~0=v_main_~s__state~0_212, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} OutVars{main_~s__state~0=v_main_~s__state~0_211, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} AuxVars[] AssignedVars[main_~s__state~0] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {5205#(= main_~blastFlag~0 0)} [253] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {5205#(= main_~blastFlag~0 0)} [254] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_212 v_main_~s__state~0_211)) (.cse2 (= v_main_~s__state~0_212 8672)) (.cse4 (= v_main_~blastFlag~0_175 4)) (.cse1 (= v_main_~s__hit~0_21 0)) (.cse3 (= 5 v_main_~blastFlag~0_175))) (or (and .cse0 (= v_main_~s__hit~0_21 v_main_~s__hit~0_21) (= v_main_~blastFlag~0_175 v_main_~blastFlag~0_175)) (and (= v_main_~s__state~0_211 8640) (not .cse1) .cse2 (not .cse3) (not .cse4)) (and .cse0 (or (not .cse2) .cse4 .cse1 .cse3)))) InVars {main_~s__state~0=v_main_~s__state~0_212, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} OutVars{main_~s__state~0=v_main_~s__state~0_211, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} AuxVars[] AssignedVars[main_~s__state~0] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {5205#(= main_~blastFlag~0 0)} [255] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {5205#(= main_~blastFlag~0 0)} [256] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_177 v_main_~blastFlag~0_176)) (.cse1 (= v_main_~s__state~0_214 v_main_~s__state~0_213)) (.cse3 (= v_main_~s__state~0_214 8656)) (.cse2 (= v_main_~blastFlag~0_177 2))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse0 .cse1) (and (= v_main_~blastFlag~0_176 3) .cse3 .cse2 (= v_main_~s__state~0_213 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_177, main_~s__state~0=v_main_~s__state~0_214} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_176, main_~s__state~0=v_main_~s__state~0_213} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {5205#(= main_~blastFlag~0 0)} [257] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {5205#(= main_~blastFlag~0 0)} [258] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_177 v_main_~blastFlag~0_176)) (.cse1 (= v_main_~s__state~0_214 v_main_~s__state~0_213)) (.cse3 (= v_main_~s__state~0_214 8656)) (.cse2 (= v_main_~blastFlag~0_177 2))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse0 .cse1) (and (= v_main_~blastFlag~0_176 3) .cse3 .cse2 (= v_main_~s__state~0_213 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_177, main_~s__state~0=v_main_~s__state~0_214} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_176, main_~s__state~0=v_main_~s__state~0_213} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {5205#(= main_~blastFlag~0 0)} [259] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {5205#(= main_~blastFlag~0 0)} [260] L188-->L35_primed: Formula: (and (= v_main_~blastFlag~0_179 v_main_~blastFlag~0_178) (= v_main_~s__state~0_216 v_main_~s__state~0_215)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_179, main_~s__state~0=v_main_~s__state~0_216} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_178, main_~s__state~0=v_main_~s__state~0_215} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {5205#(= main_~blastFlag~0 0)} [261] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:36,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {5205#(= main_~blastFlag~0 0)} [262] L188-->L35_primed: Formula: (let ((.cse2 (= 8466 v_main_~s__state~0_216)) (.cse3 (= v_main_~blastFlag~0_179 0)) (.cse0 (= v_main_~blastFlag~0_179 v_main_~blastFlag~0_178)) (.cse1 (= v_main_~s__state~0_216 v_main_~s__state~0_215))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 8496 v_main_~s__state~0_215) (= v_main_~blastFlag~0_178 1)) (and (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_179, main_~s__state~0=v_main_~s__state~0_216} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_178, main_~s__state~0=v_main_~s__state~0_215} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5206#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:36,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {5206#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [263] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5206#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} is VALID [2022-04-15 11:16:36,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {5206#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1))} [264] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__hit~0_22 0)) (.cse2 (= v_main_~blastFlag~0_181 1)) (.cse1 (= 8496 v_main_~s__state~0_218)) (.cse3 (= v_main_~s__state~0_218 v_main_~s__state~0_217))) (or (and (or .cse0 (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_180 v_main_~blastFlag~0_181) .cse3) (and (not .cse0) (= v_main_~blastFlag~0_180 2) (= v_main_~s__state~0_217 8656) .cse2 .cse1) (and (= v_main_~s__hit~0_22 v_main_~s__hit~0_22) (= v_main_~blastFlag~0_181 v_main_~blastFlag~0_180) .cse3))) InVars {main_~s__state~0=v_main_~s__state~0_218, main_~s__hit~0=v_main_~s__hit~0_22, main_~blastFlag~0=v_main_~blastFlag~0_181} OutVars{main_~s__state~0=v_main_~s__state~0_217, main_~s__hit~0=v_main_~s__hit~0_22, main_~blastFlag~0=v_main_~blastFlag~0_180} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5207#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:36,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {5207#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [265] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5207#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:36,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {5207#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [266] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_218 v_main_~s__state~0_217))) (or (and (= v_main_~blastFlag~0_181 v_main_~blastFlag~0_180) .cse0) (and (= v_main_~blastFlag~0_180 v_main_~blastFlag~0_181) .cse0))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_181, main_~s__state~0=v_main_~s__state~0_218} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_180, main_~s__state~0=v_main_~s__state~0_217} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5207#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:36,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {5207#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} [251] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5207#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} is VALID [2022-04-15 11:16:36,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {5207#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {5201#false} is VALID [2022-04-15 11:16:36,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {5201#false} assume !false; {5201#false} is VALID [2022-04-15 11:16:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 11:16:36,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 11:16:36,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676838901] [2022-04-15 11:16:36,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676838901] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 11:16:36,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886217017] [2022-04-15 11:16:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 11:16:36,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:16:36,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 11:16:36,895 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-15 11:16:36,896 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-15 11:16:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:36,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 11:16:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 11:16:36,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 11:16:37,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {5200#true} call ULTIMATE.init(); {5200#true} is VALID [2022-04-15 11:16:37,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {5200#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5200#true} is VALID [2022-04-15 11:16:37,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {5200#true} assume true; {5200#true} is VALID [2022-04-15 11:16:37,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5200#true} {5200#true} #200#return; {5200#true} is VALID [2022-04-15 11:16:37,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {5200#true} call #t~ret9 := main(); {5200#true} is VALID [2022-04-15 11:16:37,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {5200#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {5205#(= main_~blastFlag~0 0)} [252] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_212 v_main_~s__state~0_211)) (.cse3 (= v_main_~s__hit~0_21 0)) (.cse1 (= v_main_~s__state~0_212 8672)) (.cse2 (<= v_main_~blastFlag~0_175 2))) (or (and .cse0 (= v_main_~s__hit~0_21 v_main_~s__hit~0_21) (= v_main_~blastFlag~0_175 v_main_~blastFlag~0_175)) (and .cse0 (or (not .cse1) (not .cse2) .cse3)) (and (= v_main_~s__state~0_211 8640) (not .cse3) .cse1 .cse2))) InVars {main_~s__state~0=v_main_~s__state~0_212, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} OutVars{main_~s__state~0=v_main_~s__state~0_211, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} AuxVars[] AssignedVars[main_~s__state~0] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {5205#(= main_~blastFlag~0 0)} [253] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {5205#(= main_~blastFlag~0 0)} [254] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_212 v_main_~s__state~0_211)) (.cse2 (= v_main_~s__state~0_212 8672)) (.cse4 (= v_main_~blastFlag~0_175 4)) (.cse1 (= v_main_~s__hit~0_21 0)) (.cse3 (= 5 v_main_~blastFlag~0_175))) (or (and .cse0 (= v_main_~s__hit~0_21 v_main_~s__hit~0_21) (= v_main_~blastFlag~0_175 v_main_~blastFlag~0_175)) (and (= v_main_~s__state~0_211 8640) (not .cse1) .cse2 (not .cse3) (not .cse4)) (and .cse0 (or (not .cse2) .cse4 .cse1 .cse3)))) InVars {main_~s__state~0=v_main_~s__state~0_212, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} OutVars{main_~s__state~0=v_main_~s__state~0_211, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} AuxVars[] AssignedVars[main_~s__state~0] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {5205#(= main_~blastFlag~0 0)} [255] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {5205#(= main_~blastFlag~0 0)} [256] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_177 v_main_~blastFlag~0_176)) (.cse1 (= v_main_~s__state~0_214 v_main_~s__state~0_213)) (.cse3 (= v_main_~s__state~0_214 8656)) (.cse2 (= v_main_~blastFlag~0_177 2))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse0 .cse1) (and (= v_main_~blastFlag~0_176 3) .cse3 .cse2 (= v_main_~s__state~0_213 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_177, main_~s__state~0=v_main_~s__state~0_214} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_176, main_~s__state~0=v_main_~s__state~0_213} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {5205#(= main_~blastFlag~0 0)} [257] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {5205#(= main_~blastFlag~0 0)} [258] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_177 v_main_~blastFlag~0_176)) (.cse1 (= v_main_~s__state~0_214 v_main_~s__state~0_213)) (.cse3 (= v_main_~s__state~0_214 8656)) (.cse2 (= v_main_~blastFlag~0_177 2))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse0 .cse1) (and (= v_main_~blastFlag~0_176 3) .cse3 .cse2 (= v_main_~s__state~0_213 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_177, main_~s__state~0=v_main_~s__state~0_214} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_176, main_~s__state~0=v_main_~s__state~0_213} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {5205#(= main_~blastFlag~0 0)} [259] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {5205#(= main_~blastFlag~0 0)} [260] L188-->L35_primed: Formula: (and (= v_main_~blastFlag~0_179 v_main_~blastFlag~0_178) (= v_main_~s__state~0_216 v_main_~s__state~0_215)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_179, main_~s__state~0=v_main_~s__state~0_216} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_178, main_~s__state~0=v_main_~s__state~0_215} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {5205#(= main_~blastFlag~0 0)} [261] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5205#(= main_~blastFlag~0 0)} is VALID [2022-04-15 11:16:37,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {5205#(= main_~blastFlag~0 0)} [262] L188-->L35_primed: Formula: (let ((.cse2 (= 8466 v_main_~s__state~0_216)) (.cse3 (= v_main_~blastFlag~0_179 0)) (.cse0 (= v_main_~blastFlag~0_179 v_main_~blastFlag~0_178)) (.cse1 (= v_main_~s__state~0_216 v_main_~s__state~0_215))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 8496 v_main_~s__state~0_215) (= v_main_~blastFlag~0_178 1)) (and (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_179, main_~s__state~0=v_main_~s__state~0_216} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_178, main_~s__state~0=v_main_~s__state~0_215} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5260#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:37,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {5260#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [263] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5260#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:37,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {5260#(or (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [264] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__hit~0_22 0)) (.cse2 (= v_main_~blastFlag~0_181 1)) (.cse1 (= 8496 v_main_~s__state~0_218)) (.cse3 (= v_main_~s__state~0_218 v_main_~s__state~0_217))) (or (and (or .cse0 (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_180 v_main_~blastFlag~0_181) .cse3) (and (not .cse0) (= v_main_~blastFlag~0_180 2) (= v_main_~s__state~0_217 8656) .cse2 .cse1) (and (= v_main_~s__hit~0_22 v_main_~s__hit~0_22) (= v_main_~blastFlag~0_181 v_main_~blastFlag~0_180) .cse3))) InVars {main_~s__state~0=v_main_~s__state~0_218, main_~s__hit~0=v_main_~s__hit~0_22, main_~blastFlag~0=v_main_~blastFlag~0_181} OutVars{main_~s__state~0=v_main_~s__state~0_217, main_~s__hit~0=v_main_~s__hit~0_22, main_~blastFlag~0=v_main_~blastFlag~0_180} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5267#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:37,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {5267#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [265] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5267#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:37,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {5267#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [266] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_218 v_main_~s__state~0_217))) (or (and (= v_main_~blastFlag~0_181 v_main_~blastFlag~0_180) .cse0) (and (= v_main_~blastFlag~0_180 v_main_~blastFlag~0_181) .cse0))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_181, main_~s__state~0=v_main_~s__state~0_218} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_180, main_~s__state~0=v_main_~s__state~0_217} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5267#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:37,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {5267#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} [251] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5267#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} is VALID [2022-04-15 11:16:37,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {5267#(or (and (= 8656 main_~s__state~0) (= 2 main_~blastFlag~0)) (and (= main_~blastFlag~0 1) (= 8496 main_~s__state~0)) (= main_~blastFlag~0 0))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {5201#false} is VALID [2022-04-15 11:16:37,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {5201#false} assume !false; {5201#false} is VALID [2022-04-15 11:16:37,114 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 11:16:37,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 11:16:37,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {5201#false} assume !false; {5201#false} is VALID [2022-04-15 11:16:37,421 INFO L290 TraceCheckUtils]: 22: Hoare triple {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {5201#false} is VALID [2022-04-15 11:16:37,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [251] L35_primed-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-15 11:16:37,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [266] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_218 v_main_~s__state~0_217))) (or (and (= v_main_~blastFlag~0_181 v_main_~blastFlag~0_180) .cse0) (and (= v_main_~blastFlag~0_180 v_main_~blastFlag~0_181) .cse0))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_181, main_~s__state~0=v_main_~s__state~0_218} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_180, main_~s__state~0=v_main_~s__state~0_217} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-15 11:16:37,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [265] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-15 11:16:37,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [264] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__hit~0_22 0)) (.cse2 (= v_main_~blastFlag~0_181 1)) (.cse1 (= 8496 v_main_~s__state~0_218)) (.cse3 (= v_main_~s__state~0_218 v_main_~s__state~0_217))) (or (and (or .cse0 (not .cse1) (not .cse2)) (= v_main_~blastFlag~0_180 v_main_~blastFlag~0_181) .cse3) (and (not .cse0) (= v_main_~blastFlag~0_180 2) (= v_main_~s__state~0_217 8656) .cse2 .cse1) (and (= v_main_~s__hit~0_22 v_main_~s__hit~0_22) (= v_main_~blastFlag~0_181 v_main_~blastFlag~0_180) .cse3))) InVars {main_~s__state~0=v_main_~s__state~0_218, main_~s__hit~0=v_main_~s__hit~0_22, main_~blastFlag~0=v_main_~blastFlag~0_181} OutVars{main_~s__state~0=v_main_~s__state~0_217, main_~s__hit~0=v_main_~s__hit~0_22, main_~blastFlag~0=v_main_~blastFlag~0_180} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-15 11:16:37,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} [263] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-15 11:16:37,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {5305#(<= main_~blastFlag~0 2)} [262] L188-->L35_primed: Formula: (let ((.cse2 (= 8466 v_main_~s__state~0_216)) (.cse3 (= v_main_~blastFlag~0_179 0)) (.cse0 (= v_main_~blastFlag~0_179 v_main_~blastFlag~0_178)) (.cse1 (= v_main_~s__state~0_216 v_main_~s__state~0_215))) (or (and .cse0 .cse1) (and .cse2 .cse3 (= 8496 v_main_~s__state~0_215) (= v_main_~blastFlag~0_178 1)) (and (or (not .cse2) (not .cse3)) .cse0 .cse1))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_179, main_~s__state~0=v_main_~s__state~0_216} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_178, main_~s__state~0=v_main_~s__state~0_215} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5286#(or (not (< 2 main_~blastFlag~0)) (not (<= main_~s__state~0 8512)))} is VALID [2022-04-15 11:16:37,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {5305#(<= main_~blastFlag~0 2)} [261] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5305#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:37,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {5305#(<= main_~blastFlag~0 2)} [260] L188-->L35_primed: Formula: (and (= v_main_~blastFlag~0_179 v_main_~blastFlag~0_178) (= v_main_~s__state~0_216 v_main_~s__state~0_215)) InVars {main_~blastFlag~0=v_main_~blastFlag~0_179, main_~s__state~0=v_main_~s__state~0_216} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_178, main_~s__state~0=v_main_~s__state~0_215} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5305#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:37,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {5305#(<= main_~blastFlag~0 2)} [259] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5305#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:37,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {5318#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [258] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_177 v_main_~blastFlag~0_176)) (.cse1 (= v_main_~s__state~0_214 v_main_~s__state~0_213)) (.cse3 (= v_main_~s__state~0_214 8656)) (.cse2 (= v_main_~blastFlag~0_177 2))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse0 .cse1) (and (= v_main_~blastFlag~0_176 3) .cse3 .cse2 (= v_main_~s__state~0_213 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_177, main_~s__state~0=v_main_~s__state~0_214} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_176, main_~s__state~0=v_main_~s__state~0_213} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5305#(<= main_~blastFlag~0 2)} is VALID [2022-04-15 11:16:37,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {5318#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} [257] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5318#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:37,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {5325#(and (not (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 2))} [256] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~blastFlag~0_177 v_main_~blastFlag~0_176)) (.cse1 (= v_main_~s__state~0_214 v_main_~s__state~0_213)) (.cse3 (= v_main_~s__state~0_214 8656)) (.cse2 (= v_main_~blastFlag~0_177 2))) (or (and .cse0 .cse1 (or (not .cse2) (not .cse3))) (and .cse0 .cse1) (and (= v_main_~blastFlag~0_176 3) .cse3 .cse2 (= v_main_~s__state~0_213 8672)))) InVars {main_~blastFlag~0=v_main_~blastFlag~0_177, main_~s__state~0=v_main_~s__state~0_214} OutVars{main_~blastFlag~0=v_main_~blastFlag~0_176, main_~s__state~0=v_main_~s__state~0_213} AuxVars[] AssignedVars[main_~blastFlag~0, main_~s__state~0] {5318#(and (<= main_~blastFlag~0 2) (or (not (= 2 main_~blastFlag~0)) (not (= 8656 main_~s__state~0))))} is VALID [2022-04-15 11:16:37,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {5325#(and (not (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 2))} [255] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5325#(and (not (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 2))} is VALID [2022-04-15 11:16:37,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {5325#(and (not (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 2))} [254] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_212 v_main_~s__state~0_211)) (.cse2 (= v_main_~s__state~0_212 8672)) (.cse4 (= v_main_~blastFlag~0_175 4)) (.cse1 (= v_main_~s__hit~0_21 0)) (.cse3 (= 5 v_main_~blastFlag~0_175))) (or (and .cse0 (= v_main_~s__hit~0_21 v_main_~s__hit~0_21) (= v_main_~blastFlag~0_175 v_main_~blastFlag~0_175)) (and (= v_main_~s__state~0_211 8640) (not .cse1) .cse2 (not .cse3) (not .cse4)) (and .cse0 (or (not .cse2) .cse4 .cse1 .cse3)))) InVars {main_~s__state~0=v_main_~s__state~0_212, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} OutVars{main_~s__state~0=v_main_~s__state~0_211, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} AuxVars[] AssignedVars[main_~s__state~0] {5325#(and (not (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 2))} is VALID [2022-04-15 11:16:37,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {5325#(and (not (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 2))} [253] L35_primed-->L188: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5325#(and (not (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 2))} is VALID [2022-04-15 11:16:37,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {5325#(and (not (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 2))} [252] L188-->L35_primed: Formula: (let ((.cse0 (= v_main_~s__state~0_212 v_main_~s__state~0_211)) (.cse3 (= v_main_~s__hit~0_21 0)) (.cse1 (= v_main_~s__state~0_212 8672)) (.cse2 (<= v_main_~blastFlag~0_175 2))) (or (and .cse0 (= v_main_~s__hit~0_21 v_main_~s__hit~0_21) (= v_main_~blastFlag~0_175 v_main_~blastFlag~0_175)) (and .cse0 (or (not .cse1) (not .cse2) .cse3)) (and (= v_main_~s__state~0_211 8640) (not .cse3) .cse1 .cse2))) InVars {main_~s__state~0=v_main_~s__state~0_212, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} OutVars{main_~s__state~0=v_main_~s__state~0_211, main_~s__hit~0=v_main_~s__hit~0_21, main_~blastFlag~0=v_main_~blastFlag~0_175} AuxVars[] AssignedVars[main_~s__state~0] {5325#(and (not (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 2))} is VALID [2022-04-15 11:16:37,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {5200#true} havoc ~s__state~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~s__hit~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~s__verify_mode~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~s__session__peer~0 := #t~nondet6;havoc #t~nondet6;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~s__s3__tmp__new_cipher__algorithms~0 := #t~nondet7;havoc #t~nondet7;havoc ~buf~0;havoc ~cb~0;havoc ~blastFlag~0;havoc ~tmp___1~0;~s__state~0 := 8466;~blastFlag~0 := 0; {5325#(and (not (= 2 main_~blastFlag~0)) (<= main_~blastFlag~0 2))} is VALID [2022-04-15 11:16:37,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {5200#true} call #t~ret9 := main(); {5200#true} is VALID [2022-04-15 11:16:37,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5200#true} {5200#true} #200#return; {5200#true} is VALID [2022-04-15 11:16:37,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {5200#true} assume true; {5200#true} is VALID [2022-04-15 11:16:37,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {5200#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2);call #Ultimate.allocInit(12, 3); {5200#true} is VALID [2022-04-15 11:16:37,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {5200#true} call ULTIMATE.init(); {5200#true} is VALID [2022-04-15 11:16:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 11:16:37,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886217017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 11:16:37,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 11:16:37,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 12 [2022-04-15 11:16:37,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 11:16:37,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [691268695] [2022-04-15 11:16:37,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [691268695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 11:16:37,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 11:16:37,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 11:16:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523489051] [2022-04-15 11:16:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 11:16:37,640 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 11:16:37,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 11:16:37,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.769230769230769) internal successors, (49), 12 states have internal predecessors, (49), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 11:16:37,677 WARN L143 InductivityCheck]: Transition 5363#(and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) (= main_~s__state~0 8640)) ( _ , assume !false; , 5207#(or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (= 2 main_~blastFlag~0)) ) not inductive [2022-04-15 11:16:37,693 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-15 11:16:37,877 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 11:16:37,878 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 11:16:37,881 INFO L158 Benchmark]: Toolchain (without parser) took 15666.01ms. Allocated memory was 206.6MB in the beginning and 313.5MB in the end (delta: 107.0MB). Free memory was 149.7MB in the beginning and 157.2MB in the end (delta: -7.5MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. [2022-04-15 11:16:37,882 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 206.6MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 11:16:37,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.78ms. Allocated memory was 206.6MB in the beginning and 261.1MB in the end (delta: 54.5MB). Free memory was 149.5MB in the beginning and 229.4MB in the end (delta: -79.9MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. [2022-04-15 11:16:37,882 INFO L158 Benchmark]: Boogie Preprocessor took 27.54ms. Allocated memory is still 261.1MB. Free memory was 229.4MB in the beginning and 227.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 11:16:37,882 INFO L158 Benchmark]: RCFGBuilder took 299.36ms. Allocated memory is still 261.1MB. Free memory was 227.7MB in the beginning and 213.5MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-15 11:16:37,883 INFO L158 Benchmark]: TraceAbstraction took 15103.56ms. Allocated memory was 261.1MB in the beginning and 313.5MB in the end (delta: 52.4MB). Free memory was 212.6MB in the beginning and 157.6MB in the end (delta: 55.0MB). Peak memory consumption was 108.7MB. Max. memory is 8.0GB. [2022-04-15 11:16:37,884 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 206.6MB. Free memory is still 166.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 227.78ms. Allocated memory was 206.6MB in the beginning and 261.1MB in the end (delta: 54.5MB). Free memory was 149.5MB in the beginning and 229.4MB in the end (delta: -79.9MB). Peak memory consumption was 9.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.54ms. Allocated memory is still 261.1MB. Free memory was 229.4MB in the beginning and 227.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 299.36ms. Allocated memory is still 261.1MB. Free memory was 227.7MB in the beginning and 213.5MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 15103.56ms. Allocated memory was 261.1MB in the beginning and 313.5MB in the end (delta: 52.4MB). Free memory was 212.6MB in the beginning and 157.6MB in the end (delta: 55.0MB). Peak memory consumption was 108.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 11:16:37,909 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...