/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:08:22,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:08:22,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:08:22,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:08:22,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:08:22,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:08:22,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:08:22,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:08:22,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:08:22,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:08:22,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:08:22,461 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:08:22,461 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:08:22,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:08:22,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:08:22,463 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:08:22,464 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:08:22,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:08:22,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:08:22,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:08:22,469 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:08:22,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:08:22,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:08:22,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:08:22,478 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:08:22,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:08:22,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:08:22,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:08:22,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:08:22,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:08:22,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:08:22,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:08:22,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:08:22,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:08:22,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:08:22,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:08:22,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:08:22,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:08:22,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:08:22,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:08:22,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:08:22,495 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:08:22,496 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:08:22,517 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:08:22,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:08:22,518 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:08:22,518 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:08:22,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:08:22,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:08:22,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:08:22,519 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:08:22,519 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:08:22,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:08:22,521 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:08:22,521 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:08:22,521 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:08:22,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:08:22,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:08:22,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:08:22,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:08:22,522 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:08:22,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:08:22,522 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:08:22,522 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:08:22,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:08:22,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:08:22,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:08:22,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:08:22,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:08:22,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:08:22,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:08:22,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:08:22,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:08:22,524 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:08:22,524 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:08:22,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:08:22,524 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 15:08:22,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:08:22,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:08:22,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:08:22,762 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:08:22,762 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:08:22,763 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-27 15:08:22,810 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe99a850/aa7a50c07fcc45e4a8ede177d4b86035/FLAGf5d63fc1c [2022-04-27 15:08:23,192 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:08:23,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/openssl-simplified/s3_srvr_1a.cil.c [2022-04-27 15:08:23,198 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe99a850/aa7a50c07fcc45e4a8ede177d4b86035/FLAGf5d63fc1c [2022-04-27 15:08:23,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe99a850/aa7a50c07fcc45e4a8ede177d4b86035 [2022-04-27 15:08:23,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:08:23,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:08:23,210 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:08:23,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:08:23,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:08:23,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:08:23" (1/1) ... [2022-04-27 15:08:23,214 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d9310b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23, skipping insertion in model container [2022-04-27 15:08:23,214 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:08:23" (1/1) ... [2022-04-27 15:08:23,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:08:23,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:08:23,388 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-27 15:08:23,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:08:23,401 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:08:23,432 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-27 15:08:23,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:08:23,442 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:08:23,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23 WrapperNode [2022-04-27 15:08:23,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:08:23,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:08:23,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:08:23,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:08:23,451 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23" (1/1) ... [2022-04-27 15:08:23,451 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23" (1/1) ... [2022-04-27 15:08:23,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23" (1/1) ... [2022-04-27 15:08:23,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23" (1/1) ... [2022-04-27 15:08:23,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23" (1/1) ... [2022-04-27 15:08:23,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23" (1/1) ... [2022-04-27 15:08:23,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23" (1/1) ... [2022-04-27 15:08:23,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:08:23,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:08:23,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:08:23,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:08:23,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23" (1/1) ... [2022-04-27 15:08:23,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:08:23,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:08:23,512 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-27 15:08:23,530 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-27 15:08:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:08:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:08:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:08:23,548 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:08:23,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:08:23,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:08:23,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:08:23,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:08:23,591 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:08:23,593 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:08:23,750 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:08:23,755 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:08:23,755 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:08:23,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:08:23 BoogieIcfgContainer [2022-04-27 15:08:23,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:08:23,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:08:23,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:08:23,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:08:23,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:08:23" (1/3) ... [2022-04-27 15:08:23,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df1a52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:08:23, skipping insertion in model container [2022-04-27 15:08:23,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:08:23" (2/3) ... [2022-04-27 15:08:23,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df1a52f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:08:23, skipping insertion in model container [2022-04-27 15:08:23,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:08:23" (3/3) ... [2022-04-27 15:08:23,761 INFO L111 eAbstractionObserver]: Analyzing ICFG s3_srvr_1a.cil.c [2022-04-27 15:08:23,770 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:08:23,770 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:08:23,805 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:08:23,810 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@40d90956, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@11b9b5cf [2022-04-27 15:08:23,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:08:23,827 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-27 15:08:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-27 15:08:23,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:23,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:08:23,834 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:23,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:23,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1713790110, now seen corresponding path program 1 times [2022-04-27 15:08:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:23,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000889312] [2022-04-27 15:08:23,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:23,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:24,021 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-27 15:08:24,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-27 15:08:24,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-27 15:08:24,023 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-27 15:08:24,024 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-27 15:08:24,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2022-04-27 15:08:24,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #200#return; {54#true} is VALID [2022-04-27 15:08:24,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret9 := main(); {54#true} is VALID [2022-04-27 15:08:24,025 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-27 15:08:24,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {59#(= main_~blastFlag~0 0)} assume !false; {59#(= main_~blastFlag~0 0)} is VALID [2022-04-27 15:08:24,026 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-27 15:08:24,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#false} assume !false; {55#false} is VALID [2022-04-27 15:08:24,027 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-27 15:08:24,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:24,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000889312] [2022-04-27 15:08:24,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000889312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:24,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:24,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:24,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355337977] [2022-04-27 15:08:24,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:24,036 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-27 15:08:24,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:24,039 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-27 15:08:24,056 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-27 15:08:24,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:24,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:24,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:24,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:24,073 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-27 15:08:24,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:24,393 INFO L93 Difference]: Finished difference Result 136 states and 224 transitions. [2022-04-27 15:08:24,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:24,393 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-27 15:08:24,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:24,394 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-27 15:08:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-27 15:08:24,416 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-27 15:08:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2022-04-27 15:08:24,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 224 transitions. [2022-04-27 15:08:24,570 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-27 15:08:24,578 INFO L225 Difference]: With dead ends: 136 [2022-04-27 15:08:24,578 INFO L226 Difference]: Without dead ends: 83 [2022-04-27 15:08:24,580 INFO L412 NwaCegarLoop]: 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-27 15:08:24,582 INFO L413 NwaCegarLoop]: 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-27 15:08:24,583 INFO L414 NwaCegarLoop]: 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-27 15:08:24,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-27 15:08:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-27 15:08:24,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:24,608 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-27 15:08:24,609 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-27 15:08:24,610 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-27 15:08:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:24,614 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-27 15:08:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-27 15:08:24,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:24,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:24,615 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-27 15:08:24,616 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-27 15:08:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:24,620 INFO L93 Difference]: Finished difference Result 83 states and 125 transitions. [2022-04-27 15:08:24,620 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-27 15:08:24,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:24,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:24,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:24,621 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:24,621 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-27 15:08:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2022-04-27 15:08:24,625 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 9 [2022-04-27 15:08:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:24,625 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2022-04-27 15:08:24,626 INFO L496 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-27 15:08:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2022-04-27 15:08:24,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 15:08:24,626 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:24,626 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:08:24,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:08:24,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:24,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1144534844, now seen corresponding path program 1 times [2022-04-27 15:08:24,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:24,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476156429] [2022-04-27 15:08:24,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:24,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {545#(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); {539#true} is VALID [2022-04-27 15:08:24,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-27 15:08:24,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {539#true} {539#true} #200#return; {539#true} is VALID [2022-04-27 15:08:24,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {539#true} call ULTIMATE.init(); {545#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:24,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {545#(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); {539#true} is VALID [2022-04-27 15:08:24,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#true} assume true; {539#true} is VALID [2022-04-27 15:08:24,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {539#true} {539#true} #200#return; {539#true} is VALID [2022-04-27 15:08:24,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {539#true} call #t~ret9 := main(); {539#true} is VALID [2022-04-27 15:08:24,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {539#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; {539#true} is VALID [2022-04-27 15:08:24,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {539#true} assume !false; {539#true} is VALID [2022-04-27 15:08:24,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {539#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {539#true} is VALID [2022-04-27 15:08:24,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#true} assume 8466 == ~s__state~0; {539#true} is VALID [2022-04-27 15:08:24,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {544#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:24,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {544#(= (+ (- 1) main_~blastFlag~0) 0)} ~s__state~0 := 8496; {544#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:24,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#(= (+ (- 1) main_~blastFlag~0) 0)} assume !false; {544#(= (+ (- 1) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:24,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#(= (+ (- 1) main_~blastFlag~0) 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {540#false} is VALID [2022-04-27 15:08:24,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {540#false} assume !false; {540#false} is VALID [2022-04-27 15:08:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:08:24,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:24,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476156429] [2022-04-27 15:08:24,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476156429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:24,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:24,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:24,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045421524] [2022-04-27 15:08:24,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:24,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 14 [2022-04-27 15:08:24,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:24,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-27 15:08:24,699 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-27 15:08:24,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:24,701 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-27 15:08:24,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:24,904 INFO L93 Difference]: Finished difference Result 160 states and 250 transitions. [2022-04-27 15:08:24,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:24,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 14 [2022-04-27 15:08:24,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-27 15:08:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-27 15:08:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-27 15:08:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-27 15:08:24,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-27 15:08:25,049 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-27 15:08:25,052 INFO L225 Difference]: With dead ends: 160 [2022-04-27 15:08:25,052 INFO L226 Difference]: Without dead ends: 120 [2022-04-27 15:08:25,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:08:25,054 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:25,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 121 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-27 15:08:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-27 15:08:25,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:25,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 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-27 15:08:25,063 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 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-27 15:08:25,064 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 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-27 15:08:25,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:25,067 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-27 15:08:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-27 15:08:25,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:25,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:25,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 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 120 states. [2022-04-27 15:08:25,069 INFO L87 Difference]: Start difference. First operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 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 120 states. [2022-04-27 15:08:25,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:25,072 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2022-04-27 15:08:25,072 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-27 15:08:25,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:25,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:25,073 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:25,073 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:25,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 116 states have (on average 1.5172413793103448) internal successors, (176), 116 states have internal predecessors, (176), 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-27 15:08:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2022-04-27 15:08:25,076 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 14 [2022-04-27 15:08:25,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:25,077 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2022-04-27 15:08:25,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-27 15:08:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2022-04-27 15:08:25,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:08:25,078 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:25,078 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:08:25,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:08:25,078 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:25,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash -974235404, now seen corresponding path program 1 times [2022-04-27 15:08:25,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:25,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378605938] [2022-04-27 15:08:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:25,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:25,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {1193#(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); {1187#true} is VALID [2022-04-27 15:08:25,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#true} assume true; {1187#true} is VALID [2022-04-27 15:08:25,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1187#true} {1187#true} #200#return; {1187#true} is VALID [2022-04-27 15:08:25,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {1187#true} call ULTIMATE.init(); {1193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:25,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {1193#(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); {1187#true} is VALID [2022-04-27 15:08:25,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#true} assume true; {1187#true} is VALID [2022-04-27 15:08:25,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1187#true} {1187#true} #200#return; {1187#true} is VALID [2022-04-27 15:08:25,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {1187#true} call #t~ret9 := main(); {1187#true} is VALID [2022-04-27 15:08:25,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#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; {1187#true} is VALID [2022-04-27 15:08:25,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {1187#true} assume !false; {1187#true} is VALID [2022-04-27 15:08:25,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {1187#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1187#true} is VALID [2022-04-27 15:08:25,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {1187#true} assume 8466 == ~s__state~0; {1187#true} is VALID [2022-04-27 15:08:25,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {1187#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {1187#true} is VALID [2022-04-27 15:08:25,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {1187#true} ~s__state~0 := 8496; {1187#true} is VALID [2022-04-27 15:08:25,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {1187#true} assume !false; {1187#true} is VALID [2022-04-27 15:08:25,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {1187#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {1187#true} is VALID [2022-04-27 15:08:25,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {1187#true} assume !(8466 == ~s__state~0); {1187#true} is VALID [2022-04-27 15:08:25,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {1187#true} assume 8496 == ~s__state~0; {1187#true} is VALID [2022-04-27 15:08:25,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {1187#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {1192#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:25,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#(= (+ (- 2) main_~blastFlag~0) 0)} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {1192#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:25,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(= (+ (- 2) main_~blastFlag~0) 0)} assume !false; {1192#(= (+ (- 2) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:25,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {1192#(= (+ (- 2) main_~blastFlag~0) 0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {1188#false} is VALID [2022-04-27 15:08:25,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2022-04-27 15:08:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:08:25,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:25,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378605938] [2022-04-27 15:08:25,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378605938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:25,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:25,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:25,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146926426] [2022-04-27 15:08:25,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:25,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20 [2022-04-27 15:08:25,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:25,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:08:25,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:25,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:25,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:25,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:25,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:25,136 INFO L87 Difference]: Start difference. First operand 120 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:08:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:25,327 INFO L93 Difference]: Finished difference Result 234 states and 359 transitions. [2022-04-27 15:08:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:25,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 20 [2022-04-27 15:08:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:25,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:08:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-27 15:08:25,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:08:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-27 15:08:25,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-27 15:08:25,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:25,474 INFO L225 Difference]: With dead ends: 234 [2022-04-27 15:08:25,474 INFO L226 Difference]: Without dead ends: 157 [2022-04-27 15:08:25,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:08:25,480 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:25,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 124 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-27 15:08:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-04-27 15:08:25,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:25,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 153 states have internal predecessors, (231), 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-27 15:08:25,499 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 153 states have internal predecessors, (231), 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-27 15:08:25,499 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 153 states have internal predecessors, (231), 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-27 15:08:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:25,503 INFO L93 Difference]: Finished difference Result 157 states and 234 transitions. [2022-04-27 15:08:25,503 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-27 15:08:25,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:25,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:25,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 153 states have internal predecessors, (231), 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 157 states. [2022-04-27 15:08:25,513 INFO L87 Difference]: Start difference. First operand has 157 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 153 states have internal predecessors, (231), 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 157 states. [2022-04-27 15:08:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:25,517 INFO L93 Difference]: Finished difference Result 157 states and 234 transitions. [2022-04-27 15:08:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-27 15:08:25,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:25,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:25,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:25,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:25,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 153 states have (on average 1.5098039215686274) internal successors, (231), 153 states have internal predecessors, (231), 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-27 15:08:25,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 234 transitions. [2022-04-27 15:08:25,521 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 234 transitions. Word has length 20 [2022-04-27 15:08:25,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:25,521 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 234 transitions. [2022-04-27 15:08:25,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-27 15:08:25,521 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 234 transitions. [2022-04-27 15:08:25,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 15:08:25,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:25,522 INFO L195 NwaCegarLoop]: 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-27 15:08:25,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:08:25,522 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:25,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:25,523 INFO L85 PathProgramCache]: Analyzing trace with hash -674137767, now seen corresponding path program 1 times [2022-04-27 15:08:25,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:25,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723596182] [2022-04-27 15:08:25,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:25,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:25,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:25,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {2071#(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); {2065#true} is VALID [2022-04-27 15:08:25,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-27 15:08:25,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2065#true} {2065#true} #200#return; {2065#true} is VALID [2022-04-27 15:08:25,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:25,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {2071#(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); {2065#true} is VALID [2022-04-27 15:08:25,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2022-04-27 15:08:25,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #200#return; {2065#true} is VALID [2022-04-27 15:08:25,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret9 := main(); {2065#true} is VALID [2022-04-27 15:08:25,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {2065#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; {2065#true} is VALID [2022-04-27 15:08:25,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-27 15:08:25,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {2065#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2065#true} is VALID [2022-04-27 15:08:25,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {2065#true} assume 8466 == ~s__state~0; {2065#true} is VALID [2022-04-27 15:08:25,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {2065#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {2065#true} is VALID [2022-04-27 15:08:25,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {2065#true} ~s__state~0 := 8496; {2065#true} is VALID [2022-04-27 15:08:25,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {2065#true} assume !false; {2065#true} is VALID [2022-04-27 15:08:25,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {2065#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2065#true} is VALID [2022-04-27 15:08:25,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {2065#true} assume !(8466 == ~s__state~0); {2065#true} is VALID [2022-04-27 15:08:25,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {2065#true} assume 8496 == ~s__state~0; {2065#true} is VALID [2022-04-27 15:08:25,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {2065#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {2065#true} is VALID [2022-04-27 15:08:25,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {2065#true} assume !(0 != ~s__hit~0);~s__state~0 := 8512; {2070#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-27 15:08:25,565 INFO L290 TraceCheckUtils]: 17: Hoare triple {2070#(= (+ (- 8512) main_~s__state~0) 0)} assume !false; {2070#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-27 15:08:25,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {2070#(= (+ (- 8512) main_~s__state~0) 0)} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {2070#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-27 15:08:25,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {2070#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8466 == ~s__state~0); {2070#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-27 15:08:25,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {2070#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8496 == ~s__state~0); {2070#(= (+ (- 8512) main_~s__state~0) 0)} is VALID [2022-04-27 15:08:25,567 INFO L290 TraceCheckUtils]: 21: Hoare triple {2070#(= (+ (- 8512) main_~s__state~0) 0)} assume !(8512 == ~s__state~0); {2066#false} is VALID [2022-04-27 15:08:25,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {2066#false} assume !(8528 == ~s__state~0); {2066#false} is VALID [2022-04-27 15:08:25,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {2066#false} assume !(8544 == ~s__state~0); {2066#false} is VALID [2022-04-27 15:08:25,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {2066#false} assume !(8560 == ~s__state~0); {2066#false} is VALID [2022-04-27 15:08:25,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {2066#false} assume !(8576 == ~s__state~0); {2066#false} is VALID [2022-04-27 15:08:25,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {2066#false} assume !(8592 == ~s__state~0); {2066#false} is VALID [2022-04-27 15:08:25,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {2066#false} assume !(8608 == ~s__state~0); {2066#false} is VALID [2022-04-27 15:08:25,568 INFO L290 TraceCheckUtils]: 28: Hoare triple {2066#false} assume !(8640 == ~s__state~0); {2066#false} is VALID [2022-04-27 15:08:25,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {2066#false} assume 8656 == ~s__state~0; {2066#false} is VALID [2022-04-27 15:08:25,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {2066#false} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {2066#false} is VALID [2022-04-27 15:08:25,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {2066#false} ~s__state~0 := 8672; {2066#false} is VALID [2022-04-27 15:08:25,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-27 15:08:25,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {2066#false} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {2066#false} is VALID [2022-04-27 15:08:25,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2022-04-27 15:08:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 15:08:25,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:25,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723596182] [2022-04-27 15:08:25,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723596182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:25,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:25,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:25,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160610832] [2022-04-27 15:08:25,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:25,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:08:25,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:25,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:08:25,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:25,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:25,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:25,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:25,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:25,588 INFO L87 Difference]: Start difference. First operand 157 states and 234 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:08:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:25,746 INFO L93 Difference]: Finished difference Result 325 states and 488 transitions. [2022-04-27 15:08:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:25,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:08:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:08:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-27 15:08:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:08:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-27 15:08:25,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-27 15:08:25,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:25,848 INFO L225 Difference]: With dead ends: 325 [2022-04-27 15:08:25,848 INFO L226 Difference]: Without dead ends: 174 [2022-04-27 15:08:25,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:08:25,849 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:25,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 79 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-27 15:08:25,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2022-04-27 15:08:25,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:25,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 172 states, 168 states have (on average 1.4702380952380953) internal successors, (247), 168 states have internal predecessors, (247), 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-27 15:08:25,858 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 172 states, 168 states have (on average 1.4702380952380953) internal successors, (247), 168 states have internal predecessors, (247), 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-27 15:08:25,858 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 172 states, 168 states have (on average 1.4702380952380953) internal successors, (247), 168 states have internal predecessors, (247), 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-27 15:08:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:25,862 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2022-04-27 15:08:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2022-04-27 15:08:25,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:25,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:25,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 168 states have (on average 1.4702380952380953) internal successors, (247), 168 states have internal predecessors, (247), 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 174 states. [2022-04-27 15:08:25,863 INFO L87 Difference]: Start difference. First operand has 172 states, 168 states have (on average 1.4702380952380953) internal successors, (247), 168 states have internal predecessors, (247), 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 174 states. [2022-04-27 15:08:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:25,866 INFO L93 Difference]: Finished difference Result 174 states and 251 transitions. [2022-04-27 15:08:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2022-04-27 15:08:25,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:25,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:25,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:25,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 168 states have (on average 1.4702380952380953) internal successors, (247), 168 states have internal predecessors, (247), 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-27 15:08:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 250 transitions. [2022-04-27 15:08:25,870 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 250 transitions. Word has length 35 [2022-04-27 15:08:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:25,870 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 250 transitions. [2022-04-27 15:08:25,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 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-27 15:08:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 250 transitions. [2022-04-27 15:08:25,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 15:08:25,871 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:25,871 INFO L195 NwaCegarLoop]: 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-27 15:08:25,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:08:25,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1014805975, now seen corresponding path program 1 times [2022-04-27 15:08:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:25,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706105682] [2022-04-27 15:08:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:25,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:25,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:25,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {3126#(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); {3120#true} is VALID [2022-04-27 15:08:25,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {3120#true} assume true; {3120#true} is VALID [2022-04-27 15:08:25,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3120#true} {3120#true} #200#return; {3120#true} is VALID [2022-04-27 15:08:25,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {3120#true} call ULTIMATE.init(); {3126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:25,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {3126#(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); {3120#true} is VALID [2022-04-27 15:08:25,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {3120#true} assume true; {3120#true} is VALID [2022-04-27 15:08:25,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3120#true} {3120#true} #200#return; {3120#true} is VALID [2022-04-27 15:08:25,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {3120#true} call #t~ret9 := main(); {3120#true} is VALID [2022-04-27 15:08:25,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {3120#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; {3120#true} is VALID [2022-04-27 15:08:25,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {3120#true} assume !false; {3120#true} is VALID [2022-04-27 15:08:25,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {3120#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3120#true} is VALID [2022-04-27 15:08:25,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {3120#true} assume 8466 == ~s__state~0; {3120#true} is VALID [2022-04-27 15:08:25,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {3120#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {3120#true} is VALID [2022-04-27 15:08:25,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {3120#true} ~s__state~0 := 8496; {3120#true} is VALID [2022-04-27 15:08:25,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {3120#true} assume !false; {3120#true} is VALID [2022-04-27 15:08:25,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {3120#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3120#true} is VALID [2022-04-27 15:08:25,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {3120#true} assume !(8466 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {3120#true} assume 8496 == ~s__state~0; {3120#true} is VALID [2022-04-27 15:08:25,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {3120#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {3120#true} is VALID [2022-04-27 15:08:25,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {3120#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {3120#true} is VALID [2022-04-27 15:08:25,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {3120#true} assume !false; {3120#true} is VALID [2022-04-27 15:08:25,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {3120#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {3120#true} is VALID [2022-04-27 15:08:25,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {3120#true} assume !(8466 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {3120#true} assume !(8496 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {3120#true} assume !(8512 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {3120#true} assume !(8528 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {3120#true} assume !(8544 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {3120#true} assume !(8560 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {3120#true} assume !(8576 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {3120#true} assume !(8592 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {3120#true} assume !(8608 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {3120#true} assume !(8640 == ~s__state~0); {3120#true} is VALID [2022-04-27 15:08:25,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {3120#true} assume 8656 == ~s__state~0; {3120#true} is VALID [2022-04-27 15:08:25,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {3120#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {3120#true} is VALID [2022-04-27 15:08:25,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {3120#true} ~s__state~0 := 8672; {3125#(<= 8672 main_~s__state~0)} is VALID [2022-04-27 15:08:25,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {3125#(<= 8672 main_~s__state~0)} assume !false; {3125#(<= 8672 main_~s__state~0)} is VALID [2022-04-27 15:08:25,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {3125#(<= 8672 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {3121#false} is VALID [2022-04-27 15:08:25,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {3121#false} assume !false; {3121#false} is VALID [2022-04-27 15:08:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 15:08:25,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:25,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706105682] [2022-04-27 15:08:25,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706105682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:25,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:25,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:25,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623986640] [2022-04-27 15:08:25,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:25,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:08:25,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:25,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:08:25,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:25,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:25,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:25,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:25,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:25,933 INFO L87 Difference]: Start difference. First operand 172 states and 250 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:08:26,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:26,106 INFO L93 Difference]: Finished difference Result 382 states and 571 transitions. [2022-04-27 15:08:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:08:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:08:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-04-27 15:08:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:08:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2022-04-27 15:08:26,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 161 transitions. [2022-04-27 15:08:26,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:26,219 INFO L225 Difference]: With dead ends: 382 [2022-04-27 15:08:26,219 INFO L226 Difference]: Without dead ends: 216 [2022-04-27 15:08:26,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:08:26,220 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 83 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:26,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 78 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:08:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-27 15:08:26,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 211. [2022-04-27 15:08:26,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:26,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 211 states, 207 states have (on average 1.3816425120772946) internal successors, (286), 207 states have internal predecessors, (286), 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-27 15:08:26,232 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 211 states, 207 states have (on average 1.3816425120772946) internal successors, (286), 207 states have internal predecessors, (286), 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-27 15:08:26,233 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 211 states, 207 states have (on average 1.3816425120772946) internal successors, (286), 207 states have internal predecessors, (286), 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-27 15:08:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:26,237 INFO L93 Difference]: Finished difference Result 216 states and 293 transitions. [2022-04-27 15:08:26,237 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2022-04-27 15:08:26,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:26,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:26,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 207 states have (on average 1.3816425120772946) internal successors, (286), 207 states have internal predecessors, (286), 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 216 states. [2022-04-27 15:08:26,238 INFO L87 Difference]: Start difference. First operand has 211 states, 207 states have (on average 1.3816425120772946) internal successors, (286), 207 states have internal predecessors, (286), 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 216 states. [2022-04-27 15:08:26,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:26,242 INFO L93 Difference]: Finished difference Result 216 states and 293 transitions. [2022-04-27 15:08:26,243 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2022-04-27 15:08:26,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:26,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:26,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:26,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.3816425120772946) internal successors, (286), 207 states have internal predecessors, (286), 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-27 15:08:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 289 transitions. [2022-04-27 15:08:26,247 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 289 transitions. Word has length 35 [2022-04-27 15:08:26,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:26,248 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 289 transitions. [2022-04-27 15:08:26,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 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-27 15:08:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 289 transitions. [2022-04-27 15:08:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-27 15:08:26,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:26,249 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-04-27 15:08:26,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:08:26,249 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:26,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:26,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1542489334, now seen corresponding path program 1 times [2022-04-27 15:08:26,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:26,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083687877] [2022-04-27 15:08:26,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:26,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:26,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {4370#(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); {4364#true} is VALID [2022-04-27 15:08:26,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {4364#true} assume true; {4364#true} is VALID [2022-04-27 15:08:26,297 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4364#true} {4364#true} #200#return; {4364#true} is VALID [2022-04-27 15:08:26,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {4364#true} call ULTIMATE.init(); {4370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:26,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {4370#(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); {4364#true} is VALID [2022-04-27 15:08:26,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {4364#true} assume true; {4364#true} is VALID [2022-04-27 15:08:26,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4364#true} {4364#true} #200#return; {4364#true} is VALID [2022-04-27 15:08:26,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {4364#true} call #t~ret9 := main(); {4364#true} is VALID [2022-04-27 15:08:26,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {4364#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; {4364#true} is VALID [2022-04-27 15:08:26,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {4364#true} assume !false; {4364#true} is VALID [2022-04-27 15:08:26,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {4364#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {4364#true} is VALID [2022-04-27 15:08:26,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {4364#true} assume 8466 == ~s__state~0; {4364#true} is VALID [2022-04-27 15:08:26,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {4364#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {4364#true} is VALID [2022-04-27 15:08:26,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {4364#true} ~s__state~0 := 8496; {4364#true} is VALID [2022-04-27 15:08:26,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {4364#true} assume !false; {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {4364#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {4364#true} assume !(8466 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {4364#true} assume 8496 == ~s__state~0; {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {4364#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {4364#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {4364#true} assume !false; {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {4364#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {4364#true} assume !(8466 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {4364#true} assume !(8496 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {4364#true} assume !(8512 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {4364#true} assume !(8528 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {4364#true} assume !(8544 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {4364#true} assume !(8560 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {4364#true} assume !(8576 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {4364#true} assume !(8592 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {4364#true} assume !(8608 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,300 INFO L290 TraceCheckUtils]: 28: Hoare triple {4364#true} assume !(8640 == ~s__state~0); {4364#true} is VALID [2022-04-27 15:08:26,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {4364#true} assume 8656 == ~s__state~0; {4364#true} is VALID [2022-04-27 15:08:26,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {4364#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} ~s__state~0 := 8672; {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !false; {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,304 INFO L290 TraceCheckUtils]: 34: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8466 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8496 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8512 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8528 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8544 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8560 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8576 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8592 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8608 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,314 INFO L290 TraceCheckUtils]: 43: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8640 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(8656 == ~s__state~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume 8672 == ~s__state~0; {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,315 INFO L290 TraceCheckUtils]: 46: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume !(4 == ~blastFlag~0); {4369#(= (+ (- 3) main_~blastFlag~0) 0)} is VALID [2022-04-27 15:08:26,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {4369#(= (+ (- 3) main_~blastFlag~0) 0)} assume 5 == ~blastFlag~0; {4365#false} is VALID [2022-04-27 15:08:26,315 INFO L290 TraceCheckUtils]: 48: Hoare triple {4365#false} assume !false; {4365#false} is VALID [2022-04-27 15:08:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 15:08:26,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:26,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083687877] [2022-04-27 15:08:26,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083687877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:26,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:26,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:26,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406651239] [2022-04-27 15:08:26,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:26,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 49 [2022-04-27 15:08:26,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:26,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-27 15:08:26,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:26,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:26,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:26,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:26,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:26,342 INFO L87 Difference]: Start difference. First operand 211 states and 289 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-27 15:08:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:26,533 INFO L93 Difference]: Finished difference Result 418 states and 581 transitions. [2022-04-27 15:08:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:26,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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 49 [2022-04-27 15:08:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:26,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-27 15:08:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-04-27 15:08:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-27 15:08:26,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2022-04-27 15:08:26,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 197 transitions. [2022-04-27 15:08:26,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:26,711 INFO L225 Difference]: With dead ends: 418 [2022-04-27 15:08:26,712 INFO L226 Difference]: Without dead ends: 268 [2022-04-27 15:08:26,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:08:26,715 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:26,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 123 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:26,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-27 15:08:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2022-04-27 15:08:26,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:26,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 266 states, 262 states have (on average 1.3778625954198473) internal successors, (361), 262 states have internal predecessors, (361), 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-27 15:08:26,731 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 266 states, 262 states have (on average 1.3778625954198473) internal successors, (361), 262 states have internal predecessors, (361), 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-27 15:08:26,731 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 266 states, 262 states have (on average 1.3778625954198473) internal successors, (361), 262 states have internal predecessors, (361), 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-27 15:08:26,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:26,735 INFO L93 Difference]: Finished difference Result 268 states and 365 transitions. [2022-04-27 15:08:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 365 transitions. [2022-04-27 15:08:26,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:26,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:26,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 266 states, 262 states have (on average 1.3778625954198473) internal successors, (361), 262 states have internal predecessors, (361), 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 268 states. [2022-04-27 15:08:26,737 INFO L87 Difference]: Start difference. First operand has 266 states, 262 states have (on average 1.3778625954198473) internal successors, (361), 262 states have internal predecessors, (361), 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 268 states. [2022-04-27 15:08:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:26,741 INFO L93 Difference]: Finished difference Result 268 states and 365 transitions. [2022-04-27 15:08:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 365 transitions. [2022-04-27 15:08:26,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:26,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:26,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:26,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:26,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 262 states have (on average 1.3778625954198473) internal successors, (361), 262 states have internal predecessors, (361), 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-27 15:08:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 364 transitions. [2022-04-27 15:08:26,746 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 364 transitions. Word has length 49 [2022-04-27 15:08:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:26,746 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 364 transitions. [2022-04-27 15:08:26,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 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-27 15:08:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 364 transitions. [2022-04-27 15:08:26,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-27 15:08:26,747 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:26,747 INFO L195 NwaCegarLoop]: 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-27 15:08:26,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:08:26,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:26,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash 446239409, now seen corresponding path program 1 times [2022-04-27 15:08:26,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:26,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30539573] [2022-04-27 15:08:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:26,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:26,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {5829#(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); {5823#true} is VALID [2022-04-27 15:08:26,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {5823#true} assume true; {5823#true} is VALID [2022-04-27 15:08:26,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5823#true} {5823#true} #200#return; {5823#true} is VALID [2022-04-27 15:08:26,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {5823#true} call ULTIMATE.init(); {5829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:26,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {5829#(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); {5823#true} is VALID [2022-04-27 15:08:26,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {5823#true} assume true; {5823#true} is VALID [2022-04-27 15:08:26,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5823#true} {5823#true} #200#return; {5823#true} is VALID [2022-04-27 15:08:26,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {5823#true} call #t~ret9 := main(); {5823#true} is VALID [2022-04-27 15:08:26,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {5823#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; {5823#true} is VALID [2022-04-27 15:08:26,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {5823#true} assume !false; {5823#true} is VALID [2022-04-27 15:08:26,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {5823#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5823#true} is VALID [2022-04-27 15:08:26,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {5823#true} assume 8466 == ~s__state~0; {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {5823#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {5823#true} ~s__state~0 := 8496; {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {5823#true} assume !false; {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {5823#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {5823#true} assume !(8466 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {5823#true} assume 8496 == ~s__state~0; {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {5823#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {5823#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {5823#true} assume !false; {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {5823#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {5823#true} assume !(8466 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {5823#true} assume !(8496 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {5823#true} assume !(8512 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {5823#true} assume !(8528 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {5823#true} assume !(8544 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {5823#true} assume !(8560 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {5823#true} assume !(8576 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {5823#true} assume !(8592 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {5823#true} assume !(8608 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {5823#true} assume !(8640 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {5823#true} assume 8656 == ~s__state~0; {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {5823#true} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {5823#true} ~s__state~0 := 8672; {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {5823#true} assume !false; {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 33: Hoare triple {5823#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 34: Hoare triple {5823#true} assume !(8466 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {5823#true} assume !(8496 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {5823#true} assume !(8512 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {5823#true} assume !(8528 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {5823#true} assume !(8544 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 39: Hoare triple {5823#true} assume !(8560 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {5823#true} assume !(8576 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 41: Hoare triple {5823#true} assume !(8592 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {5823#true} assume !(8608 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {5823#true} assume !(8640 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {5823#true} assume !(8656 == ~s__state~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 45: Hoare triple {5823#true} assume 8672 == ~s__state~0; {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 46: Hoare triple {5823#true} assume !(4 == ~blastFlag~0); {5823#true} is VALID [2022-04-27 15:08:26,788 INFO L290 TraceCheckUtils]: 47: Hoare triple {5823#true} assume !(5 == ~blastFlag~0); {5823#true} is VALID [2022-04-27 15:08:26,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {5823#true} assume 0 != ~s__hit~0;~s__state~0 := 8640; {5828#(<= 8640 main_~s__state~0)} is VALID [2022-04-27 15:08:26,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {5828#(<= 8640 main_~s__state~0)} assume !false; {5828#(<= 8640 main_~s__state~0)} is VALID [2022-04-27 15:08:26,789 INFO L290 TraceCheckUtils]: 50: Hoare triple {5828#(<= 8640 main_~s__state~0)} assume ~s__state~0 <= 8512 && ~blastFlag~0 > 2; {5824#false} is VALID [2022-04-27 15:08:26,789 INFO L290 TraceCheckUtils]: 51: Hoare triple {5824#false} assume !false; {5824#false} is VALID [2022-04-27 15:08:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-27 15:08:26,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:26,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30539573] [2022-04-27 15:08:26,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30539573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:26,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:26,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:26,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133177239] [2022-04-27 15:08:26,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:26,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 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 52 [2022-04-27 15:08:26,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:26,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 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-27 15:08:26,807 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-27 15:08:26,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:26,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:26,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:26,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:26,808 INFO L87 Difference]: Start difference. First operand 266 states and 364 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 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-27 15:08:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:26,984 INFO L93 Difference]: Finished difference Result 524 states and 735 transitions. [2022-04-27 15:08:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:26,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 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 52 [2022-04-27 15:08:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 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-27 15:08:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-27 15:08:26,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 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-27 15:08:26,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-27 15:08:26,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-27 15:08:27,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:27,092 INFO L225 Difference]: With dead ends: 524 [2022-04-27 15:08:27,092 INFO L226 Difference]: Without dead ends: 186 [2022-04-27 15:08:27,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:08:27,093 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:27,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-27 15:08:27,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-04-27 15:08:27,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:27,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 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-27 15:08:27,111 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 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-27 15:08:27,111 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 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-27 15:08:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:27,114 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2022-04-27 15:08:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-04-27 15:08:27,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:27,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:27,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 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 186 states. [2022-04-27 15:08:27,115 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 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 186 states. [2022-04-27 15:08:27,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:27,117 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2022-04-27 15:08:27,117 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 239 transitions. [2022-04-27 15:08:27,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:27,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:27,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:27,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.2905027932960893) internal successors, (231), 179 states have internal predecessors, (231), 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-27 15:08:27,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 234 transitions. [2022-04-27 15:08:27,120 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 234 transitions. Word has length 52 [2022-04-27 15:08:27,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:27,120 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 234 transitions. [2022-04-27 15:08:27,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 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-27 15:08:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 234 transitions. [2022-04-27 15:08:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-27 15:08:27,121 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:08:27,121 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-04-27 15:08:27,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:08:27,122 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:08:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:08:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash -209652788, now seen corresponding path program 1 times [2022-04-27 15:08:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:08:27,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826151979] [2022-04-27 15:08:27,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:08:27,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:08:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:08:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:08:27,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {7126#(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); {7120#true} is VALID [2022-04-27 15:08:27,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {7120#true} assume true; {7120#true} is VALID [2022-04-27 15:08:27,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7120#true} {7120#true} #200#return; {7120#true} is VALID [2022-04-27 15:08:27,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {7120#true} call ULTIMATE.init(); {7126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:08:27,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {7126#(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); {7120#true} is VALID [2022-04-27 15:08:27,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {7120#true} assume true; {7120#true} is VALID [2022-04-27 15:08:27,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7120#true} {7120#true} #200#return; {7120#true} is VALID [2022-04-27 15:08:27,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {7120#true} call #t~ret9 := main(); {7120#true} is VALID [2022-04-27 15:08:27,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {7120#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; {7120#true} is VALID [2022-04-27 15:08:27,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {7120#true} assume !false; {7120#true} is VALID [2022-04-27 15:08:27,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {7120#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7120#true} is VALID [2022-04-27 15:08:27,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {7120#true} assume 8466 == ~s__state~0; {7120#true} is VALID [2022-04-27 15:08:27,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {7120#true} assume 0 == ~blastFlag~0;~blastFlag~0 := 1; {7120#true} is VALID [2022-04-27 15:08:27,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {7120#true} ~s__state~0 := 8496; {7120#true} is VALID [2022-04-27 15:08:27,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {7120#true} assume !false; {7120#true} is VALID [2022-04-27 15:08:27,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {7120#true} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7120#true} is VALID [2022-04-27 15:08:27,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {7120#true} assume !(8466 == ~s__state~0); {7120#true} is VALID [2022-04-27 15:08:27,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {7120#true} assume 8496 == ~s__state~0; {7120#true} is VALID [2022-04-27 15:08:27,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {7120#true} assume 1 == ~blastFlag~0;~blastFlag~0 := 2; {7120#true} is VALID [2022-04-27 15:08:27,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {7120#true} assume 0 != ~s__hit~0;~s__state~0 := 8656; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !false; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8496 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8528 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8544 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8560 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8576 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8592 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8608 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8640 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume 8656 == ~s__state~0; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume 2 == ~blastFlag~0;~blastFlag~0 := 3; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {7125#(not (= main_~s__hit~0 0))} ~s__state~0 := 8672; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !false; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,218 INFO L290 TraceCheckUtils]: 35: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8496 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,218 INFO L290 TraceCheckUtils]: 36: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,218 INFO L290 TraceCheckUtils]: 37: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8528 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8544 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8560 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8576 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,219 INFO L290 TraceCheckUtils]: 41: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8592 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,219 INFO L290 TraceCheckUtils]: 42: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8608 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8640 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,220 INFO L290 TraceCheckUtils]: 44: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8656 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume 8672 == ~s__state~0; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(4 == ~blastFlag~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,221 INFO L290 TraceCheckUtils]: 47: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(5 == ~blastFlag~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,221 INFO L290 TraceCheckUtils]: 48: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume 0 != ~s__hit~0;~s__state~0 := 8640; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,221 INFO L290 TraceCheckUtils]: 49: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !false; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,221 INFO L290 TraceCheckUtils]: 50: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,222 INFO L290 TraceCheckUtils]: 51: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8466 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8496 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8512 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,222 INFO L290 TraceCheckUtils]: 54: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8528 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,223 INFO L290 TraceCheckUtils]: 55: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8544 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,223 INFO L290 TraceCheckUtils]: 56: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8560 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,223 INFO L290 TraceCheckUtils]: 57: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8576 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8592 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,224 INFO L290 TraceCheckUtils]: 59: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(8608 == ~s__state~0); {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,224 INFO L290 TraceCheckUtils]: 60: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume 8640 == ~s__state~0; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,224 INFO L290 TraceCheckUtils]: 61: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume 3 == ~blastFlag~0;~blastFlag~0 := 4; {7125#(not (= main_~s__hit~0 0))} is VALID [2022-04-27 15:08:27,224 INFO L290 TraceCheckUtils]: 62: Hoare triple {7125#(not (= main_~s__hit~0 0))} assume !(0 != ~s__hit~0);~s__state~0 := 8656; {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 63: Hoare triple {7121#false} assume !false; {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 64: Hoare triple {7121#false} assume !(~s__state~0 <= 8512 && ~blastFlag~0 > 2); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {7121#false} assume !(8466 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 66: Hoare triple {7121#false} assume !(8496 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 67: Hoare triple {7121#false} assume !(8512 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 68: Hoare triple {7121#false} assume !(8528 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 69: Hoare triple {7121#false} assume !(8544 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 70: Hoare triple {7121#false} assume !(8560 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 71: Hoare triple {7121#false} assume !(8576 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 72: Hoare triple {7121#false} assume !(8592 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 73: Hoare triple {7121#false} assume !(8608 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 74: Hoare triple {7121#false} assume !(8640 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 75: Hoare triple {7121#false} assume !(8656 == ~s__state~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {7121#false} assume 8672 == ~s__state~0; {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 77: Hoare triple {7121#false} assume !(4 == ~blastFlag~0); {7121#false} is VALID [2022-04-27 15:08:27,225 INFO L290 TraceCheckUtils]: 78: Hoare triple {7121#false} assume 5 == ~blastFlag~0; {7121#false} is VALID [2022-04-27 15:08:27,226 INFO L290 TraceCheckUtils]: 79: Hoare triple {7121#false} assume !false; {7121#false} is VALID [2022-04-27 15:08:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 15:08:27,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:08:27,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826151979] [2022-04-27 15:08:27,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826151979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:08:27,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:08:27,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:08:27,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798313835] [2022-04-27 15:08:27,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:08:27,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 80 [2022-04-27 15:08:27,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:08:27,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-27 15:08:27,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:27,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:08:27,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:08:27,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:08:27,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:08:27,258 INFO L87 Difference]: Start difference. First operand 183 states and 234 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-27 15:08:27,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:27,391 INFO L93 Difference]: Finished difference Result 275 states and 332 transitions. [2022-04-27 15:08:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:08:27,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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 80 [2022-04-27 15:08:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:08:27,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-27 15:08:27,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-27 15:08:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-27 15:08:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2022-04-27 15:08:27,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 117 transitions. [2022-04-27 15:08:27,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:08:27,466 INFO L225 Difference]: With dead ends: 275 [2022-04-27 15:08:27,466 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:08:27,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:08:27,467 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:08:27,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 81 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:08:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:08:27,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:08:27,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:08:27,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:08:27,467 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:08:27,467 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:08:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:27,467 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:08:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:08:27,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:27,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:27,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:08:27,468 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:08:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:08:27,468 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:08:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:08:27,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:27,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:08:27,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:08:27,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:08:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:08:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:08:27,468 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2022-04-27 15:08:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:08:27,468 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:08:27,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 3 states have internal predecessors, (52), 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-27 15:08:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:08:27,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:08:27,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:08:27,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:08:27,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 15:08:27,731 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-27 15:08:27,731 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-27 15:08:27,731 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-27 15:08:27,732 INFO L902 garLoopResultBuilder]: At program point L225(lines 20 229) the Hoare annotation is: true [2022-04-27 15:08:27,732 INFO L899 garLoopResultBuilder]: For program point L126(lines 126 130) no Hoare annotation was computed. [2022-04-27 15:08:27,732 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 207) no Hoare annotation was computed. [2022-04-27 15:08:27,732 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 20 229) no Hoare annotation was computed. [2022-04-27 15:08:27,732 INFO L899 garLoopResultBuilder]: For program point L184(lines 184 186) no Hoare annotation was computed. [2022-04-27 15:08:27,732 INFO L899 garLoopResultBuilder]: For program point L118(lines 118 122) no Hoare annotation was computed. [2022-04-27 15:08:27,732 INFO L895 garLoopResultBuilder]: At program point L85(lines 84 195) the Hoare annotation is: (let ((.cse0 (<= 8672 main_~s__state~0))) (or (and .cse0 (= main_~blastFlag~0 0)) (and .cse0 (= main_~blastFlag~0 1)) (and (= 3 main_~blastFlag~0) .cse0) (and .cse0 (= 2 main_~blastFlag~0)))) [2022-04-27 15:08:27,732 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 211) no Hoare annotation was computed. [2022-04-27 15:08:27,732 INFO L895 garLoopResultBuilder]: At program point L77(lines 76 199) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and .cse0 (= 2 main_~blastFlag~0)) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-27 15:08:27,732 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 215) no Hoare annotation was computed. [2022-04-27 15:08:27,732 INFO L895 garLoopResultBuilder]: At program point L69(lines 68 203) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:27,733 INFO L895 garLoopResultBuilder]: At program point L61(lines 60 207) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:27,733 INFO L895 garLoopResultBuilder]: At program point L185(lines 20 229) the Hoare annotation is: false [2022-04-27 15:08:27,733 INFO L895 garLoopResultBuilder]: At program point L53(lines 52 211) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:27,733 INFO L895 garLoopResultBuilder]: At program point L45(lines 44 215) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:27,733 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 20 229) no Hoare annotation was computed. [2022-04-27 15:08:27,733 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 227) no Hoare annotation was computed. [2022-04-27 15:08:27,733 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 20 229) the Hoare annotation is: true [2022-04-27 15:08:27,733 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 197) no Hoare annotation was computed. [2022-04-27 15:08:27,733 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 201) no Hoare annotation was computed. [2022-04-27 15:08:27,733 INFO L899 garLoopResultBuilder]: For program point L163-1(lines 86 195) no Hoare annotation was computed. [2022-04-27 15:08:27,733 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 205) no Hoare annotation was computed. [2022-04-27 15:08:27,734 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 86 195) no Hoare annotation was computed. [2022-04-27 15:08:27,734 INFO L895 garLoopResultBuilder]: At program point L188(lines 34 223) the Hoare annotation is: (let ((.cse0 (= 3 main_~blastFlag~0))) (or (= main_~blastFlag~0 0) (= main_~blastFlag~0 1) (and .cse0 (not (= main_~s__hit~0 0)) (<= 8640 main_~s__state~0)) (and .cse0 (<= 8672 main_~s__state~0)) (= 2 main_~blastFlag~0))) [2022-04-27 15:08:27,734 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 209) no Hoare annotation was computed. [2022-04-27 15:08:27,734 INFO L899 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2022-04-27 15:08:27,734 INFO L895 garLoopResultBuilder]: At program point L81(lines 80 197) the Hoare annotation is: (let ((.cse0 (<= 8640 main_~s__state~0))) (or (and (= main_~blastFlag~0 1) .cse0) (and .cse0 (= 2 main_~blastFlag~0)) (and (= 3 main_~blastFlag~0) (not (= main_~s__hit~0 0)) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-27 15:08:27,734 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 213) no Hoare annotation was computed. [2022-04-27 15:08:27,734 INFO L895 garLoopResultBuilder]: At program point L73(lines 72 201) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:27,734 INFO L895 garLoopResultBuilder]: At program point L65(lines 64 205) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:27,734 INFO L895 garLoopResultBuilder]: At program point L57(lines 56 209) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:27,734 INFO L899 garLoopResultBuilder]: For program point L90-1(lines 90 92) no Hoare annotation was computed. [2022-04-27 15:08:27,734 INFO L899 garLoopResultBuilder]: For program point L181-1(lines 86 195) no Hoare annotation was computed. [2022-04-27 15:08:27,734 INFO L895 garLoopResultBuilder]: At program point L49(lines 48 213) the Hoare annotation is: (let ((.cse0 (= (+ (- 8512) main_~s__state~0) 0))) (or (and (= (+ (- 2) main_~blastFlag~0) 0) .cse0) (and (= (+ (- 1) main_~blastFlag~0) 0) .cse0) (and (= main_~blastFlag~0 0) .cse0))) [2022-04-27 15:08:27,734 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 216) no Hoare annotation was computed. [2022-04-27 15:08:27,735 INFO L895 garLoopResultBuilder]: At program point L132(lines 125 134) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:27,735 INFO L895 garLoopResultBuilder]: At program point L124(lines 117 135) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:27,735 INFO L899 garLoopResultBuilder]: For program point L174-1(lines 174 176) no Hoare annotation was computed. [2022-04-27 15:08:27,735 INFO L895 garLoopResultBuilder]: At program point L42(lines 41 216) the Hoare annotation is: (or (= (+ (- 1) main_~blastFlag~0) 0) (= (+ (- 2) main_~blastFlag~0) 0) (= main_~blastFlag~0 0)) [2022-04-27 15:08:27,735 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 135) no Hoare annotation was computed. [2022-04-27 15:08:27,735 INFO L899 garLoopResultBuilder]: For program point L84(lines 84 195) no Hoare annotation was computed. [2022-04-27 15:08:27,735 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 199) no Hoare annotation was computed. [2022-04-27 15:08:27,735 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 203) no Hoare annotation was computed. [2022-04-27 15:08:27,735 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 15:08:27,735 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:08:27,735 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 15:08:27,735 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:08:27,735 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:08:27,735 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 15:08:27,735 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 15:08:27,735 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:08:27,737 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:08:27,739 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:08:27,741 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:08:27,741 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 15:08:27,742 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-27 15:08:27,743 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-27 15:08:27,744 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 15:08:27,744 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-04-27 15:08:27,744 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 15:08:27,744 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2022-04-27 15:08:27,744 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 15:08:27,745 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-27 15:08:27,745 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-04-27 15:08:27,745 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 15:08:27,745 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 15:08:27,745 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-04-27 15:08:27,745 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-04-27 15:08:27,745 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-27 15:08:27,745 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-27 15:08:27,746 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 15:08:27,746 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-27 15:08:27,746 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-27 15:08:27,746 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-27 15:08:27,746 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 15:08:27,746 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 15:08:27,747 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-27 15:08:27,747 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-04-27 15:08:27,747 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 15:08:27,747 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L174-1 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L181-1 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-04-27 15:08:27,748 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-04-27 15:08:27,748 INFO L163 areAnnotationChecker]: CFG has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:08:27,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:08:27 BoogieIcfgContainer [2022-04-27 15:08:27,756 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:08:27,757 INFO L158 Benchmark]: Toolchain (without parser) took 4547.77ms. Allocated memory was 180.4MB in the beginning and 270.5MB in the end (delta: 90.2MB). Free memory was 126.7MB in the beginning and 228.9MB in the end (delta: -102.2MB). Peak memory consumption was 97.0MB. Max. memory is 8.0GB. [2022-04-27 15:08:27,757 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 180.4MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:08:27,758 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.70ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 126.5MB in the beginning and 189.7MB in the end (delta: -63.2MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-04-27 15:08:27,758 INFO L158 Benchmark]: Boogie Preprocessor took 39.93ms. Allocated memory is still 217.1MB. Free memory was 189.7MB in the beginning and 188.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:08:27,758 INFO L158 Benchmark]: RCFGBuilder took 272.10ms. Allocated memory is still 217.1MB. Free memory was 188.1MB in the beginning and 173.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 15:08:27,758 INFO L158 Benchmark]: TraceAbstraction took 3999.24ms. Allocated memory was 217.1MB in the beginning and 270.5MB in the end (delta: 53.5MB). Free memory was 172.9MB in the beginning and 228.9MB in the end (delta: -56.0MB). Peak memory consumption was 106.4MB. Max. memory is 8.0GB. [2022-04-27 15:08:27,759 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.08ms. Allocated memory is still 180.4MB. Free memory is still 143.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.70ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 126.5MB in the beginning and 189.7MB in the end (delta: -63.2MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.93ms. Allocated memory is still 217.1MB. Free memory was 189.7MB in the beginning and 188.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 272.10ms. Allocated memory is still 217.1MB. Free memory was 188.1MB in the beginning and 173.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 3999.24ms. Allocated memory was 217.1MB in the beginning and 270.5MB in the end (delta: 53.5MB). Free memory was 172.9MB in the beginning and 228.9MB in the end (delta: -56.0MB). Peak memory consumption was 106.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 227]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 840 mSDsluCounter, 762 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 560 IncrementalHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 704 mSDtfsCounter, 560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=266occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 86 NumberOfFragments, 307 HoareAnnotationTreeSize, 21 FomulaSimplifications, 64 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 131 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 218/218 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 80]: Loop Invariant Derived loop invariant: (((blastFlag == 1 && 8640 <= s__state) || (8640 <= s__state && 2 == blastFlag)) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (blastFlag == 0 && 8640 <= s__state) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((blastFlag == 1 && 8640 <= s__state) || (8640 <= s__state && 2 == blastFlag)) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (blastFlag == 0 && 8640 <= s__state) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((blastFlag == 0 || blastFlag == 1) || ((3 == blastFlag && !(s__hit == 0)) && 8640 <= s__state)) || (3 == blastFlag && 8672 <= s__state)) || 2 == blastFlag - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((8672 <= s__state && blastFlag == 0) || (8672 <= s__state && blastFlag == 1)) || (3 == blastFlag && 8672 <= s__state)) || (8672 <= s__state && 2 == blastFlag) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: ((-2 + blastFlag == 0 && -8512 + s__state == 0) || (-1 + blastFlag == 0 && -8512 + s__state == 0)) || (blastFlag == 0 && -8512 + s__state == 0) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (-1 + blastFlag == 0 || -2 + blastFlag == 0) || blastFlag == 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:08:27,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...